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

A fast vector algorithm for solving tridiagonal linear equations

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

DOI10.1016/0167-8191(89)90119-1zbMath0668.65027OpenAlexW2127956802MaRDI QIDQ1118354

M. Bessenrodt-Weberpals, Helmut Weberpals

Publication date: 1989

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(89)90119-1


zbMATH Keywords

numerical examplesparallel computationGauss eliminationtridiagonal systemsvector computerIncomplete cyclic reduction


Mathematics Subject Classification ID

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


Related Items (1)

On the parallel solution of tridiagonal systems by wrap-around partitioning and incomplete LU factorization




This page was built for publication: A fast vector algorithm for solving tridiagonal linear equations

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1118354&oldid=13161261"
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 03:40.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki