Relaxation Methods for Convex Problems
- 1 September 1968
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 5 (3), 601-612
- https://doi.org/10.1137/0705048
Abstract
Summary:In this paper an attempt is made to present a sudfficient general analysis of the convergence of modified relaxation methods for certain nonlinear problems in finite dimensional spaces. Many important results that have already been attained for linear problems are included here as special casesKeywords
This publication has 5 references indexed in Scilit:
- On the Numerical Solution of a Quasi-Linear Elliptic EquationJournal of the ACM, 1967
- Numerical solution of the minimal surface equationMathematics of Computation, 1967
- Nonlinear Difference Equations and Gauss-Seidel Type Iterative MethodsSIAM Journal on Numerical Analysis, 1966
- Iteration methods for nonlinear problemsTransactions of the American Mathematical Society, 1962
- Relaxation methods for linear equationsCommunications on Pure and Applied Mathematics, 1959