On the Complexity of the Preconditioned Conjugate Gradient Algorithm for Solving Toeplitz Systems with a Fisher--Hartwig Singularity
From MaRDI portal
(Redirected from Publication:5470482)
Recommendations
- scientific article; zbMATH DE number 1404624
- scientific article; zbMATH DE number 2097089
- Fast iterative methods for least squares estimations
- Which circulant preconditioner is better?
- Circulant Preconditioned Toeplitz Least Squares Iterations
- A note on superoptimal generalized circulant preconditioners
- An Optimal Circulant Preconditioner for Toeplitz Systems
- scientific article; zbMATH DE number 440685
- The best circulant preconditioners for Hermitian Toeplitz systems II: The multiple-zero case
- Fast computation of two-level circulant preconditioners
Cited in
(6)- On the asymptotics of all eigenvalues of Hermitian Toeplitz band matrices
- Orthogonal polynomials with respect to a class of Fisher-Hartwig symbols and inverse of Toeplitz matrices
- Convergence analysis of superoptimal PCG algorithm for Toeplitz systems with a Fisher-Hartwig singularity
- Superoptimal approximation for unbounded symbols
- Inside the eigenvalues of certain Hermitian Toeplitz band matrices
- Block band Toeplitz preconditioners derived from generating function approximations: analysis and applications
This page was built for publication: On the Complexity of the Preconditioned Conjugate Gradient Algorithm for Solving Toeplitz Systems with a Fisher--Hartwig Singularity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470482)