Approximating the inverse of a matrix for use in iterative algorithms on vector processors
From MaRDI portal
Publication:1142011
DOI10.1007/BF02243566zbMath0438.65037MaRDI QIDQ1142011
P. F. Dubois, Anne Greenbaum, Garry H. Rodrigue
Publication date: 1979
Published in: Computing (Search for Journal in Brave)
conjugate gradient methodChebyshev methodcomparison with the incomplete Cholesky decompositionconjugate Cholesky decompositionlinear symmetric positive definite systemtruncated Neumann series
Iterative numerical methods for linear systems (65F10) Theory of operating systems (68N25) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Related Items (48)
A numerical study of optimized sparse preconditioners ⋮ Approximate Inverse Preconditioners for the Conjugate Gradient Method ⋮ Shifted FSAI preconditioners for the efficient parallel solution of non-linear groundwater flow models ⋮ Polynomial Preconditioned GMRES and GMRES-DR ⋮ Stabilized Finite Element Formulation and High-Performance Solver for Slightly Compressible Navier–Stokes Equations ⋮ High performance inverse preconditioning ⋮ Explicit preconditioned iterative methods for solving large unsymmetric finite element systems ⋮ Necessary and sufficient conditions for the simplification of generalized conjugate-gradient algorithms ⋮ A parallel implementation of the restarted GMRES iterative algorithm for nonsymmetric systems of linear equations ⋮ A POLYNOMIAL PRECONDITIONER FOR BLOCK TRIDIAGONAL MATRICES ⋮ Numerical simulations for transonic aerodynamic flows ⋮ Matrix-free polynomial-based nonlinear least squares optimized preconditioning and its application to discontinuous Galerkin discretizations of the Euler equations ⋮ Preconditioning complex symmetric linear systems ⋮ Numerical solution of three-dimensional boundary-value problems by generalized approximate inverse matrix techniques ⋮ Vector Computations for Sparse Linear Systems ⋮ A class of explicit preconditioned conjugate gradient methods for solving large finite element systems ⋮ The numerical solution of stochastic automata networks ⋮ Explicit approximate inverse preconditioning techniques ⋮ Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives ⋮ Periodically preconditioned conjugate gradient-restoration algorithm ⋮ Vectorizing codes for studying long-range transport of air pollutants ⋮ An explicit-implicit method for a class of time-dependent partial differential equations ⋮ An adaptive method for solving nonsymmetric linear systems involving applications of SCPACK ⋮ Approximate polynomial preconditionings applied to biharmonic equations ⋮ Parallel computations in linear algebra. II ⋮ Explicit semi-direct methods based on approximate inverse matrix techniques for solving boundary-value problems on parallel processors ⋮ Optimal preconditioners of a given sparsity pattern ⋮ Comparison of several iterative techniques in the solution of symmetric banded equations on a two-pipe Cyber 205 ⋮ A block preconditioned steepest descent method for symmetric eigenvalue problems ⋮ Data structures to vectorize CG algorithms for general sparsity patterns ⋮ Adaptive polynomial preconditioning for Hermitian indefinite linear systems ⋮ Preconditioning the Helmholtz equation with the shifted Laplacian and Faber polynomials ⋮ The block preconditioned conjugate gradient method on vector computers ⋮ Unified frameworks for high order Newton-Schulz and Richardson iterations: a computationally efficient toolkit for convergence rate improvement ⋮ The radiation-hydrodynamic ICF3D code ⋮ Some notes on multisplitting methods and \(m\)-step preconditioners for linear systems ⋮ Convergence of a parallel jacobi-type method ⋮ Iterative solution of linear systems in the 20th century ⋮ Solving elliptic boundary-value problems on parallel processors by approximate inverse matrix semi-direct methods based on the multiple explicit Jacobi iteration ⋮ A survey of preconditioned iterative methods for linear systems of algebraic equations ⋮ On validity of \(m\)-step multisplitting preconditioners for linear systems ⋮ Low-rank tensor methods for Markov chains with applications to tumor progression models ⋮ A parallel iterative system solver ⋮ The extrapolated ω-double jacobi (Eω-DOJ) method ⋮ Polynomial preconditioning on vector computers ⋮ Conjugate gradient solution of finite element equations on the IBM 3090 vector computer utilizing polynomial preconditionings ⋮ Yet another polynomial preconditioner for the conjugate gradient algorithm ⋮ Preconditioning techniques for large linear systems: A survey
Cites Work
This page was built for publication: Approximating the inverse of a matrix for use in iterative algorithms on vector processors
