Extremal Polynomials with Application to Richardson Iteration for Indefinite Linear Systems
From MaRDI portal
Publication:3932208
DOI10.1137/0903004zbMath0476.65021OpenAlexW2076483112MaRDI QIDQ3932208
Publication date: 1982
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/e851ac3acc987b4075e79d29ac7a25ccc4f8eb85
Chebyshev polynomialsymmetric indefiniteRichardson iterationbest polynomial approximantnorm calculation for linear functionalRemes, norm preserving extension
Related Items (18)
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 ⋮ GMRES-Accelerated ADMM for Quadratic Objectives ⋮ Barycentric-Remez algorithms for best polynomial approximation in the chebfun system ⋮ An adaptive Richardson iteration method for indefinite linear systems ⋮ Tensor Equivalents for Solution of Linear Systems: A Parallel Algorithm ⋮ Optimal designs for multivariate interpolation ⋮ Finite-element-wise domain decomposition iterative solvers with polynomial preconditioning ⋮ Chebyshev polynomials for disjoint compact sets ⋮ Adaptive polynomial preconditioning for Hermitian indefinite linear systems ⋮ Orthogonal Polynomials on Several Intervals Via a Polynomial Mapping ⋮ A hybrid iterative method for symmetric indefinite linear systems ⋮ Iterative solution of linear systems in the 20th century ⋮ Richardson's iteration for nonsymmetric matrices ⋮ 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
This page was built for publication: Extremal Polynomials with Application to Richardson Iteration for Indefinite Linear Systems
