scientific article; zbMATH DE number 176183
[For the entire collection see Zbl 0753.00013.] The quadrant interlocking factorization (QIF) method, suggested by the first author and \textit{M. Hatzopoulos} [ Int. J. Comput. Math. 7, 227-238 (1979; Zbl 0442.65019)] for the solution of nonsingular linear systems \(Au=s\) on SIMD-parallel computers is considered. An adaptive method is suggested for the coefficient matrix \(A\) being a nonsingular banded diagonally-dominated matrix. The authors apply the QIF method to the numerical solution of banded linear systems, which occur in the finite element discretization of partial differential equations. Based on the extendable sparse factorization techniques of the authors [Comput. 24, 325-339 (1980; Zbl 0428.65056)], the parallel linear solver can be used either as a direct or an iterative method, where the sparse factorization is used in conjunction with implicit schemes. According to the theoretic evaluation, the method requires the number of \(\max\{2(r_ 1+r_ 2)^ 2,\;2(r_ 1+r_ 2+1)\}\) parallel processors where \(r_ 1\) and \(r_ 2\) are the outer most off-diagonal terms.
- scientific article; zbMATH DE number 1444294
- Parallel quadrant interlocking factorization on hypercube computers
- The solution of linear systems by the QIF algorithms on a wavefront array processor
- A new quadrant interlocking factorization for parallel solution of tridiagonal linear systems
- Part III Matrix decomposition methods for parallel computers
- Solving elliptic boundary-value problems on parallel processors by approximate inverse matrix semi-direct methods based on the multiple explicit Jacobi iteration
- The solution of linear systems by the QIF algorithms on a wavefront array processor
- A Note on Quadrant Interlocking Factorization
- A new quadrant interlocking factorization for parallel solution of tridiagonal linear systems
- Pushing the limits of solvable QAP problems using parallel processing -- is Nugent30 within reach?
- Computing theULfactorisation by newton's method
- The QIF Singular Value Decomposition Method
- Part III Matrix decomposition methods for parallel computers
- The choleski Q.I.F. algorithm for solving symmetric linear systems
- scientific article; zbMATH DE number 1444294 (Why is no real title available?)
- A parallel implementation of the QR-algorithm
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035287)