ThewwTfactorization of dense and sparse matrices
From MaRDI portal
Publication:4876356
DOI10.1080/00207169508804403zbMath0846.65007OpenAlexW2009574932MaRDI QIDQ4876356
Publication date: 26 September 1996
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169508804403
Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)
Cites Work
- Comments on the paper ``A short proof for the existence of the WZ- factorization
- The solution of linear systems by the QIF algorithms on a wavefront array processor
- The inversion of matrices by the double-bordering algorithm on MIMD computers
- A systolic array design for matrix system solution by the symmetric bordering method
- Supernodal symbolic Cholesky factorization on a local-memory multiprocessor
- Parallel algorithms for sparse triangular system solution
- A short proof for the existence of the WZ-factorisation
- The Role of Elimination Trees in Sparse Factorization
- A parallel linear system solver
- The parallel solution of banded linear equations by the new quadrant interlocking factorisation (q.i.f.) method