Fast Toeplitz Orthogonalization Using Inner Products

DOI10.1137/0908063zbMath0689.65022OpenAlexW153121462MaRDI QIDQ3031830

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

orthogonalizationToeplitz matricesorthogonal decompositionlinear predictionlattice algorithmsinverse QR factorization

Mathematics Subject Classification ID

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

Related Items (10)

A superfast method for solving Toeplitz linear least squares problems. ⋮ Hybrid algorithm for fast Toeplitz orthogonalization ⋮ Stability analysis of a general Toeplitz system solver ⋮ Least squares modifications with inverse factorizations: Parallel implications ⋮ Stability and inertia ⋮ 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 ⋮ Symbiosis between linear algebra and optimization ⋮ Fast iterative methods for least squares estimations

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