This graduate-level text examines the practical use of iterative methods in solving large, sparse systems of linear algebraic equations and in resolving multidimensional boundary-value problems. Assuming minimal mathematical background, it profiles the relative merits of several general iterative procedures. Topics include polynomial acceleration of basic iterative methods, Chebyshev and conjugate gradient acceleration procedures applicable to partitioning the linear system into a “red/black” block form, adaptive computational algorithms for the successive overrelaxation (SOR) method, and computational aspects in the use of iterative algorithms for solving multidimensional problems. 1981 edition. 48 figures. 35 tables.
Unabridged republication of the edition published by Academic Press, Inc., San Diego, 1981.
|Availability||Usually ships in 24 to 48 hours|
|Author/Editor||Louis A. Hageman, David M. Young|
|Dimensions||5 3/8 x 8 1/2|