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 binary tree implementation of a parallel distributed tridiagonal solver

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

DOI10.1016/0167-8191(94)00074-KzbMath0835.65050OpenAlexW2020947060MaRDI QIDQ1907152

Juan C. Agüí, Javier Jiménez

Publication date: 29 January 1996

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

Full work available at URL: https://doi.org/10.1016/0167-8191(94)00074-k


zbMATH Keywords

parallel computationdivide-and-conquer algorithmperformance resultstransputer systembinary tree implementationdistributed linear tridiagonal systems


Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)


Related Items (1)

A parallel algorithm for circulant tridiagonal linear systems







This page was built for publication: A binary tree implementation of a parallel distributed tridiagonal solver

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