Global convergence of nonlinear successive overrelaxation via linear theory

DOI10.1007/BF02242174zbMath0568.65034OpenAlexW201366673MaRDI QIDQ1060541

B. George

Publication date: 1985

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02242174

zbMATH Keywords

global convergenceiterative processminimum of a strictly convex functionalnonlinear successive overrelaxation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical computation of solutions to systems of equations (65H10)

Related Items (7)

Convergence of a two-stage Richardson process for nonlinear equations ⋮ On nonlinear SOR-like methods. II: Convergence of the SOR-Newton method for mildly nonlinear equations ⋮ On nonlinear SOR-like methods. III: Global convergence of SOR, SSOR and USSOR methods for convex problems ⋮ Nonlinear Kaczmarz algorithms and their convergence ⋮ Successive overrelaxation method with projection for finite element solutions of nonlinear radiation cooling problems ⋮ A practical choice of parameters in improved SOR-Newton method with orderings ⋮ Varying relaxation parameters in nonlinear successive overrelaxation

Cites Work

• A mixed problem for the Euler-Poisson-Darboux equation
• Nonlinear successive over-relaxation
• Iteration Methods for Nonlinear Problems
• Relaxation Methods for Convex Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Global convergence of nonlinear successive overrelaxation via linear theory