Abstract
The key idea of relaxation methods is to reduce, using some iterative process, the solution of some problems posed in a product space V = Π N i = 1 V i (minimization of functionals, solution of systems of equations and/or inequalities, etc.) to the solution of a sequence of subproblems of the same kind, but simpler, since they are posed in the V i .
In this chapter we follow Cea and Glowinski [1] and Glowinski [6].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Glowinski, R. (1984). Relaxation Methods and Applications. In: Numerical Methods for Nonlinear Variational Problems. Springer Series in Computational Physics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-12613-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-12613-4_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-12615-8
Online ISBN: 978-3-662-12613-4
eBook Packages: Springer Book Archive