Presentation is loading. Please wait.

Presentation is loading. Please wait.

CSE 245: Computer Aided Circuit Simulation and Verification

Similar presentations


Presentation on theme: "CSE 245: Computer Aided Circuit Simulation and Verification"— Presentation transcript:

1 CSE 245: Computer Aided Circuit Simulation and Verification
Nonlinear Equation

2 courtesy Alessandra Nardi UCB
Outline Nonlinear problems Iterative Methods Newton’s Method Derivation of Newton Quadratic Convergence Examples Convergence Testing Multidimensonal Newton Method Basic Algorithm Quadratic convergence Application to circuits Improve Convergence Limiting Schemes Direction Corrupting Non corrupting (Damped Newton) Continuation Schemes Source stepping May 19, 2018 courtesy Alessandra Nardi UCB

3 courtesy Alessandra Nardi UCB
Nonlinear Problems - Example 1 Ir I1 Id Need to Solve May 19, 2018 courtesy Alessandra Nardi UCB

4 courtesy Alessandra Nardi UCB
Nonlinear Equations Given g(V)=I It can be expressed as: f(V)=g(V)-I  Solve g(V)=I equivalent to solve f(V)=0 Hard to find analytical solution for f(x)=0 Solve iteratively May 19, 2018 courtesy Alessandra Nardi UCB

5 Nonlinear Equations – Iterative Methods
Start from an initial value x0 Generate a sequence of iterate xn-1, xn, xn+1 which hopefully converges to the solution x* Iterates are generated according to an iteration function F: xn+1=F(xn) Ask When does it converge to correct solution ? What is the convergence rate ? May 19, 2018 courtesy Alessandra Nardi UCB

6 Newton-Raphson (NR) Method
Consists of linearizing the system. Want to solve f(x)=0  Replace f(x) with its linearized version and solve. Note: at each step need to evaluate f and f’ May 19, 2018 courtesy Alessandra Nardi UCB

7 Newton-Raphson Method – Graphical View
May 19, 2018 courtesy Alessandra Nardi UCB

8 Newton-Raphson Method – Algorithm
Define iteration Do k = 0 to …. until convergence How about convergence? An iteration {x(k)} is said to converge with order q if there exists a vector norm such that for each k  N: May 19, 2018 courtesy Alessandra Nardi UCB

9 courtesy Alessandra Nardi UCB
Newton-Raphson Method – Convergence Mean Value theorem truncates Taylor series But by Newton definition May 19, 2018 courtesy Alessandra Nardi UCB

10 courtesy Alessandra Nardi UCB
Newton-Raphson Method – Convergence Subtracting Dividing through Convergence is quadratic May 19, 2018 courtesy Alessandra Nardi UCB

11 courtesy Alessandra Nardi UCB
Newton-Raphson Method – Convergence Local Convergence Theorem If Then Newton’s method converges given a sufficiently close initial guess (and convergence is quadratic) May 19, 2018 courtesy Alessandra Nardi UCB

12 courtesy Alessandra Nardi UCB
Newton-Raphson Method – Convergence Example 1 Convergence is quadratic May 19, 2018 courtesy Alessandra Nardi UCB

13 courtesy Alessandra Nardi UCB
Newton-Raphson Method – Convergence Example 2 Note : not bounded away from zero Convergence is linear May 19, 2018 courtesy Alessandra Nardi UCB

14 courtesy Alessandra Nardi UCB
Newton-Raphson Method – Convergence Example 1,2 May 19, 2018 courtesy Alessandra Nardi UCB

15 courtesy Alessandra Nardi UCB
Newton-Raphson Method – Convergence May 19, 2018 courtesy Alessandra Nardi UCB

16 courtesy Alessandra Nardi UCB
Newton-Raphson Method – Convergence Convergence Check f(x) X May 19, 2018 courtesy Alessandra Nardi UCB

17 courtesy Alessandra Nardi UCB
Newton-Raphson Method – Convergence Convergence Check X f(x) May 19, 2018 courtesy Alessandra Nardi UCB

18 courtesy Alessandra Nardi UCB
Newton-Raphson Method – Convergence demo2 May 19, 2018 courtesy Alessandra Nardi UCB

19 courtesy Alessandra Nardi UCB
Newton-Raphson Method – Convergence Local Convergence Convergence Depends on a Good Initial Guess f(x) X May 19, 2018 courtesy Alessandra Nardi UCB

20 courtesy Alessandra Nardi UCB
Newton-Raphson Method – Convergence Local Convergence Convergence Depends on a Good Initial Guess May 19, 2018 courtesy Alessandra Nardi UCB

21 Nonlinear Problems – Multidimensional Example
Nodal Analysis + - + + - - Nonlinear Resistors Two coupled nonlinear equations in two unknowns May 19, 2018 courtesy Alessandra Nardi UCB

22 courtesy Alessandra Nardi UCB
Outline Nonlinear problems Iterative Methods Newton’s Method Derivation of Newton Quadratic Convergence Examples Convergence Testing Multidimensonal Newton Method Basic Algorithm Quadratic convergence Application to circuits Improve Convergence Limiting Schemes Direction Corrupting Non corrupting (Damped Newton) Continuation Schemes Source stepping May 19, 2018 courtesy Alessandra Nardi UCB

23 courtesy Alessandra Nardi UCB
Multidimensional Newton Method May 19, 2018 courtesy Alessandra Nardi UCB

24 courtesy Alessandra Nardi UCB
Multidimensional Newton Method Computational Aspects Each iteration requires: Evaluation of F(xk) Computation of J(xk) Solution of a linear system of algebraic equations whose coefficient matrix is J(xk) and whose RHS is -F(xk) May 19, 2018 courtesy Alessandra Nardi UCB

25 courtesy Alessandra Nardi UCB
Multidimensional Newton Method Algorithm May 19, 2018 courtesy Alessandra Nardi UCB

26 courtesy Alessandra Nardi UCB
Multidimensional Newton Method Convergence Local Convergence Theorem If Then Newton’s method converges given a sufficiently close initial guess (and convergence is quadratic) May 19, 2018 courtesy Alessandra Nardi UCB

27 Application of NR to Circuit Equations
Companion Network 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. May 19, 2018 courtesy Alessandra Nardi UCB

28 Application of NR to Circuit Equations
Companion Network General procedure: the NR method applied to a nonlinear circuit whose eqns are formulated in the STA form produces at each iteration the STA eqns of a linear resistive circuit obtained by linearizing the BCE of the nonlinear elements and leaving all the other BCE unmodified After the linear circuit is produced, there is no need to stick to STA, but other methods (such as MNA) may be used to assemble the circuit eqns May 19, 2018 courtesy Alessandra Nardi UCB

29 Application of NR to Circuit Equations
Companion Network – MNA templates Note: G0 and Id depend on the iteration count k  G0=G0(k) and Id=Id(k) May 19, 2018 courtesy Alessandra Nardi UCB

30 Application of NR to Circuit Equations
Companion Network – MNA templates May 19, 2018 courtesy Alessandra Nardi UCB

31 Modeling a MOSFET (MOS Level 1, linear regime)
May 19, 2018 courtesy Alessandra Nardi UCB

32 Modeling a MOSFET (MOS Level 1, linear regime)
May 19, 2018 courtesy Alessandra Nardi UCB

33 DC Analysis Flow Diagram
For each state variable in the system May 19, 2018 courtesy Alessandra Nardi UCB

34 courtesy Alessandra Nardi UCB
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) || <  such that  > than model errors. May 19, 2018 courtesy Alessandra Nardi UCB

35 courtesy Alessandra Nardi UCB
Outline Nonlinear problems Iterative Methods Newton’s Method Derivation of Newton Quadratic Convergence Examples Convergence Testing Multidimensonal Newton Method Basic Algorithm Quadratic convergence Application to circuits Improve Convergence Limiting Schemes Direction Corrupting Non corrupting (Damped Newton) Continuation Schemes Source stepping May 19, 2018 courtesy Alessandra Nardi UCB

36 Improving convergence
Improve Models (80% of problems) Improve Algorithms (20% of problems) Focus on new algorithms: Limiting Schemes Continuations Schemes May 19, 2018 courtesy Alessandra Nardi UCB

37 courtesy Alessandra Nardi UCB
Improve Convergence Limiting Schemes Direction Corrupting Non corrupting (Damped Newton) Globally Convergent if Jacobian is Nonsingular Difficulty with Singular Jacobians Continuation Schemes Source stepping May 19, 2018 courtesy Alessandra Nardi UCB

38 courtesy Alessandra Nardi UCB
Multidimensional Newton Method Convergence Problems – Local Minimum Local Minimum May 19, 2018 courtesy Alessandra Nardi UCB

39 courtesy Alessandra Nardi UCB
Multidimensional Newton Method Convergence Problems – Nearly singular f(x) X Must Somehow Limit the changes in X May 19, 2018 courtesy Alessandra Nardi UCB

40 Multidimensional Newton Method
Convergence Problems - Overflow f(x) X Must Somehow Limit the changes in X May 19, 2018 courtesy Alessandra Nardi UCB

41 courtesy Alessandra Nardi UCB
Newton Method with Limiting May 19, 2018 courtesy Alessandra Nardi UCB

42 courtesy Alessandra Nardi UCB
Newton Method with Limiting Limiting Methods Direction Corrupting NonCorrupting Heuristics, No Guarantee of Global Convergence May 19, 2018 courtesy Alessandra Nardi UCB

43 Newton Method with Limiting
Damped Newton Scheme General Damping Scheme Key Idea: Line Search Method Performs a one-dimensional search in Newton Direction May 19, 2018 courtesy Alessandra Nardi UCB

44 courtesy Alessandra Nardi UCB
Newton Method with Limiting Damped Newton – Convergence Theorem If Then Every Step reduces F-- Global Convergence! May 19, 2018 courtesy Alessandra Nardi UCB

45 courtesy Alessandra Nardi UCB
Newton Method with Limiting Damped Newton – Nested Iteration May 19, 2018 courtesy Alessandra Nardi UCB

46 Newton Method with Limiting
Damped Newton – Singular Jacobian Problem X Damped Newton Methods “push” iterates to local minimums Finds the points where Jacobian is Singular May 19, 2018 courtesy Alessandra Nardi UCB

47 courtesy Alessandra Nardi UCB
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  Starts the continuation Ends the continuation Hard to insure! May 19, 2018 courtesy Alessandra Nardi UCB

48 courtesy Alessandra Nardi UCB
Newton with Continuation schemes Basic Concepts – Template Algorithm May 19, 2018 courtesy Alessandra Nardi UCB

49 courtesy Alessandra Nardi UCB
Newton with Continuation schemes Basic Concepts – Source Stepping Example May 19, 2018 courtesy Alessandra Nardi UCB

50 courtesy Alessandra Nardi UCB
Newton with Continuation schemes Basic Concepts – Source Stepping Example R Vs + - Diode Source Stepping Does Not Alter Jacobian May 19, 2018 courtesy Alessandra Nardi UCB

51 Transient Analysis Flow Diagram
Predict values of variables at tl Replace C and L with resistive elements via integration formula Replace nonlinear elements with G and indep. sources via NR Assemble linear circuit equations Solve linear circuit equations NO Did NR converge? YES Test solution accuracy Save solution if acceptable Select new Dt and compute new integration formula coeff. NO Done? May 19, 2018 courtesy Alessandra Nardi UCB


Download ppt "CSE 245: Computer Aided Circuit Simulation and Verification"

Similar presentations


Ads by Google