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 BSP recursive divide and conquer algorithm to compute the inverse of a tridiagonal matrix

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

DOI10.1006/jpdc.1999.1586zbMath0958.68189OpenAlexW2071826812MaRDI QIDQ1970210

Antonio Zamora, Joan-Josep Climent, Leandro Tortosa

Publication date: 19 March 2000

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.1999.1586

zbMATH Keywords

tridiagonal matrixSherman-Morrison formula


Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)


Related Items

A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system



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