A look-ahead block Schur algorithm for diagonal plus semiseparable matrices

DOI10.1016/S0898-1221(98)00069-8zbMath0999.65016OpenAlexW2010705600MaRDI QIDQ1608395

Yu.S.Eidel'man, Israel Gohberg

Publication date: 6 August 2002

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(98)00069-8

zbMATH Keywords

linear complexitysemiseparable matricesblock triangular factorizationlook-ahead algorithmblock Schur algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (3)

A Levinson-like algorithm for symmetric strongly nonsingular higher order semiseparable plus band matrices ⋮ Two fast algorithms for solving diagonal-plus-semiseparable linear systems. ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices
• Time varying linear systems with boundary conditions and integral operators. I: The transfer operator and its properties
• Linear complexity algorithms for semiseparable matrices
• Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Toeplitz systems
• Fast inversion algorithms for diagonal plus semiseparable matrices
• A Look-Ahead Block Schur Algorithm for Toeplitz-Like Matrices
• Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure

This page was built for publication: A look-ahead block Schur algorithm for diagonal plus semiseparable matrices