Comparison of Krylov subspace methods with preconditioning techniques for solving boundary value problems

DOI10.1016/S0898-1221(99)00298-9zbMath0976.65029OpenAlexW2064710591MaRDI QIDQ1975707

Yanyan Li

Publication date: 8 January 2002

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(99)00298-9

zbMATH Keywords

convergencefinite difference methodpreconditioningconjugate gradient methodLaplace equationKrylov subspace methodsLanczos algorithmsymmetric systems

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Finite difference methods for boundary value problems involving PDEs (65N06)

Related Items

Preconditioned techniques for solving large sparse linear systems arising from the discretization of the elliptic partial differential equations, Rotated Krylov preconditioned iterative schemes in the solution of convection-diffusion equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• Preconditioned CG methods for sparse matrices on massively parallel machines
• Comparison of Lanczos and CGS solvers for solving numerical heat transfer problems
• A new implementation of the Lanczos method in linear problems
• Polynomial Preconditioners for Conjugate Gradient Calculations
• A numerical study of various algorithms related to the preconditioned conjugate gradient method
• Methods of conjugate gradients for solving linear systems