On a new class of structured matrices
From MaRDI portal
diagonal-plus-semi-separable matrixdiscrete time-varying linear systeminput-outputinverseinversion algorithmslinear complexitynumerical experimentsquasi-separable matrices
Linear equations (linear algebraic aspects) (15A06) Theory of matrix inversion and generalized inverses (15A09) Algebraic systems of matrices (15A30) Direct numerical methods for linear systems and matrix inversion (65F05) Discrete-time control/observation systems (93C55) Input-output approaches in control theory (93D25)
The authors study the properties of quasi-separable matrices in details. It is found that a quasiseparable matrix of general form may be treated as an input-output one for a discrete time-varying linear system with boundary conditions, similar to a diagonal-plus-semi-separable matrix. It is proved that the inverse to a quasiseparable matrix is a quasiseparable matrix which does not hold for diagonal-plus-semi-separable and band matrices. Linear complexity by \(N\) multiplication and inversion algorithms is developed. The implementation of these algorithms is illustrated by results of numerical experiments.
Recommendations
Cites work
- Displacement Structure: Theory and Applications
- Fast inversion algorithms for diagonal plus semiseparable matrices
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- scientific article; zbMATH DE number 3196285 (Why is no real title available?)
- Inverses of Matrices $\{a_{ij}\}$ which Satisfy $a_{ij} = 0$ for $j > i+p$.
- Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices
- Linear complexity algorithms for semiseparable matrices
- Time varying linear systems with boundary conditions and integral operators. I: The transfer operator and its properties
Cited in
(82)- Green's matrices
- A multiple shift \(QR\)-step for structured rank matrices
- Linear complexity inversion algorithms for a class of structured matrices
- A modification of the Dewilde-van der Veen method for inversion of finite structured matrices
- Fast inversion algorithms for a class of structured operator matrices.
- Inner-outer factorization and the inversion of locally finite systems of equations
- Some new results for struve matrix functions
- A real QZ algorithm for structured companion pencils
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- Direct approach to the band completion problem
- Separable type representations of matrices and fast algorithms. Volume 1. Basics. Completion problems. Multiplication and inversion algorithms
- Fast recursive algorithm for a class of structured matrices
- An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths
- The spectral connection matrix for classical orthogonal polynomials of a single parameter
- Structured generalized eigenvalue condition numbers for parameterized quasiseparable matrices
- Structured condition number for multiple right-hand side linear systems with parameterized quasiseparable coefficient matrix
- The spectral connection matrix for any change of basis within the classical real orthogonal polynomials
- Minimal quasi-separable realizations for the inverse of a quasi-separable operator
- Computations with quasiseparable polynomials and matrices
- Time and space efficient generators for quasiseparable matrices
- Geometric means of structured matrices
- Implicit QR for rank-structured matrix pencils
- Fast QR factorization of Cauchy-like matrices
- Neville elimination for rank-structured matrices
- 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
- Piecewise separable matrices
- A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices
- Data-dependent orthogonal polynomials on generalized circles: a unified approach applied to \(\delta \)-domain identification
- Implicit QR for companion-like pencils
- On the stability of some hierarchical rank structured matrix algorithms
- Parallel randomized and matrix-free direct solvers for large structured dense linear systems
- Fast inversion of polynomial-Vandermonde matrices for polynomial systems related to order one quasiseparable matrices
- Inverses of generalized Hessenberg matrices
- New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem.
- Computing with quasiseparable matrices
- scientific article; zbMATH DE number 2186974 (Why is no real title available?)
- Fast algorithms for hierarchically semiseparable matrices
- Efficient solution of parameter-dependent quasiseparable systems and computation of meromorphic matrix functions
- scientific article; zbMATH DE number 5008233 (Why is no real title available?)
- scientific article; zbMATH DE number 5674690 (Why is no real title available?)
- Semi- and quasi-separable systems
- A structured matrix approach to efficient calculation of LQG repetitive learning controllers in the lifted setting
- scientific article; zbMATH DE number 4053817 (Why is no real title available?)
- Low-rank tensor structure of linear diffusion operators in the TT and QTT formats
- Linear computational complexity robust ILC for lifted systems
- Structured tools for structured matrices
- Tensor decomposition methods for high-dimensional Hamilton-Jacobi-Bellman equations
- Structured condition numbers for linear systems with parameterized quasiseparable coefficient matrices
- Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic
- A parallel geometric multifrontal solver using hierarchically semiseparable structure
- Stability of QR-based fast system solvers for a subclass of quasiseparable rank one matrices
- Nested product decomposition of quasiseparable matrices
- The unitary completion and QR iterations for a class of structured matrices
- On some classes of structured matrices with algebraic trigonometric eigenvalues
- Structural and computational properties of possibly singular semiseparable matrices
- Matrix Structures and Matrix Functions
- Efficient inversion of matrix -functions of low order
- The bisection eigenvalue method for unitary Hessenberg matrices via their quasiseparable structure
- Exact computations with quasiseparable matrices
- Improved bisection eigenvalue method for band symmetric Toeplitz matrices
- A quasiseparable approach to five-diagonal CMV and Fiedler matrices
- Reprint of: A quasiseparable approach to five-diagonal CMV and Fiedler matrices
- Representation of quasiseparable matrices using excluded sums and equivalent charges
- Structured condition numbers for Sylvester matrix equation with parameterized quasiseparable matrices
- Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices
- On the LU factorization of infinite systems of semi-separable equations
- Low-rank tree tensor network operators for long-range pairwise interactions
- Tree quasi-separable matrices: a simultaneous generalization of sequentially and hierarchically semiseparable representations
- Condition numbers for the Moore-Penrose inverse and the least squares problem involving rank-structured matrices
- An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures
- Structured eigenvalue condition numbers for parameterized quasiseparable matrices
- Decay bounds for the numerical quasiseparable preservation in matrix functions
- On the Sequentially Semiseparable Structure of SDE-Induced Kernels and Efficient Algorithms for Kernel-Based Estimation Problems
- Block encoding of semiseparable matrices via their generators
- Signal flow graph approach to inversion of (H,m)-quasiseparable-Vandermonde matrices and new filter structures
- On generators of quasiseparable finite block matrices
- On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms
- Multi-core parallel robust structured multifrontal factorization method for large discretized PDEs
- Out-of-band quasiseparable matrices
- Randomized preprocessing of homogeneous linear systems of equations
- Implicit double shift \(QR\)-algorithm for companion matrices
This page was built for publication: On a new class of structured matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1301583)
