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.展开更多
A matrix equation solved in an eddy current analysis,??-??method based on a domain decomposition method becomes a complex symmetric system.In general,iterative method is used as the solver.Convergence of iterative met...A matrix equation solved in an eddy current analysis,??-??method based on a domain decomposition method becomes a complex symmetric system.In general,iterative method is used as the solver.Convergence of iterative method in an interface problem is improved by increasing an accuracy of a solution of an iterative method of a subdomain problem.However,it is difficult to improve the convergence by using a small convergence criterion in the subdomain problem.Therefore,authors propose a method to introduce double-double precision into the interface problem and the subdomain problem.This proposed method improves the convergence of the interface problem.In this paper,first,we describe proposed method.Second,we confirm validity of the method by using Team Workshop Problem 7,standard model for eddy current analysis.Finally,we show effectiveness of the method from two numerical results.展开更多
This study presents a novel hybrid approach for addressing incompressible stationary natural convection problem,incorporating a parallel technique to enhance computational efficiency.Inspired by the traditional two-le...This study presents a novel hybrid approach for addressing incompressible stationary natural convection problem,incorporating a parallel technique to enhance computational efficiency.Inspired by the traditional two-level method[He and Wang,Comput.Methods Appl.Mech.Engrg.,197(2008)]and the two-step approach[Wu et al.,Int.J.Heat Mass Transfer,101(2016)],both characterized by their iterative and corrective processes,we endeavor to alleviate the computational burden associated with the iterative process.Building upon these methods,our novel hybrid method involves two primary steps:initially solving the original problem using the finite element pair P1 b-P1-P1 on a coarse mesh,followed by resolving the linearized equations using the higher-order pair P2-P1-P2 on a fine mesh.While the first step employs iterative techniques,the second step entails directly solving a linearized problem.This novel approach can save lots of computational time in the iterative step compared to the traditional methods.Moreover,leveraging domain decomposition techniques,we implement a parallel strategy to further accelerate computations.Finally,we conduct several numerical examples to validate the efficiency of the proposed algorithms.The numerical results demonstrate optimal convergence rates comparable to those obtained using only the P2-P1-P2 finite element pair under similar relative error conditions.Furthermore,the numerical simulations on the two obstacles flow and Bénard convection problem show the robustness and efficiency of the proposed algorithms.展开更多
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.展开更多
This paper links parallel factor(PARAFAC) analysis to the problem of nominal direction-of-arrival(DOA) estimation for coherently distributed(CD) sources and proposes a fast PARAFACbased algorithm by establishing...This paper links parallel factor(PARAFAC) analysis to the problem of nominal direction-of-arrival(DOA) estimation for coherently distributed(CD) sources and proposes a fast PARAFACbased algorithm by establishing the trilinear PARAFAC model.Relying on the uniqueness of the low-rank three-way array decomposition and the trilinear alternating least squares regression, the proposed algorithm achieves nominal DOA estimation and outperforms the conventional estimation of signal parameter via rotational technique CD(ESPRIT-CD) and propagator method CD(PM-CD)methods in terms of estimation accuracy. Furthermore, by means of the initialization via the propagator method, this paper accelerates the convergence procedure of the proposed algorithm with no estimation performance degradation. In addition, the proposed algorithm can be directly applied to the multiple-source scenario,where sources have different angular distribution shapes. Numerical simulation results corroborate the effectiveness and superiority of the proposed fast PARAFAC-based algorithm.展开更多
Based on domain decomposition, a parallel two-level finite element method for the stationary Navier-Stokes equations is proposed and analyzed. The basic idea of the method is first to solve the Navier-Stokes equations...Based on domain decomposition, a parallel two-level finite element method for the stationary Navier-Stokes equations is proposed and analyzed. The basic idea of the method is first to solve the Navier-Stokes equations on a coarse grid, then to solve the resulted residual equations in parallel on a fine grid. This method has low communication complexity. It can be implemented easily. By local a priori error estimate for finite element discretizations, error bounds of the approximate solution are derived. Numerical results are also given to illustrate the high efficiency of the method.展开更多
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...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.展开更多
In the graph signal processing(GSP)framework,distributed algorithms are highly desirable in processing signals defined on large-scale networks.However,in most existing distributed algorithms,all nodes homogeneously pe...In the graph signal processing(GSP)framework,distributed algorithms are highly desirable in processing signals defined on large-scale networks.However,in most existing distributed algorithms,all nodes homogeneously perform the local computation,which calls for heavy computational and communication costs.Moreover,in many real-world networks,such as those with straggling nodes,the homogeneous manner may result in serious delay or even failure.To this end,we propose active network decomposition algorithms to select non-straggling nodes(normal nodes)that perform the main computation and communication across the network.To accommodate the decomposition in different kinds of networks,two different approaches are developed,one is centralized decomposition that leverages the adjacency of the network and the other is distributed decomposition that employs the indicator message transmission between neighboring nodes,which constitutes the main contribution of this paper.By incorporating the active decomposition scheme,a distributed Newton method is employed to solve the least squares problem in GSP,where the Hessian inverse is approximately evaluated by patching a series of inverses of local Hessian matrices each of which is governed by one normal node.The proposed algorithm inherits the fast convergence of the second-order algorithms while maintains low computational and communication cost.Numerical examples demonstrate the effectiveness of the proposed algorithm.展开更多
Based on overlapping domain decomposition,two parallel Schwarz finite element algorithms are presented for solving a two-domain parabolic problem.Our algorithms are based on two ideas.One is the observation that the i...Based on overlapping domain decomposition,two parallel Schwarz finite element algorithms are presented for solving a two-domain parabolic problem.Our algorithms are based on two ideas.One is the observation that the influence of the non-homogeneous boundary data diminishes exponentially towards the interior of the subdomains.Another is to apply proper partitions of unity to distribute the residuals of the discretized systems reasonably into many subdomains so as to avoid repeated correction in the overlapping parts.The resulting algorithms are fully parallel in each subdomain.At each time step,only one iteration step is required to reach the optimal order of accuracy.The convergence rate depending on the mesh parameters are analyzed.Finally,numerical results are reported,which verify the theoretical analysis.展开更多
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.展开更多
A novel overlapping domain decomposition splitting algorithm based on a CrankNicolson method is developed for the stochastic nonlinear Schrödinger equation driven by a multiplicative noise with non-periodic bound...A novel overlapping domain decomposition splitting algorithm based on a CrankNicolson method is developed for the stochastic nonlinear Schrödinger equation driven by a multiplicative noise with non-periodic boundary conditions.The proposed algorithm can significantly reduce the computational cost while maintaining the similar conservation laws.Numerical experiments are dedicated to illustrating the capability of the algorithm for different spatial dimensions,as well as the various initial conditions.In particular,we compare the performance of the overlapping domain decomposition splitting algorithm with the stochastic multi-symplectic method in[S.Jiang et al.,Commun.Comput.Phys.,14(2013),393-411]and the finite difference splitting scheme in[J.Cui et al.,J.Differ.Equ.,266(2019),5625-5663].We observe that our proposed algorithm has excellent computational efficiency and is highly competitive.It provides a useful tool for solving stochastic partial differential equations.展开更多
In this paper, an overlapping lattice Boltzmann model is introduced and its domain decomposition method, a distributed lattice Boltzmann method is presented. Parallel effectiveness of some programs based on the distri...In this paper, an overlapping lattice Boltzmann model is introduced and its domain decomposition method, a distributed lattice Boltzmann method is presented. Parallel effectiveness of some programs based on the distributed lattice Boltzmann method are analyzed.展开更多
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.展开更多
An iterative nonoverlapping domain decomposition procedure is proposed and analyzed for linear elliptic problems. At the interface of two subdomains, one subdomain problem requires that Dirichlet data be passed to it ...An iterative nonoverlapping domain decomposition procedure is proposed and analyzed for linear elliptic problems. At the interface of two subdomains, one subdomain problem requires that Dirichlet data be passed to it from the previous iteration level, while the other subdomain problem requires that Neumann data be passed to it. This procedure is suitable for parallel processing. A convergence analysis is established. Standard and mixed finite element methods are employed to give discrete versions of this domain decomposition algorithm. Numerical experiments arc conducted to show the effectiveness of the method.展开更多
Large eddy simulation(LES) cooperated with a high performance parallel computing method is applied to simulate the flow in a curved duct with square cross section in the paper. The method consists of parallel domain d...Large eddy simulation(LES) cooperated with a high performance parallel computing method is applied to simulate the flow in a curved duct with square cross section in the paper. The method consists of parallel domain decomposition of grids, creation of virtual diagonal bordered matrix, assembling of boundary matrix, parallel LDL^T decomposition, parallel solving of Poisson Equation, parallel estimation of convergence and so on. The parallel computing method can solve the problems that are difficult to solve using traditional serial computing. Furthermore, existing microcomputers can be fully used to resolve some large-scale problems of complex turbulent flow.展开更多
This paper firstly introduces the structure and working principle of DSP-based parallel system, parallel accelerating board and SHARC DSP chip. Then it pays attention to investigating the system’s programming charact...This paper firstly introduces the structure and working principle of DSP-based parallel system, parallel accelerating board and SHARC DSP chip. Then it pays attention to investigating the system’s programming characteristics, especially the mode of communication, discussing how to design parallel algorithms and presenting a domain-decomposition-based complete multi-grid parallel algorithm with virtual boundary forecast (VBF) to solve a lot of large-scale and complicated heat problems. In the end, Mandelbrot Set and a non-linear heat transfer equation of ceramic/metal composite material are taken as examples to illustrate the implementation of the proposed algorithm. The results showed that the solutions are highly efficient and have linear speedup.展开更多
摘要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.
摘要A matrix equation solved in an eddy current analysis,??-??method based on a domain decomposition method becomes a complex symmetric system.In general,iterative method is used as the solver.Convergence of iterative method in an interface problem is improved by increasing an accuracy of a solution of an iterative method of a subdomain problem.However,it is difficult to improve the convergence by using a small convergence criterion in the subdomain problem.Therefore,authors propose a method to introduce double-double precision into the interface problem and the subdomain problem.This proposed method improves the convergence of the interface problem.In this paper,first,we describe proposed method.Second,we confirm validity of the method by using Team Workshop Problem 7,standard model for eddy current analysis.Finally,we show effectiveness of the method from two numerical results.
基金supported in part by the Guangxi Natural Science Foundation(Grant No.2026GXNSFBA00640283)Tianyuan Fund for Mathematics of the National Natural Science Foundation of China(Grant No.12526545)+3 种基金supported by the Natural Science Foundation of Fujian Province of China(Grant No.2025J01026)by the National Key R&D Program of China(Grant Nos.2022YFA1004500,2024YFA1012503)by the National Natural Science Foundation of China(Grant No.12371372)supported by the Talent Scientific Fund of Lanzhou University and by the National Natural Science Foundation of China(Grant Nos.12301510,12171216,12526514).
摘要This study presents a novel hybrid approach for addressing incompressible stationary natural convection problem,incorporating a parallel technique to enhance computational efficiency.Inspired by the traditional two-level method[He and Wang,Comput.Methods Appl.Mech.Engrg.,197(2008)]and the two-step approach[Wu et al.,Int.J.Heat Mass Transfer,101(2016)],both characterized by their iterative and corrective processes,we endeavor to alleviate the computational burden associated with the iterative process.Building upon these methods,our novel hybrid method involves two primary steps:initially solving the original problem using the finite element pair P1 b-P1-P1 on a coarse mesh,followed by resolving the linearized equations using the higher-order pair P2-P1-P2 on a fine mesh.While the first step employs iterative techniques,the second step entails directly solving a linearized problem.This novel approach can save lots of computational time in the iterative step compared to the traditional methods.Moreover,leveraging domain decomposition techniques,we implement a parallel strategy to further accelerate computations.Finally,we conduct several numerical examples to validate the efficiency of the proposed algorithms.The numerical results demonstrate optimal convergence rates comparable to those obtained using only the P2-P1-P2 finite element pair under similar relative error conditions.Furthermore,the numerical simulations on the two obstacles flow and Bénard convection problem show the robustness and efficiency of the proposed algorithms.
摘要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.
基金supported by the National Natural Science Foundation of China(6137116961601167)+2 种基金the Jiangsu Natural Science Foundation(BK20161489)the open research fund of State Key Laboratory of Millimeter Waves,Southeast University(K201826)the Fundamental Research Funds for the Central Universities(NE2017103)
摘要This paper links parallel factor(PARAFAC) analysis to the problem of nominal direction-of-arrival(DOA) estimation for coherently distributed(CD) sources and proposes a fast PARAFACbased algorithm by establishing the trilinear PARAFAC model.Relying on the uniqueness of the low-rank three-way array decomposition and the trilinear alternating least squares regression, the proposed algorithm achieves nominal DOA estimation and outperforms the conventional estimation of signal parameter via rotational technique CD(ESPRIT-CD) and propagator method CD(PM-CD)methods in terms of estimation accuracy. Furthermore, by means of the initialization via the propagator method, this paper accelerates the convergence procedure of the proposed algorithm with no estimation performance degradation. In addition, the proposed algorithm can be directly applied to the multiple-source scenario,where sources have different angular distribution shapes. Numerical simulation results corroborate the effectiveness and superiority of the proposed fast PARAFAC-based algorithm.
基金Project supported by the National Natural Science Foundation of China(No.11001061)the Science and Technology Foundation of Guizhou Province of China(No.[2008]2123)
摘要Based on domain decomposition, a parallel two-level finite element method for the stationary Navier-Stokes equations is proposed and analyzed. The basic idea of the method is first to solve the Navier-Stokes equations on a coarse grid, then to solve the resulted residual equations in parallel on a fine grid. This method has low communication complexity. It can be implemented easily. By local a priori error estimate for finite element discretizations, error bounds of the approximate solution are derived. Numerical results are also given to illustrate the high efficiency of the method.
基金Supported by the National Natural Science Foundation of China(No.60133010,No.70071042,No.60073043)National 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.
基金supported by National Natural Science Foundation of China(Grant No.61761011)Natural Science Foundation of Guangxi(Grant No.2020GXNSFBA297078).
摘要In the graph signal processing(GSP)framework,distributed algorithms are highly desirable in processing signals defined on large-scale networks.However,in most existing distributed algorithms,all nodes homogeneously perform the local computation,which calls for heavy computational and communication costs.Moreover,in many real-world networks,such as those with straggling nodes,the homogeneous manner may result in serious delay or even failure.To this end,we propose active network decomposition algorithms to select non-straggling nodes(normal nodes)that perform the main computation and communication across the network.To accommodate the decomposition in different kinds of networks,two different approaches are developed,one is centralized decomposition that leverages the adjacency of the network and the other is distributed decomposition that employs the indicator message transmission between neighboring nodes,which constitutes the main contribution of this paper.By incorporating the active decomposition scheme,a distributed Newton method is employed to solve the least squares problem in GSP,where the Hessian inverse is approximately evaluated by patching a series of inverses of local Hessian matrices each of which is governed by one normal node.The proposed algorithm inherits the fast convergence of the second-order algorithms while maintains low computational and communication cost.Numerical examples demonstrate the effectiveness of the proposed algorithm.
基金supported by the Ministry of Science and Technology(Grant No.2022YFA1004403)Science and Technology Commission of Shanghai Municipality(Grant Nos.22JC1400900,21JC1402500,22DZ2229014).
摘要Based on overlapping domain decomposition,two parallel Schwarz finite element algorithms are presented for solving a two-domain parabolic problem.Our algorithms are based on two ideas.One is the observation that the influence of the non-homogeneous boundary data diminishes exponentially towards the interior of the subdomains.Another is to apply proper partitions of unity to distribute the residuals of the discretized systems reasonably into many subdomains so as to avoid repeated correction in the overlapping parts.The resulting algorithms are fully parallel in each subdomain.At each time step,only one iteration step is required to reach the optimal order of accuracy.The convergence rate depending on the mesh parameters are analyzed.Finally,numerical results are reported,which verify the theoretical analysis.
基金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(Grant Nos.12171047,11971458).
摘要A novel overlapping domain decomposition splitting algorithm based on a CrankNicolson method is developed for the stochastic nonlinear Schrödinger equation driven by a multiplicative noise with non-periodic boundary conditions.The proposed algorithm can significantly reduce the computational cost while maintaining the similar conservation laws.Numerical experiments are dedicated to illustrating the capability of the algorithm for different spatial dimensions,as well as the various initial conditions.In particular,we compare the performance of the overlapping domain decomposition splitting algorithm with the stochastic multi-symplectic method in[S.Jiang et al.,Commun.Comput.Phys.,14(2013),393-411]and the finite difference splitting scheme in[J.Cui et al.,J.Differ.Equ.,266(2019),5625-5663].We observe that our proposed algorithm has excellent computational efficiency and is highly competitive.It provides a useful tool for solving stochastic partial differential equations.
摘要In this paper, an overlapping lattice Boltzmann model is introduced and its domain decomposition method, a distributed lattice Boltzmann method is presented. Parallel effectiveness of some programs based on the distributed lattice Boltzmann method are analyzed.
摘要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.
摘要An iterative nonoverlapping domain decomposition procedure is proposed and analyzed for linear elliptic problems. At the interface of two subdomains, one subdomain problem requires that Dirichlet data be passed to it from the previous iteration level, while the other subdomain problem requires that Neumann data be passed to it. This procedure is suitable for parallel processing. A convergence analysis is established. Standard and mixed finite element methods are employed to give discrete versions of this domain decomposition algorithm. Numerical experiments arc conducted to show the effectiveness of the method.
摘要Large eddy simulation(LES) cooperated with a high performance parallel computing method is applied to simulate the flow in a curved duct with square cross section in the paper. The method consists of parallel domain decomposition of grids, creation of virtual diagonal bordered matrix, assembling of boundary matrix, parallel LDL^T decomposition, parallel solving of Poisson Equation, parallel estimation of convergence and so on. The parallel computing method can solve the problems that are difficult to solve using traditional serial computing. Furthermore, existing microcomputers can be fully used to resolve some large-scale problems of complex turbulent flow.
基金Project (No. 60173046) supported by the National Natural ScienceFoundation of China
摘要This paper firstly introduces the structure and working principle of DSP-based parallel system, parallel accelerating board and SHARC DSP chip. Then it pays attention to investigating the system’s programming characteristics, especially the mode of communication, discussing how to design parallel algorithms and presenting a domain-decomposition-based complete multi-grid parallel algorithm with virtual boundary forecast (VBF) to solve a lot of large-scale and complicated heat problems. In the end, Mandelbrot Set and a non-linear heat transfer equation of ceramic/metal composite material are taken as examples to illustrate the implementation of the proposed algorithm. The results showed that the solutions are highly efficient and have linear speedup.