The Use of Pivoting to Improve the Numerical Performance of Algorithms for Toeplitz Matrices

DOI10.1137/0614033zbMATH Open0772.65014OpenAlexW2082779891MaRDI QIDQ5286288FDOQ5286288

Authors: Douglas Sweet 

Publication date: 29 June 1993

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0614033

Recommendations

• A look-ahead Bareiss algorithm for general Toeplitz matrices
• Stability of Methods for Solving Toeplitz Systems of Equations
• scientific article; zbMATH DE number 4001304
• Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. II: Algorithms
• A fast approach to stabilize two Toeplitz solvers of the Levinson type

zbMATH Keywords

pivotingerror analysisLU factorizationToeplitz systemsNumerical examplesTrench algorithmBareiss algorithm

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Cited In (3)

• A modified T. Chan's preconditioner for Toeplitz systems
• Comparing pivoting strategies for almost strictly sign regular matrices
• Stability analysis of a general Toeplitz system solver

This page was built for publication: The Use of Pivoting to Improve the Numerical Performance of Algorithms for Toeplitz Matrices

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