High performance inverse preconditioning
DOI10.1007/s11831-008-9026-xzbMath1172.65019OpenAlexW2089684282WikidataQ113323946 ScholiaQ113323946MaRDI QIDQ841716
Publication date: 18 September 2009
Published in: Archives of Computational Methods in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11831-008-9026-x
performancedistributed systemspreconditioningparallel computationconjugate gradient methodsurvey papersparse linear systemssymmetric multiprocessor systemsapproximate inverse matrix algorithms
Computational methods for sparse matrices (65F50) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)
Related Items
Uses Software
Cites Work
- 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
- A normalized sparse linear equations solver
- High performance finite element approximate inverse preconditioning
- OpenMP based parallel normalized direct methods for sparse finite element linear systems
- The use of a refined error bound when updating eigenvalues of tridiagonals
- s-step iterative methods for symmetric linear systems
- Approximating the inverse of a matrix for use in iterative algorithms on vector processors
- Approximate sparsity patterns for the inverse of a matrix and preconditioning
- Iterative solution of large sparse systems of equations. Transl. from the German
- Explicit preconditioned iterative methods for solving large unsymmetric finite element systems
- Explicit approximate inverse preconditioning techniques
- Iterative solution of linear systems in the 20th century
- The impact of high-performance computing in the solution of linear systems: Trends and problems
- Preconditioning techniques for large linear systems: A survey
- On the performance of parallel approximate inverse preconditioning using Java multithreading techniques
- The rate of convergence of explicit approximate inverse preconditioning
- Fast Parallel Finite Element Approximate Inverses
- Java multithreading‐based parallel approximate arrow‐type inverses
- Algorithms for Special Tridiagonal Systems
- Normalized explicit approximate inverse preconditioning for solving 3D boundary value problems on uniprocessor and distributed systems
- High Performance Preconditioning
- Parallel Exact and Approximate Arrow-Type Inverses on Symmetric Multiprocessor Systems
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Approximate inverse preconditionings for sparse linear systems
- Factorized Sparse Approximate Inverse Preconditionings I. Theory
- Numerical Linear Algebra for High-Performance Computers
- An approximate inverse matrix technique for arrowhead matrices
- Parallel Preconditioning with Sparse Approximate Inverses
- Benchmarking Java against C and Fortran for scientific applications
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
- Explicit isomorphic iterative methods for solving arrow-type linear systems
- The Use of Pre-conditioning in Iterative Methods for Solving Linear Equations with Symmetric Positive Definite Matrices
- Methods of conjugate gradients for solving linear systems