A computational process for choosing the relaxation parameter in nonlinear SOR
From MaRDI portal
We present here a computational process which establishes the convergence of nonlinear successive-overrelaxation in finding the minimum of a strictly convex functional. The algorithm is designed in such a manner that the SOR parameter is computed approximately to guarantee convergence. Numerical examples are presented.
Recommendations
Cites work
- Iteration Methods for Nonlinear Problems
- Nonlinear successive over-relaxation
- Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method
- Numerical Solution of the Minimal Surface Equation
- On approximating extremals of functionals. II: Theory and generalizations related to boundary value problems for nonlinear differential equations
Cited in
(13)- Nonlinear successive over-relaxation
- Varying relaxation parameters in nonlinear successive overrelaxation
- On the extrapolation method and the USA algorithm
- A random direction algorithm for an intersection problem
- A practical choice of parameters in improved SOR-Newton method with orderings
- On nonlinear SOR-like methods. II: Convergence of the SOR-Newton method for mildly nonlinear equations
- Nonlinear SOR and mesh redistribution
- Nonlinear Kaczmarz algorithms and their convergence
- scientific article; zbMATH DE number 3907673 (Why is no real title available?)
- On maximum residual nonlinear Kaczmarz-type algorithms for large nonlinear systems of equations
- On pseudoinverse-free block maximum residual nonlinear Kaczmarz method for solving large-scale nonlinear system of equations
- Greedy randomized sampling nonlinear Kaczmarz methods
- Greedy capped nonlinear Kaczmarz methods
This page was built for publication: A computational process for choosing the relaxation parameter in nonlinear SOR
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1069675)
