A numerical study of optimized sparse preconditioners

DOI10.1007/BF01955867zbMath0812.65029MaRDI QIDQ1334989

Aslak Tveito, Are Magnus Bruaset

Publication date: 26 September 1994

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

performanceconvergencenumerical experimentsPoisson equationpreconditioned conjugate gradient methodFourier methodoptimized preconditioners

Mathematics Subject Classification ID

Spectral, collocation and related methods for boundary value problems involving PDEs (65N35) 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) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items (1)

An efficient method for solving highly anisotropic elliptic equations

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal preconditioners of a given sparsity pattern
• Yet another polynomial preconditioner for the conjugate gradient algorithm
• On the real convergence rate of the conjugate gradient method
• On the eigenvalue distribution of a class of preconditioning methods
• On the rate of convergence of the preconditioned conjugate gradient method
• The rate of convergence of conjugate gradients
• Approximating the inverse of a matrix for use in iterative algorithms on vector processors
• Box spline interpolation; a computational study
• Adaptive polynomial preconditioning for Hermitian indefinite linear systems
• Sizing and Least-Change Secant Methods
• A Taxonomy for Conjugate Gradient Methods
• Fourier Analysis of Relaxed Incomplete Factorization Preconditioners
• Polynomial Preconditioners for Conjugate Gradient Calculations
• Some Superlinear Convergence Results for the Conjugate Gradient Method
• Minimax Polynomial Preconditioning for Hermitian Linear Systems
• A Comparison of Adaptive Chebyshev and Least Squares Polynomial Preconditioning for Hermitian Positive Definite Linear Systems
• Fourier Analysis of Incomplete Factorization Preconditioners for Three-Dimensional Anisotropic Problems
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
• Influence of the Eigenvalue Spectrum on the Convergence Rate of the Conjugate Gradient Method
• A class of first order factorization methods
• Matrix-Free Methods for Stiff Systems of ODE’s
• Fourier Analysis of Iterative Methods for Elliptic pr
• The role of the inner product in stopping criteria for conjugate gradient iterations

This page was built for publication: A numerical study of optimized sparse preconditioners