On a new class of structured matrices

DOI10.1007/BF01300581zbMath0934.15002OpenAlexW2050746438MaRDI QIDQ1301583

Publication date: 12 September 1999

Published in: Integral Equations and Operator Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01300581

zbMATH Keywords

numerical experiments inverse linear complexity input-output quasi-separable matrices discrete time-varying linear system inversion algorithms diagonal-plus-semi-separable matrix

Mathematics Subject Classification ID

Theory of matrix inversion and generalized inverses (15A09) Discrete-time control/observation systems (93C55) Input-output approaches in control theory (93D25) Algebraic systems of matrices (15A30) Direct numerical methods for linear systems and matrix inversion (65F05) Linear equations (linear algebraic aspects) (15A06)

Related Items (56)

Computations with quasiseparable polynomials and matrices ⋮ A modification of the Dewilde-van der Veen method for inversion of finite structured matrices ⋮ Semi- and Quasi-separable Systems ⋮ On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms ⋮ Stability of QR-based fast system solvers for a subclass of quasiseparable rank one matrices ⋮ Inverses of generalized Hessenberg matrices ⋮ Data-dependent orthogonal polynomials on generalized circles: a unified approach applied to \(\delta \)-domain identification ⋮ Time and space efficient generators for quasiseparable matrices ⋮ Low-rank tensor structure of linear diffusion operators in the TT and QTT formats ⋮ Matrix Structures and Matrix Functions ⋮ Efficient inversion of matrix \(\varphi \)-functions of low order ⋮ The bisection eigenvalue method for unitary Hessenberg matrices via their quasiseparable structure ⋮ Exact computations with quasiseparable matrices ⋮ New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem ⋮ Improved bisection eigenvalue method for band symmetric Toeplitz matrices ⋮ A quasiseparable approach to five-diagonal CMV and Fiedler matrices ⋮ Multi-core parallel robust structured multifrontal factorization method for large discretized PDEs ⋮ A real QZ algorithm for structured companion pencils ⋮ Reprint of: A quasiseparable approach to five-diagonal CMV and Fiedler matrices ⋮ Linear computational complexity robust ILC for lifted systems ⋮ Representation of quasiseparable matrices using excluded sums and equivalent charges ⋮ Geometric means of structured matrices ⋮ Implicit QR for rank-structured matrix pencils ⋮ Fast recursive algorithm for a class of structured matrices ⋮ Fast QR factorization of Cauchy-like matrices ⋮ Structured condition numbers for linear systems with parameterized quasiseparable coefficient matrices ⋮ Neville elimination for rank-structured matrices ⋮ The spectral connection matrix for classical orthogonal polynomials of a single parameter ⋮ On the \(LU\) factorization of infinite systems of semi-separable equations ⋮ A structured matrix approach to efficient calculation of LQG repetitive learning controllers in the lifted setting ⋮ Eigenstructure of order-one-quasiseparable matrices. Three-term and two-term recurrence relations ⋮ The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order ⋮ Randomized preprocessing of homogeneous linear systems of equations ⋮ An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths ⋮ On some classes of structured matrices with algebraic trigonometric eigenvalues ⋮ The unitary completion and QR iterations for a class of structured matrices ⋮ Structured generalized eigenvalue condition numbers for parameterized quasiseparable matrices ⋮ Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations ⋮ An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures ⋮ Implicit double shift \(QR\)-algorithm for companion matrices ⋮ Implicit QR for companion-like pencils ⋮ Structured eigenvalue condition numbers for parameterized quasiseparable matrices ⋮ Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic ⋮ Structured condition number for multiple right-hand side linear systems with parameterized quasiseparable coefficient matrix ⋮ Fast algorithms for hierarchically semiseparable matrices ⋮ On the Stability of Some Hierarchical Rank Structured Matrix Algorithms ⋮ Parallel Randomized and Matrix-Free Direct Solvers for Large Structured Dense Linear Systems ⋮ Direct approach to the band completion problem ⋮ Tensor Decomposition Methods for High-dimensional Hamilton--Jacobi--Bellman Equations ⋮ Inner-outer factorization and the inversion of locally finite systems of equations ⋮ Green's matrices ⋮ A multiple shift \(QR\)-step for structured rank matrices ⋮ A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices ⋮ Fast Inversion of Polynomial-Vandermonde Matrices for Polynomial Systems Related to Order One Quasiseparable Matrices ⋮ The spectral connection matrix for any change of basis within the classical real orthogonal polynomials ⋮ A Parallel Geometric Multifrontal Solver Using Hierarchically Semiseparable Structure

Cites Work

This page was built for publication: On a new class of structured matrices