ThewwTfactorization of dense and sparse matrices

DOI10.1080/00207169508804403zbMATH Open0846.65007OpenAlexW2009574932MaRDI QIDQ4876356FDOQ4876356

Authors: Abdelhamid Benaini 

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

Recommendations

• A symmetric linear system solver
• Wilkinson's inertia-revealing factorization and its application to sparse matrices.
• Sparsity Analysis of the $QR$ Factorization
• Symmetric-triangular decomposition and its applications. I: Theorems and algorithms

zbMATH Keywords

sparse matricesalgorithmfactorizationsymmetric positive definite matrix

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)

Cites Work

• The Role of Elimination Trees in Sparse Factorization
• A parallel linear system solver
• 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
• The parallel solution of banded linear equations by the new quadrant interlocking factorisation (q.i.f.) method
• A short proof for the existence of the WZ-factorisation

Cited In (1)

• On simplifying the matrix of a wff

This page was built for publication: Theww^Tfactorization of dense and sparse matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4876356)