On the Superlinear Convergence Rate of the Preconditioned CGM for Some Nonsymmetric Elliptic Problems
DOI10.1080/01630560701587833zbMath1140.65076OpenAlexW2005257803MaRDI QIDQ5452410
Publication date: 4 April 2008
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630560701587833
preconditioningerror estimatesuperlinear convergencenonsymmetric elliptic problemsconjugate gradient method (CGM)
Boundary value problems for second-order elliptic equations (35J25) Error bounds for boundary value problems involving PDEs (65N15) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Finite difference methods for boundary value problems involving PDEs (65N06)
Related Items
Cites Work
- Unnamed Item
- Superlinearly convergent CG methods via equivalent preconditioning for nonsymmetric elliptic operators
- A generalized conjugate gradient, least square method
- Classes of linear operators. Vol. I
- On the theory of equivalent operators and application to the numerical solution of uniformly elliptic partial differential equations
- Some Convergence Properties of the Conjugate Gradient Method in Hilbert Space
- ON THE RATE OF CONVERGENCE OF THE CONJUGATE GRADIENT METHOD FOR LINEAR OPERATORS IN HILBERT SPACE
- Preconditioning and Boundary Conditions
- Mesh Independent Superlinear PCG Rates Via Compact-Equivalent Operators
- Some Superlinear Convergence Results for the Conjugate Gradient Method
- A Lanczos Method for a Class of Nonsymmetric Systems of Linear Equations
- Iterative Solution Methods
- Symmetric Part Preconditioning for the Conjugate Gradient Method in Hilbert Space
- The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
