Preconditioned conjugate- and secant-Newton methods for non-linear problems
β Scribed by M. Papadrakakis; C. J. Gantes
- Publisher
- John Wiley and Sons
- Year
- 1989
- Tongue
- English
- Weight
- 878 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0029-5981
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
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
An algorithm is presented for the solution of the time dependent reaction-diffusion systems which arise in non-equilibrium radiation diffusion applications. This system of nonlinear equations is solved by coupling three numerical methods, Jacobian-free Newton-Krylov, operator splitting, and multigri