Two fast algorithms for solving diagonal-plus-semiseparable linear systems.

DOI10.1016/j.cam.2003.09.040zbMath1038.65025OpenAlexW2002864633MaRDI QIDQ1426814

Nicola Mastronardi, Ellen Van Camp, Marc Van Barel

Publication date: 15 March 2004

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2003.09.040

zbMATH Keywords

algorithmsLinear system\(QR\)-factorization\(URV\)-factorizationDiagonal-plus-semiseparable matrixHessenberg orthogonal matrices

Mathematics Subject Classification ID

Factorization of matrices (15A23) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

A note on the nullity theorem ⋮ Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal ⋮ Stability of QR-based fast system solvers for a subclass of quasiseparable rank one matrices ⋮ A Levinson-like algorithm for symmetric strongly nonsingular higher order semiseparable plus band matrices ⋮ Rational \(QR\)-iteration without inversion ⋮ Eigenstructure of order-one-quasiseparable matrices. Three-term and two-term recurrence relations ⋮ Generalized Rybicki Press algorithm ⋮ A QR-method for computing the singular values via semiseparable matrices ⋮ A multiple shift \(QR\)-step for structured rank matrices

Cites Work

• Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices
• A modification of the Dewilde-van der Veen method for inversion of finite structured matrices
• A look-ahead block Schur algorithm for diagonal plus semiseparable matrices
• Fast and Stable Algorithms for Banded Plus Semiseparable Systems of Linear Equations
• An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form
• Unnamed Item
• Unnamed Item

This page was built for publication: Two fast algorithms for solving diagonal-plus-semiseparable linear systems.