Linear complexity algorithms for semiseparable matrices
From MaRDI portal
For the solution of linear systems with coefficient matrix \(R=D+S\), where S is a semiseparable matrix and D a diagonal matrix, recursive algorithms are introduced that use the LDU factorization of R into factors \((L+S_ L)D(I+S_ U)\), where the semiseparability property is retained. The complexity for these algorithms is analyzed and an efficient updating method for the increase of system dimensions is proposed.
Recommendations
- Linear complexity algorithm for semiseparable matrices
- Matrix computations and semiseparable matrices. Vol. 1: Linear systems.
- Fast and Stable Algorithms for Banded Plus Semiseparable Systems of Linear Equations
- Fast and stable solution of banded-plus-semiseparable linear systems
- scientific article; zbMATH DE number 2098303
Cites work
- An innovations approach to least-squares estimation--Part VI: Discrete-time innovations representations and recursive estimation
- Fast algorithms for Brownian matrices
- Fast O(n) complexity algorithms for diagonal innovation matrices
- Fast recursive algorithms for a class of linear equations
- Fredholm resolvents, Wiener-Hopf equations, and Riccati differential equations
- scientific article; zbMATH DE number 3711820 (Why is no real title available?)
- scientific article; zbMATH DE number 44406 (Why is no real title available?)
- Linear complexity algorithms for semiseparable matrices
- Numerical solution of integral equations, fast algorithms and Krein- Sobolev equation
- Some new algorithms for recursive estimation in constant linear systems
- Some new algorithms for recursive estimation in constant, linear, discrete-time systems
- Time varying linear systems with boundary conditions and integral operators. I: The transfer operator and its properties
Cited in
(36)- Linear complexity algorithms for semiseparable matrices
- Efficient solution of linear systems of equations with recursive structure
- The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented algorithms
- On a new class of structured 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 diagonal plus semiseparable matrices
- Linear complexity algorithm for semiseparable matrices
- Inner-outer factorization and the inversion of locally finite systems of equations
- A look-ahead block Schur algorithm for diagonal plus semiseparable matrices
- Discrete self-adjoint Dirac systems: asymptotic relations, Weyl functions and Toeplitz matrices
- Minimal quasi-separable realizations for the inverse of a quasi-separable operator
- Time and space efficient generators for quasiseparable matrices
- A Levinson-like algorithm for symmetric strongly nonsingular higher order semiseparable plus band matrices
- Unitary rank structured matrices
- Eigenstructure of order-one-quasiseparable matrices. Three-term and two-term recurrence relations
- A preconditioned GMRES for complex dense linear systems from electromagnetic wave scattering problems
- On the Power of the Semi-Separated Pair Decomposition
- Semi- and quasi-separable systems
- Algorithms to solve hierarchically semi-separable systems
- Low-rank tensor structure of linear diffusion operators in the TT and QTT formats
- Fast and Stable Algorithms for Banded Plus Semiseparable Systems of Linear Equations
- Transformations of matrix structures work again
- Data-sparse approximation on the computation of a weakly singular Fredholm equation: a stellar radiative transfer application
- Parameter estimation in differential equations, using random time transformations
- On some classes of structured matrices with algebraic trigonometric eigenvalues
- Matrix computations and semiseparable matrices. Vol. 1: Linear systems.
- Some Fast Algorithms for Sequentially Semiseparable Representations
- Transformations to rank structures by unitary similarity
- Generalized Rybicki Press algorithm.
- Singular matrices whose Moore-Penrose inverse is tridiagonal
- Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices
- Tridiagonal M-matrices with tridiagonal Moore-Penrose inverse
- On the LU factorization of infinite systems of semi-separable equations
- A QR-method for computing the singular values via semiseparable matrices
- Out-of-band quasiseparable matrices
This page was built for publication: Linear complexity algorithms for semiseparable matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1075738)
