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

The accuracy of a parallel \(LU\) decomposition algorithm

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

DOI10.1016/0898-1221(90)90345-KzbMath0708.65028OpenAlexW2072188291MaRDI QIDQ920567

Nai-Kuan Tsao

Publication date: 1990

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(90)90345-k


zbMATH Keywords

comparisonnumerical exampleserror analysiserror complexity measuresparallel LU decomposition algorithmsequential LU decomposition algorithm


Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)


Related Items (2)

Dense linear system: A parallel self-verified solver ⋮ Recurrent neural networks for LU decomposition and Cholesky factorization




Cites Work

  • Unnamed Item
  • LU factorization on parallel computers
  • A Round-Off Error Model with Applications to Arithmetic Expressions




This page was built for publication: The accuracy of a parallel \(LU\) decomposition algorithm

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