Menu
Home Explore People Places Arts History Plants & Animals Science Life & Culture Technology
On this page
Chebyshev iteration

In numerical linear algebra, the Chebyshev iteration is an iterative method for determining the solutions of a system of linear equations. The method is named after Russian mathematician Pafnuty Chebyshev.

Chebyshev iteration avoids the computation of inner products as is necessary for the other nonstationary methods. For some distributed-memory architectures these inner products are a bottleneck with respect to efficiency. The price one pays for avoiding inner products is that the method requires enough knowledge about spectrum of the coefficient matrix A, that is an upper estimate for the upper eigenvalue and lower estimate for the lower eigenvalue. There are modifications of the method for nonsymmetric matrices A.

We don't have any images related to Chebyshev iteration yet.
We don't have any YouTube videos related to Chebyshev iteration yet.
We don't have any PDF documents related to Chebyshev iteration yet.
We don't have any Books related to Chebyshev iteration yet.
We don't have any archived web articles related to Chebyshev iteration yet.

Example code in MATLAB

function [x] = SolChebyshev002(A, b, x0, iterNum, lMax, lMin) d = (lMax + lMin) / 2; c = (lMax - lMin) / 2; preCond = eye(size(A)); % Preconditioner x = x0; r = b - A * x; for i = 1:iterNum % size(A, 1) z = linsolve(preCond, r); if (i == 1) p = z; alpha = 1/d; else if (i == 2) beta = (1/2) * (c * alpha)^2 alpha = 1/(d - beta / alpha); p = z + beta * p; else beta = (c * alpha / 2)^2; alpha = 1/(d - beta / alpha); p = z + beta * p; end; x = x + alpha * p; r = b - A * x; %(= r - alpha * A * p) if (norm(r) < 1e-15), break; end; % stop if necessary end; end

Code translated from 1 and.2

See also

References

  1. Barrett, Richard; Michael, Berry; Tony, Chan; Demmel, James; Donato, June; Dongarra, Jack; Eijkhout, Victor; Pozo, Roldan; Romine, Charles; Van der Vorst, Henk (1994). Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods (2nd ed.). SIAM. http://www.netlib.org/linalg/html_templates/Templates.html

  2. Gutknecht, Martin; Röllin, Stefan (2002). "The Chebyshev iteration revisited". Parallel Computing. 28 (2): 263–283. doi:10.1016/S0167-8191(01)00139-9. hdl:20.500.11850/145926. /wiki/Doi_(identifier)