Separable type representations of matrices and fast algorithms. Volume 1. Basics. Completion problems. Multiplication and inversion algorithms

DOI10.1007/978-3-0348-0606-0zbMath1280.65027OpenAlexW2503785863MaRDI QIDQ1945555

Israel Gohberg, Yu.S.Eidel'man, Iulian Haimovici

Publication date: 8 April 2013

Published in: Operator Theory: Advances and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-0348-0606-0

zbMATH Keywords

algorithm textbook completion inverse matrices multiplication unitary matrices quasiseparable representations quasiseparable matrices minimal rank LDU factorization QR-factorization

Mathematics Subject Classification ID

Factorization of matrices (15A23) Theory of matrix inversion and generalized inverses (15A09) Direct numerical methods for linear systems and matrix inversion (65F05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis (65-01) Matrix completion problems (15A83)

Related Items (17)

LU factorization for matrices in quasiseparable form via orthogonal transformations ⋮ Quasiseparable Hessenberg reduction of real diagonal plus low rank matrices and applications ⋮ Efficient inversion of matrix \(\varphi \)-functions of low order ⋮ The bisection eigenvalue method for unitary Hessenberg matrices via their quasiseparable structure ⋮ Improved bisection eigenvalue method for band symmetric Toeplitz matrices ⋮ hm-toolbox: MATLAB Software for HODLR and HSS Matrices ⋮ A real QZ algorithm for structured companion pencils ⋮ Matrix Structures in Queuing Models ⋮ Implicit QR for rank-structured matrix pencils ⋮ Structured condition numbers for linear systems with parameterized quasiseparable coefficient matrices ⋮ Low-Rank Approximation of a Matrix: Novel Insights, New Progress, and Extensions ⋮ Structured generalized eigenvalue condition numbers for parameterized quasiseparable matrices ⋮ Implicit QR for companion-like pencils ⋮ Structured eigenvalue condition numbers for parameterized quasiseparable matrices ⋮ Decay bounds for the numerical quasiseparable preservation in matrix functions ⋮ Computing the reciprocal of a \(\phi\)-function by rational approximation ⋮ Fast approximate computations with Cauchy matrices and polynomials

This page was built for publication: Separable type representations of matrices and fast algorithms. Volume 1. Basics. Completion problems. Multiplication and inversion algorithms