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

Reliable parallel solution of bidiagonal systems

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

DOI10.1007/s002110100296zbMath0997.65048OpenAlexW2026211182MaRDI QIDQ1348918

Ilan Bar-On, Mauro Leoncini

Publication date: 21 May 2002

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002110100296


zbMATH Keywords

algorithmstabilitynumerical examplesparallel computationCholesky factorizationcyclic reductionpartition methoddivide and conquer approachbidiagonal systems


Mathematics Subject Classification ID

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


Related Items (2)

Checking robust nonsingularity of tridiagonal matrices in linear time ⋮ Aitken-Schwarz Acceleration not based on the mesh for CFD




This page was built for publication: Reliable parallel solution of bidiagonal systems

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