Divide-and-Conquer Solutions of Least-Squares Problems for Matrices with Displacement Structure
From MaRDI portal
Recommendations
Cited in
(13)- Parallel solution of Toeplitzlike linear systems
- Product rules for the displacement of near-Toeplitz matrices
- Complexity of multiplication with vectors for structured matrices
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields
- A fast, preconditioned conjugate gradient Toeplitz and Toeplitz-like solvers
- Stability analysis of a general Toeplitz system solver
- Efficient parallel factorization and solution of structured and unstructured linear systems
- scientific article; zbMATH DE number 4143348 (Why is no real title available?)
- On Computations with Dense Structured Matrices
- Generating correlated gaussian random fields by orthogonal polynomial approximations to the square root of the covariance matrix
- Parallel output-sensitive algorithms for combinatorial and linear algebra problems
- A fast solver for linear systems with displacement structure
- Solving structured linear systems with large displacement rank
This page was built for publication: Divide-and-Conquer Solutions of Least-Squares Problems for Matrices with Displacement Structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5750341)