A method of matrix inverse triangular decomposition based on contiguous principal submatrices
From MaRDI portal
computational complexitytriangular decompositionToeplitz matricesHermitian Toeplitz matricesprincipal submatricesalgorithm of Levinson-Trench
Direct numerical methods for linear systems and matrix inversion (65F05) Factorization of matrices (15A23) Hermitian, skew-Hermitian, and related matrices (15B57) Analysis of algorithms and problem complexity (68Q25) Theory of matrix inversion and generalized inverses (15A09) Algorithms in computer science (68W99)
Cites work
- A view of three decades of linear filtering theory
- An Algorithm for the Inversion of Finite Toeplitz Matrices
- Design of two-dimensional semicasual recursive filters
- Displacement ranks of matrices and linear equations
- Half-plane Toeplitz systems
- Inverses of Toeplitz Operators, Innovations, and Orthogonal Polynomials
- On the fitting of multivariate autoregressions, and the approximate canonical factorization of a spectral density matrix
- Toeplitz Matrix Inversion: The Algorithm of W. F. Trench
Cited in
(6)- Two composition methods for solving certain systems of linear equations
- Parallel solution of symmetric positive definite systems with hyperbolic rotations
- Characterization of the partial autocorrelation function of nonstationary time series.
- From Bareiss' algorithm to the stable computation of partial correlations
- Maximum of entropy and extension of covariance matrices for periodically correlated and multivariate processes.
- Covariance decompositions via elementary transformations. Applications to filtering
This page was built for publication: A method of matrix inverse triangular decomposition based on contiguous principal submatrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1142008)