CSE 245: Computer Aided Circuit Simulation and Verification

Slides:



Advertisements
Similar presentations
Lecture 5 Newton-Raphson Method
Advertisements

Markov Decision Process
Modified Newton Methods Lecture 9 Alessandra Nardi Thanks to Prof. Jacob White, Jaime Peraire, Michal Rewienski, and Karen Veroy.
ECE 552 Numerical Circuit Analysis
CSE 245: Computer Aided Circuit Simulation and Verification Fall 2004, Nov Nonlinear Equation.
LECTURE 2.
1 EE 616 Computer Aided Analysis of Electronic Networks Lecture 5 Instructor: Dr. J. A. Starzyk, Professor School of EECS Ohio University Athens, OH,
Open Methods (Part 1) Fixed Point Iteration & Newton-Raphson Methods
Numerical Integration CSE245 Lecture Notes. Content Introduction Linear Multistep Formulae Local Error and The Order of Integration Time Domain Solution.
Solutions for Nonlinear Equations
1 EE 616 Computer Aided Analysis of Electronic Networks Lecture 12 Instructor: Dr. J. A. Starzyk, Professor School of EECS Ohio University Athens, OH,
EECS 42, Spring 2005Week 3a1 Announcements New topics: Mesh (loop) method of circuit analysis Superposition method of circuit analysis Equivalent circuit.
1 EE 616 Computer Aided Analysis of Electronic Networks Lecture 5 Instructor: Dr. J. A. Starzyk, Professor School of EECS Ohio University Athens, OH,
Systems of Non-Linear Equations
ECE 552 Numerical Circuit Analysis Chapter Six NONLINEAR DC ANALYSIS OR: Solution of Nonlinear Algebraic Equations Copyright © I. Hajj 2012 All rights.
Newton's Method for Functions of Several Variables
Roots of Equations Open Methods Second Term 05/06.
Differential Equations and Boundary Value Problems
Chapter 3 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 2 Roots of Equations Why? But.
Taylor Series.
Lecture Notes Dr. Rakhmad Arief Siregar Universiti Malaysia Perlis
ME451 Kinematics and Dynamics of Machine Systems Numerical Solution of DAE IVP Newmark Method November 1, 2013 Radu Serban University of Wisconsin-Madison.
Newton's Method for Functions of Several Variables Joe Castle & Megan Grywalski.
ECE 546 – Jose Schutt-Aine 1 ECE 546 Lecture -12 MNA and SPICE Spring 2014 Jose E. Schutt-Aine Electrical & Computer Engineering University of Illinois.
305221, Computer Electrical Circuit Analysis การวิเคราะห์วงจรไฟฟ้าทาง คอมพิวเตอร์ 3(2-3-6) ณรงค์ชัย มุ่งแฝงกลาง คมกริช มาเที่ยง สัปดาห์ที่ 3 Nodal.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 ~ Roots of Equations ~ Open Methods Chapter 6 Credit:
Numerical Methods.
Large Timestep Issues Lecture 12 Alessandra Nardi Thanks to Prof. Sangiovanni, Prof. Newton, Prof. White, Deepak Ramaswamy, Michal Rewienski, and Karen.
Circuits Theory Examples Newton-Raphson Method. Formula for one-dimensional case: Series of successive solutions: If the iteration process is converged,
The Power Flow Problem Scott Norr For EE 4501 April, 2015.
Direct Methods for Linear Systems Lecture 3 Alessandra Nardi Thanks to Prof. Jacob White, Suvranu De, Deepak Ramaswamy, Michal Rewienski, and Karen Veroy.
1 Chapter 7 Numerical Methods for the Solution of Systems of Equations.
Lecture 6 - Single Variable Problems & Systems of Equations CVEN 302 June 14, 2002.
Chapter 2-OPTIMIZATION G.Anuradha. Contents Derivative-based Optimization –Descent Methods –The Method of Steepest Descent –Classical Newton’s Method.
CHAPTER 3 Resistive Network Analysis. Figure Branch current formulation in nodal analysis.
SCHOOL OF ENGINEERING Introduction to Electrical and Electronic Engineering Part 2 Pr. Nazim Mir-Nasiri and Pr. Alexander Ruderman.
Chapter 6(b) Sinusoidal Steady State Analysis
CHAPTER 2: DC Circuit Analysis and AC Circuit Analysis
Non-linear Minimization
Boundary Element Analysis of Systems Using Interval Methods
Newton’s Method for Systems of Non Linear Equations
Announcements New topics: Mesh (loop) method of circuit analysis
CSE 245: Computer Aided Circuit Simulation and Verification
Computational Methods EML3041
Announcements New topics: Mesh (loop) method of circuit analysis
Read Chapters 5 and 6 of the textbook
CSE245: Computer-Aided Circuit Simulation and Verification
Solving Nonlinear Equation
Chapter 6.
Non-linear Least-Squares
CSE 245: Computer Aided Circuit Simulation and Verification
Chapter 27.
Computers in Civil Engineering 53:081 Spring 2003
Chapter 10. Numerical Solutions of Nonlinear Systems of Equations
Nonlinear regression.
Linear Algebra Lecture 3.
CSE245: Computer-Aided Circuit Simulation and Verification
6.5 Taylor Series Linearization
Section 4.8: Newton’s Method
Mathematical Solution of Non-linear equations : Newton Raphson method
C H A P T E R 3 Resistive Network Analysis.
Some Comments on Root finding
Some iterative methods free from second derivatives for nonlinear equation Muhammad Aslam Noor Dept. of Mathematics, COMSATS Institute of Information Technology,
Chapter 6.
1 Newton’s Method.
Circuit w/ Dependent Source Example
EE 616 Computer Aided Analysis of Electronic Networks Lecture 12
Pivoting, Perturbation Analysis, Scaling and Equilibration
ECE 4991 Electrical and Electronic Circuits Chapter 3
Presentation transcript:

CSE 245: Computer Aided Circuit Simulation and Verification Nonlinear Equation

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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