✦ LIBER ✦

Oppositely converging Newton–Raphson method for non-linear equilibrium problems

✍ Scribed by Isaac Fried

Publisher: John Wiley and Sons
Year: 2009
Tongue: English
Weight: 52 KB
Volume: 79
Category: Article
ISSN: 0029-5981
DOI: 10.1002/nme.2574

No coin nor oath required. For personal study only.

✦ Synopsis

Starting with p = 37 as an approximation to its highest root a = 36 we get successively x 1 -36 = 0.184×10 0 , 0.759×10 -2 , 0.137×10 -4 , 0.445×10 -10 , 0.0 x 2 -36 = -0.141×10 0 , -0.732×10 -2 , -0.137×10 -4 , -0.445×10 -10 , 0.0 (x 1 + x 2 )/2-36 = 0.212×10 -1 , 0.135×10 -3 , 0.934×10 -8 , 0.0 (13) REFERENCE 1. Householder AS.

📜 SIMILAR VOLUMES

Mesh-independent convergence of the modi

Mesh-independent convergence of the modified inexact Newton method for a second order non-linear problem

✍ T. Kim; J. E. Pasciak; P. S. Vassilevski 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 200 KB 👁 1 views

Indefinitely preconditioned inexact Newt

Indefinitely preconditioned inexact Newton method for large sparse equality constrained non-linear programming problems

✍ Ladislav Lukšan; Jan Vlček 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB 👁 2 views

An inexact Newton algorithm for large sparse equality constrained non-linear programming problems is proposed. This algorithm is based on an indefinitely preconditioned smoothed conjugate gradient method applied to the linear KKT system and uses a simple augmented Lagrangian merit function for Armij