Explicit approximate inverse preconditioning techniques

DOI10.1007/BF03041466zbMath1032.65046OpenAlexW2006637940WikidataQ113327631 ScholiaQ113327631MaRDI QIDQ1396235

George A. Gravvanis

Publication date: 30 June 2003

Published in: Archives of Computational Methods in Engineering (Search for Journal in Brave)

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

zbMATH Keywords

computational complexityconvergencenumerical resultsnonlinear systemsdomain decompositionpreconditioningfinite elementelliptic equationsnonlinear boundary value problemsfinite differenceparabolic equationslarge sparse systemsLU-factorizationapproximate inversescomposite iterative schemesCholesky-factorizationinner-outer schemesinverse matrix techniques

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Numerical computation of solutions to systems of equations (65H10) Nonlinear parabolic equations (35K55) Boundary value problems for second-order elliptic equations (35J25) Nonlinear boundary value problems for linear elliptic equations (35J65) Initial-boundary value problems for second-order parabolic equations (35K20) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Finite difference methods for initial value and initial-boundary value problems involving PDEs (65M06) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Finite element, Rayleigh-Ritz and Galerkin methods for initial value and initial-boundary value problems involving PDEs (65M60) Finite difference methods for boundary value problems involving PDEs (65N06) Multigrid methods; domain decomposition for initial value and initial-boundary value problems involving PDEs (65M55) Complexity and performance of numerical algorithms (65Y20)

Related Items

Exploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systems ⋮ High performance inverse preconditioning ⋮ Software rejuvenation for resource optimization based on explicit approximate inverse preconditioning ⋮ A Distributed Normalized Explicit Preconditioned Conjugate Gradient Method ⋮ Parallel \(N\)-body simulation based on the PM and P3M methods using multigrid schemes in conjunction with generic approximate sparse inverses ⋮ On the GPGPU parallelization issues of finite element approximate inverse preconditioning ⋮ Software rejuvenation and resource reservation policies for optimizing server resource availability using cyclic nonhomogeneous Markov chains ⋮ On the preconditioners for fast multipole boundary element methods for 2D multi-domain elastostatics ⋮ GPGPU-based parallel computing applied in the FEM using the conjugate gradient algorithm: a review ⋮ Three-dimensional preconditioned FM-IBEM solution to broadband-frequency seismic wave scattering in a layered sedimentary basin ⋮ Optimal server resource reservation policies for priority classes of users under cyclic non-homogeneous Markov modeling

Uses Software

• CGS

Cites Work

• Methods of conjugate gradients for solving linear systems
• Compact Computation of the Inverse of a Matrix
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Explicit semi-direct methods based on approximate inverse matrix techniques for solving boundary-value problems on parallel processors
• Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices
• The numerically stable reconstruction of Jacobi matrices from spectral data
• A normalized sparse linear equations solver
• Relaxed and stabilized incomplete factorizations for non-self-adjoint linear systems
• Implicit semi-direct methods based on root-free sparse factorization procedures
• On the eigenvalue distribution of a class of preconditioning methods
• A finite element - capacitance method for elliptic problems on regions partitioned into subregions
• The rate of convergence of conjugate gradients
• Approximate root-free factorization techniques for solving elliptic difference equations in three space variables
• Approximating the inverse of a matrix for use in iterative algorithms on vector processors
• Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
• A capacitance matrix method for Dirichlet problem on polygon region
• A comparison of some GMRES-like methods
• Numerical stability of the Chebyshev method for the solution of large linear systems
• The Tchebychev iteration for nonsymmetric linear systems
• Approximate sparsity patterns for the inverse of a matrix and preconditioning
• Iterative solution of large sparse systems of equations. Transl. from the German
• On the convergence rate of the conjugate gradients in presence of rounding errors
• Explicit preconditioned iterative methods for solving large unsymmetric finite element systems
• Iterative solution of linear systems in the 20th century
• The impact of high-performance computing in the solution of linear systems: Trends and problems
• A three-dimensional explicit preconditioned solver
• SOR as a preconditioner
• Maintaining convergence properties of BiCGStab methods in finite precision arithmetic
• The rate of convergence of explicit approximate inverse preconditioning
• Analysis of Preconditioners for Domain Decomposition
• A Note on the Generalized Conjugate Gradient Method
• On a class of preconditioned iterative methods on parallel computers
• A Taxonomy for Conjugate Gradient Methods
• The Numerical Solution of Parabolic and Elliptic Differential Equations
• Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
• High Performance Preconditioning
• On the Stability of Relaxed Incomplete Lu Factorizations
• The Construction of Preconditioners for Elliptic Problems by Substructuring, III
• A Note on the Efficiency of Domain Decomposed Incomplete Factorizations
• Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
• An Iterative Method for Elliptic Problems on Regions Partitioned into Substructures
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• A Stability Analysis of Incomplete LU Factorizations
• Numerical solution of non-linear elliptic boundary-value problems by isomorphic iterative methods
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
• On the Robustness of ILU Smoothing
• Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
• A Vectorizable Variant of some ICCG Methods
• Row Projection Methods for Large Nonsymmetric Linear Systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Domain Decomposition with Local Mesh Refinement
• How Fast are Nonsymmetric Matrix Iterations?
• Approximate inverse preconditionings for sparse linear systems
• Factorized Sparse Approximate Inverse Preconditionings I. Theory
• Pseudoinversus and conjugate gradients
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
• A class of first order factorization methods
• Preconditioned iterative methods for solving 3d boundary value problems
• An approximate inverse matrix technique for arrowhead matrices
• Variants of BICGSTAB for Matrices with Complex Spectrum
• Domain Decomposition Methods in Science and Engineering
• Iterative Solution Methods
• A three‐dimensional symmetric linear equation solver
• Parallel Preconditioning with Sparse Approximate Inverses
• On Fourier-Toeplitz Methods for Separable Elliptic Problems
• Explicit preconditioned conjugate gradient schemes for solving biharmonic equations
• Approximate inverse banded matrix techniques
• The Construction of Preconditioners for Elliptic Problems by Substructuring. I
• New convergence results and preconditioning strategies for the conjugate gradient method
• GMRESR: a family of nested GMRES methods
• Explicit preconditioned methods for solving 3d boundary-value problems by approximate inverse finite element matrix techniques
• A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
• Explicit isomorphic iterative methods for solving arrow-type linear systems
• Some numerical experiments using Newton's method for nonlinear parabolic and elliptic boundary-value problems
• An Approximate Factorization Procedure for Solving Self-Adjoint Elliptic Difference Equations
• The Use of Pre-conditioning in Iterative Methods for Solving Linear Equations with Symmetric Positive Definite Matrices