Optimal Bounds for Solving Tridiagonal Systems with Preconditioning

DOI10.1137/0217065MaRDI QIDQ3806666zbMATH OpenOpenAlexFDO

Authors Paolo Zellini

Publication date 1988

Published in SIAM Journal on Computing (Search for Journal in Brave)

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

zbMATH Keywords

Centrosymmetric matricescomplexitylinear tridiagonal systemLU-decompositionodd-even reduction

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Complexity bounds for solving some tridiagonal systems with preconditioning
• scientific article; zbMATH DE number 4039116
• scientific article; zbMATH DE number 1760070
• Optimal and efficient parallel tridiagonal solvers using direct methods
• Bounds for the solutions of a class of tridiagonal linear systems

Cited in

(5)

• Bounds for the solutions of a class of tridiagonal linear systems
• Complexity bounds for solving some tridiagonal systems with preconditioning
• Optimal trigonometric preconditioners for nonsymmetric Toeplitz systems
• Optimal trigonometric preconditioners for elliptic and queueing problems
• Bounding the Error in Gaussian Eimination for Tridiagonal Systems

This page was built for publication: Optimal Bounds for Solving Tridiagonal Systems with Preconditioning

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