Fast matrix factorizations via discrete transmission lines
From MaRDI portal
Publication:1082033
DOI10.1016/0024-3795(86)90178-3zbMath0602.65010OpenAlexW2002311180WikidataQ114215329 ScholiaQ114215329MaRDI QIDQ1082033
Publication date: 1986
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(86)90178-3
Schur algorithminversestriangular factorizationdiscrete transmission linesfast Cholesky algorithmLevinson algorithmssymmetric positive definite Toeplitz matricesToeplitz inversion formula
Factorization of matrices (15A23) Analytic circuit theory (94C05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Some spectral formulas for systems and transmission lines, Inversion and factorization of non-Hermitian quasi-Toeplitz matrices, Generalized Schur parameters and the effects of perturbations, On some properties of positive definite Toeplitz matrices and their possible applications, A constructive proof of the Gohberg-Semencul formula, Eigenvector computation for almost unitary Hessenberg matrices and inversion of Szegö-Vandermonde matrices via discrete transmission lines, Immittance- versus scattering-domain fast algorithms for non-Hermitian Toeplitz and quasi-Toeplitz matrices, Inverse scattering and minimal partial realizations, Maximum entropy and the moment problem, Transmutation for systems by spectral methods, Some matrix factorization identities for discrete inverse scattering
Cites Work
- Numerical solution of linear equations with Toeplitz and vector Toeplitz matrices
- The One-Dimensional Inverse Problem of Reflection Seismology
- Lattice filter parameterization and modeling of nonstationary processes
- Inverse Scattering for Discrete Transmission-Line Models
- Algorithms for Triangular Decomposition of Block Hankel and Toeplitz Matrices with Application to Factoring Positive Matrix Polynomials
- Unnamed Item
- Unnamed Item
- Unnamed Item
