Overview Class #2 (Jan 16) Brief introduction to time-stepping ODEs

Slides:



Advertisements
Similar presentations
Formal Computational Skills
Advertisements

Computational Modeling for Engineering MECN 6040
CSE245: Computer-Aided Circuit Simulation and Verification Lecture Note 5 Numerical Integration Prof. Chung-Kuan Cheng 1.
Ordinary Differential Equations
ME751 Advanced Computational Multibody Dynamics
1cs542g-term Notes. 2 Solving Nonlinear Systems  Most thoroughly explored in the context of optimization  For systems arising in implicit time.
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 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,
1 EE 616 Computer Aided Analysis of Electronic Networks Lecture 12 Instructor: Dr. J. A. Starzyk, Professor School of EECS Ohio University Athens, OH,
Efficient Simulation of Physical System Models Using Inlined Implicit Runge-Kutta Algorithms Vicha Treeaporn Department of Electrical & Computer Engineering.
Ordinary Differential Equations (ODEs) 1Daniel Baur / Numerical Methods for Chemical Engineers / Implicit ODE Solvers Daniel Baur ETH Zurich, Institut.
Homework Homework Assignment #19 Read Section 9.3 Page 521, Exercises: 1 – 41(EOO) Quiz next time Rogawski Calculus Copyright © 2008 W. H. Freeman and.
Ordinary Differential Equations (ODEs)
Ordinary Differential Equations (ODEs) 1Daniel Baur / Numerical Methods for Chemical Engineers / Implicit ODE Solvers Daniel Baur ETH Zurich, Institut.
Ordinary Differential Equations (ODEs) 1Daniel Baur / Numerical Methods for Chemical Engineers / Explicit ODE Solvers Daniel Baur ETH Zurich, Institut.
Numerical Solutions to ODEs Nancy Griffeth January 14, 2014 Funding for this workshop was provided by the program “Computational Modeling and Analysis.
Lecture 35 Numerical Analysis. Chapter 7 Ordinary Differential Equations.
ME451 Kinematics and Dynamics of Machine Systems
ME451 Kinematics and Dynamics of Machine Systems Numerical Solution of DAE IVP Newmark Method November 1, 2013 Radu Serban University of Wisconsin-Madison.
Computational Methods in Physics PHYS 3437 Dr Rob Thacker Dept of Astronomy & Physics (MM-301C)
Large Steps in Cloth Simulation - SIGGRAPH 98 박 강 수박 강 수.
Integration of 3-body encounter. Figure taken from
Workshop on Stochastic Differential Equations and Statistical Inference for Markov Processes Day 3: Numerical Methods for Stochastic Differential.
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.
7. Introduction to the numerical integration of PDE. As an example, we consider the following PDE with one variable; Finite difference method is one of.
+ Numerical Integration Techniques A Brief Introduction By Kai Zhao January, 2011.
Pure Elastic 2D Beam Bending Using Numerical Methods
Finite Difference Methods Definitions. Finite Difference Methods Approximate derivatives ** difference between exact derivative and its approximation.
MECN 3500 Inter - Bayamon Lecture 9 Numerical Methods for Engineering MECN 3500 Professor: Dr. Omar E. Meza Castillo
Large Timestep Issues Lecture 12 Alessandra Nardi Thanks to Prof. Sangiovanni, Prof. Newton, Prof. White, Deepak Ramaswamy, Michal Rewienski, and Karen.
© Imperial College London Numerical Solution of Differential Equations 3 rd year JMC group project ● Summer Term 2004 Supervisor: Prof. Jeff Cash Saeed.
Circuits Theory Examples Newton-Raphson Method. Formula for one-dimensional case: Series of successive solutions: If the iteration process is converged,
Introduction to the Runge-Kutta algorithm for approximating derivatives PHYS 361 Spring, 2011.
1 EE 616 Computer Aided Analysis of Electronic Networks Lecture 12 Instructor: Dr. J. A. Starzyk, Professor School of EECS Ohio University Athens, OH,
Particle Systems. Applications Particle systems are broadly defined for: Explosion Cloth Fluid And more… It is integrated into many animation software,
Ordinary Differential Equations
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
Lecture 39 Numerical Analysis. Chapter 7 Ordinary Differential Equations.
Skeletal Integrals Chapter 3, section 4.1 – 4.4 Rohit Saboo.
INTEGRATOR CLASSIFICATION & CHARACTERISTICS
Dynamic Systems: Ordinary Differential Equations
Lecture 11 Alessandra Nardi
Ordinary Differential Equations
CHAPTER 2 - EXPLICIT TRANSIENT DYNAMIC ANALYSYS
Numerical Methods by Dr. Laila Fouad.
ECE 576 – Power System Dynamics and Stability
CSE245: Computer-Aided Circuit Simulation and Verification
Class Notes 19: Numerical Methods (2/2)
Chapter 23.
CSE 245: Computer Aided Circuit Simulation and Verification
Sec:25.3 RUNGE-KUTTA METHODS.
Ordinary differential equaltions:
Chapter 26.
Try Lam 25 April 2007 Aerospace and Mechanical Engineering
Sec 21: Analysis of the Euler Method
MATH 175: NUMERICAL ANALYSIS II
CSE245: Computer-Aided Circuit Simulation and Verification
Sec:5.4 RUNGE-KUTTA METHODS.
5.3 Higher-Order Taylor Methods
MATH 175: NUMERICAL ANALYSIS II
Numerical Analysis Lecture 2.
Introduction to Ordinary Differential Equations
Ch5 Initial-Value Problems for ODE
MATH 175: NUMERICAL ANALYSIS II
Charged particle in an electrostatic field
EE 616 Computer Aided Analysis of Electronic Networks Lecture 12
Modeling and Simulation: Exploring Dynamic System Behaviour
Presentation transcript:

Overview Class #2 (Jan 16) Brief introduction to time-stepping ODEs Application: Particle systems Numerical stiffness issues

No class next Tuesday Instead: http://www.cs.cmu.edu/~djames/pbmis assignment readings http://www.cs.cmu.edu/~djames/pbmis

What is stiffness? From [AscherPetzold97] “Loosely speaking, the initial value problem is referred to as being stiff if the absolute stability requirement dictates a much smaller time step than is needed to satisfy approximation requirements alone.” Definition 3.1 [p48]: An IVP is stiff in some interval [0,b] if the step size needed to maintain stability of the forward Euler method is much smaller than the step size required to represent the solution accurately.

What is stiffness? Stiffness depends on your problem and… Accuracy criterion Length of the interval of integration, [0,b] Region of absolute stability of the method Related to local Jacobian eigenvalues {j} Stiff on [0,b] if “Stiff decay”

Some higher-order explicit methods

Some higher-order implicit methods

Complications Smoothness assumption in Taylor expansion