A computational process for choosing the relaxation parameter in nonlinear SOR
From MaRDI portal
Publication:1069675
DOI10.1007/BF02252731zbMath0584.65038MaRDI QIDQ1069675
Publication date: 1986
Published in: Computing (Search for Journal in Brave)
convergence; Numerical examples; minimum of a strictly convex functional; nonlinear successive-overrelaxation
Related Items
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