4DVAR, according to the name, is a four-dimensional variational method.
|
|
- Archibald Adrian Hancock
- 6 years ago
- Views:
Transcription
1 4D-Varatonal Data Assmlaton (4D-Var) 4DVAR, accordng to the name, s a four-dmensonal varatonal method. 4D-Var s actually a drect generalzaton of 3D-Var to handle observatons that are dstrbuted n tme. The cost functon s the same, provded that the observaton operators are generalzed to nclude a forecast model that wll allow a comparson between the model state and the observatons at the approprate tme. 4D-Var seeks the ntal condton such that the forecast best fts the observatons wthn the assmlaton nterval.
2 Cost functon for 4DVAR f a Let x ( t) M x ( t ) represent the (nonlnear) model forecast that advances from the prevous analyss tme t to the current t. Assume the observatons dstrbuted wthn a tme nterval t, t n wll be used. The cost functon ncludes a term measurng the dstance to the background at the begnnng of the nterval, and a summaton over tme of the cost functon for each observatonal ncrement computed wth respect to the model ntegrated to the tme of the observaton: J( x( t )) ( x( t ) x ( t )) B ( x( t ) x ( t )) ( H( x ) y ) R ( H( x ) y ) (6.) N b T b o T o where N s the number of observatonal vectors o y dstrbuted over tme. The control varable (the varable wth respect to whch the cost functon s mnmzed) s the ntal state of the model at the begnnng of the tme nterval, x, whereas the analyss at the end of the nterval s gven by the model ntegraton from the soluton t M t n t x x. In ths sense, the model s used as a strong constrant,.e., the analyss soluton has to satsfy the model equatons.
3 In other words, 4D-Var seeks the ntal condton such that the forecast best fts the observatons wthn the assmlaton nterval. The fact that the 4D-Var method assumes a perfect model s a dsadvantage snce (for example) t wll gve the same credence to older observatons at the begnnng of the nterval as to newer observatons at the end of the nterval. 3
4 The 4DVAR tres to use all observatons n the assmlaton tme nterval as well as possble. The followng s an example of how nformaton s propagated n tme by a smple advecton model, so that the observatons can be compared wth the frst guess. 4
5 A varaton n the cost functon when the control varable t x s changed by a small amount x ( t) s gven by J J J J J J[ x( t) x( t)] J ( x( t) x x... xn x( t) x x xn x( t) T (6.) J J where the gradent of the cost functon x( t) x j( t) j s a column vector. Iteratve mnmzaton schemes requre the estmaton of the cost functon gradent w.r.t. control varables. Smlar to the 3DVAR case, the steepest descent method s the smplest scheme n whch the change n the J control varable after each teraton s chosen to be opposte to the gradent x( t) J. x( t ) x( t ) Other, more effcent methods, such as conjugate gradent or quas-newton also requre the use of the gradent. To solve ths mnmzaton problem effcently, we need to be able to compute the gradent of J wth respect to the elements of the control varable. 5
6 Calculaton of the gradent of 4DVAR cost functon As we saw earler, gven a symmetrc matrx A and a functonal T J x Ax, the gradent s gven by J x Ax. If T J y Ay, and y y( x ), then (by applyng the chan rule) J x y x T Ay (6.3) where y x kl, y x k l s a matrx. We can wrte (6.) as J Jb Jo, and from the rules dscussed above, the gradent of the background component of the cost functon ( ( ) b ( )) T ( ( ) b Jb x t x t B x t x ( t )) wth respect to xt s gven by J b x( t ) B ( x( t ) x ( t )). (6.4) b Ths s the same as n the 3DVAR case. 6
7 Before we proceed to determne the gradent of the observaton term, let s frst defne Tangent Lnear Model and Its Adjont. A lnear tangent model (or tangent lnear model, TLM as t s often called) s obtaned by lnearzng the model about the nonlnear trajectory of the model between t and t, so that f we ntroduce a perturbaton n the ntal condtons, the fnal perturbaton s gven by x( t ) x( t ) M x( t ) x( t ) M x( t ) L x( t ) O( x ) (6.5) The lnear tangent model L s a matrx that transforms an small ntal perturbaton at t to the fnal perturbaton at t. The TLM equaton s then x( t ) L x ( t ). u u For example, the nonlnear advecton u s ntegrated usng the forward-n-tme centered-n-space fnte t x dfference scheme (ths scheme s actually computatonally unstable t s gven here for llustraton purpose only), n n t n n n u u u ( u u ). x The TLM model for perturbaton u s (neglectng the hgh order nonlnear term) t u u u ( u u ) u ( u u ) u u ( u u ) u u u x n n n n n n n n n n n n n n n 7
8 where t. Therefore x n n n n n u ( u u ) u u n n n n n n n u u ( u3 u ) u3 u n u Lnu. n n n n n un un ( un un ) un n n ( u L u, therefore n u L u L L u L L L u ) n n n n n n n n If there are several steps n a tme nterval t -t, the tangent lnear model that advances a perturbaton from t to t s gven by the product of the tangent lnear model matrces that advance t over each step: L ( t, t ) L ( t, t ) L L L... L. (6.6) j j j j j The adjont model, defned as the transpose of the lnearzed forward model, s gven by T T T T T T j j j j j L ( t, t ) L ( t, t ) L L L... L. (6.7) Eq. (6.7) shows that the adjont model advances a perturbaton backwards n tme, from the fnal to the ntal tme, because the rght most L T n the equaton s that of the fnal tme nterval (from t to t ) and the left most L T s that of the frst tme nterval (from t to t ) and matrx product s evaluated n the rght-to-left order. 8
9 9 Revew of matrx calculus The dervatves of vector functons Let x, y, z be vectors of lengths n, m and l, respectvely:, n x x x x n y y y y,. l z z z z Dervatve of a Scalar wth Respect to Vector If y s a scalar, n y x y y x y x x.
10 Dervatve of Vector wth Respect to Scalar If x s a scalar, y y y ym x x x x The dervatve of the vector y wth respect to vector x s a n m matrx: y y ym x x x y y ym y x x x x y y ym xn xn x n.. h s the chan rule for the dervatve of a vector wth respect to a vector.
11 When z = z(y(x)), the dervatve of the vector z wth respect to vector x z z z y y y z z z x x x n y x y x y x z z z z y z y z y z x x x y x y x y x x z z z z y z y z y x x x n y x y x y x m m m n m m m n n m m m l l l l l z z z y y y y y y x x x m n l l l m m m y y y m x x x n n z z z y y y y y y m x x x z y n y x. z z z y y y Therefore, z z y x y x, whch s the chan rule for the dervatve of a vector wth respect to a vector.
12 Defntons that are not consstent wth our equatons: When z = z(y(x)), the dervatve of the vector z wth respect to vector x z z z z y z y z y l x y x y x y x x x z z z z y z y z y z x x x y x y x y x x z z z z y z y z y xn xn xn y x y x y x m m m l m m m l l m m m l y y ym z z zl x x x y y y m l xn xn xn ym ym ym n n n y y ym z z zl x x x y y y y z x y. y y y z z z
13 The gradent of the observatonal term n the cost functon, J H H N o T o o ( ( x ) y ) R ( ( x ) y ) s more complcated because x M( x ( t)). If we ntroduce a perturbaton to the ntal state, thenx L( t, t) x, so that o ( H( x ) y ) H M H x H L( t, t ) H L( t, t ) x( t ) x x x x j j j (6.8) As ndcated by (6.8), the matrces H and L are the lnearzed Jacobans, H x M and x, respectvely. Therefore the gradent of the observaton cost functon s gven by (remember J o xt N L H R x y T T o ( t, t) ( H( ) ) J x y x T Ay ) (6.9) Equaton (6.9) shows that every teraton of the 4D-Var mnmzaton requres the computaton of the gradent,.e., o computng the ncrements ( H( x) y ) at the observaton tmes t durng a forward ntegraton, multplyng them T by HR and ntegratng these weghted ncrements back to the ntal tme usng the adjont model. 3
14 Denote T ( ( ) o ) T d H R H x y H R d whch we call the weghted observatonal ncrement for observatons at tme t. Snce parts of the backward adjont ntegraton are common to several tme ntervals, the summaton n (6.9) can be arranged more convenently: J o xt N N T T T T L( t, t) d LL... L d d L d... L L... L d L L... L d T T T T T T T d L ( d L ( d... L ( d L d ))) T T T T Assume, for example that the nterval of assmlaton s from Z to Z, and that there are observatons every 3 hours (Fg. 5.6) L T L T L T L T 3 d d d d 3 d 4 Fgure: Schematc of the computaton of the gradent of the observatonal cost functon for a perod of hours, observatons every 3 hours and the adjont model that ntegrates backwards wthn each nterval. 4
15 Procedure of 4DVAR mnmzaton ) Frst ntegrate the (nonlnear) forward model and save the nonlnear trajectory (.e., model state at every tme T step) n the assmlaton wndow. Ths 4D state s needed for defnng L and for calculatng the observatonal ncrements (ths nonlnear trajectory plays the role of x b n the observaton term of 3DVAR). ) Compute the weghted negatve observaton ncrements d H R ( H( x ) y ) H R d. T o T T T 3) The adjont model L ( t, t ) L appled on a vector advances t from t to t. In our case, ths vector s d or the combnaton of d s at tmes later than t. Ths vector s the adjont varable that the adjont equaton advances. Jo T T T T 4) Then we can wrte (6.9) as d L( d L ( d... L( d L d))) x (6.) 5) From (6.4) plus (6.) we obtan the gradent of the cost functon, and the mnmzaton algorthm s then called to modfy approprately control varable x ( t). 6) After ths change, a new forward ntegraton and new observatonal ncrements are computed and the process s repeated untl convergence. Therefore, each mnmzaton teraton nvolves one forward ntegraton of the nonlnear predcton model and one backward ntegraton of the adjont model. Because everythng n the adjont model s reversed n order, and the defnton of the adjont operator requres the value of the varables n the forward model (even wthn the ndvdual steps of a sngle tme step), many recalculatons are often nvolved n order to restore the values of these varables (unless they are saved durng the forward ntegraton step), the adjont model s often -3 tmes as expensve as the forward model. But stll, only one ntegraton s needed nstead of N of them as Eq. (6.9) mght suggest. Ths s so because of the lnear nature of Eq. (6.9). 5
16 6
17 Incremental Form of 4DVAR 4D-Var can also be wrtten n an ncremental form wth the cost functon defned by J( x ) ( x ) B ( x ) H L( t, t ) x d ) R H L( t, t ) x d ) (6.) N T o T o and the observatonal ncrement s defned as d o y o H( x f ( t )). Because H ( x ) H( x ) H( x ) x H( x ) H L( t, t ) x x( t) whch s plugged nto (6.) to gve (6.). Wthn the ncremental formulaton, t s possble to choose a smplfcaton operator that solves the problem of mnmzaton n a lower dmensonal space for w than that of the orgnal model varables x : w Sx S s meant to be rank defcent (as would be the case, for example, f a lower resoluton spectral truncaton or a low-resoluton grd was used for w than for x ). In the latter case, w can be x at every other grd pont, n ths case, w s a vector that about ¼ the length of x. 7
18 After the mnmum of the problem s obtaned for J( w ), b g x I x S w and a new outer teraton at the full I model resoluton can be carred out (Lorenc 997). Here the nverson operator S can be spatal nterpolaton from the coarser resoluton grd of w to the hgher-resoluton grd of x. In essence, the grdded felds assocated wth the hgh-resoluton trajectory s frst nterpolated to a coarser resoluton grd, then a cost functon defned on ths coarse grd s mnmzed usng an teratve mnmzaton algorthm that nvolves forward and backward ntegraton for the TLM and adjont models n every teraton. When an analyss ncrement s found that mnmzes ths cost functon, t s nterpolated to the hgher-resoluton grd and added to the ntal condton estmate of the prevous outer teraton. Startng from ths updated ntal condton, a nonlnear forward ntegraton s performed on the hgh resoluton grd to produce a more accurate nonlnear trajectory. Ths trajectory s agan nterpolated to the coarse resoluton grd, the nonlnear model s lnearzed around ths new trajectory to obtan the more accurate TLM and adjont models. Another outer teraton loop, that contnues the mnmzaton 'nner loops' then begns. The teraton process can also be accelerated through the use of precondtonng, a change of control varables that makes the cost functon more sphercal, and therefore each teraton can get closer to the center (mnmum) of the cost functon (e.g., Parrsh and Derber 99; Lorenc 997). 8
19 4DVAR versus 3D analyss methods (3DVAR, IO) When compared to a 3-D analyss algorthm n a sequental assmlaton system, the (strong-constrant) 4D-Var has the followng characterstcs: t works under the assumpton that the model s perfect. Problems can be expected f model errors are large. t requres the mplementaton of the rather specal lot of work f the forecast model s complex. T L operators, the so-called adjont model. Ths can be a n a real-tme system t requres the assmlaton to wat for the observatons over the whole 4D-Var tme nterval to be avalable before the analyss procedure can begn, whereas sequental systems can process observatons shortly after they are avalable. Ths can delay the avalablty of analyss. x a s used as the ntal state for a forecast, then by constructon of 4D-Var one s sure that the forecast wll be completely consstent wth the model equatons and the four-dmensonal dstrbuton of observatons untl the end of the 4D-Var tme nterval (the cut off tme). Ths makes ntermttent 4D-Var a very sutable system for numercal forecastng. (standard strong-constrant) 4D-Var s an optmal (subjectng to a number of assumptons) and relatvely effcent (relatve to e.g., tradtonal Kalman flter or weak-constrant 4DVAR) assmlaton algorthm over ts tme perod thanks to a theorem that says that The evaluaton of the 4D-Var observaton cost functon and ts gradent, J( x ) and J ( x ), requres one drect model ntegraton from tmes t to t n and one sutably modfed adjont ntegraton made of transposes of the tangent lnear model tme-steppng operators M.. In fact t s the applcaton of ths procedure that made 4DVAR practcal. 9
20 4DVAR versus Kalman flter The most mportant advantage of 4D-Var s that f we assume that the model s perfect, and that the a pror error covarance at the ntal tme B s correct, t can be shown that the 4D-Var analyss at the fnal tme s dentcal to that of the extended Kalman Flter (Lorenc, 986, Daley, 99). Ths means that mplctly 4D-Var s able to evolve the forecast error covarance from B to the fnal tme (because Kalman flter explctly evolves B). Unfortunately, ths mplct covarance s not avalable at the end of the cycle, and nether s the new analyss error covarance. In other words, 4D-Var s able to fnd the BLUE (Best Lnear Unbased Estmate) but not ts error covarance. To mtgate ths problem, a smplfed Kalman Flter algorthm has been proposed to estmate the evoluton of the analyss errors n the subspace of the dynamcally most unstable modes (Fsher and Courter, 995, Cohn and Todlng, 996). 4DVAR s much cheaper than the conventonal Kalman Flter. 4DVAR s, however, comparable n cost to ensemble-based Kalman flter, whch uses a forecast ensemble to estmate the evolvng forecast error covarance.
CHAPTER 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 informationSome Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)
Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998
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 informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
More informationTime-Varying Systems and Computations Lecture 6
Tme-Varyng Systems and Computatons Lecture 6 Klaus Depold 14. Januar 2014 The Kalman Flter The Kalman estmaton flter attempts to estmate the actual state of an unknown dscrete dynamcal system, gven nosy
More informationPHYS 705: Classical Mechanics. Calculus of Variations II
1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary
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 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 informationVector Norms. Chapter 7 Iterative Techniques in Matrix Algebra. Cauchy-Bunyakovsky-Schwarz Inequality for Sums. Distances. Convergence.
Vector Norms Chapter 7 Iteratve Technques n Matrx Algebra Per-Olof Persson persson@berkeley.edu Department of Mathematcs Unversty of Calforna, Berkeley Math 128B Numercal Analyss Defnton A vector norm
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
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 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 informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16
STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus
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 informationSIO 224. m(r) =(ρ(r),k s (r),µ(r))
SIO 224 1. A bref look at resoluton analyss Here s some background for the Masters and Gubbns resoluton paper. Global Earth models are usually found teratvely by assumng a startng model and fndng small
More informationFeature Selection: Part 1
CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More information10-701/ Machine Learning, Fall 2005 Homework 3
10-701/15-781 Machne Learnng, Fall 2005 Homework 3 Out: 10/20/05 Due: begnnng of the class 11/01/05 Instructons Contact questons-10701@autonlaborg for queston Problem 1 Regresson and Cross-valdaton [40
More informationSingular Value Decomposition: Theory and Applications
Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real
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 informationInexact Newton Methods for Inverse Eigenvalue Problems
Inexact Newton Methods for Inverse Egenvalue Problems Zheng-jan Ba Abstract In ths paper, we survey some of the latest development n usng nexact Newton-lke methods for solvng nverse egenvalue problems.
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 informationCIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M
CIS56: achne Learnng Lecture 3 (Sept 6, 003) Preparaton help: Xaoyng Huang Lnear Regresson Lnear regresson can be represented by a functonal form: f(; θ) = θ 0 0 +θ + + θ = θ = 0 ote: 0 s a dummy attrbute
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 informationFinite Element Modelling of truss/cable structures
Pet Schreurs Endhoven Unversty of echnology Department of Mechancal Engneerng Materals echnology November 3, 214 Fnte Element Modellng of truss/cable structures 1 Fnte Element Analyss of prestressed structures
More information4DVAR, according to the name, is a four-dimensional variational method.
4D-Varatnal Data Assmlatn (4D-Var) 4DVAR, accrdng t the name, s a fur-dmensnal varatnal methd. 4D-Var s actually a smple generalzatn f 3D-Var fr bservatns that are dstrbuted n tme. he equatns are the same,
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
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 informationHandout # 6 (MEEN 617) Numerical Integration to Find Time Response of SDOF mechanical system. and write EOM (1) as two first-order Eqs.
Handout # 6 (MEEN 67) Numercal Integraton to Fnd Tme Response of SDOF mechancal system State Space Method The EOM for a lnear system s M X + DX + K X = F() t () t = X = X X = X = V wth ntal condtons, at
More informationInductance Calculation for Conductors of Arbitrary Shape
CRYO/02/028 Aprl 5, 2002 Inductance Calculaton for Conductors of Arbtrary Shape L. Bottura Dstrbuton: Internal Summary In ths note we descrbe a method for the numercal calculaton of nductances among conductors
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationFeb 14: Spatial analysis of data fields
Feb 4: Spatal analyss of data felds Mappng rregularly sampled data onto a regular grd Many analyss technques for geophyscal data requre the data be located at regular ntervals n space and/or tme. hs s
More information1 Convex Optimization
Convex Optmzaton We wll consder convex optmzaton problems. Namely, mnmzaton problems where the objectve s convex (we assume no constrants for now). Such problems often arse n machne learnng. For example,
More information1 Derivation of Point-to-Plane Minimization
1 Dervaton of Pont-to-Plane Mnmzaton Consder the Chen-Medon (pont-to-plane) framework for ICP. Assume we have a collecton of ponts (p, q ) wth normals n. We want to determne the optmal rotaton and translaton
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 informationWeek3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity
Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle
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 informationVARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES
VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue
More informationChapter - 2. Distribution System Power Flow Analysis
Chapter - 2 Dstrbuton System Power Flow Analyss CHAPTER - 2 Radal Dstrbuton System Load Flow 2.1 Introducton Load flow s an mportant tool [66] for analyzng electrcal power system network performance. Load
More informationSalmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2
Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationClassification as a Regression Problem
Target varable y C C, C,, ; Classfcaton as a Regresson Problem { }, 3 L C K To treat classfcaton as a regresson problem we should transform the target y nto numercal values; The choce of numercal class
More informationPrimer on High-Order Moment Estimators
Prmer on Hgh-Order Moment Estmators Ton M. Whted July 2007 The Errors-n-Varables Model We wll start wth the classcal EIV for one msmeasured regressor. The general case s n Erckson and Whted Econometrc
More informationMarkov Chain Monte Carlo Lecture 6
where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationHidden Markov Models & The Multivariate Gaussian (10/26/04)
CS281A/Stat241A: Statstcal Learnng Theory Hdden Markov Models & The Multvarate Gaussan (10/26/04) Lecturer: Mchael I. Jordan Scrbes: Jonathan W. Hu 1 Hdden Markov Models As a bref revew, hdden Markov models
More informationAdditional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty
Addtonal Codes usng Fnte Dfference Method Benamn Moll 1 HJB Equaton for Consumpton-Savng Problem Wthout Uncertanty Before consderng the case wth stochastc ncome n http://www.prnceton.edu/~moll/ HACTproect/HACT_Numercal_Appendx.pdf,
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationChapter 3 Describing Data Using Numerical Measures
Chapter 3 Student Lecture Notes 3-1 Chapter 3 Descrbng Data Usng Numercal Measures Fall 2006 Fundamentals of Busness Statstcs 1 Chapter Goals To establsh the usefulness of summary measures of data. The
More informationLecture Note 3. Eshelby s Inclusion II
ME340B Elastcty of Mcroscopc Structures Stanford Unversty Wnter 004 Lecture Note 3. Eshelby s Incluson II Chrs Wenberger and We Ca c All rghts reserved January 6, 004 Contents 1 Incluson energy n an nfnte
More informationPhysics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1
P. Guterrez Physcs 5153 Classcal Mechancs D Alembert s Prncple and The Lagrangan 1 Introducton The prncple of vrtual work provdes a method of solvng problems of statc equlbrum wthout havng to consder the
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationECONOMICS 351*-A Mid-Term Exam -- Fall Term 2000 Page 1 of 13 pages. QUEEN'S UNIVERSITY AT KINGSTON Department of Economics
ECOOMICS 35*-A Md-Term Exam -- Fall Term 000 Page of 3 pages QUEE'S UIVERSITY AT KIGSTO Department of Economcs ECOOMICS 35* - Secton A Introductory Econometrcs Fall Term 000 MID-TERM EAM ASWERS MG Abbott
More informationEEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming
EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationWeek 5: Neural Networks
Week 5: Neural Networks Instructor: Sergey Levne Neural Networks Summary In the prevous lecture, we saw how we can construct neural networks by extendng logstc regresson. Neural networks consst of multple
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationParametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010
Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Survey Workng Group Semnar March 29, 2010 1 Outlne Introducton Proposed method Fractonal mputaton Approxmaton Varance estmaton Multple mputaton
More informationFall 2012 Analysis of Experimental Measurements B. Eisenstein/rev. S. Errede
Fall 0 Analyss of Expermental easurements B. Esensten/rev. S. Errede We now reformulate the lnear Least Squares ethod n more general terms, sutable for (eventually extendng to the non-lnear case, and also
More informationSome modelling aspects for the Matlab implementation of MMA
Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton
More informationTracking with Kalman Filter
Trackng wth Kalman Flter Scott T. Acton Vrgna Image and Vdeo Analyss (VIVA), Charles L. Brown Department of Electrcal and Computer Engneerng Department of Bomedcal Engneerng Unversty of Vrgna, Charlottesvlle,
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationReport on Image warping
Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.
More information2016 Wiley. Study Session 2: Ethical and Professional Standards Application
6 Wley Study Sesson : Ethcal and Professonal Standards Applcaton LESSON : CORRECTION ANALYSIS Readng 9: Correlaton and Regresson LOS 9a: Calculate and nterpret a sample covarance and a sample correlaton
More informationBézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0
Bézer curves Mchael S. Floater September 1, 215 These notes provde an ntroducton to Bézer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of
More informationNovember 5, 2002 SE 180: Earthquake Engineering SE 180. Final Project
SE 8 Fnal Project Story Shear Frame u m Gven: u m L L m L L EI ω ω Solve for m Story Bendng Beam u u m L m L Gven: m L L EI ω ω Solve for m 3 3 Story Shear Frame u 3 m 3 Gven: L 3 m m L L L 3 EI ω ω ω
More informationHomework Notes Week 7
Homework Notes Week 7 Math 4 Sprng 4 #4 (a Complete the proof n example 5 that s an nner product (the Frobenus nner product on M n n (F In the example propertes (a and (d have already been verfed so we
More informationErratum: A Generalized Path Integral Control Approach to Reinforcement Learning
Journal of Machne Learnng Research 00-9 Submtted /0; Publshed 7/ Erratum: A Generalzed Path Integral Control Approach to Renforcement Learnng Evangelos ATheodorou Jonas Buchl Stefan Schaal Department of
More informationEstimation: Part 2. Chapter GREG estimation
Chapter 9 Estmaton: Part 2 9. GREG estmaton In Chapter 8, we have seen that the regresson estmator s an effcent estmator when there s a lnear relatonshp between y and x. In ths chapter, we generalzed the
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 informationDesign and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm
Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:
More informationRELIABILITY ASSESSMENT
CHAPTER Rsk Analyss n Engneerng and Economcs RELIABILITY ASSESSMENT A. J. Clark School of Engneerng Department of Cvl and Envronmental Engneerng 4a CHAPMAN HALL/CRC Rsk Analyss for Engneerng Department
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 informationELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM
ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM An elastc wave s a deformaton of the body that travels throughout the body n all drectons. We can examne the deformaton over a perod of tme by fxng our look
More informationHidden Markov Models
Hdden Markov Models Namrata Vaswan, Iowa State Unversty Aprl 24, 204 Hdden Markov Model Defntons and Examples Defntons:. A hdden Markov model (HMM) refers to a set of hdden states X 0, X,..., X t,...,
More informationSolution of the Navier-Stokes Equations
Numercal Flud Mechancs Fall 2011 Lecture 25 REVIEW Lecture 24: Soluton of the Naver-Stokes Equatons Dscretzaton of the convectve and vscous terms Dscretzaton of the pressure term Conservaton prncples Momentum
More informationIV. Performance Optimization
IV. Performance Optmzaton A. Steepest descent algorthm defnton how to set up bounds on learnng rate mnmzaton n a lne (varyng learnng rate) momentum learnng examples B. Newton s method defnton Gauss-Newton
More informationOn a direct solver for linear least squares problems
ISSN 2066-6594 Ann. Acad. Rom. Sc. Ser. Math. Appl. Vol. 8, No. 2/2016 On a drect solver for lnear least squares problems Constantn Popa Abstract The Null Space (NS) algorthm s a drect solver for lnear
More information2 Finite difference basics
Numersche Methoden 1, WS 11/12 B.J.P. Kaus 2 Fnte dfference bascs Consder the one- The bascs of the fnte dfference method are best understood wth an example. dmensonal transent heat conducton equaton T
More informationx = , so that calculated
Stat 4, secton Sngle Factor ANOVA notes by Tm Plachowsk n chapter 8 we conducted hypothess tests n whch we compared a sngle sample s mean or proporton to some hypotheszed value Chapter 9 expanded ths to
More informationOne-sided finite-difference approximations suitable for use with Richardson extrapolation
Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,
More informationMathematical Preparations
1 Introducton Mathematcal Preparatons The theory of relatvty was developed to explan experments whch studed the propagaton of electromagnetc radaton n movng coordnate systems. Wthn expermental error the
More informationRadar Trackers. Study Guide. All chapters, problems, examples and page numbers refer to Applied Optimal Estimation, A. Gelb, Ed.
Radar rackers Study Gude All chapters, problems, examples and page numbers refer to Appled Optmal Estmaton, A. Gelb, Ed. Chapter Example.0- Problem Statement wo sensors Each has a sngle nose measurement
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
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 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 information18.1 Introduction and Recap
CS787: Advanced Algorthms Scrbe: Pryananda Shenoy and Shjn Kong Lecturer: Shuch Chawla Topc: Streamng Algorthmscontnued) Date: 0/26/2007 We contnue talng about streamng algorthms n ths lecture, ncludng
More informationThe optimal delay of the second test is therefore approximately 210 hours earlier than =2.
THE IEC 61508 FORMULAS 223 The optmal delay of the second test s therefore approxmately 210 hours earler than =2. 8.4 The IEC 61508 Formulas IEC 61508-6 provdes approxmaton formulas for the PF for smple
More information3D Estimates of Analysis and Short-Range Forecast Error Variances
3D Estmates of Analyss and Short-Range Forecast Error Varances Je Feng, Zoltan Toth Global Systems Dvson, ESRL/OAR/NOAA, Boulder, CO, USA Malaquas Peña Envronmental Modelng Center, NCEP/NWS/NOAA, College
More information= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.
Chapter Matlab Exercses Chapter Matlab Exercses. Consder the lnear system of Example n Secton.. x x x y z y y z (a) Use the MATLAB command rref to solve the system. (b) Let A be the coeffcent matrx and
More informationOutline and Reading. Dynamic Programming. Dynamic Programming revealed. Computing Fibonacci. The General Dynamic Programming Technique
Outlne and Readng Dynamc Programmng The General Technque ( 5.3.2) -1 Knapsac Problem ( 5.3.3) Matrx Chan-Product ( 5.3.1) Dynamc Programmng verson 1.4 1 Dynamc Programmng verson 1.4 2 Dynamc Programmng
More informationSecond Order Analysis
Second Order Analyss In the prevous classes we looked at a method that determnes the load correspondng to a state of bfurcaton equlbrum of a perfect frame by egenvalye analyss The system was assumed to
More informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 31 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 6. Rdge regresson The OLSE s the best lnear unbased
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationFTCS Solution to the Heat Equation
FTCS Soluton to the Heat Equaton ME 448/548 Notes Gerald Recktenwald Portland State Unversty Department of Mechancal Engneerng gerry@pdx.edu ME 448/548: FTCS Soluton to the Heat Equaton Overvew 1. Use
More informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
More information