On some parallel algorithms for inverting tridiagonal and pentadiagonal matrices

DOI10.1007/BF02576433MaRDI QIDQ1159945zbMATH OpenFDO

Authors S. H. Smith

Publication date 1981

Published in Calcolo (Search for Journal in Brave)

zbMATH Keywords

determinantlinear recurrencesparallel algorithmstridiagonal matricespentadiagonal matricesr-band Hessenberg matrices

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Numerical computation of determinants (65F40)

Cites work

• A Determinant Theorem with Applications to Parallel Algorithms
• A Parallel Algorithm for Solving General Tridiagonal Equations
• A Parallel QR Algorithm for Symmetric Tridiagonal Matrices
• An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
• An improved parallel processor bound in fast matrix inversion
• Matrix Inversion, Its Interest and Application in Analysis of Data
• On Stable Parallel Linear System Solvers
• On some properties of a tridiagonal and penta-diagonal matrix
• Parallel Poisson and biharmonic solvers
• Solving Triangular Systems on a Parallel Computer
• Sulla determinazione della inversa delle matrici tridiagonali e tridiagonali a blicchi
• Time and Parallel Processor Bounds for Linear Recurrence Systems

Cited in

(1)

• Parallel solution of block tridiagonal linear systems

This page was built for publication: On some parallel algorithms for inverting tridiagonal and pentadiagonal matrices

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