𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A modified secant Newton method for non-linear problems

✍ Scribed by L. Zhang; D.R.J. Owen

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
379 KB
Volume
15
Category
Article
ISSN
0045-7949

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Oppositely converging Newton–Raphson met
Oppositely converging Newton–Raphson method for non-linear equilibrium problems
✍ Isaac Fried πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 52 KB

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 (1

A modified perturbation method for treat
A modified perturbation method for treating non-linear oscillation problems
✍ G.L. Anderson πŸ“‚ Article πŸ“… 1975 πŸ› Elsevier Science 🌐 English βš– 571 KB

In this investigation a method that uses multiple time scales for the purpose of obtaining uniform asymptotic solutions of non-linear ordinary differential equations is modified through the introduction of a new small parameter, p, defined by p = e/(l + e), where c denotes the non-linearity paramete

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