Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:1805908
Jump to:navigation, search

DOI10.1023/A:1019120304866zbMath0936.65022MaRDI QIDQ1805908

Emilio Spedicato, Meifang Zhu

Publication date: 31 October 1999

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


zbMATH Keywords

Gram-Schmidt orthogonalizationLU factorizationABS algorithmimplicit LU algorithmright preconditioning


Mathematics Subject Classification ID

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


Related Items (1)

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1805908&oldid=14165856"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 09:17.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki