Explicit semi-direct methods based on approximate inverse matrix techniques for solving boundary-value problems on parallel processors
- 28 February 1987
- journal article
- Published by Elsevier in Mathematics and Computers in Simulation
- Vol. 29 (1) , 1-17
- https://doi.org/10.1016/0378-4754(87)90062-0
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Generalized extended to the limit sparse factorization techniques for solving unsymmetric finite element systemsComputing, 1984
- Solving non-linear elliptic difference equations by extendable sparse factorization proceduresComputing, 1980
- The rate of convergence of an approximate matrix factorization semi-direct methodNumerische Mathematik, 1980
- A normalized implicit conjugate gradient method for the solution of large sparse systems of linear equationsComputer Methods in Applied Mechanics and Engineering, 1980
- Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate GradientsACM Transactions on Mathematical Software, 1980
- Approximating the inverse of a matrix for use in iterative algorithms on vector processorsComputing, 1979
- A class of first order factorization methodsBIT Numerical Mathematics, 1978
- Iterative Solution of Implicit Approximations of Multidimensional Partial Differential EquationsSIAM Journal on Numerical Analysis, 1968
- On the Product Form of Inverses of Sparse MatricesSIAM Review, 1966
- The product form for the inverse in the simplex methodMathematics of Computation, 1954