A boundary element method based on non-overlapping domain decomposition method to solve the time-dependent diffusion equations is presented. The time-dependent fundamental solution is used in the formulation of bounda...A boundary element method based on non-overlapping domain decomposition method to solve the time-dependent diffusion equations is presented. The time-dependent fundamental solution is used in the formulation of boundary integrals and the time integration process always restarts from the initial time condition. The process of replacing the interface values, which needs a summation of boundary integrals related to the boundary values at previous time steps can be treated in parallel iterative procedure. Numerical experiments demonstrate that the implementation of the present algorithm is efficient.展开更多
This paper presents a parallel two-level evolutionary algorithm based on domain decomposition for solving function optimization problem containing multiple solutions. By combining the characteristics of the global sea...This paper presents a parallel two-level evolutionary algorithm based on domain decomposition for solving function optimization problem containing multiple solutions. By combining the characteristics of the global search and local search in each sub-domain, the former enables individual to draw closer to each optima and keeps the diversity of individuals, while the latter selects local optimal solutions known as latent solutions in sub-domain. In the end, by selecting the global optimal solutions from latent solutions in each sub-domain, we can discover all the optimal solutions easily and quickly.展开更多
In this paper, an absorbing Fictitious Boundary Condition (FBC) is presented to generate an iterative Domain Decomposition Method (DDM) for analyzing waveguide problems.The relaxed algorithm is introduced to improve t...In this paper, an absorbing Fictitious Boundary Condition (FBC) is presented to generate an iterative Domain Decomposition Method (DDM) for analyzing waveguide problems.The relaxed algorithm is introduced to improve the iterative convergence. And the matrix equations are solved using the multifrontal algorithm. The resulting CPU time is greatly reduced.Finally, a number of numerical examples are given to illustrate its accuracy and efficiency.展开更多
The numerical solution of large scale multi-dimensional convection diffusion equations often requires efficient parallel algorithms.In this work,we consider the extension of a recently proposed non-overlapping domain ...The numerical solution of large scale multi-dimensional convection diffusion equations often requires efficient parallel algorithms.In this work,we consider the extension of a recently proposed non-overlapping domain decomposition method for two dimensional time dependent convection diffusion equations with variable coefficients. By combining predictor-corrector technique,modified upwind differences with explicitimplicit coupling,the method under consideration provides intrinsic parallelism while maintaining good stability and accuracy.Moreover,for multi-dimensional problems, the method can be readily implemented on a multi-processor system and does not have the limitation on the choice of subdomains required by some other similar predictor-corrector or stabilized schemes.These properties of the method are demonstrated in this work through both rigorous mathematical analysis and numerical experiments.展开更多
Schwarz methods are an important type of domain decomposition methods. Using the Fourier transform, we derive error propagation matrices and their spectral radii of the classical Schwarz alternating method and the add...Schwarz methods are an important type of domain decomposition methods. Using the Fourier transform, we derive error propagation matrices and their spectral radii of the classical Schwarz alternating method and the additive Schwarz method for the biharmonic equation in this paper. We prove the convergence of the Schwarz methods from a new point of view, and provide detailed information about the convergence speeds and their dependence on the overlapping size of subdomains. The obtained results are independent of any unknown constant and discretization method, showing that the Schwarz alternating method converges twice as quickly as the additive Schwarz method.展开更多
We consider optimal control problems for the flow of gas in a pipe network. The equations of motions are taken to be represented by a semi-linear model derived from the fully nonlinear isothermal Euler gas equations. ...We consider optimal control problems for the flow of gas in a pipe network. The equations of motions are taken to be represented by a semi-linear model derived from the fully nonlinear isothermal Euler gas equations. We formulate an optimal control problem on a given network and introduce a time discretization thereof. We then study the well-posedness of the corresponding time-discrete optimal control problem. In order to further reduce the complexity, we consider an instantaneous control strategy. The main part of the paper is concerned with a non-overlapping domain decomposition of the semi-linear elliptic optimal control problem on the graph into local problems on a small part of the network, ultimately on a single edge.展开更多
In this paper,we establish a new algorithm to the non-overlapping Schwarz domain decomposition methods with changing transmission conditions for solving one dimensional advection reaction diffusion problem.More precis...In this paper,we establish a new algorithm to the non-overlapping Schwarz domain decomposition methods with changing transmission conditions for solving one dimensional advection reaction diffusion problem.More precisely,we first describe the new algorithm and prove the convergence results under several natural assumptions on the sequences of parameters which determine the transmission conditions.Then we give a simple method to estimate the new value of parameters in each iteration.The interesting advantage of our method is that one may update the better parameters in each iteration to save the computational cost for optimizing the parameters after many steps.Finally some numerical experiments are performed to show the behavior of the convergence rate for the new method.展开更多
In this paper we introduce two kinds of parallel Schwarz domain decomposition me thods for general, selfadjoint, second order parabolic equations and study the dependence of their convergence rates on parameters of ti...In this paper we introduce two kinds of parallel Schwarz domain decomposition me thods for general, selfadjoint, second order parabolic equations and study the dependence of their convergence rates on parameters of time-step and space-mesh. We prove that the, approximate solution has convergence independent of iteration times at each time-level. And the L^2 error estimates are given.展开更多
We introduced the work on parallel problem solvers from physics and biology being developed by the research team at the State Key Laboratory of Software Engineering, Wuhan University. Results on parallel solvers inclu...We introduced the work on parallel problem solvers from physics and biology being developed by the research team at the State Key Laboratory of Software Engineering, Wuhan University. Results on parallel solvers include the following areas: Evolutionary algorithms based on imitating the evolution processes of nature for parallel problem solving, especially for parallel optimization and model-building; Asynchronous parallel algorithms based on domain decomposition which are inspired by physical analogies such as elastic relaxation process and annealing process, for scientific computations, especially for solving nonlinear mathematical physics problems. All these algorithms have the following common characteristics: inherent parallelism, self-adaptation and self-organization, because the basic ideas of these solvers are from imitating the natural evolutionary processes.展开更多
This paper presents and analyzes a monotone domain decomposition algorithm for solving nonlinear singularly perturbed reaction-diffusion problems of parabolic type. To solve the nonlinear weighted average finite diffe...This paper presents and analyzes a monotone domain decomposition algorithm for solving nonlinear singularly perturbed reaction-diffusion problems of parabolic type. To solve the nonlinear weighted average finite difference scheme for the partial differential equation, we construct a monotone domain decomposition algorithm based on a Schwarz alternating method and a box-domain decomposition. This algorithm needs only to solve linear discrete systems at each iterative step and converges monotonically to the exact solution of the nonlinear discrete problem. domain decomposition algorithm is estimated The rate of convergence of the monotone Numerical experiments are presented.展开更多
From the principle of of the Domain Decomposition Method (DDM), we analyse the 2nd-order linear elliptic partial differential problems and link the Separated-Layers Algorithm (SLA) with DDM. The mathematical propertie...From the principle of of the Domain Decomposition Method (DDM), we analyse the 2nd-order linear elliptic partial differential problems and link the Separated-Layers Algorithm (SLA) with DDM. The mathematical properties of SLA and numerical example are presented to obtain satisfactory computation results. For general linear differential ones, also are the structure of SLA and its characteristics discussed.展开更多
We present an innovative interpretation of Kalman filter(KF)combining the ideas of Schwarz domain decomposition(DD)and parallel in time(PinT)approaches.Thereafter we call it DD-KF.In contrast to standard DD approaches...We present an innovative interpretation of Kalman filter(KF)combining the ideas of Schwarz domain decomposition(DD)and parallel in time(PinT)approaches.Thereafter we call it DD-KF.In contrast to standard DD approaches which are already incorporated in KF and other state estimation models,implementing a straightforward data parallelism inside the loop over time,DD-KF ab-initio partitions the whole model,including filter equations and dynamic model along both space and time directions/steps.As a consequence,we get local KFs reproducing the original filter at smaller dimensions on local domains.Also,sub problems could be solved in parallel.In order to enforce the matching of local solutions on overlapping regions,and then to achieve the same global solution of KF,local KFs are slightly modified by adding a correction term keeping track of contributions of adjacent subdomains to overlapping regions.Such a correction term balances localization errors along overlapping regions,acting as a regularization constraint on local solutions.Furthermore,such a localization excludes remote observations from each analyzed location improving the conditioning of the error covariance matrices.As dynamic model we consider shallow water equations which can be regarded a consistent tool to get a proof of concept of the reliability assessment of DD-KF in monitoring and forecasting of weather systems and ocean currents.展开更多
Splitting extrapolation based on domain decomposition for finite element approximations is a new technique for solving large scale scientific and engineering problems in parallel. By means of domain decomposition, a l...Splitting extrapolation based on domain decomposition for finite element approximations is a new technique for solving large scale scientific and engineering problems in parallel. By means of domain decomposition, a large scale multidimensional problem is turned to many discrete problems involving several grid parameters The multi-variate asymptotic expansions of finite element errors on independent grid parameters are proved for linear and nonlin ear second order elliptic equations as well as eigenvalue problems. Therefore after solving smaller problems with similar sizes in parallel, a global fine grid approximation with higher accuracy is computed by the splitting extrapolation method.展开更多
Examines a nonoverlapping domain decomposition method based on the natural boundary reduction. Development of the D-N alternating algorithm; Studies the convergence of the D-N method for exterior spherical domain; Dis...Examines a nonoverlapping domain decomposition method based on the natural boundary reduction. Development of the D-N alternating algorithm; Studies the convergence of the D-N method for exterior spherical domain; Discussion of the discrete form of the D-N alternating algorithm.展开更多
文摘A boundary element method based on non-overlapping domain decomposition method to solve the time-dependent diffusion equations is presented. The time-dependent fundamental solution is used in the formulation of boundary integrals and the time integration process always restarts from the initial time condition. The process of replacing the interface values, which needs a summation of boundary integrals related to the boundary values at previous time steps can be treated in parallel iterative procedure. Numerical experiments demonstrate that the implementation of the present algorithm is efficient.
基金Supported by the National Natural Science Foundation of China(60133010,60073043,70071042)
文摘This paper presents a parallel two-level evolutionary algorithm based on domain decomposition for solving function optimization problem containing multiple solutions. By combining the characteristics of the global search and local search in each sub-domain, the former enables individual to draw closer to each optima and keeps the diversity of individuals, while the latter selects local optimal solutions known as latent solutions in sub-domain. In the end, by selecting the global optimal solutions from latent solutions in each sub-domain, we can discover all the optimal solutions easily and quickly.
文摘In this paper, an absorbing Fictitious Boundary Condition (FBC) is presented to generate an iterative Domain Decomposition Method (DDM) for analyzing waveguide problems.The relaxed algorithm is introduced to improve the iterative convergence. And the matrix equations are solved using the multifrontal algorithm. The resulting CPU time is greatly reduced.Finally, a number of numerical examples are given to illustrate its accuracy and efficiency.
基金the National Natural Science Foundation of China(No.10571017)supported in part by the National Natural Science Foundation of China(No.60533020)supported in part by NSF DMS 0712744
文摘The numerical solution of large scale multi-dimensional convection diffusion equations often requires efficient parallel algorithms.In this work,we consider the extension of a recently proposed non-overlapping domain decomposition method for two dimensional time dependent convection diffusion equations with variable coefficients. By combining predictor-corrector technique,modified upwind differences with explicitimplicit coupling,the method under consideration provides intrinsic parallelism while maintaining good stability and accuracy.Moreover,for multi-dimensional problems, the method can be readily implemented on a multi-processor system and does not have the limitation on the choice of subdomains required by some other similar predictor-corrector or stabilized schemes.These properties of the method are demonstrated in this work through both rigorous mathematical analysis and numerical experiments.
基金supported by the National Natural Science Foundation of China (No. 10671154)the Na-tional Basic Research Program (No. 2005CB321703)the Science and Technology Foundation of Guizhou Province of China (No. [2008]2123)
文摘Schwarz methods are an important type of domain decomposition methods. Using the Fourier transform, we derive error propagation matrices and their spectral radii of the classical Schwarz alternating method and the additive Schwarz method for the biharmonic equation in this paper. We prove the convergence of the Schwarz methods from a new point of view, and provide detailed information about the convergence speeds and their dependence on the overlapping size of subdomains. The obtained results are independent of any unknown constant and discretization method, showing that the Schwarz alternating method converges twice as quickly as the additive Schwarz method.
文摘We consider optimal control problems for the flow of gas in a pipe network. The equations of motions are taken to be represented by a semi-linear model derived from the fully nonlinear isothermal Euler gas equations. We formulate an optimal control problem on a given network and introduce a time discretization thereof. We then study the well-posedness of the corresponding time-discrete optimal control problem. In order to further reduce the complexity, we consider an instantaneous control strategy. The main part of the paper is concerned with a non-overlapping domain decomposition of the semi-linear elliptic optimal control problem on the graph into local problems on a small part of the network, ultimately on a single edge.
文摘In this paper,we establish a new algorithm to the non-overlapping Schwarz domain decomposition methods with changing transmission conditions for solving one dimensional advection reaction diffusion problem.More precisely,we first describe the new algorithm and prove the convergence results under several natural assumptions on the sequences of parameters which determine the transmission conditions.Then we give a simple method to estimate the new value of parameters in each iteration.The interesting advantage of our method is that one may update the better parameters in each iteration to save the computational cost for optimizing the parameters after many steps.Finally some numerical experiments are performed to show the behavior of the convergence rate for the new method.
基金This work was supported by Natural Science Foundation of China and Shandong Province.
文摘In this paper we introduce two kinds of parallel Schwarz domain decomposition me thods for general, selfadjoint, second order parabolic equations and study the dependence of their convergence rates on parameters of time-step and space-mesh. We prove that the, approximate solution has convergence independent of iteration times at each time-level. And the L^2 error estimates are given.
基金Supported by the National Natural Science Foundation of China( No.6 0 1330 10 ,No.70 0 710 42 ,No.6 0 0 730 43) andNational Laboratory for Parallel and Distributed Processing
文摘We introduced the work on parallel problem solvers from physics and biology being developed by the research team at the State Key Laboratory of Software Engineering, Wuhan University. Results on parallel solvers include the following areas: Evolutionary algorithms based on imitating the evolution processes of nature for parallel problem solving, especially for parallel optimization and model-building; Asynchronous parallel algorithms based on domain decomposition which are inspired by physical analogies such as elastic relaxation process and annealing process, for scientific computations, especially for solving nonlinear mathematical physics problems. All these algorithms have the following common characteristics: inherent parallelism, self-adaptation and self-organization, because the basic ideas of these solvers are from imitating the natural evolutionary processes.
文摘This paper presents and analyzes a monotone domain decomposition algorithm for solving nonlinear singularly perturbed reaction-diffusion problems of parabolic type. To solve the nonlinear weighted average finite difference scheme for the partial differential equation, we construct a monotone domain decomposition algorithm based on a Schwarz alternating method and a box-domain decomposition. This algorithm needs only to solve linear discrete systems at each iterative step and converges monotonically to the exact solution of the nonlinear discrete problem. domain decomposition algorithm is estimated The rate of convergence of the monotone Numerical experiments are presented.
文摘From the principle of of the Domain Decomposition Method (DDM), we analyse the 2nd-order linear elliptic partial differential problems and link the Separated-Layers Algorithm (SLA) with DDM. The mathematical properties of SLA and numerical example are presented to obtain satisfactory computation results. For general linear differential ones, also are the structure of SLA and its characteristics discussed.
文摘We present an innovative interpretation of Kalman filter(KF)combining the ideas of Schwarz domain decomposition(DD)and parallel in time(PinT)approaches.Thereafter we call it DD-KF.In contrast to standard DD approaches which are already incorporated in KF and other state estimation models,implementing a straightforward data parallelism inside the loop over time,DD-KF ab-initio partitions the whole model,including filter equations and dynamic model along both space and time directions/steps.As a consequence,we get local KFs reproducing the original filter at smaller dimensions on local domains.Also,sub problems could be solved in parallel.In order to enforce the matching of local solutions on overlapping regions,and then to achieve the same global solution of KF,local KFs are slightly modified by adding a correction term keeping track of contributions of adjacent subdomains to overlapping regions.Such a correction term balances localization errors along overlapping regions,acting as a regularization constraint on local solutions.Furthermore,such a localization excludes remote observations from each analyzed location improving the conditioning of the error covariance matrices.As dynamic model we consider shallow water equations which can be regarded a consistent tool to get a proof of concept of the reliability assessment of DD-KF in monitoring and forecasting of weather systems and ocean currents.
文摘Splitting extrapolation based on domain decomposition for finite element approximations is a new technique for solving large scale scientific and engineering problems in parallel. By means of domain decomposition, a large scale multidimensional problem is turned to many discrete problems involving several grid parameters The multi-variate asymptotic expansions of finite element errors on independent grid parameters are proved for linear and nonlin ear second order elliptic equations as well as eigenvalue problems. Therefore after solving smaller problems with similar sizes in parallel, a global fine grid approximation with higher accuracy is computed by the splitting extrapolation method.
基金The. Project supported by the Special Funds for State Major Basic Research Projects, the Chinese NationalKey Project for Basic
文摘Examines a nonoverlapping domain decomposition method based on the natural boundary reduction. Development of the D-N alternating algorithm; Studies the convergence of the D-N method for exterior spherical domain; Discussion of the discrete form of the D-N alternating algorithm.