Outline. Review Numerical Approach. Schedule for April and May. Review Simple Methods. Review Notation and Order
|
|
- Gervase Holmes
- 6 years ago
- Views:
Transcription
1 Sstes of Ordnar Dfferental Equatons Aprl, Solvng Sstes of Ordnar Dfferental Equatons Larr Caretto Mecancal Engneerng 9 Nuercal Analss of Engneerng Sstes Aprl, Outlne Revew bascs of nuercal solutons of ordnar dfferental equatons Error control n sple etods dscussed prevousl Sstes of dfferental equatons Reducng ger-order equatons nto a sste of frst-order equatons Wrtng and usng software for solvng sstes of ordnar dfferental equatons Scedule for Aprl and Ma Monda Tuesda Wednesda Tursda Frda Sprng Brea 5 Quz 7 & PA PA 9 Quz 8 Ma 5 PA 7 7 Prog Ea Fnal 8 9 Revew Nuercal Approac Solve ntal value proble d/ = f(,) (nown equaton) wt ( ) = Use a fnte dfference grd: + = Replace dervatve b fnte-dfference approaton: d/ ( + ) / ( + ) = ( + ) / Derve a forula to copute f avg te average value of f(,) between and + Replace d/ = f(,) b ( + ) / = f avg Repeatedl copute + = + f avg Revew Notaton and Order s ndependent varable s nuercal soluton at = f s dervatve found fro : f = f(, ) ( ) s te eact value of at = f(,( )) s te eact dervatve e = ( ) = local truncaton error E = ( ) s global truncaton error If e s O( n ), ten E s O( n- ) 5 Revew Sple Metods Euler: + = + f = + f(, ) Huen s etod f (, ) f (, ) f (, ) f (, ) Modfed Euler etod (, ) f f (, ) ME 9 Nuercal Analss of Engneerng Sstes
2 Sstes of Ordnar Dfferental Equatons Aprl, Revew t Order Runge-Kutta Uses four dervatve evaluatons per step f (, ) f f f (,,, ) Error (at = ) versus step sze for ODE solvers Error.E+.E-.E-.E-.E-.E-5.E-.E-7.E-8.E-9.E- Error versus Step Sze for Sple ODE Solvers d e -- wt at Euler Huen Modfed Euler Runge-Kutta.E-.E-.E-.E-.E-5.E-.E-7.E-.E-5.E-.E-.E-.E- Step sze, 7 8 Error Error Propagaton n Solutons of ODEs.E+.E-.E-.E-.E-.E-5.E-.E-7.E-8.E-9.E-.E-.E-.E-.E Euler (N = ) Euler (N = ) Euler N =,) Huen (N =) Huen (N = ) Huen (N =,) RK (H = ) RK (N = ) 9 Error Control How do we coose to antan desred accurac? Want to obtan a result wt soe desred sall global error Can ust repeat calculatons wt saller untl two results are suffcentl close Can use algorts tat estate error and adust step sze durng te calculaton based on te error Runge-Kutta Error Control Tae step wt two forulas of dfferent orders usng te sae functon evaluatons n eac forula Use te dfference between te two forulas as an estate of te error Use te error estate to control te step sze based on a user-nput desred error Soe etods n fnal sldes not sown Dorand-Prnce Metod Uses fourt- and fft-order epressons to fnd error estate Modfes step sze b coparng error estate wt desred error Used n MATLAB solver ode5 wc s n net prograng assgnent Algort equatons sown on net two sldes v. of ode5 code at ttp://users.powernet.co.u/enzle/octave/ atcopat/scrpts/ode_v./ode5. ME 9 Nuercal Analss of Engneerng Sstes
3 Sstes of Ordnar Dfferental Equatons Aprl, Dorand-Prnce Equatons = 5 = 5 = 5 Dorand-Prnce Metod II e s desred error per step opt s optu step sze Tosnor Kura, On Dorand-Prnce Metod ttp://depa.fqu.una./ad/arcvero/dorandprnce_985.pdf Tosnor Kura, On Dorand-Prnce Metod ttp://depa.fqu.una./ad/arcvero/dorandprnce_985.pdf Net Steps We ave sown soe algorts for solvng te ntal value proble d/ = f(,) wt = at = Need to solve ger order equatons Can sow tan an n t -order equaton can be epressed as a sste of n frstorder equatons Ten ave to consder solvng sstes of frst order equatons 5 Basc Idea An n t order ODE can be wrtten as a sste of n frst-order ODEs For a sste of two or ore ODEs wt varng orders: Brea te t ODE wt order n nto n frstorder ODEs; repeat for all equatons Te result wll be a sste of frst order ODEs Te total nuber of ODEs wll be n + n + = te su of te orders of eac orgnal ODE Hger order equatons Loo at sprng-ass-daper equaton as eaple: d / + Cd/ + = F F s appled force wc a be a nown functon of t, and d/ (a ave F = ) Defne a veloct, v = d/ dv/ = d / Our second order equaton becoes dv/ + Cv + = F gvng two ODEs dv C F - v - fvt,, v d v f t,, v 7 dv f Hger Order Equatons II d t,, v f t, v v, d General Notaton d ft, f t, Te two frst order equatons we found loo le our ntal value proble Ts assues tat we ave an ntal conon for veloct, v Wll cover stuatons were ts s not true (nown as boundar value probles) later We can appl all algorts developed for sngle frst-order equatons to an sste of sultaneous frst-order equatons 8 N ME 9 Nuercal Analss of Engneerng Sstes
4 Sstes of Ordnar Dfferental Equatons Aprl, Solvng Sultaneous ODEs Appl sae algorts used for sngle ODEs Must appl eac part of eac algort step to all equatons n sste before gong on to net step Ke s avng consstent and values n deternaton of f (,) All values n ust be avalable at te sae pont wen coputng te f E.g., n Runge-Kutta we ust evaluate Runge-Kutta for ODE Sste (n) s vector of dependent varables at = n (), (), (), and (), are vectors contanng nteredate Runge-Kutta results f s a vector contanng te dervatves () = f = f( n, (n) ) () = f( n + /, (n) + () /) () = f( n + /, (n) + () /) () = f( n +, (n) + () ) (n+) = ( () + () + () + () )/ for all equatons before fndng 9 ODE Sste b RK d/ = + z and dz/ = z wt () = and z() = - wt =. Detals of frst step fro to () = [- + z] =.[- + (-)] = -. ()z = [ - z] =.[ - (-)] =. () = [-(+ () /) + z + ()z /] =.[ -( + -./) + (- +./)] = -.8 ()z = [(+ () /) (z + ()z /)] =.[( + -.)/ - (- +./)] =.8 ODE Sste b RK II () = [-(+ () /) + z + ()z /] =.[ -( + -.8/) + (- +.8/)] = -.8 ()z = [(+ () /) (z + ()z /)] =.[( + -.8)/ - (- +.8/)] =.8 () = [-(+ () ) + z + ()z ] =.[ -( + -.8) + (- +.8)] = -. ()z = [(+ () ) (z + ()z )] =.[ ( + -.8) - (- +.8)] =. ODE Sste b RK III + = + ( () + () + () + () )/ = + [ (.) + (.8) + (.8) + (.)]/ =.887 (ere = ) z + = z + ( ()z + ()z + ()z + ()z )/ = + [(.) + (.8) + (.8) + (.)]/ =.887 Contnue n ts fason untl desred fnal value s reaced Note all coputed before an + No dependence for f n ts eaple Nuercal Software for ODEs Usuall wrtten to solve a sste of N equatons, but wll wor for N = User as to code a subroutne or functon to copute te f arra Input varables are and ; f s output Soe codes ave one densonal paraeter arra to pass adonal nforaton fro an progra nto te functon tat coputes dervatves ME 9 Nuercal Analss of Engneerng Sstes
5 Sstes of Ordnar Dfferental Equatons Aprl, Dervatve Subroutne Eaple Vsual Basc sub code for sste of ODEs at rgt s sown below d - d - - e - Sub fsub( as Double, () as Double, _ f() as Double ) f() = -() + Sqr(()) - ()*Ep(*) f() = - * ()^ f() = - * () * () End Sub 5 d Dervatve Functon Eaple d Vsual Basc - - e functon code for d d sste of ODEs - - Functon ff( As Double, () As Double, _ N As Long) As Varant D fd() As Double; red fd( to N) fd() = -() + Sqr(()) - ()*Ep(*) fd() = - * ()^ fd() = - * () * () : ff = fd End Functon In an progra use f = ff(,,n) were f s an arra of sae sze Dervatve Subroutne Eaple MATLAB functon for sste of ODEs at rgt s sown below d - d - - e - functon f = test(, ) f = zeros(,); f() =-() +Sqrt(()) - ()*Ep(*); f() = - * ()^; f() = - * () * (); end %secolons prevent output d 7 Dervatve Subroutne Eaple C++ code for sste of ODEs at rgt s sown below d - d - - e - vod fsub(double, double [], double f[]) { f[] = -[] + sqrt([]) - []*ep(*); f[] = - * [] * []; f[] = - * [] * []; } 8 d Dervatve Subroutne Eaple Fortran code for sste of ODEs at rgt s sown below d - d - - e - subroutne fsub(,, f ) real(kind=8), (:), f(:) f() = -() + sqrt(()) -()*ep(*) f() = - * ()** f() = - * () * () end subroutne fsub d 9 Assgnent Seven and Last Wrte routne n MATLAB and n VBA to solve general sste of N ODEs wt followng for: d / = f (t,), =, N Appl to N = sste wt nown eact solutons sae as on prevous sldes d - d - - e d - e e -t e -t -t ME 9 Nuercal Analss of Engneerng Sstes 5
6 Sstes of Ordnar Dfferental Equatons Aprl, Assgnent Seven Algorts Code Huen algort n MATLAB Modfed Euler algort n VBA f ( t, ) t t f ( t, ) f ( t, ) f ( t, t t Use MATLAB functon ode5 for solvng sae set of equatons and copare wor for sae accurac ) Runge-Kutta Error Control Followng sldes not sown n class Present oter approac to error control n Runge-Kutta algorts Older etod: Copare results for two steps at step sze wt one step of Requres dervatve functon evaluatons over bot steps Runge-Kutta-Felberg: earl etod to use algorts of dfferent order wt sae functon evaluatons Runge-Kutta Error Control Control error b dong ntegraton wt and all along ntegraton Integraton wt step requres adonal functon evaluatons per steps Analze local truncaton error, wc s O( 5 ), for bot steps 5 ( ) A B ( ) - A 5 B A O( ) Runge-Kutta Error Control II = D s easure of truncaton error User specfes D D, te desred error Man was to specf ts, sngle value, relatve values, relatve to ncreents for n one step Snce error scales as 5, we can adust step sze suc tat new = old D D /D /5 Tpcall use safet factor to avod ang new too large Runge-Kutta-Felberg Uses two equatons to copute n+, one as O( 5 ), te oter O( ) error Requres s dervatve evaluatons per step (sae evaluatons used for bot equatons) Te error estate can be used for step sze control based on an overall 5 t order error Cas-Karp verson and Runge-Kutta- Verner use sae dea 5 Runge-Kutta-Felberg II See page n Rao tet for algort Tpcal forula coponents below n+ = n + ( /5 + 5 /85 = f( n + /8, n + / + 9 /) Error = / - 8 /75 new = old old E Desred /Error / E Desred s set b user RKF5 code b Watts and Sapne ME 9 Nuercal Analss of Engneerng Sstes
7 Sstes of Ordnar Dfferental Equatons Aprl, Increents,, for RKF f, f, 9 f, f, f, f, Fnal RKF Step Results Proposed value of + s Estated error s e If e n < e + < e a accept + ; eep If e + < e n accept + and get new If e + > e a get new and redo step new = old (ε* old / e + )¼ ε* = desred error 8 ME 9 Nuercal Analss of Engneerng Sstes 7
ORDINARY DIFFERENTIAL EQUATIONS EULER S METHOD
Numercal Analss or Engneers German Jordanan Unverst ORDINARY DIFFERENTIAL EQUATIONS We wll eplore several metods o solvng rst order ordnar derental equatons (ODEs and we wll sow ow tese metods can be appled
More informationNumerical Solution of Ordinary Differential Equations
College of Engneerng and Computer Scence Mecancal Engneerng Department otes on Engneerng Analss Larr Caretto ovember 9, 7 Goal of tese notes umercal Soluton of Ordnar Dfferental Equatons ese notes were
More informationOn Pfaff s solution of the Pfaff problem
Zur Pfaff scen Lösung des Pfaff scen Probles Mat. Ann. 7 (880) 53-530. On Pfaff s soluton of te Pfaff proble By A. MAYER n Lepzg Translated by D. H. Delpenc Te way tat Pfaff adopted for te ntegraton of
More informationRectilinear motion. Lecture 2: Kinematics of Particles. External motion is known, find force. External forces are known, find motion
Lecture : Kneatcs of Partcles Rectlnear oton Straght-Lne oton [.1] Analtcal solutons for poston/veloct [.1] Solvng equatons of oton Analtcal solutons (1 D revew) [.1] Nuercal solutons [.1] Nuercal ntegraton
More informationNumerical Solution of Ordinary Differential Equations
Numercal Methods (CENG 00) CHAPTER-VI Numercal Soluton of Ordnar Dfferental Equatons 6 Introducton Dfferental equatons are equatons composed of an unknown functon and ts dervatves The followng are examples
More informationSystem in Weibull Distribution
Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co
More information1.3 Hence, calculate a formula for the force required to break the bond (i.e. the maximum value of F)
EN40: Dynacs and Vbratons Hoework 4: Work, Energy and Lnear Moentu Due Frday March 6 th School of Engneerng Brown Unversty 1. The Rydberg potental s a sple odel of atoc nteractons. It specfes the potental
More informationME 501A Seminar in Engineering Analysis Page 1
umercal Solutons of oundary-value Problems n Os ovember 7, 7 umercal Solutons of oundary- Value Problems n Os Larry aretto Mechancal ngneerng 5 Semnar n ngneerng nalyss ovember 7, 7 Outlne Revew stff equaton
More informationOutline. Remaining Course Schedule. Review Systems of ODEs. Example. Example Continued. Other Algorithms for Ordinary Differential Equations
ter Nuercal DE Algorts Aprl 8 0 ter Algorts or rdar Deretal Equatos Larr aretto Mecacal Egeerg 09 Nuercal Aalss o Egeerg Sstes Aprl 8 0 utle Scedule Revew sstes o DEs Sprg-ass-daper proble wt two asses
More informationBoundary Value Problems. Lecture Objectives. Ch. 27
Boundar Vaue Probes Ch. 7 Lecture Obectves o understand the dfference between an nta vaue and boundar vaue ODE o be abe to understand when and how to app the shootng ethod and FD ethod. o understand what
More informationApplied Mathematics Letters
Appled Matheatcs Letters 2 (2) 46 5 Contents lsts avalable at ScenceDrect Appled Matheatcs Letters journal hoepage: wwwelseverco/locate/al Calculaton of coeffcents of a cardnal B-splne Gradr V Mlovanovć
More informationLeast Squares Fitting of Data
Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2014. All Rghts Reserved. Created: July 15, 1999 Last Modfed: February 9, 2008 Contents 1 Lnear Fttng
More information6.3.4 Modified Euler s method of integration
6.3.4 Modfed Euler s method of ntegraton Before dscussng the applcaton of Euler s method for solvng the swng equatons, let us frst revew the basc Euler s method of numercal ntegraton. Let the general from
More informationE91: Dynamics. E91: Dynamics. Numerical Integration & State Space Representation
E91: Dnamcs Numercal Integraton & State Space Representaton The Algorthm In steps of Δ f ( new ) f ( old ) df ( d old ) Δ Numercal Integraton of ODEs d d f() h Δ Intal value problem: Gven the ntal state
More informationPART 8. Partial Differential Equations PDEs
he Islamc Unverst of Gaza Facult of Engneerng Cvl Engneerng Department Numercal Analss ECIV 3306 PAR 8 Partal Dfferental Equatons PDEs Chapter 9; Fnte Dfference: Ellptc Equatons Assocate Prof. Mazen Abualtaef
More informationXII.3 The EM (Expectation-Maximization) Algorithm
XII.3 The EM (Expectaton-Maxzaton) Algorth Toshnor Munaata 3/7/06 The EM algorth s a technque to deal wth varous types of ncoplete data or hdden varables. It can be appled to a wde range of learnng probles
More informationSolution for singularly perturbed problems via cubic spline in tension
ISSN 76-769 England UK Journal of Informaton and Computng Scence Vol. No. 06 pp.6-69 Soluton for sngularly perturbed problems va cubc splne n tenson K. Aruna A. S. V. Rav Kant Flud Dynamcs Dvson Scool
More informationChapter 12. Ordinary Differential Equation Boundary Value (BV) Problems
Chapter. Ordnar Dfferental Equaton Boundar Value (BV) Problems In ths chapter we wll learn how to solve ODE boundar value problem. BV ODE s usuall gven wth x beng the ndependent space varable. p( x) q(
More informationIntroduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:
CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and
More informationLECTURE :FACTOR ANALYSIS
LCUR :FACOR ANALYSIS Rta Osadchy Based on Lecture Notes by A. Ng Motvaton Dstrbuton coes fro MoG Have suffcent aount of data: >>n denson Use M to ft Mture of Gaussans nu. of tranng ponts If
More informationLecture 21: Numerical methods for pricing American type derivatives
Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)
More informationDenote the function derivatives f(x) in given points. x a b. Using relationships (1.2), polynomials (1.1) are written in the form
SET OF METHODS FO SOUTION THE AUHY POBEM FO STIFF SYSTEMS OF ODINAY DIFFEENTIA EUATIONS AF atypov and YuV Nulchev Insttute of Theoretcal and Appled Mechancs SB AS 639 Novosbrs ussa Introducton A constructon
More informationAppendix B. The Finite Difference Scheme
140 APPENDIXES Appendx B. The Fnte Dfference Scheme In ths appendx we present numercal technques whch are used to approxmate solutons of system 3.1 3.3. A comprehensve treatment of theoretcal and mplementaton
More informationPHYS 342L NOTES ON ANALYZING DATA. Spring Semester 2002
PHYS 34L OTES O AALYZIG DATA Sprng Seester 00 Departent of Phscs Purdue Unverst A ajor aspect of eperental phscs (and scence n general) s easureent of soe quanttes and analss of eperentall obtaned data.
More informationOur focus will be on linear systems. A system is linear if it obeys the principle of superposition and homogenity, i.e.
SSTEM MODELLIN In order to solve a control syste proble, the descrptons of the syste and ts coponents ust be put nto a for sutable for analyss and evaluaton. The followng ethods can be used to odel physcal
More informationElastic Collisions. Definition: two point masses on which no external forces act collide without losing any energy.
Elastc Collsons Defnton: to pont asses on hch no external forces act collde thout losng any energy v Prerequstes: θ θ collsons n one denson conservaton of oentu and energy occurs frequently n everyday
More informationWhat is LP? LP is an optimization technique that allocates limited resources among competing activities in the best possible manner.
(C) 998 Gerald B Sheblé, all rghts reserved Lnear Prograng Introducton Contents I. What s LP? II. LP Theor III. The Splex Method IV. Refneents to the Splex Method What s LP? LP s an optzaton technque that
More informationSolving Fuzzy Linear Programming Problem With Fuzzy Relational Equation Constraint
Intern. J. Fuzz Maeatcal Archve Vol., 0, -0 ISSN: 0 (P, 0 0 (onlne Publshed on 0 Septeber 0 www.researchasc.org Internatonal Journal of Solvng Fuzz Lnear Prograng Proble W Fuzz Relatonal Equaton Constrant
More informationXiangwen Li. March 8th and March 13th, 2001
CS49I Approxaton Algorths The Vertex-Cover Proble Lecture Notes Xangwen L March 8th and March 3th, 00 Absolute Approxaton Gven an optzaton proble P, an algorth A s an approxaton algorth for P f, for an
More informationCOS 511: Theoretical Machine Learning
COS 5: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #0 Scrbe: José Sões Ferrera March 06, 203 In the last lecture the concept of Radeacher coplexty was ntroduced, wth the goal of showng that
More information1 GSW Iterative Techniques for y = Ax
1 for y = A I m gong to cheat here. here are a lot of teratve technques that can be used to solve the general case of a set of smultaneous equatons (wrtten n the matr form as y = A), but ths chapter sn
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationShuai Dong. Isaac Newton. Gottfried Leibniz
Computatonal pyscs Sua Dong Isaac Newton Gottred Lebnz Numercal calculus poston dervatve ntegral v velocty dervatve ntegral a acceleraton Numercal calculus Numercal derentaton Numercal ntegraton Roots
More informationIntroduction to groundwater flow modeling: finite difference methods. Tyson Strand
Introducton to groundwater flow odelng: fnte dfference etods Tson Strand Darc s law contnut and te groundwater flow equaton Fundaentals of fnte dfference etods 3 FD soluton of Laplace s equaton 4 FD soluton
More informationLecture 10: Euler s Equations for Multivariable
Lecture 0: Euler s Equatons for Multvarable Problems Let s say we re tryng to mnmze an ntegral of the form: {,,,,,, ; } J f y y y y y y d We can start by wrtng each of the y s as we dd before: y (, ) (
More informationlecture 35: Linear Multistep Mehods: Truncation Error
88 lecture 5: Linear Multistep Meods: Truncation Error 5.5 Linear ultistep etods One-step etods construct an approxiate solution x k+ x(t k+ ) using only one previous approxiation, x k. Tis approac enoys
More informationLinear Momentum. Center of Mass.
Lecture 16 Chapter 9 Physcs I 11.06.2013 Lnear oentu. Center of ass. Course webste: http://faculty.ul.edu/ndry_danylov/teachng/physcsi Lecture Capture: http://echo360.ul.edu/danylov2013/physcs1fall.htl
More informationConsistency & Convergence
/9/007 CHE 374 Computatonal Methods n Engneerng Ordnary Dfferental Equatons Consstency, Convergence, Stablty, Stffness and Adaptve and Implct Methods ODE s n MATLAB, etc Consstency & Convergence Consstency
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationLimit Cycle Bifurcations in a Class of Cubic System near a Nilpotent Center *
Appled Mateatcs 77-777 ttp://dxdoorg/6/a75 Publsed Onlne July (ttp://wwwscrporg/journal/a) Lt Cycle Bfurcatons n a Class of Cubc Syste near a Nlpotent Center * Jao Jang Departent of Mateatcs Sanga Marte
More informationLecture 2: Numerical Methods for Differentiations and Integrations
Numercal Smulaton of Space Plasmas (I [AP-4036] Lecture 2 by Lng-Hsao Lyu March, 2018 Lecture 2: Numercal Methods for Dfferentatons and Integratons As we have dscussed n Lecture 1 that numercal smulaton
More information1 Proving the Fundamental Theorem of Statistical Learning
THEORETICAL MACHINE LEARNING COS 5 LECTURE #7 APRIL 5, 6 LECTURER: ELAD HAZAN NAME: FERMI MA ANDDANIEL SUO oving te Fundaental Teore of Statistical Learning In tis section, we prove te following: Teore.
More informationPhysics 3A: Linear Momentum. Physics 3A: Linear Momentum. Physics 3A: Linear Momentum. Physics 3A: Linear Momentum
Recall that there was ore to oton than just spee A ore coplete escrpton of oton s the concept of lnear oentu: p v (8.) Beng a prouct of a scalar () an a vector (v), oentu s a vector: p v p y v y p z v
More informationLinear Feature Engineering 11
Lnear Feature Engneerng 11 2 Least-Squares 2.1 Smple least-squares Consder the followng dataset. We have a bunch of nputs x and correspondng outputs y. The partcular values n ths dataset are x y 0.23 0.19
More informationNumerical Simulation of One-Dimensional Wave Equation by Non-Polynomial Quintic Spline
IOSR Journal of Matematcs (IOSR-JM) e-issn: 78-578, p-issn: 319-765X. Volume 14, Issue 6 Ver. I (Nov - Dec 018), PP 6-30 www.osrournals.org Numercal Smulaton of One-Dmensonal Wave Equaton by Non-Polynomal
More informationLecture 26 Finite Differences and Boundary Value Problems
4//3 Leture 6 Fnte erenes and Boundar Value Problems Numeral derentaton A nte derene s an appromaton o a dervatve - eample erved rom Talor seres 3 O! Negletng all terms ger tan rst order O O Tat s te orward
More informationSolution of Linear System of Equations and Matrix Inversion Gauss Seidel Iteration Method
Soluton of Lnear System of Equatons and Matr Inverson Gauss Sedel Iteraton Method It s another well-known teratve method for solvng a system of lnear equatons of the form a + a22 + + ann = b a2 + a222
More informationExcess Error, Approximation Error, and Estimation Error
E0 370 Statstcal Learnng Theory Lecture 10 Sep 15, 011 Excess Error, Approxaton Error, and Estaton Error Lecturer: Shvan Agarwal Scrbe: Shvan Agarwal 1 Introducton So far, we have consdered the fnte saple
More informationComputational and Statistical Learning theory Assignment 4
Coputatonal and Statstcal Learnng theory Assgnent 4 Due: March 2nd Eal solutons to : karthk at ttc dot edu Notatons/Defntons Recall the defnton of saple based Radeacher coplexty : [ ] R S F) := E ɛ {±}
More informationBAYESIAN CURVE FITTING USING PIECEWISE POLYNOMIALS. Dariusz Biskup
BAYESIAN CURVE FITTING USING PIECEWISE POLYNOMIALS Darusz Bskup 1. Introducton The paper presents a nonparaetrc procedure for estaton of an unknown functon f n the regresson odel y = f x + ε = N. (1) (
More informationMain components of the above cycle are: 1) Boiler (steam generator) heat exchanger 2) Turbine generates work 3) Condenser heat exchanger 4) Pump
Introducton to Terodynacs, Lecture -5 Pro. G. Cccarell (0 Applcaton o Control olue Energy Analyss Most terodynac devces consst o a seres o coponents operatng n a cycle, e.g., stea power plant Man coponents
More informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More informationMultivariate Ratio Estimator of the Population Total under Stratified Random Sampling
Open Journal of Statstcs, 0,, 300-304 ttp://dx.do.org/0.436/ojs.0.3036 Publsed Onlne July 0 (ttp://www.scrp.org/journal/ojs) Multvarate Rato Estmator of te Populaton Total under Stratfed Random Samplng
More informationCOMP4630: λ-calculus
COMP4630: λ-calculus 4. Standardsaton Mcael Norrs Mcael.Norrs@ncta.com.au Canberra Researc Lab., NICTA Semester 2, 2015 Last Tme Confluence Te property tat dvergent evaluatons can rejon one anoter Proof
More informationDEMO #8 - GAUSSIAN ELIMINATION USING MATHEMATICA. 1. Matrices in Mathematica
demo8.nb 1 DEMO #8 - GAUSSIAN ELIMINATION USING MATHEMATICA Obectves: - defne matrces n Mathematca - format the output of matrces - appl lnear algebra to solve a real problem - Use Mathematca to perform
More informationLeast Squares Fitting of Data
Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2015. All Rghts Reserved. Created: July 15, 1999 Last Modfed: January 5, 2015 Contents 1 Lnear Fttng
More informationSeveral generation methods of multinomial distributed random number Tian Lei 1, a,linxihe 1,b,Zhigang Zhang 1,c
Internatonal Conference on Appled Scence and Engneerng Innovaton (ASEI 205) Several generaton ethods of ultnoal dstrbuted rando nuber Tan Le, a,lnhe,b,zhgang Zhang,c School of Matheatcs and Physcs, USTB,
More informationSlobodan Lakić. Communicated by R. Van Keer
Serdca Math. J. 21 (1995), 335-344 AN ITERATIVE METHOD FOR THE MATRIX PRINCIPAL n-th ROOT Slobodan Lakć Councated by R. Van Keer In ths paper we gve an teratve ethod to copute the prncpal n-th root and
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More information,..., k N. , k 2. ,..., k i. The derivative with respect to temperature T is calculated by using the chain rule: & ( (5) dj j dt = "J j. k i.
Suppleentary Materal Dervaton of Eq. 1a. Assue j s a functon of the rate constants for the N coponent reactons: j j (k 1,,..., k,..., k N ( The dervatve wth respect to teperature T s calculated by usng
More informationFinal Exam Solutions, 1998
58.439 Fnal Exa Solutons, 1998 roble 1 art a: Equlbru eans that the therodynac potental of a consttuent s the sae everywhere n a syste. An exaple s the Nernst potental. If the potental across a ebrane
More informationLecture 13 APPROXIMATION OF SECOMD ORDER DERIVATIVES
COMPUTATIONAL FLUID DYNAMICS: FDM: Appromaton of Second Order Dervatves Lecture APPROXIMATION OF SECOMD ORDER DERIVATIVES. APPROXIMATION OF SECOND ORDER DERIVATIVES Second order dervatves appear n dffusve
More information9 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations
Physcs 171/271 - Chapter 9R -Davd Klenfeld - Fall 2005 9 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys a set
More informationNote 10. Modeling and Simulation of Dynamic Systems
Lecture Notes of ME 475: Introducton to Mechatroncs Note 0 Modelng and Smulaton of Dynamc Systems Department of Mechancal Engneerng, Unversty Of Saskatchewan, 57 Campus Drve, Saskatoon, SK S7N 5A9, Canada
More informationCENTROID (AĞIRLIK MERKEZİ )
CENTOD (ĞLK MEKEZİ ) centrod s a geometrcal concept arsng from parallel forces. Tus, onl parallel forces possess a centrod. Centrod s tougt of as te pont were te wole wegt of a pscal od or sstem of partcles
More information12. The Hamilton-Jacobi Equation Michael Fowler
1. The Hamlton-Jacob Equaton Mchael Fowler Back to Confguraton Space We ve establshed that the acton, regarded as a functon of ts coordnate endponts and tme, satsfes ( ) ( ) S q, t / t+ H qpt,, = 0, and
More informationDescription of the Force Method Procedure. Indeterminate Analysis Force Method 1. Force Method con t. Force Method con t
Indeternate Analyss Force Method The force (flexblty) ethod expresses the relatonshps between dsplaceents and forces that exst n a structure. Prary objectve of the force ethod s to deterne the chosen set
More informationtotal If no external forces act, the total linear momentum of the system is conserved. This occurs in collisions and explosions.
Lesson 0: Collsons, Rotatonal netc Energy, Torque, Center o Graty (Sectons 7.8 Last te we used ewton s second law to deelop the pulse-oentu theore. In words, the theore states that the change n lnear oentu
More informationImplicit Integration Henyey Method
Implct Integraton Henyey Method In realstc stellar evoluton codes nstead of a drect ntegraton usng for example the Runge-Kutta method one employs an teratve mplct technque. Ths s because the structure
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationImage classification. Given the bag-of-features representations of images from different classes, how do we learn a model for distinguishing i them?
Image classfcaton Gven te bag-of-features representatons of mages from dfferent classes ow do we learn a model for dstngusng tem? Classfers Learn a decson rule assgnng bag-offeatures representatons of
More informationStanford University CS254: Computational Complexity Notes 7 Luca Trevisan January 29, Notes for Lecture 7
Stanford Unversty CS54: Computatonal Complexty Notes 7 Luca Trevsan January 9, 014 Notes for Lecture 7 1 Approxmate Countng wt an N oracle We complete te proof of te followng result: Teorem 1 For every
More informationBasic Concepts in Numerical Analysis November 6, 2017
Basc Cocepts Nuercal Aalyss Noveber 6, 7 Basc Cocepts Nuercal Aalyss Larry Caretto Mecacal Egeerg 5AB Sear Egeerg Aalyss Noveber 6, 7 Outle Revew last class Mdter Exa Noveber 5 covers ateral o deretal
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More information36.1 Why is it important to be able to find roots to systems of equations? Up to this point, we have discussed how to find the solution to
ChE Lecture Notes - D. Keer, 5/9/98 Lecture 6,7,8 - Rootndng n systems o equatons (A) Theory (B) Problems (C) MATLAB Applcatons Tet: Supplementary notes rom Instructor 6. Why s t mportant to be able to
More information5 The Laplace Equation in a convex polygon
5 Te Laplace Equaton n a convex polygon Te most mportant ellptc PDEs are te Laplace, te modfed Helmoltz and te Helmoltz equatons. Te Laplace equaton s u xx + u yy =. (5.) Te real and magnary parts of an
More informationCENTROID (AĞIRLIK MERKEZİ )
CENTOD (ĞLK MEKEZİ ) centrod s a geometrcal concept arsng from parallel forces. Tus, onl parallel forces possess a centrod. Centrod s tougt of as te pont were te wole wegt of a pscal od or sstem of partcles
More informationFinite Vector Space Representations Ross Bannister Data Assimilation Research Centre, Reading, UK Last updated: 2nd August 2003
Fnte Vector Space epresentatons oss Bannster Data Asslaton esearch Centre, eadng, UK ast updated: 2nd August 2003 Contents What s a lnear vector space?......... 1 About ths docuent............ 2 1. Orthogonal
More informationPHYS 705: Classical Mechanics. Newtonian Mechanics
1 PHYS 705: Classcal Mechancs Newtonan Mechancs Quck Revew of Newtonan Mechancs Basc Descrpton: -An dealzed pont partcle or a system of pont partcles n an nertal reference frame [Rgd bodes (ch. 5 later)]
More informationNumerical Methods. ME Mechanical Lab I. Mechanical Engineering ME Lab I
5 9 Mechancal Engneerng -.30 ME Lab I ME.30 Mechancal Lab I Numercal Methods Volt Sne Seres.5 0.5 SIN(X) 0 3 7 5 9 33 37 4 45 49 53 57 6 65 69 73 77 8 85 89 93 97 0-0.5 Normalzed Squared Functon - 0.07
More informationME 501A Seminar in Engineering Analysis Page 1
St Ssts o Ordar Drtal Equatos Novbr 7 St Ssts o Ordar Drtal Equatos Larr Cartto Mcacal Er 5A Sar Er Aalss Novbr 7 Outl Mr Rsults Rvw last class Stablt o urcal solutos Stp sz varato or rror cotrol Multstp
More informationRevision: December 13, E Main Suite D Pullman, WA (509) Voice and Fax
.9.1: AC power analyss Reson: Deceber 13, 010 15 E Man Sute D Pullan, WA 99163 (509 334 6306 Voce and Fax Oerew n chapter.9.0, we ntroduced soe basc quanttes relate to delery of power usng snusodal sgnals.
More informationMultipoint Analysis for Sibling Pairs. Biostatistics 666 Lecture 18
Multpont Analyss for Sblng ars Bostatstcs 666 Lecture 8 revously Lnkage analyss wth pars of ndvduals Non-paraetrc BS Methods Maxu Lkelhood BD Based Method ossble Trangle Constrant AS Methods Covered So
More information1 Review From Last Time
COS 5: Foundatons of Machne Learnng Rob Schapre Lecture #8 Scrbe: Monrul I Sharf Aprl 0, 2003 Revew Fro Last Te Last te, we were talkng about how to odel dstrbutons, and we had ths setup: Gven - exaples
More informationFinite Difference Method
7/0/07 Instructor r. Ramond Rump (9) 747 698 rcrump@utep.edu EE 337 Computatonal Electromagnetcs (CEM) Lecture #0 Fnte erence Method Lecture 0 These notes ma contan coprghted materal obtaned under ar use
More informationInfinite Length MMSE Decision Feedback Equalization
Infnte Lengt SE ecson Feedbac Equalzaton FE N * * Y F Z ' Z SS ˆ Y Q N b... Infnte-Lengt ecson Feedbac Equalzer as reoval ^ Y Z Feedforward Flter Feedbac Flter - Input to Slcer - Z Y Assung prevous decsons
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More information8 Derivation of Network Rate Equations from Single- Cell Conductance Equations
Physcs 178/278 - Davd Klenfeld - Wnter 2015 8 Dervaton of Network Rate Equatons from Sngle- Cell Conductance Equatons We consder a network of many neurons, each of whch obeys a set of conductancebased,
More informationA New Recursive Method for Solving State Equations Using Taylor Series
I J E E E C Internatonal Journal of Electrcal, Electroncs ISSN No. (Onlne) : 77-66 and Computer Engneerng 1(): -7(01) Specal Edton for Best Papers of Mcael Faraday IET Inda Summt-01, MFIIS-1 A New Recursve
More informationTrees and Order Conditions
Trees and Order Condtons Constructon of Runge-Kutta order condtons usng Butcher trees and seres. Paul Tranqull 1 1 Computatonal Scence Laboratory CSL) Department of Computer Scence Vrgna Tech. Trees and
More informationDigital Signal Processing
Dgtal Sgnal Processng Dscrete-tme System Analyss Manar Mohasen Offce: F8 Emal: manar.subh@ut.ac.r School of IT Engneerng Revew of Precedent Class Contnuous Sgnal The value of the sgnal s avalable over
More informationDepartment of Economics, Niigata Sangyo University, Niigata, Japan
Appled Matheatcs, 0, 5, 777-78 Publshed Onlne March 0 n ScRes. http://www.scrp.org/journal/a http://d.do.org/0.6/a.0.507 On Relatons between the General Recurrence Forula o the Etenson o Murase-Newton
More informationA new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
More informationThe Finite Element Method: A Short Introduction
Te Fnte Element Metod: A Sort ntroducton Wat s FEM? Te Fnte Element Metod (FEM) ntroduced by engneers n late 50 s and 60 s s a numercal tecnque for solvng problems wc are descrbed by Ordnary Dfferental
More informationCOMP th April, 2007 Clement Pang
COMP 540 12 th Aprl, 2007 Cleent Pang Boostng Cobnng weak classers Fts an Addtve Model Is essentally Forward Stagewse Addtve Modelng wth Exponental Loss Loss Functons Classcaton: Msclasscaton, Exponental,
More informationSE Story Shear Frame. Final Project. 2 Story Bending Beam. m 2. u 2. m 1. u 1. m 3. u 3 L 3. Given: L 1 L 2. EI ω 1 ω 2 Solve for m 2.
SE 8 Fnal Project Story Sear Frame Gven: EI ω ω Solve for Story Bendng Beam Gven: EI ω ω 3 Story Sear Frame Gven: L 3 EI ω ω ω 3 3 m 3 L 3 Solve for Solve for m 3 3 4 3 Story Bendng Beam Part : Determnng
More information8 Derivation of Network Rate Equations from Single- Cell Conductance Equations
Physcs 178/278 - Davd Klenfeld - Wnter 2019 8 Dervaton of Network Rate Equatons from Sngle- Cell Conductance Equatons Our goal to derve the form of the abstract quanttes n rate equatons, such as synaptc
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More information