Eigenvectors of the Successive Over-Relaxation Process, and its Combination with Chebyshev Semi-Iteration
Author(s) -
Garry J. Tee
Publication year - 1963
Publication title -
the computer journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.319
H-Index - 64
eISSN - 1460-2067
pISSN - 0010-4620
DOI - 10.1093/comjnl/6.3.250
Subject(s) - chebyshev filter , eigenvalues and eigenvectors , chebyshev iteration , convergence (economics) , mathematics , chebyshev polynomials , process (computing) , relaxation (psychology) , iterative and incremental development , iterative method , mathematical proof , decomposition , mathematical optimization , algorithm , mathematical analysis , computer science , geometry , physics , psychology , social psychology , software engineering , ecology , quantum mechanics , economics , biology , economic growth , operating system
summary:In the paper, the system of $n$ linear algebraic equations $Ax=b$ with 2-cyclic matrix is considered. Methods are derived which converge to the solution $x$ faster than the optimal successive overrelaxation iterative method
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom