Fast Toeplitz Orthogonalization Using Inner Products

DOI10.1137/0908063MaRDI QIDQ3031830zbMATH OpenOpenAlexFDO

Authors George Cybenko

Publication date 1987

Published in SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0908063

zbMATH Keywords

inverse QR factorizationlattice algorithmslinear predictionorthogonal decompositionorthogonalizationToeplitz matrices

Mathematics Subject Classification ID

Orthogonalization in numerical linear algebra (65F25) Method of lines for initial value and initial-boundary value problems involving PDEs (65M20)

Recommendations

• Fast block Toeplitz orthogonalization
• Hybrid algorithm for fast Toeplitz orthogonalization
• QR factorization of Toeplitz matrices
• Fast Inverse QR Factorization for Toeplitz Matrices
• A fast algorithm for \({\mathcal Q}{\mathcal R}^{-1}\) factorization of Toeplitz matrices

Cited in

(13)

• Hybrid algorithm for fast Toeplitz orthogonalization
• Least squares modifications with inverse factorizations: Parallel implications
• Fast orthogonal decomposition of rank deficient Toeplitz matrices
• Product rules for the displacement of near-Toeplitz matrices
• A total least squares method for Toeplitz systems of equations
• Fast iterative methods for least squares estimations
• Symbiosis between linear algebra and optimization
• A superfast method for solving Toeplitz linear least squares problems.
• Stability analysis of a general Toeplitz system solver
• Stability and inertia
• A General Orthogonalization Technique with Applications to Time Series Analysis and Signal Processing
• Householder Orthogonalization with a Nonstandard Inner Product
• The optimal causal linear predictor is not Turing computable

This page was built for publication: Fast Toeplitz Orthogonalization Using Inner Products

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3031830)