On Block Relaxation Techniques

dc.contributor.author	Boley, D.	en_US
dc.contributor.author	Buzbee, B.L.	en_US
dc.contributor.author	Parter, Seymour	en_US
dc.date.accessioned	2012-03-15T16:28:17Z
dc.date.available	2012-03-15T16:28:17Z
dc.date.created	1978	en_US
dc.date.issued	1978
dc.identifier.citation	TR318
dc.identifier.uri	http://digital.library.wisc.edu/1793/58078
dc.description.abstract	In connection with efforts to utilize the CRAY-1 computer efficiently, we present some methods of analysis of rates of convergence for block iterative methods applied to the model problem. One of the more interesting methods involves relaxing on 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.	en_US
dc.format.mimetype	application/pdf	en_US
dc.publisher	University of Wisconsin-Madison Department of Computer Sciences	en_US
dc.title	On Block Relaxation Techniques	en_US
dc.type	Technical Report	en_US

CS Technical Reports
Technical Reports Archive for the Department of Computer Sciences at the University of Wisconsin-Madison