ABSTRACT
An easily coded iterative routine is described which approximates the solution of a wide class of simultaneous linear algebraic equations by a succession of simple matrix multiplications.
The problem of finding the solution of the matrix equation
- 1.D.A.Flanders and G. Shortley, Journ. of Appl. Physics, 21, 1326-1332, (1950)Google ScholarCross Ref
- 2.S. Gersgorin, Izv. Akad. Nauk SSBR, 7, 672-675, (1931)Google Scholar
- 3.E. Jahnke and F. Emde, Tables of Functions, (American Dover Publications, New York, 1945)Google Scholar
- 4.G. Szego, Orthogonal Polynomials (Amer. Math. Soc., New York City, 1939)Google Scholar
- 5.E. T. Whittaker and G. N. Watson, Modern Analysis, 4th ed., (Cambridge University Press, 1935)Google Scholar
- 6.Tables of Chebyshev Polynomials Sn(X) and Cn (x), Applied Math. Series 9, U.S. Dept. of Commerce, NBS,(1952)Google Scholar
- 7.C. Lanczos, Journ. of Research, 49, 33-53, (1952)Google Scholar
Index Terms
- Chebyshev polynomials in the solution of large-scale linear systems
Recommendations
Parallel solution of large symmetric tridiagonal linear systems
We present a matrix factorization called WZ factorization for the solution of symmetric tridiagonal linear systems. When combined with partitioning scheme, it renders a divide and conquer algorithm. Existence theorems are presented and backward error ...
On Chebyshev Polynomials of Matrices
The $m$th Chebyshev polynomial of a square matrix $A$ is the monic polynomial that minimizes the matrix 2-norm of $p(A)$ over all monic polynomials $p(z)$ of degree $m$. This polynomial is uniquely defined if $m$ is less than the degree of the minimal ...
Chebyshev solution of large linear systems
The general problem considered is that of solving a linear system of equations which is singular or almost singular. A method is described which obtains a ''solution'' to the system which is stable with respect to small changes in the matrix elements. ...
Comments