In this paper we give an overview of the present state of fast solvers for the solution of the incompressible Navier-Stokes equations discretized by the finite element method and linearized by Newton or Picard's m...In this paper we give an overview of the present state of fast solvers for the solution of the incompressible Navier-Stokes equations discretized by the finite element method and linearized by Newton or Picard's method.It is shown that block preconditioners form an excellent approach for the solution,however if the grids are not to fine preconditioning with a Saddle point ILU matrix(SILU) may be an attractive alternative. The applicability of all methods to stabilized elements is investigated.In case of the stand-alone Stokes equations special preconditioners increase the efficiency considerably.展开更多
In this paper,we develop subspace correction preconditioners for discontinuous Galerkin(DG)discretizations of elliptic problems with hp-refnement.These preconditioners are based on the decomposition of the DG fnite el...In this paper,we develop subspace correction preconditioners for discontinuous Galerkin(DG)discretizations of elliptic problems with hp-refnement.These preconditioners are based on the decomposition of the DG fnite element space into a conforming subspace,and a set of small nonconforming edge spaces.The conforming subspace is preconditioned using a matrix-free low-order refned technique,which in this work,we extend to the hprefnement context using a variational restriction approach.The condition number of the resulting linear system is independent of the granularity of the mesh h,and the degree of the polynomial approximation p.The method is amenable to use with meshes of any degree of irregularity and arbitrary distribution of polynomial degrees.Numerical examples are shown on several test cases involving adaptively and randomly refned meshes,using both the symmetric interior penalty method and the second method of Bassi and Rebay(BR2).展开更多
Explicit Exact and Approximate Inverse Preconditioners for solving complex linear systems are introduced. A class of general iterative methods of second order is presented and the selection of iterative parameters is ...Explicit Exact and Approximate Inverse Preconditioners for solving complex linear systems are introduced. A class of general iterative methods of second order is presented and the selection of iterative parameters is discussed. The second order iterative methods behave quite similar to first order methods and the development of efficient preconditioners for solving the original linear system is a decisive factor for making the second order iterative methods superior to the first order iterative methods. Adaptive preconditioned Conjugate Gradient methods using explicit approximate preconditioners for solving efficiently large sparse systems of algebraic equations are also presented. The generalized Approximate Inverse Matrix techniques can be efficiently used in conjunction with explicit iterative schemes leading to effective composite semi-direct solution methods for solving large linear systems of algebraic equations.展开更多
For the large sparse block two-by-two real nonsingular matrices, we establish a general framework of structured preconditioners through matrix transformation and matrix approximations. For the specific versions such a...For the large sparse block two-by-two real nonsingular matrices, we establish a general framework of structured preconditioners through matrix transformation and matrix approximations. For the specific versions such as modified block Jacobi-type, modified block Gauss-Seidel-type, and modified block unsymmetric (symmetric) Gauss-Seidel-type preconditioners, we precisely describe their concrete expressions and deliberately analyze eigenvalue distributions and positive definiteness of the preconditioned matrices. Also, we show that when these structured preconditioners are employed to precondition the Krylov subspace methods such as GMRES and restarted GMRES, fast and effective iteration solvers can be obtained for the large sparse systems of linear equations with block two-by-two coefficient matrices. In particular, these structured preconditioners can lead to high-quality preconditioning matrices for some typical matrices from the real-world applications.展开更多
In this article algebraic multigrid as preconditioners are designed, with biorthogonal wavelets, as intergrid operators for the Krylov subspace iterative methods. Construction of hierarchy of matrices in algebraic mul...In this article algebraic multigrid as preconditioners are designed, with biorthogonal wavelets, as intergrid operators for the Krylov subspace iterative methods. Construction of hierarchy of matrices in algebraic multigrid context is based on lowpass filter version of Wavelet Transform. The robustness and efficiency of this new approach is tested by applying it to large sparse, unsymmetric and ill-conditioned matrices from Tim Davis collection of sparse matrices. Proposed preconditioners have potential in reducing cputime, operator complexity and storage space of algebraic multigrid V-cycle and meet the desired accuracy of solution compared with that of orthogonal wavelets.展开更多
Finite difference type preconditioners for spectral element discretizations based on Legendre-Gauss-Lobatto points are analyzed. The latter is employed for the approximation of uniformly elliptic partial differential ...Finite difference type preconditioners for spectral element discretizations based on Legendre-Gauss-Lobatto points are analyzed. The latter is employed for the approximation of uniformly elliptic partial differential problems. In this work, it is shown that the condition number of the resulting preconditioned system is bounded independently of both of the polynomial degrees used in the spectral element method and the element sizes. Several numerical tests verify the h-p independence of the proposed preconditioning.展开更多
In this paper,we design an efficient domain decomposition(DD)preconditioner for the saddle-point problem resulting from the mixed finite-element discretization of multiscale elliptic problems.By proper equivalent alge...In this paper,we design an efficient domain decomposition(DD)preconditioner for the saddle-point problem resulting from the mixed finite-element discretization of multiscale elliptic problems.By proper equivalent algebraic operations,the original saddle-point system can be transformed to another saddle-point system which can be preconditioned by a block-diagonel matrix efficiently.Actually,the first block of this block-diagonal matrix corresponds to a multiscale H(div)problem,and thus,the direct inverse of this block is unpractical and unstable for the large-scale problem.To remedy this issue,a two-level overlapping DD preconditioner is proposed for this//(div)problem.Our coarse space consists of some velocities obtained from mixed formulation of local eigenvalue problems on the coarse edge patches multiplied by the partition of unity functions and the trivial coarse basis(e.g.,Raviart-Thomas element)on the coarse grid.The condition number of our preconditioned DD method for this multiscale H(div)system is bounded by C(1+务)(1+log4(^)),where 6 denotes the width of overlapping region,and H,h are the typical sizes of the subdomain and fine mesh.Numerical examples are presented to confirm the validity and robustness of our DD preconditioner.展开更多
We extend the construction and analysis of the non-overlapping Schwarz preconditioners proposed in[2,3]to the(non-consistent)super penalty discontinuous Galerkin methods introduced in[5]and[8].We show that the resulti...We extend the construction and analysis of the non-overlapping Schwarz preconditioners proposed in[2,3]to the(non-consistent)super penalty discontinuous Galerkin methods introduced in[5]and[8].We show that the resulting preconditioners are scalable,and we provide the convergence estimates.We also present numerical experiments confirming the sharpness of the theoretical results.展开更多
This paper deals with the preconditioning of the curl-curl operator. We use H（curl）- conforming finite elements for the discretization of our corresponding magnetostatic model problem. Jumps in the material paramete...This paper deals with the preconditioning of the curl-curl operator. We use H（curl）- conforming finite elements for the discretization of our corresponding magnetostatic model problem. Jumps in the material parameters influence the condition of the problem. We will demonstrate by theoretical estimates and numerical experiments that hierarchical matrices are well suited to construct efficient parallel preconditioners for the fast and robust iterative solution of such problems.展开更多
In this paper,we consider using Schur complements to design preconditioners for twofold and block tridiagonal saddle point problems.One type of the preconditioners are based on the nested(or recursive)Schur complement...In this paper,we consider using Schur complements to design preconditioners for twofold and block tridiagonal saddle point problems.One type of the preconditioners are based on the nested(or recursive)Schur complement,the other is based on an additive type Schur complement after permuting the original saddle point systems.We analyze different preconditioners incorporating the exact Schur complements.We show that some of them will lead to positively stable preconditioned systems if proper signs are selected in front of the Schur complements.These positive-stable preconditioners outperform other preconditioners if the Schur complements are further approximated inexactly.Numerical experiments for a 3-field formulation of the Biot model are provided to verify our predictions.展开更多
This paper is concerned with preconditioners for interior penalty discontinuous Galerkin discretizations of second-order elliptic boundary value problems.We extend earlier related results in[7]in the following sense.S...This paper is concerned with preconditioners for interior penalty discontinuous Galerkin discretizations of second-order elliptic boundary value problems.We extend earlier related results in[7]in the following sense.Several concrete realizations of splitting the nonconforming trial spaces into a conforming and(remaining)nonconforming part are identified and shown to give rise to uniformly bounded condition numbers.These asymptotic results are complemented by numerical tests that shed some light on their respective quantitative behavior.展开更多
In this paper,we are concerned with the fast solvers for higher order edge finite element discretizations of Maxwell's equations.We present the preconditioners for the first family and second family of higher orde...In this paper,we are concerned with the fast solvers for higher order edge finite element discretizations of Maxwell's equations.We present the preconditioners for the first family and second family of higher order N′ed′elec element equations,respectively.By combining the stable decompositions of two kinds of edge finite element spaces with the abstract theory of auxiliary space preconditioning,we prove that the corresponding condition numbers of our preconditioners are uniformly bounded on quasi-uniform grids.We also present some numerical experiments to demonstrate the theoretical results.展开更多
Signal and image restoration problems are often solved by minimizing a cost function consisting of an l2 data-fidelity term and a regularization term. We consider a class of convex and edge-preserving regularization f...Signal and image restoration problems are often solved by minimizing a cost function consisting of an l2 data-fidelity term and a regularization term. We consider a class of convex and edge-preserving regularization functions. In specific, half-quadratic regularization as a fixed-point iteration method is usually employed to solve this problem. The main aim of this paper is to solve the above-described signal and image restoration problems with the half-quadratic regularization technique by making use of the Newton method. At each iteration of the Newton method, the Newton equation is a structured system of linear equations of a symmetric positive definite coefficient matrix, and may be efficiently solved by the preconditioned conjugate gradient method accelerated with the modified block SSOR preconditioner. Our experimental results show that the modified block-SSOR preconditioned conjugate gradient method is feasible and effective for further improving the numerical performance of the half-quadratic regularization approach.展开更多
We give general expressions, analyze algebraic properties and derive eigenvalue bounds for a sequence of Toeplitz matrices associated with the sinc discretizations of various orders of differential operators. We demon...We give general expressions, analyze algebraic properties and derive eigenvalue bounds for a sequence of Toeplitz matrices associated with the sinc discretizations of various orders of differential operators. We demonstrate that these Toeplitz matrices can be satisfactorily preconditioned by certain banded Toeplitz matrices through showing that the spectra of the preconditioned matrices are uniformly bounded. In particular, we also derive eigen- value bounds for the banded Toeplitz preconditioners. These results are elementary in constructing high-quality structured preconditioners for the systems of linear equations arising from the sinc discretizations of ordinary and partial differential equations, and are useful in analyzing algebraic properties and deriving eigenvalue bounds for the correspond- ing preconditioned matrices. Numerical examples are given to show effectiveness of the banded Toeplitz preconditioners.展开更多
Recently, Bal proposed a block-counter-diagonal and a block-counter-triangular precon- ditioning matrices to precondition the GMRES method for solving the structured system of linear equations arising from the Galerki...Recently, Bal proposed a block-counter-diagonal and a block-counter-triangular precon- ditioning matrices to precondition the GMRES method for solving the structured system of linear equations arising from the Galerkin finite-element discretizations of the distributed control problems in （Computing 91 （2011） 379-395）. He analyzed the spectral properties and derived explicit expressions of the eigenvalues and eigenvectors of the preconditioned matrices. By applying the special structures and properties of the eigenvector matrices of the preconditioned matrices, we derive upper bounds for the 2-norm condition numbers of the eigenvector matrices and give asymptotic convergence factors of the preconditioned GMRES methods with the block-counter-diagonal and the block-counter-triangular pre- conditioners. Experimental results show that the convergence analyses match well with the numerical results.展开更多
In this paper, we consider the problem of solving finite element equations of biharmonic Dirichlet problems. We divide the given domain into non-overlapping subdomains, construct a preconditioner for Morley element by...In this paper, we consider the problem of solving finite element equations of biharmonic Dirichlet problems. We divide the given domain into non-overlapping subdomains, construct a preconditioner for Morley element by substructuring on the basis of a function decomposition for discrete biharmonic functions. The function decomposition is introduced by partitioning these finite element functions into the low and high frequency components through the intergrid transfer operators between coarse mesh and fine mesh, and the conforming interpolation operators. The method leads to a preconditioned system with the condition number bounded by C(1 + log(2) H/h) in the case with interior cross points, and by C in the case without interior cross points, where H is the subdomain size and h is the mesh size. These techniques are applicable to other nonconforming elements and are well suited to a parallel computation.展开更多
Ⅰ. INTRODUCTIONBy high-order (discretization) schemes we can obtain highly accurate numerical solutions of diferential equations by using very few grid points. But the algebraic systems induced by high-order schemes ...Ⅰ. INTRODUCTIONBy high-order (discretization) schemes we can obtain highly accurate numerical solutions of diferential equations by using very few grid points. But the algebraic systems induced by high-order schemes olden are ill-posed and have many non-zero elements. In order to solve these algebraic systems efficiently, Y. S. Wong presented a preconditioned conju-展开更多
We establish a class of improved relaxed positive-definite and skew-Hermitian splitting (IRPSS)preconditioners for saddle point problems.These preconditioners are easier to be implemented than the relaxed positive-def...We establish a class of improved relaxed positive-definite and skew-Hermitian splitting (IRPSS)preconditioners for saddle point problems.These preconditioners are easier to be implemented than the relaxed positive-definite and skew-Hermitian splitting (RPSS) preconditioner at each step for solving the saddle point problem.We study spectral properties and the minimal polynomial of the IRPSS preconditioned saddle point matrix.A theoretical optimal IRPSS preconditioner is also obtained,Numerical results show that our proposed IRPSS preconditioners are convergence rate of the GMRES method superior to the existing ones in accelerating the for solving saddle point problems.展开更多
In this paper, we study a composite preconditioner that combines the modified tangential frequency filtering decomposition with the ILU（O） factorization. Spectral property of the composite preconditioner is examined...In this paper, we study a composite preconditioner that combines the modified tangential frequency filtering decomposition with the ILU（O） factorization. Spectral property of the composite preconditioner is examined by the approach of Fourier analysis. We illustrate that condition number of the preconditioned matrix by the composite preconditioner is asymptotically bounded by O（hp -2/3） on a standard model problem. Performance of the composite preconditioner is compared with other preconditioners on several problems arising from the discretization of PDEs with discontinuous coefficients. Numerical results show that performance of the proposed composite preconditioner is superior to other relative preconditioners.展开更多
Discusses the genuine-optimal circulant preconditioner for finite-section Wiener-Hopf equations. Definition of the genuine-optimal circulant preconditioner; Use of the preconditioned conjugate gradient method; Numeric...Discusses the genuine-optimal circulant preconditioner for finite-section Wiener-Hopf equations. Definition of the genuine-optimal circulant preconditioner; Use of the preconditioned conjugate gradient method; Numerical treatments for high order quadrature rules.展开更多
文摘In this paper we give an overview of the present state of fast solvers for the solution of the incompressible Navier-Stokes equations discretized by the finite element method and linearized by Newton or Picard's method.It is shown that block preconditioners form an excellent approach for the solution,however if the grids are not to fine preconditioning with a Saddle point ILU matrix(SILU) may be an attractive alternative. The applicability of all methods to stabilized elements is investigated.In case of the stand-alone Stokes equations special preconditioners increase the efficiency considerably.
基金This work was performed under the auspices of the U.S.Department of Energy by Lawrence Livermore National Laboratory under Contract DE-AC52-07NA27344 and was partially supported by the LLNL-LDRD Program under Project No.20-ERD-002(LLNL-JRNL-814157).
文摘In this paper,we develop subspace correction preconditioners for discontinuous Galerkin(DG)discretizations of elliptic problems with hp-refnement.These preconditioners are based on the decomposition of the DG fnite element space into a conforming subspace,and a set of small nonconforming edge spaces.The conforming subspace is preconditioned using a matrix-free low-order refned technique,which in this work,we extend to the hprefnement context using a variational restriction approach.The condition number of the resulting linear system is independent of the granularity of the mesh h,and the degree of the polynomial approximation p.The method is amenable to use with meshes of any degree of irregularity and arbitrary distribution of polynomial degrees.Numerical examples are shown on several test cases involving adaptively and randomly refned meshes,using both the symmetric interior penalty method and the second method of Bassi and Rebay(BR2).
文摘Explicit Exact and Approximate Inverse Preconditioners for solving complex linear systems are introduced. A class of general iterative methods of second order is presented and the selection of iterative parameters is discussed. The second order iterative methods behave quite similar to first order methods and the development of efficient preconditioners for solving the original linear system is a decisive factor for making the second order iterative methods superior to the first order iterative methods. Adaptive preconditioned Conjugate Gradient methods using explicit approximate preconditioners for solving efficiently large sparse systems of algebraic equations are also presented. The generalized Approximate Inverse Matrix techniques can be efficiently used in conjunction with explicit iterative schemes leading to effective composite semi-direct solution methods for solving large linear systems of algebraic equations.
文摘For the large sparse block two-by-two real nonsingular matrices, we establish a general framework of structured preconditioners through matrix transformation and matrix approximations. For the specific versions such as modified block Jacobi-type, modified block Gauss-Seidel-type, and modified block unsymmetric (symmetric) Gauss-Seidel-type preconditioners, we precisely describe their concrete expressions and deliberately analyze eigenvalue distributions and positive definiteness of the preconditioned matrices. Also, we show that when these structured preconditioners are employed to precondition the Krylov subspace methods such as GMRES and restarted GMRES, fast and effective iteration solvers can be obtained for the large sparse systems of linear equations with block two-by-two coefficient matrices. In particular, these structured preconditioners can lead to high-quality preconditioning matrices for some typical matrices from the real-world applications.
文摘In this article algebraic multigrid as preconditioners are designed, with biorthogonal wavelets, as intergrid operators for the Krylov subspace iterative methods. Construction of hierarchy of matrices in algebraic multigrid context is based on lowpass filter version of Wavelet Transform. The robustness and efficiency of this new approach is tested by applying it to large sparse, unsymmetric and ill-conditioned matrices from Tim Davis collection of sparse matrices. Proposed preconditioners have potential in reducing cputime, operator complexity and storage space of algebraic multigrid V-cycle and meet the desired accuracy of solution compared with that of orthogonal wavelets.
文摘Finite difference type preconditioners for spectral element discretizations based on Legendre-Gauss-Lobatto points are analyzed. The latter is employed for the approximation of uniformly elliptic partial differential problems. In this work, it is shown that the condition number of the resulting preconditioned system is bounded independently of both of the polynomial degrees used in the spectral element method and the element sizes. Several numerical tests verify the h-p independence of the proposed preconditioning.
文摘In this paper,we design an efficient domain decomposition(DD)preconditioner for the saddle-point problem resulting from the mixed finite-element discretization of multiscale elliptic problems.By proper equivalent algebraic operations,the original saddle-point system can be transformed to another saddle-point system which can be preconditioned by a block-diagonel matrix efficiently.Actually,the first block of this block-diagonal matrix corresponds to a multiscale H(div)problem,and thus,the direct inverse of this block is unpractical and unstable for the large-scale problem.To remedy this issue,a two-level overlapping DD preconditioner is proposed for this//(div)problem.Our coarse space consists of some velocities obtained from mixed formulation of local eigenvalue problems on the coarse edge patches multiplied by the partition of unity functions and the trivial coarse basis(e.g.,Raviart-Thomas element)on the coarse grid.The condition number of our preconditioned DD method for this multiscale H(div)system is bounded by C(1+务)(1+log4(^)),where 6 denotes the width of overlapping region,and H,h are the typical sizes of the subdomain and fine mesh.Numerical examples are presented to confirm the validity and robustness of our DD preconditioner.
基金The work was carried out while the second author was visiting the Istituto di Matematica Applicata e Tecnologie Informatiche of the CNR in PaviaShe thanks the Institute for the kind hospitalityThe first author has been supported by ADIGMA project within the 3rd Call of the 6th European Research Framework Programme.The second author has been supported by MTM2005−00714 of the Spanish MEC and by SIMUMAT of CAM.
文摘We extend the construction and analysis of the non-overlapping Schwarz preconditioners proposed in[2,3]to the(non-consistent)super penalty discontinuous Galerkin methods introduced in[5]and[8].We show that the resulting preconditioners are scalable,and we provide the convergence estimates.We also present numerical experiments confirming the sharpness of the theoretical results.
文摘This paper deals with the preconditioning of the curl-curl operator. We use H（curl）- conforming finite elements for the discretization of our corresponding magnetostatic model problem. Jumps in the material parameters influence the condition of the problem. We will demonstrate by theoretical estimates and numerical experiments that hierarchical matrices are well suited to construct efficient parallel preconditioners for the fast and robust iterative solution of such problems.
基金the NIH-RCMI(Grant No.347U54MD013376)the affliated project award from the Center for Equitable Artificial Intelligence and Machine Learning Systems at Morgan State University(Project ID 02232301)+3 种基金the National Science Foundation awards(Grant No.1831950).The work of G.Ju is supported in part by the National Key R&D Program of China(Grant No.2017YFB1001604)the National Natural Science Foundation of China(Grant No.11971221)the Shenzhen Sci-Tech Fund(Grant Nos.RCJC20200714114556020,JCYJ20170818153840322,JCYJ20190809150413261)the Guangdong Provincial Key Laboratory of Computational Science and Material Design(Grant No.2019B030301001).
文摘In this paper,we consider using Schur complements to design preconditioners for twofold and block tridiagonal saddle point problems.One type of the preconditioners are based on the nested(or recursive)Schur complement,the other is based on an additive type Schur complement after permuting the original saddle point systems.We analyze different preconditioners incorporating the exact Schur complements.We show that some of them will lead to positively stable preconditioned systems if proper signs are selected in front of the Schur complements.These positive-stable preconditioners outperform other preconditioners if the Schur complements are further approximated inexactly.Numerical experiments for a 3-field formulation of the Biot model are provided to verify our predictions.
基金This work has been supported in part by the French-German PROCOPE contract 11418YBby the European Commission Human Potential Programme under contract HPRN-CT-2002-00286“Breaking Complexity”,by the SFB 401 and the Leibniz Pro-gramme funded by DFG.
文摘This paper is concerned with preconditioners for interior penalty discontinuous Galerkin discretizations of second-order elliptic boundary value problems.We extend earlier related results in[7]in the following sense.Several concrete realizations of splitting the nonconforming trial spaces into a conforming and(remaining)nonconforming part are identified and shown to give rise to uniformly bounded condition numbers.These asymptotic results are complemented by numerical tests that shed some light on their respective quantitative behavior.
基金the National Natural Science Foundation of China(Grant Nos.10771178,10676031)the National Key Basic Research Program of China(973Program)(Grant No.2005CB321702)the Key Project of Chinese Ministry of Education and Scientific Research Fund of Hunan Provincial Education Department(Grant Nos.208093,07A068)
文摘In this paper,we are concerned with the fast solvers for higher order edge finite element discretizations of Maxwell's equations.We present the preconditioners for the first family and second family of higher order N′ed′elec element equations,respectively.By combining the stable decompositions of two kinds of edge finite element spaces with the abstract theory of auxiliary space preconditioning,we prove that the corresponding condition numbers of our preconditioners are uniformly bounded on quasi-uniform grids.We also present some numerical experiments to demonstrate the theoretical results.
基金supported by the China NSF Outstanding Young Scientist Foundation(No.10525102)National Natural Science Foundation(No.10471146)+3 种基金the National Basic Research Program (No.2005CB321702)P.R.Chinasupported in part by the Fundamental Research Fund for Physics and Mathematics of Lanzhou University.P.R.Chinasupported in part by Hong Kong Research Grants Council Grant Nos.7035/04P and 7035/05PHKBU FRGs
文摘Signal and image restoration problems are often solved by minimizing a cost function consisting of an l2 data-fidelity term and a regularization term. We consider a class of convex and edge-preserving regularization functions. In specific, half-quadratic regularization as a fixed-point iteration method is usually employed to solve this problem. The main aim of this paper is to solve the above-described signal and image restoration problems with the half-quadratic regularization technique by making use of the Newton method. At each iteration of the Newton method, the Newton equation is a structured system of linear equations of a symmetric positive definite coefficient matrix, and may be efficiently solved by the preconditioned conjugate gradient method accelerated with the modified block SSOR preconditioner. Our experimental results show that the modified block-SSOR preconditioned conjugate gradient method is feasible and effective for further improving the numerical performance of the half-quadratic regularization approach.
文摘We give general expressions, analyze algebraic properties and derive eigenvalue bounds for a sequence of Toeplitz matrices associated with the sinc discretizations of various orders of differential operators. We demonstrate that these Toeplitz matrices can be satisfactorily preconditioned by certain banded Toeplitz matrices through showing that the spectra of the preconditioned matrices are uniformly bounded. In particular, we also derive eigen- value bounds for the banded Toeplitz preconditioners. These results are elementary in constructing high-quality structured preconditioners for the systems of linear equations arising from the sinc discretizations of ordinary and partial differential equations, and are useful in analyzing algebraic properties and deriving eigenvalue bounds for the correspond- ing preconditioned matrices. Numerical examples are given to show effectiveness of the banded Toeplitz preconditioners.
文摘Recently, Bal proposed a block-counter-diagonal and a block-counter-triangular precon- ditioning matrices to precondition the GMRES method for solving the structured system of linear equations arising from the Galerkin finite-element discretizations of the distributed control problems in （Computing 91 （2011） 379-395）. He analyzed the spectral properties and derived explicit expressions of the eigenvalues and eigenvectors of the preconditioned matrices. By applying the special structures and properties of the eigenvector matrices of the preconditioned matrices, we derive upper bounds for the 2-norm condition numbers of the eigenvector matrices and give asymptotic convergence factors of the preconditioned GMRES methods with the block-counter-diagonal and the block-counter-triangular pre- conditioners. Experimental results show that the convergence analyses match well with the numerical results.
文摘In this paper, we consider the problem of solving finite element equations of biharmonic Dirichlet problems. We divide the given domain into non-overlapping subdomains, construct a preconditioner for Morley element by substructuring on the basis of a function decomposition for discrete biharmonic functions. The function decomposition is introduced by partitioning these finite element functions into the low and high frequency components through the intergrid transfer operators between coarse mesh and fine mesh, and the conforming interpolation operators. The method leads to a preconditioned system with the condition number bounded by C(1 + log(2) H/h) in the case with interior cross points, and by C in the case without interior cross points, where H is the subdomain size and h is the mesh size. These techniques are applicable to other nonconforming elements and are well suited to a parallel computation.
基金Project supported by the National Natural Science Foundation of China.
文摘Ⅰ. INTRODUCTIONBy high-order (discretization) schemes we can obtain highly accurate numerical solutions of diferential equations by using very few grid points. But the algebraic systems induced by high-order schemes olden are ill-posed and have many non-zero elements. In order to solve these algebraic systems efficiently, Y. S. Wong presented a preconditioned conju-
基金the National Natural Science Foundation of China (Nos.11771225,11301521,11771467,11572210).
文摘We establish a class of improved relaxed positive-definite and skew-Hermitian splitting (IRPSS)preconditioners for saddle point problems.These preconditioners are easier to be implemented than the relaxed positive-definite and skew-Hermitian splitting (RPSS) preconditioner at each step for solving the saddle point problem.We study spectral properties and the minimal polynomial of the IRPSS preconditioned saddle point matrix.A theoretical optimal IRPSS preconditioner is also obtained,Numerical results show that our proposed IRPSS preconditioners are convergence rate of the GMRES method superior to the existing ones in accelerating the for solving saddle point problems.
基金The authors thank the anonymous reviewers for their useful comments and suggestions that considerably improve the paper. The first author is indebted to L. Grigori, F. Nataf and P. Kumar for many helpful discussions. The work of the first author was supported in part by the National Natural Science Foundation of China （Grant No. 11301420）.
文摘In this paper, we study a composite preconditioner that combines the modified tangential frequency filtering decomposition with the ILU（O） factorization. Spectral property of the composite preconditioner is examined by the approach of Fourier analysis. We illustrate that condition number of the preconditioned matrix by the composite preconditioner is asymptotically bounded by O（hp -2/3） on a standard model problem. Performance of the composite preconditioner is compared with other preconditioners on several problems arising from the discretization of PDEs with discontinuous coefficients. Numerical results show that performance of the proposed composite preconditioner is superior to other relative preconditioners.
基金Supported in part by the natural science foundation of China No. 19901017.
文摘Discusses the genuine-optimal circulant preconditioner for finite-section Wiener-Hopf equations. Definition of the genuine-optimal circulant preconditioner; Use of the preconditioned conjugate gradient method; Numerical treatments for high order quadrature rules.
