On Block Relaxation Techniques.
Abstract
In connection with efforts to utilize the CRAY-1 computer efficiently, some methods of analysis of rates of convergence for block iterative methods applied to the model problem are presented. One of the more interesting methods involves relaxing an p x p blocks of points. A Cholesky decomposition is used for that smaller problem. One of the basic methods of analysis is a modification of a method discussed earlier by Parter. This analysis easily extends to more general second order elliptic problems. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 1978
- Accession Number
- ADA056749
Entities
People
- B. L. Buzbee
- D. Boley
- S. V. Parter
Organizations
- University of Wisconsin Madison Department of Computer Science