Numerical solution of three-dimensional boundary-value problems by generalized approximate inverse matrix techniques
DOI10.1080/00207168908803789zbMath0749.65021OpenAlexW2094622535MaRDI QIDQ4009702
Publication date: 27 September 1992
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207168908803789
preconditioningboundary-value problemiterative methodsmultiprocessor systemsexplicit difference equationsgeneralized approximate inverse matrix techniquesinverses of large sparse unsymmetric matricesLU-type sparse factorizationthree-space variables
Iterative numerical methods for linear systems (65F10) Finite difference methods for boundary value problems involving PDEs (65N06) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Related Items
Cites Work
- Explicit semi-direct methods based on approximate inverse matrix techniques for solving boundary-value problems on parallel processors
- Generalized extended to the limit sparse factorization techniques for solving unsymmetric finite element systems
- Solving elliptic boundary-value problems on parallel processors by approximate inverse matrix semi-direct methods based on the multiple explicit Jacobi iteration
- Parallel S.O.R. iterative methods
- Solving non-linear elliptic difference equations by extendable sparse factorization procedures
- The rate of convergence of an approximate matrix factorization semi- direct method
- Approximating the inverse of a matrix for use in iterative algorithms on vector processors
- Compact Computation of the Inverse of a Matrix
