Divide-and-Conquer Solutions of Least-Squares Problems for Matrices with Displacement Structure
From MaRDI portal
Publication:5750341
DOI10.1137/0612010zbMath0718.65031OpenAlexW2041676904MaRDI QIDQ5750341
Publication date: 1991
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0612010
Schur algorithmdisplacement structureleast-squares solutionsblock-Toeplitz systemsdivide-and-conquer implementationToeplitz-block systems
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Complexity of multiplication with vectors for structured matrices, A fast, preconditioned conjugate gradient Toeplitz and Toeplitz-like solvers, Stability analysis of a general Toeplitz system solver, Parallel computation of polynomial GCD and some related parallel computations over abstract fields, A fast solver for linear systems with displacement structure, Generating correlated gaussian random fields by orthogonal polynomial approximations to the square root of the covariance matrix, Parallel solution of Toeplitzlike linear systems, Efficient parallel factorization and solution of structured and unstructured linear systems, Parallel output-sensitive algorithms for combinatorial and linear algebra problems, On Computations with Dense Structured Matrices, Product rules for the displacement of near-Toeplitz matrices
