1. Modified Newton Methods Lecture 9 Alessandra Nardi Thanks to Prof. Jacob White, Jaime Peraire, Michal Rewienski, and Karen Veroy

2. Last lecture review Solving nonlinear systems of equations –SPICE DC Analysis Newton’s Method –Derivation of Newton –Quadratic Convergence –Examples –Convergence Testing Multidimensonal Newton Method –Basic Algorithm –Quadratic convergence –Application to circuits

3. Multidimensional Newton Method Algorithm

4. If Then Newton’s method converges given a sufficiently close initial guess (and convergence is quadratic) Multidimensional Newton Method Convergence Local Convergence Theorem

5. Last lecture review Applying NR to the system of equations we find that at iteration k+1: –all the coefficients of KCL, KVL and of BCE of the linear elements remain unchanged with respect to iteration k –Nonlinear elements are represented by a linearization of BCE around iteration k  This system of equations can be interpreted as the STA of a linear circuit (companion network) whose elements are specified by the linearized BCE.

6. Note: G 0 and I d depend on the iteration count k  G 0 =G 0 (k) and I d =I d (k) Application of NR to Circuit Equations Companion Network – MNA templates

8. Modeling a MOSFET (MOS Level 1, linear regime) d

10. Last lecture review Multidimensional Case: each step of iteration implies solving a system of linear equations Linearizing the circuit leads to a matrix whose structure does not change from iteration to iteration: only the values of the companion circuits (the nonlinear elements) are changing.

11. DC Analysis Flow Diagram For each state variable in the system

12. Implications Device model equations must be continuous with continuous derivatives (not all models do this - - be sure models are decent - beware of user-supplied models) Watch out for floating nodes (If a node becomes disconnected, then J(x) is singular) Give good initial guess for x (0) Most model computations produce errors in function values and derivatives. Want to have convergence criteria || x (k+1) - x (k) || than model errors.

13. Improving convergence Improve Models (80% of problems) Improve Algorithms (20% of problems) Focus on new algorithms: Limiting Schemes Continuations Schemes

14. Outline Limiting Schemes –Direction Corrupting –Non corrupting (Damped Newton) Globally Convergent if Jacobian is Nonsingular Difficulty with Singular Jacobians Continuation Schemes –Source stepping –More General Continuation Scheme –Improving Efficiency Better first guess for each continuation step

15. Local Minimum Multidimensional Newton Method Convergence Problems – Local Minimum

16. f(x) X Must Somehow Limit the changes in X Multidimensional Newton Method Convergence Problems – Nearly singular

17. Multidimensional Newton Method Convergence Problems - Overflow f(x) X Must Somehow Limit the changes in X

18. Newton Method with Limiting

19. NonCorrupting Direction Corrupting Heuristics, No Guarantee of Global Convergence Newton Method with Limiting Limiting Methods

20. General Damping Scheme Key Idea: Line Search Method Performs a one-dimensional search in Newton Direction Newton Method with Limiting Damped Newton Scheme

21. If Then Every Step reduces F-- Global Convergence! Newton Method with Limiting Damped Newton – Convergence Theorem

22. Newton Method with Limiting Damped Newton – Nested Iteration

23. X Damped Newton Methods “push” iterates to local minimums Finds the points where Jacobian is Singular Newton Method with Limiting Damped Newton – Singular Jacobian Problem

24.  Starts the continuation  Ends the continuation  Hard to insure! Newton with Continuation schemes Basic Concepts - General setting Newton converges given a close initial guess  Idea: Generate a sequence of problems, s.t. a problem is a good initial guess for the following one

25. Newton with Continuation schemes Basic Concepts – Template Algorithm

26. Newton with Continuation schemes Basic Concepts – Source Stepping Example

27. +-+- VsVs R Diode Source Stepping Does Not Alter Jacobian Newton with Continuation schemes Basic Concepts – Source Stepping Example

28. Observations Problem is easy to solve and Jacobian definitely nonsingular. Back to the original problem and original Jacobian Newton with Continuation schemes Jacobian Altering Scheme

29. Newton with Continuation schemes Jacobian Altering Scheme – Basic Algorithm

30. 0 Have From last step’s Newton Better Guess for next step’s Newton Newton with Continuation schemes Jacobian Altering Scheme – Update Improvement

31. Easily Computed If Then Newton with Continuation schemes Jacobian Altering Scheme – Update Improvement

32. 0 1 Graphically Newton with Continuation schemes Jacobian Altering Scheme – Update Improvement

33. Summary Newton’s Method works fine: –given a close enough initial guess In case Newton does not converge: –Limiting Schemes Direction Corrupting Non corrupting (Damped Newton) –Globally Convergent if Jacobian is Nonsingular –Difficulty with Singular Jacobians –Continuation Schemes Source stepping More General Continuation Scheme Improving Efficiency –Better first guess for each continuation step