Approximating the inverse of a matrix for use in iterative algorithms on vector processors
From MaRDI portal
(Redirected from Publication:1142011)
Cites work
Cited in
(49)- Shifted FSAI preconditioners for the efficient parallel solution of non-linear groundwater flow models
- Unified frameworks for high order Newton-Schulz and Richardson iterations: a computationally efficient toolkit for convergence rate improvement
- A parallel implementation of the restarted GMRES iterative algorithm for nonsymmetric systems of linear equations
- A class of explicit preconditioned conjugate gradient methods for solving large finite element systems
- Preconditioning techniques for large linear systems: A survey
- Numerical solution of three-dimensional boundary-value problems by generalized approximate inverse matrix techniques
- Stabilized finite element formulation and high-performance solver for slightly compressible Navier-Stokes equations
- Low-rank tensor methods for Markov chains with applications to tumor progression models
- A block preconditioned steepest descent method for symmetric eigenvalue problems
- Approximate polynomial preconditionings applied to biharmonic equations
- Adaptive polynomial preconditioning for Hermitian indefinite linear systems
- Polynomial preconditioning for the action of the matrix square root and inverse square root
- Yet another polynomial preconditioner for the conjugate gradient algorithm
- Vector Computations for Sparse Linear Systems
- Preconditioning the Helmholtz equation with the shifted Laplacian and Faber polynomials
- A POLYNOMIAL PRECONDITIONER FOR BLOCK TRIDIAGONAL MATRICES
- On validity of \(m\)-step multisplitting preconditioners for linear systems
- Parallel computations in linear algebra. II
- Iterative solution of linear systems in the 20th century
- 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
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- A numerical study of optimized sparse preconditioners
- Solving elliptic boundary-value problems on parallel processors by approximate inverse matrix semi-direct methods based on the multiple explicit Jacobi iteration
- Some notes on multisplitting methods and \(m\)-step preconditioners for linear systems
- Necessary and sufficient conditions for the simplification of generalized conjugate-gradient algorithms
- The extrapolated ω-double jacobi (Eω-DOJ) method
- An explicit-implicit method for a class of time-dependent partial differential equations
- Polynomial preconditioning on vector computers
- The block preconditioned conjugate gradient method on vector computers
- The numerical solution of stochastic automata networks
- High performance inverse preconditioning
- Periodically preconditioned conjugate gradient-restoration algorithm
- Convergence of a parallel jacobi-type method
- Data structures to vectorize CG algorithms for general sparsity patterns
- Matrix-free polynomial-based nonlinear least squares optimized preconditioning and its application to discontinuous Galerkin discretizations of the Euler equations
- Polynomial Preconditioned GMRES and GMRES-DR
- A parallel iterative system solver
- An adaptive method for solving nonsymmetric linear systems involving applications of SCPACK
- Numerical simulations for transonic aerodynamic flows
- Conjugate gradient solution of finite element equations on the IBM 3090 vector computer utilizing polynomial preconditionings
- Explicit preconditioned iterative methods for solving large unsymmetric finite element systems
- A survey of preconditioned iterative methods for linear systems of algebraic equations
- Explicit approximate inverse preconditioning techniques
- The radiation-hydrodynamic ICF3D code
- Approximate Inverse Preconditioners for the Conjugate Gradient Method
- Vectorizing codes for studying long-range transport of air pollutants
- Preconditioning complex symmetric linear systems
This page was built for publication: Approximating the inverse of a matrix for use in iterative algorithms on vector processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1142011)
