A generalization of the implicit LU algorithm to an arbitrary initial matrix

DOI10.1023/A:1019120304866zbMATH Open0936.65022MaRDI QIDQ1805908FDOQ1805908

Authors: E. Spedicato, Meifang Zhu 

Publication date: 31 October 1999

Published in: Numerical Algorithms (Search for Journal in Brave)

Recommendations

• The implicit LX method of the ABS class
• On the block implicit LU algorithm for linear systems of equations
• scientific article; zbMATH DE number 1163763
• New interpretation of related Huang's methods

zbMATH Keywords

LU factorizationGram-Schmidt orthogonalizationABS algorithmimplicit LU algorithmright preconditioning

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Numerical computation of matrix norms, conditioning, scaling (65F35) Orthogonalization in numerical linear algebra (65F25)

Cited In (2)

• On the block implicit LU algorithm for linear systems of equations
• ABS-type methods for solving full row rank linear systems using a new rank two update

This page was built for publication: A generalization of the implicit LU algorithm to an arbitrary initial matrix

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