Extremal Polynomials with Application to Richardson Iteration for Indefinite Linear Systems
From MaRDI portal
Cited in
(20)- Richardson's iteration for nonsymmetric matrices
- On the application of orthogonal polynomials to the iterative solution of linear systems of equations with indefinite or non-Hermitian matrices
- Optimal designs for interpolation
- An optimum iterative method for solving any linear system with a square matrix
- Chebyshev polynomials for disjoint compact sets
- Adaptive polynomial preconditioning for Hermitian indefinite linear systems
- A hybrid iterative method for symmetric indefinite linear systems
- Iterative solution of linear systems in the 20th century
- An adaptive Richardson iteration method for indefinite linear systems
- Barycentric-Remez algorithms for best polynomial approximation in the chebfun system
- Tensor Equivalents for Solution of Linear Systems: A Parallel Algorithm
- Orthogonal Polynomials on Several Intervals Via a Polynomial Mapping
- GMRES-accelerated ADMM for quadratic objectives
- Finite-element-wise domain decomposition iterative solvers with polynomial preconditioning
- A Riemann-Hilbert approach to computing the inverse spectral map for measures supported on disjoint intervals
- Chebyshev Iteration
- The application of Leja points to Richardson iteration and polynomial preconditioning
- On polynomial preconditioning and asymptotic convergence factors for indefinite Hermitian matrices
- Computing interior eigenvalues of large matrices
- Optimal designs for multivariate interpolation
This page was built for publication: Extremal Polynomials with Application to Richardson Iteration for Indefinite Linear Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3932208)