CSE245:Lecture12 Advisor: C.K. Cheng Date: 02/13/03.

Slides:



Advertisements
Similar presentations
#1 Factor Each (to prime factors): #2 #3 #4 Solve:
Advertisements

Solving Equations = 4x – 5(6x – 10) -132 = 4x – 30x = -26x = -26x 7 = x.
CSE245: Computer-Aided Circuit Simulation and Verification Lecture Note 5 Numerical Integration Prof. Chung-Kuan Cheng 1.
Ordinary Differential Equations
1cs542g-term Notes  Even if you’re not registered (not handing in assignment 1) send me an to be added to a class list.
CSE245: Computer-Aided Circuit Simulation and Verification Lecture Note 2: State Equations Prof. Chung-Kuan Cheng 1.
CSE245: Computer-Aided Circuit Simulation and Verification Lecture Note 5 Numerical Integration Spring 2010 Prof. Chung-Kuan Cheng 1.
1 EE 616 Computer Aided Analysis of Electronic Networks Lecture 12 Instructor: Dr. J. A. Starzyk, Professor School of EECS Ohio University Athens, OH,
CSE245:Lec4 02/24/2003. Integration Method Problem formulation.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 32 Ordinary Differential Equations.
Numerical Integration CSE245 Lecture Notes. Content Introduction Linear Multistep Formulae Local Error and The Order of Integration Time Domain Solution.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 31 Ordinary Differential Equations.
Lecture on Stiff Systems (Section 1-6 of Chua and Lin) ECE 546 Jan. 15, 2008.
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,
UCSD CSE245 Notes -- Spring 2006 CSE245: Computer-Aided Circuit Simulation and Verification Lecture Notes Spring 2006 Prof. Chung-Kuan Cheng.
Multistep methods previous methods use information at xi to predict yi+1 multistep methods use information from xi-1, xi-2, etc. leads to better results.
Technical Question Technical Question
Row Reduction and Echelon Forms (9/9/05) A matrix is in echelon form if: All nonzero rows are above any all-zero rows. Each leading entry of a row is in.
Adaptive Runge-Kutta addresses the problem of functions that change rapidly at a point.
Capstone Final Presentation Spring 2003 Thin Film flow.
Chapter 16 Integration of Ordinary Differential Equations.
CISE301_Topic8L31 SE301: Numerical Methods Topic 8 Ordinary Differential Equations (ODEs) Lecture KFUPM (Term 101) Section 04 Read , 26-2,
1Chapter 2. 2 Example 3Chapter 2 4 EXAMPLE 5Chapter 2.
Ordinary Differential Equations (ODEs)
Numerical Solution of Ordinary Differential Equation
MATH 685/ CSI 700/ OR 682 Lecture Notes Lecture 10. Ordinary differential equations. Initial value problems.
1 Chapter 6 Numerical Methods for Ordinary Differential Equations.
Numerical Solutions to ODEs Nancy Griffeth January 14, 2014 Funding for this workshop was provided by the program “Computational Modeling and Analysis.
First Order Linear Equations Integrating Factors.
Boyce/DiPrima 9th ed, Ch 8.4: Multistep Methods Elementary Differential Equations and Boundary Value Problems, 9th edition, by William E. Boyce and Richard.
CSE245: Computer-Aided Circuit Simulation and Verification Lecture Note 2: State Equations Prof. Chung-Kuan Cheng.
Modeling and simulation of systems Numerical methods for solving of differential equations Slovak University of Technology Faculty of Material Science.
The Rational Root Theorem The Rational Root Theorem gives us a tool to predict the Values of Rational Roots:
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. ~ Ordinary Differential Equations ~ Stiffness and Multistep.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 261 Stiffness.
3.1 Solving equations by Graphing System of equations Consistent vs. Inconsistent Independent vs. Dependent.
3.1 You should be able to solve one-step equations using algebra. Solve for x.
Scientific Computing Multi-Step and Predictor-Corrector 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,
2.3 – Solving Multi-Step Equations. Note: REVERSE Order of Operations! Ex. 1 -7(p + 8) = 21.
1 EE 616 Computer Aided Analysis of Electronic Networks Lecture 12 Instructor: Dr. J. A. Starzyk, Professor School of EECS Ohio University Athens, OH,
Announcements Read Chapters 11 and 12 (sections 12.1 to 12.3)
CSE245: Computer-Aided Circuit Simulation and Verification Lecture Note 2: State Equations Spring 2010 Prof. Chung-Kuan Cheng.
Lecture 40 Numerical Analysis. Chapter 7 Ordinary Differential Equations.
Solving Multi-Step Equations Using Inverse Operations.
1/14  5.2 Euler’s Method Compute the approximations of y(t) at a set of ( usually equally-spaced ) mesh points a = t 0 < t 1
14 - finite element method
2.3 solving multi-step equations. Review combining like terms Term-- the individual item(s) being added or subtracted. Example: 3x + 5x Example: 5y –
CISE301_Topic8L71 CISE301: Numerical Methods Topic 8 Ordinary Differential Equations (ODEs) Lecture KFUPM (Term 101) Section 04 Read , 26-2,
Solving Ordinary Differential Equations
Lecture 11 Alessandra Nardi
Notes Over 9.6 An Equation with One Solution
CSE245: Computer-Aided Circuit Simulation and Verification
Solve the equation for x. {image}
CSE 245: Computer Aided Circuit Simulation and Verification
CSE245: Computer-Aided Circuit Simulation and Verification
Finding A Better Final Discretized Equation
Chapter 26.
Molarity (cont.).
Standardized Test Practice
CSE245: Computer-Aided Circuit Simulation and Verification
ECE 576 POWER SYSTEM DYNAMICS AND STABILITY
Standardized Test Practice
Solve the equation: 6 x - 2 = 7 x + 7 Select the correct answer.
How many groups are there?
Physics 319 Classical Mechanics
EE 616 Computer Aided Analysis of Electronic Networks Lecture 12
Presentation transcript:

CSE245:Lecture12 Advisor: C.K. Cheng Date: 02/13/03

Prediction and Correction Predictor-corrector method: Apply to solve implicit integration methods as backward Euler, trapezoidal Step1: prediction, predict an initial value by Forward Euler

Prediction and Correction (cont) Step2: correction iteratively,use x n i to get x n i+1 using Backward Euler or Trapezoidal If the method converges, the solution is

Stiff Function A stiff function:

Stiff Function (cont) To see the effect of the second item, the stepsize should be small as: Stiff function happens in: Interconnect network Modulator PLL (phase lock loop)

Conservation of Charges Two way to write nodal equations: (1) (2) The law of charge conservation: (3) (4)

Conservation of Charges (cont) Example: Apply Forward Euler method to (1) and (2) Apply Forward Euler method to (2), then charge is not conserved

Example (cont) Apply Forward Euler method to (1), then charge is conserved Theorem: Any consistent multistep method conserves charge when applied to (1)