Computing Methods, Volume 2Computing Methods, Volume I generalizes and details the methods involved in computer mathematics. The book has been developed in two volumes; Volume I contains Chapters 1 to 5, and Volume II encompasses Chapters 6 to 10. |
From inside the book
Results 1-3 of 90
Page 58
... convergence of simple iteration and Seidel iteration only intersect . This means that matrices do exist for which the Seidel method will converge whereas simple iteration does not , and vice versa . It is a simple matter to show that ...
... convergence of simple iteration and Seidel iteration only intersect . This means that matrices do exist for which the Seidel method will converge whereas simple iteration does not , and vice versa . It is a simple matter to show that ...
Page 567
... converge to the exact solution of the boundary value problem in the differential equation . It is , therefore , adequate to establish the " correctness " of a difference scheme to prove its convergence . This follows from the theorem ...
... converge to the exact solution of the boundary value problem in the differential equation . It is , therefore , adequate to establish the " correctness " of a difference scheme to prove its convergence . This follows from the theorem ...
Page 676
... convergence for sets of linear algebraic equations 256 Aitken's 2 process 262 best choice of polynomial 258 conditions of convergence Kantorovich's variational method 630 König's thoerem on high - order itera- tion 145 Krylov's method ...
... convergence for sets of linear algebraic equations 256 Aitken's 2 process 262 best choice of polynomial 258 conditions of convergence Kantorovich's variational method 630 König's thoerem on high - order itera- tion 145 Krylov's method ...
Contents
The Squareroot Method | 16 |
Conjugate Gradients | 23 |
Partitioning into SubMatrices | 34 |
Copyright | |
42 other sections not shown
Other editions - View all
Common terms and phrases
a₁ absolute magnitude approximate solution arbitrary b₁ boundary conditions boundary nodes boundary value problem C₁ C₂ calculations Cauchy problem characteristic polynomial coefficients column consider constant convergence corresponding defined derivatives difference equation difference scheme differential equations Dirichlet problem dx dy eigenvalues eigenvectors elements equal error estimate exact solution find the solution formula Goursat problem inequality initial conditions initial vector integral equation internal nodes interval iteration J²u K(xn k₁ linear algebraic linear algebraic equations matrix mesh method method of solving multiplied norm obtained operator orthogonal Poisson's equation presupposed real roots region G right-hand side sequence set of equations set of linear straight line Substituting Suppose we put symmetric Taylor formula theorem U₁ vector x₁ y₁ zero ду дх მყ