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 parallel algorithm for the solution of tridiagonal linear systems

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

DOI10.1080/00207169208804121zbMath0776.65018OpenAlexW2123692403MaRDI QIDQ4032910

Kalpdrum Passi, M. M. Chawla, Pappur N. Shivakumar

Publication date: 16 May 1993

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169208804121


zbMATH Keywords

parallel solvertridiagonal linear systemspartitioning methodsdirect method without pivoting


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 (4)

A parallel elimination method for the solution of banded linear systems ⋮ Properties of a class of perturbed Toeplitz periodic tridiagonal matrices ⋮ A symbolic algorithm for periodic tridiagonal systems of equations ⋮ Upper and lower bounds for inverse elements of finite and infinite tridiagonal matrices



Cites Work

  • A parallel linear system solver
  • A new quadrant interlocking factorization for parallel solution of tridiagonal linear systems
  • Parallel Computers 2




This page was built for publication: A fast parallel algorithm for the solution of tridiagonal linear systems

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