ME451 Kinematics and Dynamics of Machine Systems

Similar documents
ME451 Kinematics and Dynamics of Machine Systems

ME451 Kinematics and Dynamics of Machine Systems

ME451 Kinematics and Dynamics of Machine Systems

ME451 Kinematics and Dynamics of Machine Systems

ME451 Kinematics and Dynamics of Machine Systems

ME451 Kinematics and Dynamics of Machine Systems

ME451 Kinematics and Dynamics of Machine Systems

ME751 Advanced Computational Multibody Dynamics

ME751 Advanced Computational Multibody Dynamics

Non-polynomial Least-squares fitting

ME751 Advanced Computational Multibody Dynamics

Lecture 5. September 4, 2018 Math/CS 471: Introduction to Scientific Computing University of New Mexico

Quick Introduction to Momentum Principle. Momentum. Momentum. Basic principle not at all obvious on Earth 24/02/11

Important Dates. Non-instructional days. No classes. College offices closed.

SF2822 Applied nonlinear optimization, final exam Saturday December

ME751 Advanced Computational Multibody Dynamics

CS 542G: Robustifying Newton, Constraints, Nonlinear Least Squares

ME751 Advanced Computational Multibody Dynamics. September 14, 2016

ME451 Kinematics and Dynamics of Machine Systems

Welcome to Physics 212

Welcome to Physics 211! General Physics I

Physics 273 (Fall 2013) (4 Credit Hours) Fundamentals of Physics II

MA 113 Calculus I Fall 2015 Exam 3 Tuesday, 17 November Multiple Choice Answers. Question

PHYSICS 100. Introduction to Physics. Bridges the gap between school science and Physics 101, Physics 120, Physics 125 or Physics 140

Lecture 10: Powers of Matrices, Difference Equations

Math/Phys/Engr 428, Math 529/Phys 528 Numerical Methods - Summer Homework 3 Due: Tuesday, July 3, 2018

Introduction to Engineering Analysis - ENGR1100 Course Description and Syllabus Tuesday / Friday Sections. Spring '13.

Solving Linear Systems

Numerical Methods for Inverse Kinematics

Problem 1: Lagrangians and Conserved Quantities. Consider the following action for a particle of mass m moving in one dimension

10725/36725 Optimization Homework 4

PHYSICS 206, Spring 2019

Numerical Integration of Equations of Motion

Matrix Assembly in FEA

COMP 558 lecture 18 Nov. 15, 2010

Lecture 4.3: Closures and Equivalence Relations

Quiescent Steady State (DC) Analysis The Newton-Raphson Method

Announcements - Homework

May bring 1 sheet of paper with notes!! Both sides!! Printed/handwritten/whatever.. I don t really care

The remains of the course

PHYS 1441 Section 002 Lecture #17

Welcome to Physics 212

Welcome to Physics 161 Elements of Physics Fall 2018, Sept 4. Wim Kloet

CENTRAL TEXAS COLLEGE SYLLABUS FOR MATH 2415 CALCULUS III. Semester Hours Credit: 4

Required Textbook. Grade Determined by

Physics 2514 Lecture 2

Quasi-Newton Methods

Review for Exam 2 Ben Wang and Mark Styczynski

ENGR 3130: DYNAMICS University of Detroit Mercy Term I,

PHY2048 Physics with Calculus I

ECE 204 Numerical Methods for Computer Engineers MIDTERM EXAMINATION /8:00-9:30

Intro to Linear & Nonlinear Optimization

Applied Mathematics 205. Unit I: Data Fitting. Lecturer: Dr. David Knezevic

Time integration. DVI and HHT time stepping methods in Chrono

Today s class. Linear Algebraic Equations LU Decomposition. Numerical Methods, Fall 2011 Lecture 8. Prof. Jinbo Bi CSE, UConn

Programming Assignment 4: Image Completion using Mixture of Bernoullis

Bindel, Fall 2011 Intro to Scientific Computing (CS 3220) Week 6: Monday, Mar 7. e k+1 = 1 f (ξ k ) 2 f (x k ) e2 k.

Physics 351 Wednesday, January 14, 2015

12. Perturbed Matrices

DS Machine Learning and Data Mining I. Alina Oprea Associate Professor, CCIS Northeastern University

The Clickers. PHY131 Summer 2011 Class 2 Notes 5/19/11. Your First Clicker Question!

The Normal Equations. For A R m n with m > n, A T A is singular if and only if A is rank-deficient. 1 Proof:

Written Examination

Announcements August 31

Spring 2015, Math 111 Lab 8: Newton s Method

CPSC 340: Machine Learning and Data Mining. Gradient Descent Fall 2016

CPSC 340: Machine Learning and Data Mining. Regularization Fall 2017

Chapter 3 Numerical Methods

Physics 2101, First Exam, Spring 2006

AM 205: lecture 19. Last time: Conditions for optimality Today: Newton s method for optimization, survey of optimization methods

CSE250A Fall 12: Discussion Week 9

Introduction MEAM 535. What is MEAM 535? Audience. Advanced topics in dynamics

Solving Linear Systems

CS 231A Section 1: Linear Algebra & Probability Review

Homework 5. Convex Optimization /36-725

ECE580 Exam 2 November 01, Name: Score: / (20 points) You are given a two data sets

Important Dates. Non-instructional days. No classes. College offices closed.

Course Staff. Textbook

Exam 1 Review. IEA Section 2 2/5/2018 Section 3 2/5/2018

Welcome. to Physics 2135.

Intro to Linear & Nonlinear Optimization

Math 164-1: Optimization Instructor: Alpár R. Mészáros

Markov Chains and Related Matters

Physics 161 Lecture 5 Greek: π ρ σ Newton s Laws

Finite and infinite sets, and cardinality

PHYS 272 (Spring 2018): Introductory Physics: Fields Homeworks

MATH 310, REVIEW SHEET 2

Iterative Methods for Solving A x = b

CS173 Lecture B, November 3, 2015

Final Exam. 1 True or False (15 Points)

Constrained Optimization

3.2 Iterative Solution Methods for Solving Linear

LU Factorization. LU factorization is the most common way of solving linear systems! Ax = b LUx = b

Review Solutions, Exam 2, Operations Research

Gradient Descent. Dr. Xiaowei Huang

Announcements Monday, November 06

Proofs. 29th January 2014

MAT01A1. Numbers, Inequalities and Absolute Values. (Appendix A)

Lecture 2: Linear regression

Numerical Optimization Professor Horst Cerjak, Horst Bischof, Thomas Pock Mat Vis-Gra SS09

Transcription:

ME451 Kinematics and Dynamics of Machine Systems Introduction to Dynamics Newmark Integration Formula [not in the textbook] December 9, 2014 Dan Negrut ME451, Fall 2014 University of Wisconsin-Madison Quote of the day: They have computers, and they may have other weapons of mass destruction. -- Janet Reno, while US Attorney General

Before we get started 2 Last time[s] Numerical Integration Exam Today Solving the constrained equations of motion using the Newmark integration formulas Critical for implementation of simengine2d Project 2 due on 12/16 at 11:59 PM Dropped HW policies Lowest 6 scores amongst the MATLAB, pen-and-paper, and ADAMS assignments will be dropped Exams graded, scores in Learn@UW Please come to see me this week if you think score doesn t reflect the quality of your work

Before we get started 3 Final Exam: content Part 1: Pen and paper You ll have to generate a pair of acf/adm files but you don t have to use these files unless you go for the bonus Part 2: Bonus (extra credit) You ll have to use simengine2d and the pair of acf/adm files Score cannot exceed 100% Final Exam: logistics Tuesday, December 16, 2014 2:45 PM - 4:45 PM Room: 2109ME (computer lab) MATLAB access one of two choices: Bring your own laptop Use CAE machine Final Project Due on Friday, December 19 at 11:59 PM

Solution Strategy [Step 3 of the Three Steps for Dynamics Analysis, see Slide 25] 4 The numerical solution; i.e., an approximation of the actual solution of the dynamics problem, is produced in the following three stages: Stage 1: the Newmark numerical integration (discretization) formulas are used to express the positions and velocities as functions of accelerations Stage 2: everywhere in the constrained EOM, the positions and velocities are replaced using the Newmark numerical integration formulas and expressed in terms of the acceleration This is the most important step, since through this discretization the differential problem is transformed into an algebraic problem Stage 3: the unknowns; i.e., the acceleration and Lagrange multipliers are obtained by solving a nonlinear system

Solution Strategy Ease Into It Solve Simpler Problem First 5 Solve a Finite Element Analysis (FEA) problem first, then move to DAE Linear FEA leads to the following second order differential equation: Not quite our problem, but good stepping stone Square matrices, C, and K are constant is the forcing term, time dependent

Newmark Integration Formulas (1/2) Goal: find the positions, velocities, accelerations and Lagrange multipliers on a grid of time points; i.e., at,,, Stage 1/3 Newmark s formulas relate position to acceleration and velocity to acceleration: Stage 2/3 Newmark s method (1957) discretizes the second order EOM:

Newmark Integration Formulas (2/2) 7 Newmark Method Initially introduced to deal with linear transient Finite Element Analysis Accuracy: 1 st Order Stability: Very good stability properties Choose values for the two parameters controlling the behavior of the method: 0.3025 and 0.6 Write the EOM at each time Use the discretization formulas to replace and in terms of the accelerations using formulas on previous slide: Obtain algebraic problem in which the unknown is the acceleration (denoted here by ):

DAEs of Constrained Multibody Dynamics The rigid multibody dynamics problem is more complicated than the Linear Finite Element problem used to introduce Newmark s formulas Additional algebraic equations: kinematic constraints that solution must satisfy Additional algebraic variables: the Lagrange multipliers that come along with these constraints Linear Finite Element Dynamics Problem Nonlinear Multibody Dynamics Problem Newmark s method can be applied for the DAE problem, with slightly more complexity in the resulting algebraic problem.

Stage 3/3: Discretization of the Constrained EOM (1/3) The discretized equations solved at each time are: Recall that and in the above expressions are functions of the accelerations : Recall, these are Newmark s formulas that express the generalized positions and velocities as functions of the generalized accelerations

Stage 3/3: Discretization of the Constrained EOM (2/3) 10 The unknowns are the accelerations and the Lagrange multipliers The number of unknowns is equal to the number of equations The equations that must be solved now are algebraic and nonlinear Differential problem has been transformed into an algebraic one The new problem: find acceleration and Lagrange multipliers that satisfy We have to use Newton s method We need the Jacobian of the nonlinear system of equations (chain rule will be used to simplify calculations) This looks exactly like what we had to do when for Kinematics analysis of a mechanism (there we solved (q,t)=0 to get the positions q)

Stage 3/3: Discretization of the Constrained EOM (3/3) 11 Define the following two functions: Once we use the Newmark discretization formulas, these functions depend in fact only on the accelerations and Lagrange multipliers To make this clear, define the new functions: Therefore, we must solve for and the following system

Chain Rule for Computing the Jacobian (1/3) 12 Newton s method for the solution of the nonlinear system relies on the Jacobian Use the chain rule to calculate the above partial derivatives. Note that, from the Newmark formulas we get

Chain Rule for Computing the Jacobian (2/3) 13 Consider Apply the chain rule of differentiation to obtain and

Chain Rule for Computing the Jacobian (3/3) 14 Consider Apply the chain rule of differentiation to obtain and

Solving the Nonlinear System 15 Newton s method applied to the system Jacobian obtained as Corrections computed as Note: to keep notation simple, all subscripts were dropped. Recall that all quantities are evaluated at time

Newton Method for Dynamics 16 At each integration time step At the initial time Increment time: Define the initial guess for and to be the values from the previous time step Find consistent initial conditions for generalized positions and velocities Calculate the generalized accelerations and Lagrange multipliers Update positions and velocities at using the Newmark formulas using the current accelerations and Lagrange multipliers Calculate the Jacobian matrix, using the current values of,,, and at Evaluate the EOM and scaled constraints, using the current values of,,, and at. The resulting vector is called the residual vector. Compute the correction vector by solving a linear system with the Jacobian as the system coefficient matrix and the residual as the RHS vector. NO Need to further improve accelerations and Lagrange multipliers Is error less than tolerance? YES Correct the accelerations and Lagrange multipliers to obtain a better approximation for their values at time Compute the infinity norm of the correction vector (the largest entry in absolute value) which will be used in the convergence test Store and at. Use the final acceleration values to calculate positions and velocities and at. Use the final Lagrange multiplier values to calculate reaction forces. Store all this information.

Newton-Type Methods Geometric Interpretation 17 Newton method At each iterate, use the direction given by the current derivative Modified Newton method At all iterates, use the direction given by the derivative at the initial guess Quasi Newton method At each iterate, use a direction that only approximates the derivative

Quasi Newton Method for the Dynamics Problem (1/3) 18 Nonlinear problem: find and by solving Jacobian obtained as Terms that we have not computed previously: Partial derivative of reaction forces with respect to positions Partial derivative of applied forces with respect to positions Partial derivative of applied forces with respect to velocities

Quasi Newton Method for the Dynamics Problem (2/3) 19 Approximate the Jacobian by ignoring these terms Nonlinear equations: Exact Jacobian: Approximate Jacobian: Therefore, we modify the solution procedure to use a Quasi Newton method

Quasi Newton Method for the Dynamics Problem (3/3) 20 The actual terms dropped from the expression of the exact Jacobian Is it acceptable to neglect these terms? Under what conditions? As a rule of thumb, this is fine for small values of the step-size; e.g. 0.001 But there is no guarantee and smaller values of may be required Note that the terms that we are neglecting are in fact straight-forward to compute A production-level multibody package (such as ADAMS) would evaluate these quantities

Quasi Newton Method for Dynamics 21 At each integration time step At the initial time Increment time:. Define the initial guess for and to be the values from the previous time step. Find consistent initial conditions for generalized positions and velocities. Calculate the generalized accelerations and Lagrange multipliers. Update positions and velocities at using the Newmark formulas using the current accelerations and Lagrange multipliers. Calculate the approximate Jacobian matrix. Only evaluate this matrix at the first iteration and reuse it at subsequent iterations. Evaluate the EOM and scaled constraints, using the current values of,,, and at. The resulting vector is called the residual vector. Compute the correction vector by solving a linear system. Note that the system matrix is constant during the iterative process. NO Need to further improve accelerations and Lagrange multipliers Is error less than tolerance? YES Correct the accelerations and Lagrange multipliers to obtain a better approximation for their values at time. Compute the infinity norm of the correction vector (the largest entry in absolute value) which will be used in the convergence test. Store and at. Use the final acceleration values to calculate positions and velocities and at. Use the final Lagrange multiplier values to calculate reaction forces. Store all this information.

ME451 End of Semester Evaluation 22 Please let me know what you didn t like Please let me know what you liked Your input is extremely valuable Course Evaluation: https://aefis.engr.wisc.edu