An efficient implementation of certain iterative refinement preconditioners

DOI10.1007/BF02243396MaRDI QIDQ1316591zbMATH OpenFDO

Authors S. I. Petrova

Publication date 9 October 1994

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02243396

zbMATH Keywords

BEPS preconditionergeneralized minimal residual methodsleast squares methodlocal grid refinementpreconditioned conjugate gradient methodsparsity pattern of residuals

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Review text

The BEPS preconditioner cf. \textit{J. H. Bramble, R. E. Ewing, J. E. Pasciak} and \textit{A. H. Schatz} [Comput. Methods Appl. Mech. Eng. 67, No. 2, 149-159 (1988; Zbl 0632.76112)] was suggested to solve linear systems arising from the discretization of elliptic or parabolic problems on grids with local refinement. This paper is concerned with an efficient implementation of the BEPS preconditioner for the preconditioned conjugate gradient (CG) method or in the case of unsymmetric system matrices for the preconditioned variants of the generalized conjugate gradient -- least squares (GCG-LS) or the generalized minimal residual (GMRES) methods. The efficient implementation is based on exploiting the sparsity pattern of residuals with nonzero entries appearing only on the interface between the coarse grid and the local fine grid.

Recommendations

• scientific article; zbMATH DE number 66096
• Publication:3197268
• scientific article; zbMATH DE number 1167599
• A preconditioning technique for the efficient solution of problems with local grid refinement

Cites work

• A generalized conjugate gradient, least square method
• A preconditioning technique for the efficient solution of problems with local grid refinement
• A restarted version of a generalized preconditioned conjugate gradient method
• A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• scientific article; zbMATH DE number 3854346 (Why is no real title available?)
• scientific article; zbMATH DE number 3880039 (Why is no real title available?)
• scientific article; zbMATH DE number 3958638 (Why is no real title available?)
• Incomplete block-matrix factorization iterative methods for convection- diffusion problems
• Local refinement techniques for elliptic problems on cell-centered grids. III: Algebraic multilevel BEPS preconditioners
• Local refinement techniques for elliptic problems on cell‐centered grids; II. Optimal order two‐grid iterative methods
• Marching Algorithms for Elliptic Boundary Value Problems. I: The Constant Coefficient Case
• Marching Algorithms for Elliptic Boundary Value Problems. II: The Variable Coefficient Case
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• The Fast Adaptive Composite Grid (FAC) Method for Elliptic Equations

Cited in

(7)

• Methods of reflections: relations with Schwarz methods and classical stationary iterations, scalability and preconditioning.
• scientific article; zbMATH DE number 4172324 (Why is no real title available?)
• scientific article; zbMATH DE number 66096 (Why is no real title available?)
• scientific article; zbMATH DE number 804136 (Why is no real title available?)
• Efficient preconditioning of laplacian matrices for computer graphics
• A class of refined preconditioners with sparse error correction for BEM linear system
• An analysis of some element-by-element techniques

Describes a project that uses

Uses Software

• CGS

This page was built for publication: An efficient implementation of certain iterative refinement preconditioners

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1316591)