A BSP recursive divide and conquer algorithm to compute the inverse of a tridiagonal matrix

DOI10.1006/JPDC.1999.1586MaRDI QIDQ1970210zbMATH OpenOpenAlexFDO

Authors Joan-Josep Climent, Leandro Tortosa, Antonio Zamora

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

Sherman-Morrison formulatridiagonal matrix

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system
• A recursive doubling algorithm for inverting tridiagonal matrices
• A recursive partitioning algorithm for inverting tridiagonal matrices
• Divide and conquer: A parallel algorithm for the solution of a tridiagonal linear system of equations
• scientific article; zbMATH DE number 4009643

Cited in

(5)

• Recursive tridiagonalization of infinite dimensional Hamiltonians
• A recursive method for finding the inverse of a CSP matrix
• A recursive doubling algorithm for inverting tridiagonal matrices
• A recursive partitioning algorithm for inverting tridiagonal matrices
• A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system

This page was built for publication: A BSP recursive divide and conquer algorithm to compute the inverse of a tridiagonal matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1970210)