Computing theULfactorisation by newton's method

DOI10.1080/00207169308804191MaRDI QIDQ4323720zbMATH OpenOpenAlexWikidataFDO

Authors Dušan Caf, D. J. Evans

Publication date 15 August 1995

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169308804191

zbMATH Keywords

comparisonconvergencedirect inversionNewton methodnumerical experimentssystolic arraysToeplitz matrices

Mathematics Subject Classification ID

Factorization of matrices (15A23) Iterative numerical methods for linear systems (65F10) Computational methods for sparse matrices (65F50)

Recommendations

• The QIF Singular Value Decomposition Method
• A Rotation Method for Computing the QR-Decomposition
• scientific article; zbMATH DE number 176183
• Publication:4203703
• A new quadrant interlocking factorization for parallel solution of tridiagonal linear systems
• scientific article; zbMATH DE number 541480
• A Note on Quadrant Interlocking Factorization
• The choleski Q.I.F. algorithm for solving symmetric linear systems
• ULfactorization of banded Töplitz matrices
• Fast Parallel Algorithms for QR and Triangular Factorization

Cites work

• A parallel linear system solver
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)

Cited in

(2)

• scientific article; zbMATH DE number 541480 (Why is no real title available?)
• ULfactorization of banded Töplitz matrices

This page was built for publication: Computing theULfactorisation by newton's method

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