A recursive partitioning algorithm for inverting tridiagonal matrices

DOI10.1080/00207169008803895zbMath0711.65014OpenAlexW2060314464MaRDI QIDQ3497116

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

Publication date: 1990

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

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

zbMATH Keywords

algorithmconvergencefinite difference methodsinversetridiagonal matricesrecursive partitioningmatrix inversionvector and parallel implementation

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Linear boundary value problems for ordinary differential equations (34B05) Direct numerical methods for linear systems and matrix inversion (65F05) Finite difference and finite volume methods for ordinary differential equations (65L12)

Related Items (2)

A symmetric finite difference method for computing eigenvalues of Sturm- Liouville problems ⋮ A 5-instant finite difference formula to find discrete time-varying generalized matrix inverses, matrix inverses, and scalar reciprocals

Cites Work

• A Parallel Method for Tridiagonal Equations
• A Fourth-order Tridiagonal Finite Difference Method for General Non-linear Two-point Boundary Value Problems with Mixed Boundary Conditions
• Unnamed Item
• Unnamed Item

This page was built for publication: A recursive partitioning algorithm for inverting tridiagonal matrices