Classical iterative methods for sparse linear equations
12.1 Linear one-step stationary schemes
The theme of this chapter is iterative solution of the linear system
where A is a d × d real nonsingular matrix and The most general iterative method is a rule that for every k = 0, 1, . . . and generates a new vector In other words, ...