Extensions and Variations on the Kalman Filter
|
|
- Jonathan Crawford
- 7 years ago
- Views:
Transcription
1 Extensions and Variations on the Kalman Filter The Information Filter - rewriting the KF recursion in terms of Based on the Matrix Inversion Lemma/Woodbury-Sherman-Morrison formula Liewise (A + BD 1 C) 1 = A 1 A 1 B(D + CA 1 B) 1 CA 1 with: A = P 1, B = H T, C = H, D = R = 1 + HT R 1 H, is equivalent to This yields either = Q 1 Q 1 F ( + F T Q 1 or a Riccati Difference Equation for P = P 1 P 1 H T (H P 1 H T + R ) 1 H P 1 P +1 = F P F T + Q, is equivalent to +1 = Q 1 Q 1 F ( + F T Q 1 F ) 1 F T Q 1 P +1 = F [P + F 1 Q F T ]F T, is equivalent to +1 = F 1 F T F 1 F T Q 1/2 [I + Q 1/2 F 1 F T Q 1/2 ] 1 Q 1/2 F 1 F T = F 1 F T F 1 F T Q 1/2 [I + Q 1/2 F 1 F T F ) 1 F T Q 1 Q 1/2 ] 1 Q 1/2 F 1 + H T R 1 H F T + H T R 1 1 H
2 The Information Filter continued The information filter uses the WSM-formula to write a recursion for the information matrix - the inverse of the filtered error covariance The Kalman filter gain has a formulation in terms of the information matrix L = P 1 H T (H P 1 H T + R ) 1 1 = H T R 1 The information filter has a number of applications Handling the case where the initial condition has infinite covariance but still has structure Handling multiple measurements in a single time period Dealing with some numerical issue connected with matrix inversion It is really useful for proving things and captures the idea of information as being the converse of covariance 2
3 Correlated Process and Measurement Noises So far, we have assumed that the noises {w} and {v} were zero-mean, white and mutually uncorrelated - independent since gaussian What should we do if they are correlated but still white? E[w ]=0, E[w w T ]=Q δ,, E[v ]=0, E[v v T ]=R δ,, E[w v T ]=M δ j, Run a modified (but similar) set of recursions ˆx = ˆx +1 + P +1 H T +1(H +1 P +1 H T +1 + R +1 ) 1 (y +1 H +1ˆx +1 ) P = P +1 P +1 H T +1(H +1 P +1 H T +1 + R +1 ) 1 H +1 P +1 ˆx +1 = (F M R 1 P +1 = (F M R 1 H )ˆx + G u + M R 1 y H )P (F M R 1 Accommodates the correlation How is this proven? Homewor! H ) T + Q M R 1 M T There is a need for care as to whether v-1 (Simon) or v (A&M) is correlated with w You get different answers none mysterious 3
4 Correlated Noises continued Why is this important? Some signal models come this way, e.g. AR, ARX, ARMA, etc y + a 1 y 1 + a 2 y a n y n = w State-variable realization x T = y 1 T y 2 T... y n T a 1 a 2... a n 1 a n I x +1 = 0 I I 0 x + I w y = a 1 a 2... a n 1 a n x + w 4
5 Colored Process and Measurement Noises Colored means non-white means correlated over time [Recall our Kalman filtering is done with second-order statistics only] We need to understand how the noise is correlated Equivalent sets of information Correlation function of the noise Spectrum of the noise State-variable realization Φ ww,vv (ω) R w,v (τ) ζ +1 = A ζ + p η +1 = A η + r w = C ζ + q v = C η + s p,q,r,s mutually independent white gaussian with nown covariances P, Q, R, S x +1 = F x + Gu + w y = H x + Ju + v 5
6 Colored Noises Continued x +1 = F x + Gu + w ζ +1 = A ζ + p η +1 = A η + r y = H x + Ju + v w = C ζ + q v = C η + s Aha! ζ +1 A 0 0 ζ 0 I 0 0 x +1 = C F 0 x + G u + 0 I 0 η A η I y = ζ 0 H C x + J u + s η This is a regular Kalman filtering problem with an augmented state p q r Computing the state estimates C ˆζ 1, C ˆη 1 ˆζ 1, ˆη 1 yields via the predictable parts of the noises The innovations are white remember This is a really important aspect of Kalman filtering Somebody needs to be able to describe the signal and the noise and how to tell the two apart Go on! Chec the observability and stabilizability properties 6
7 The Steady-State Kalman filter The Riccati difference equation (RDE) P +1 = F P 1 F T F P 1 H T (H P 1 H T + R ) 1 H P 1 F T + Q The Lyapunov form of the RDE P +1 = (F K H )P 1 (F K H ) T + K R K T + Q The Kalman predictor error equation x +1 = (F K H ) x 1 K v + w We expect the error equation to be stable provide P 1 > 0 and [F K H,Q + K R K T ] is uniformly controllable This follows in the time-invariant case if R>0 and [F, Q] has no uncontrollable modes on the unit circle But, if F K H is uniformly (exponentially) stable then the RDE must also be (doubly) stable 7
8 For the LTI system Steady-state Kalman filtering continued x +1 = Fx + Gu + w Q = Q, R = R y = Hx + Ju + v The Kalman filter is time-varying because of P 0 1, ˆx 0 1 But as The limiting Kalman predictor covariance satisfies P 1 P P P + K K P = FP F T FP H T (HP H T + R) 1 HP F T + Q This is the discrete Algebraic Riccati Equation ([d]are) K = FP H T (HP H T + R) 1 L = P H T (HP H T + R) 1 The steady-state Kalman predictor is ˆx +1 = (F K H)ˆx 1 + K y This is a linear, time-invariant observer The steady-state Kalman filter is ˆx = (I L H)F ˆx + L y +1 8
9 Copied from Simon copied from me and MAP Theorem 23 (p.196) The DARE has a unique positive semidefinite solution if and only if (i) [F,H] is detectable, and (ii) [F-MR -1 H,Q] is stabilizable The corresponding steady state Kalman Filter is exponentially stable Theorem 24 (pp ) The DARE has at least one positive semidefinite solution if and only if (i) [F,H] is detectable, and (ii) [F-MR -1 H,Q] is controllable on the unit circle Exactly one of these solutions results in a stable s.s. Kalman Filter Theorem 25 (p.197) The DARE has at least one positive semidefinite solution if and only if (i) [F,H] is detectable, and (ii) [F-MR -1 H,Q] is controllable on and inside the unit circle Exactly one of these solutions results in a stable s.s. Kalman Filter 9
10 An unstable system with Q=0, R=1 A Really Simple ARE Example x +1 = 2x y = x + v [F,H] = [2,1] is clearly observable and therefore detectable [F,Q] = [2,0] is not stabilizable but its uncontrollable mode is at 2 ARE p = 2 p 2 2p(p + 1) 1 2p +0 p 2 + p = 4p p 2 3p = 0 = 4p 4p2 p +1 = 4p2 +4p 4p 2 p +1 p = 0, 3 Two nonnegative solutions Two Kalman predictors = 2p p +1 =0, 3/2 ˆx +1 = 2ˆx 1 ˆx +1 = (2 3/2)ˆx 1 +3/2 y 10
11 The Hamiltonian (Symplectic) Approach to steady-state KF Real matrix H is Hamiltonian if If H is Hamiltonian and! is an eigenvalue of H then -! is also an eigenvalue Real matrix S is symplectic if If S is symplectic and! is an eigenvalue of S then! -1 is also an eigenvalue The 2n x 2n Hamiltonian matrix is symplectic H = F T QF T JH = H T J T, J = S T JS = J, J = 0 In I n 0 0 In I n 0 F T H T R 1 H F + QF T H T R 1 H 2n n Ψ12 Ψ 22 Suppose H has no eigenvalues on the unit circle Select n eigenvalues and corresponding eigenvectors of H The matrix P = Ψ 22 Ψ 1 12 satisfies the ARE The closed-loop KP eigenvalues are at the n values chosen There are 2n n solutions and one (the maximal one) stabilizes Matlab uses the QZ generalized eigenvalue algorithm to solve AREs 11
12 History (à la Simon) The Continuous-time Kalman filter Follin, Carlton, Hanson, Bucy developed continuous-time KF in late 1950s Kalman independently developed discrete time KF in 1960 Kalman and Bucy published the continuous KF in 1961 Hence, the Kalman-Bucy filter Continuous-time stochastic linear system Itô stochastic calculus wt and vt are standard Brownian motions of intensity I x t x s = t s A τ x τ dτ + t The special calculus is to eep xt Marovian s dx t = A t x t dt + B t u t dt + Q 1 2 t dw t dy t = C t x t dt + R 1 2 t dv t B τ u τ dτ + There is a need for technical care with continuous-time white noise processes E[dw t dwt T ]=Idt t s Q 1 2 τ dw τ For bandlimited noise processes Itô and regular calculus coincide 12
13 Continuous-time Kalman filter continued Linear time-varying gaussian stochastic system dx t = A t x t dt + B t u t dt + Q 1 2 t dw t dy t = C t x t dt + R 1 2 t dv t dyt dt ẋ t = A t x t + B t u t + Q 1 2 t w t =ȳ t = C t x t + R 1 2 t v t Linear continuous-time observer format with a special choice of gain ˆx 0 = E[x 0 ] P 0 = E (x 0 ˆx 0 )(x 0 ˆx 0 ) T K t = P t Ct T Rt 1 ˆx t = (A t K t C t )ˆx t + B t u t + K t ȳ t dˆx t = (A t K t C t )ˆx t dt + B t u t dt + K t dy t P t = A t P t + P t A T t P t Ht T R 1 H h P t + Q t Pt is still the estimate covariance t It is permissible in practice to use regular calculus Notice there is no difference between KP and KF 13
14 Variations on the continuous-time Kalman filter Correlated noises Kalman filter Colored process and/or measurement noise processes - augment the state The steady-state continuous-time Kalman filter A, C, Q, R constant Pt! constant The continuous ARE Hamiltonian E[w t w T ]=Iδ t, E[v t v T ]=Iδ t, E[w t v T ]=Mδ t P = AP + PA T + Q KRK T K = (PC T + M)R 1 ˆx = (A KC)ˆx + Ky H = P 0 0=AP + PA T PC T R 1 CP + Q A T C T R 1 C Q A The steady-state continuous-time Kalman filter is also nown as the Wiener filter The Wiener filter was developed in World War 2 for radar applications It was defined from the signal and noise spectra by factorization 14
Probability and Random Variables. Generation of random variables (r.v.)
Probability and Random Variables Method for generating random variables with a specified probability distribution function. Gaussian And Markov Processes Characterization of Stationary Random Process Linearly
More informationLinear-Quadratic Optimal Controller 10.3 Optimal Linear Control Systems
Linear-Quadratic Optimal Controller 10.3 Optimal Linear Control Systems In Chapters 8 and 9 of this book we have designed dynamic controllers such that the closed-loop systems display the desired transient
More informationMATH 551 - APPLIED MATRIX THEORY
MATH 55 - APPLIED MATRIX THEORY FINAL TEST: SAMPLE with SOLUTIONS (25 points NAME: PROBLEM (3 points A web of 5 pages is described by a directed graph whose matrix is given by A Do the following ( points
More informationUsing the Theory of Reals in. Analyzing Continuous and Hybrid Systems
Using the Theory of Reals in Analyzing Continuous and Hybrid Systems Ashish Tiwari Computer Science Laboratory (CSL) SRI International (SRI) Menlo Park, CA 94025 Email: ashish.tiwari@sri.com Ashish Tiwari
More informationIntroduction to Kalman Filtering
Introduction to Kalman Filtering A set of two lectures Maria Isabel Ribeiro Associate Professor Instituto Superior écnico / Instituto de Sistemas e Robótica June All rights reserved INRODUCION O KALMAN
More informationCONTROLLABILITY. Chapter 2. 2.1 Reachable Set and Controllability. Suppose we have a linear system described by the state equation
Chapter 2 CONTROLLABILITY 2 Reachable Set and Controllability Suppose we have a linear system described by the state equation ẋ Ax + Bu (2) x() x Consider the following problem For a given vector x in
More information1 2 3 1 1 2 x = + x 2 + x 4 1 0 1
(d) If the vector b is the sum of the four columns of A, write down the complete solution to Ax = b. 1 2 3 1 1 2 x = + x 2 + x 4 1 0 0 1 0 1 2. (11 points) This problem finds the curve y = C + D 2 t which
More informationUnderstanding and Applying Kalman Filtering
Understanding and Applying Kalman Filtering Lindsay Kleeman Department of Electrical and Computer Systems Engineering Monash University, Clayton 1 Introduction Objectives: 1. Provide a basic understanding
More informationLS.6 Solution Matrices
LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions
More informationEECS 556 Image Processing W 09. Interpolation. Interpolation techniques B splines
EECS 556 Image Processing W 09 Interpolation Interpolation techniques B splines What is image processing? Image processing is the application of 2D signal processing methods to images Image representation
More information19 LINEAR QUADRATIC REGULATOR
19 LINEAR QUADRATIC REGULATOR 19.1 Introduction The simple form of loopshaping in scalar systems does not extend directly to multivariable (MIMO) plants, which are characterized by transfer matrices instead
More informationSince it is necessary to consider the ability of the lter to predict many data over a period of time a more meaningful metric is the expected value of
Chapter 11 Tutorial: The Kalman Filter Tony Lacey. 11.1 Introduction The Kalman lter ë1ë has long been regarded as the optimal solution to many tracing and data prediction tass, ë2ë. Its use in the analysis
More information15 Limit sets. Lyapunov functions
15 Limit sets. Lyapunov functions At this point, considering the solutions to ẋ = f(x), x U R 2, (1) we were most interested in the behavior of solutions when t (sometimes, this is called asymptotic behavior
More informationFormulations of Model Predictive Control. Dipartimento di Elettronica e Informazione
Formulations of Model Predictive Control Riccardo Scattolini Riccardo Scattolini Dipartimento di Elettronica e Informazione Impulse and step response models 2 At the beginning of the 80, the early formulations
More informationLecture 8: Signal Detection and Noise Assumption
ECE 83 Fall Statistical Signal Processing instructor: R. Nowak, scribe: Feng Ju Lecture 8: Signal Detection and Noise Assumption Signal Detection : X = W H : X = S + W where W N(, σ I n n and S = [s, s,...,
More informationRow Echelon Form and Reduced Row Echelon Form
These notes closely follow the presentation of the material given in David C Lay s textbook Linear Algebra and its Applications (3rd edition) These notes are intended primarily for in-class presentation
More informationChapter 2: Binomial Methods and the Black-Scholes Formula
Chapter 2: Binomial Methods and the Black-Scholes Formula 2.1 Binomial Trees We consider a financial market consisting of a bond B t = B(t), a stock S t = S(t), and a call-option C t = C(t), where the
More informationANALYZING INVESTMENT RETURN OF ASSET PORTFOLIOS WITH MULTIVARIATE ORNSTEIN-UHLENBECK PROCESSES
ANALYZING INVESTMENT RETURN OF ASSET PORTFOLIOS WITH MULTIVARIATE ORNSTEIN-UHLENBECK PROCESSES by Xiaofeng Qian Doctor of Philosophy, Boston University, 27 Bachelor of Science, Peking University, 2 a Project
More informationOn using numerical algebraic geometry to find Lyapunov functions of polynomial dynamical systems
Dynamics at the Horsetooth Volume 2, 2010. On using numerical algebraic geometry to find Lyapunov functions of polynomial dynamical systems Eric Hanson Department of Mathematics Colorado State University
More informationLecture 7: Finding Lyapunov Functions 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.243j (Fall 2003): DYNAMICS OF NONLINEAR SYSTEMS by A. Megretski Lecture 7: Finding Lyapunov Functions 1
More information1 Short Introduction to Time Series
ECONOMICS 7344, Spring 202 Bent E. Sørensen January 24, 202 Short Introduction to Time Series A time series is a collection of stochastic variables x,.., x t,.., x T indexed by an integer value t. The
More informationNumerical Solution of Differential Equations
Numerical Solution of Differential Equations Dr. Alvaro Islas Applications of Calculus I Spring 2008 We live in a world in constant change We live in a world in constant change We live in a world in constant
More informationTTT4120 Digital Signal Processing Suggested Solution to Exam Fall 2008
Norwegian University of Science and Technology Department of Electronics and Telecommunications TTT40 Digital Signal Processing Suggested Solution to Exam Fall 008 Problem (a) The input and the input-output
More informationReview Jeopardy. Blue vs. Orange. Review Jeopardy
Review Jeopardy Blue vs. Orange Review Jeopardy Jeopardy Round Lectures 0-3 Jeopardy Round $200 How could I measure how far apart (i.e. how different) two observations, y 1 and y 2, are from each other?
More informationScientific Programming
1 The wave equation Scientific Programming Wave Equation The wave equation describes how waves propagate: light waves, sound waves, oscillating strings, wave in a pond,... Suppose that the function h(x,t)
More information11. Time series and dynamic linear models
11. Time series and dynamic linear models Objective To introduce the Bayesian approach to the modeling and forecasting of time series. Recommended reading West, M. and Harrison, J. (1997). models, (2 nd
More informationMathematical Finance
Mathematical Finance Option Pricing under the Risk-Neutral Measure Cory Barnes Department of Mathematics University of Washington June 11, 2013 Outline 1 Probability Background 2 Black Scholes for European
More information3 Contour integrals and Cauchy s Theorem
3 ontour integrals and auchy s Theorem 3. Line integrals of complex functions Our goal here will be to discuss integration of complex functions = u + iv, with particular regard to analytic functions. Of
More informationLecture 13 Linear quadratic Lyapunov theory
EE363 Winter 28-9 Lecture 13 Linear quadratic Lyapunov theory the Lyapunov equation Lyapunov stability conditions the Lyapunov operator and integral evaluating quadratic integrals analysis of ARE discrete-time
More informationLinear Programming Notes V Problem Transformations
Linear Programming Notes V Problem Transformations 1 Introduction Any linear programming problem can be rewritten in either of two standard forms. In the first form, the objective is to maximize, the material
More informationAutomated Stellar Classification for Large Surveys with EKF and RBF Neural Networks
Chin. J. Astron. Astrophys. Vol. 5 (2005), No. 2, 203 210 (http:/www.chjaa.org) Chinese Journal of Astronomy and Astrophysics Automated Stellar Classification for Large Surveys with EKF and RBF Neural
More informationNonlinear Systems and Control Lecture # 15 Positive Real Transfer Functions & Connection with Lyapunov Stability. p. 1/?
Nonlinear Systems and Control Lecture # 15 Positive Real Transfer Functions & Connection with Lyapunov Stability p. 1/? p. 2/? Definition: A p p proper rational transfer function matrix G(s) is positive
More informationIntroduction to Arbitrage-Free Pricing: Fundamental Theorems
Introduction to Arbitrage-Free Pricing: Fundamental Theorems Dmitry Kramkov Carnegie Mellon University Workshop on Interdisciplinary Mathematics, Penn State, May 8-10, 2015 1 / 24 Outline Financial market
More informationQuotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
More information3.2 Sources, Sinks, Saddles, and Spirals
3.2. Sources, Sinks, Saddles, and Spirals 6 3.2 Sources, Sinks, Saddles, and Spirals The pictures in this section show solutions to Ay 00 C By 0 C Cy D 0. These are linear equations with constant coefficients
More informationEE 570: Location and Navigation
EE 570: Location and Navigation On-Line Bayesian Tracking Aly El-Osery 1 Stephen Bruder 2 1 Electrical Engineering Department, New Mexico Tech Socorro, New Mexico, USA 2 Electrical and Computer Engineering
More informationOverview of Monte Carlo Simulation, Probability Review and Introduction to Matlab
Monte Carlo Simulation: IEOR E4703 Fall 2004 c 2004 by Martin Haugh Overview of Monte Carlo Simulation, Probability Review and Introduction to Matlab 1 Overview of Monte Carlo Simulation 1.1 Why use simulation?
More informationOPTIMAl PREMIUM CONTROl IN A NON-liFE INSURANCE BUSINESS
ONDERZOEKSRAPPORT NR 8904 OPTIMAl PREMIUM CONTROl IN A NON-liFE INSURANCE BUSINESS BY M. VANDEBROEK & J. DHAENE D/1989/2376/5 1 IN A OPTIMAl PREMIUM CONTROl NON-liFE INSURANCE BUSINESS By Martina Vandebroek
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationMATH 425, PRACTICE FINAL EXAM SOLUTIONS.
MATH 45, PRACTICE FINAL EXAM SOLUTIONS. Exercise. a Is the operator L defined on smooth functions of x, y by L u := u xx + cosu linear? b Does the answer change if we replace the operator L by the operator
More informationReduced echelon form: Add the following conditions to conditions 1, 2, and 3 above:
Section 1.2: Row Reduction and Echelon Forms Echelon form (or row echelon form): 1. All nonzero rows are above any rows of all zeros. 2. Each leading entry (i.e. left most nonzero entry) of a row is in
More informationLECTURE 9: A MODEL FOR FOREIGN EXCHANGE
LECTURE 9: A MODEL FOR FOREIGN EXCHANGE 1. Foreign Exchange Contracts There was a time, not so long ago, when a U. S. dollar would buy you precisely.4 British pounds sterling 1, and a British pound sterling
More informationUniversity of Lille I PC first year list of exercises n 7. Review
University of Lille I PC first year list of exercises n 7 Review Exercise Solve the following systems in 4 different ways (by substitution, by the Gauss method, by inverting the matrix of coefficients
More informationSystem Identification for Acoustic Comms.:
System Identification for Acoustic Comms.: New Insights and Approaches for Tracking Sparse and Rapidly Fluctuating Channels Weichang Li and James Preisig Woods Hole Oceanographic Institution The demodulation
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More informationThe Characteristic Polynomial
Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem
More informationZeros of Polynomial Functions
Review: Synthetic Division Find (x 2-5x - 5x 3 + x 4 ) (5 + x). Factor Theorem Solve 2x 3-5x 2 + x + 2 =0 given that 2 is a zero of f(x) = 2x 3-5x 2 + x + 2. Zeros of Polynomial Functions Introduction
More information5 Homogeneous systems
5 Homogeneous systems Definition: A homogeneous (ho-mo-jeen -i-us) system of linear algebraic equations is one in which all the numbers on the right hand side are equal to : a x +... + a n x n =.. a m
More informationARBITRAGE-FREE OPTION PRICING MODELS. Denis Bell. University of North Florida
ARBITRAGE-FREE OPTION PRICING MODELS Denis Bell University of North Florida Modelling Stock Prices Example American Express In mathematical finance, it is customary to model a stock price by an (Ito) stochatic
More informationby the matrix A results in a vector which is a reflection of the given
Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the y-axis We observe that
More informationThe continuous and discrete Fourier transforms
FYSA21 Mathematical Tools in Science The continuous and discrete Fourier transforms Lennart Lindegren Lund Observatory (Department of Astronomy, Lund University) 1 The continuous Fourier transform 1.1
More informationChapter 8 - Power Density Spectrum
EE385 Class Notes 8/8/03 John Stensby Chapter 8 - Power Density Spectrum Let X(t) be a WSS random process. X(t) has an average power, given in watts, of E[X(t) ], a constant. his total average power is
More informationLecture 8 ELE 301: Signals and Systems
Lecture 8 ELE 3: Signals and Systems Prof. Paul Cuff Princeton University Fall 2-2 Cuff (Lecture 7) ELE 3: Signals and Systems Fall 2-2 / 37 Properties of the Fourier Transform Properties of the Fourier
More informationLecture. S t = S t δ[s t ].
Lecture In real life the vast majority of all traded options are written on stocks having at least one dividend left before the date of expiration of the option. Thus the study of dividends is important
More informationPassive control. Carles Batlle. II EURON/GEOPLEX Summer School on Modeling and Control of Complex Dynamical Systems Bertinoro, Italy, July 18-22 2005
Passive control theory I Carles Batlle II EURON/GEOPLEX Summer School on Modeling and Control of Complex Dynamical Systems Bertinoro, Italy, July 18-22 25 Contents of this lecture Change of paradigm in
More information4 Lyapunov Stability Theory
4 Lyapunov Stability Theory In this section we review the tools of Lyapunov stability theory. These tools will be used in the next section to analyze the stability properties of a robot controller. We
More informationSensitivity analysis of European options in jump-diffusion models via the Malliavin calculus on the Wiener space
Sensitivity analysis of European options in jump-diffusion models via the Malliavin calculus on the Wiener space Virginie Debelley and Nicolas Privault Département de Mathématiques Université de La Rochelle
More informationKalman Filter Applied to a Active Queue Management Problem
IOSR Journal of Electrical and Electronics Engineering (IOSR-JEEE) e-issn: 2278-1676,p-ISSN: 2320-3331, Volume 9, Issue 4 Ver. III (Jul Aug. 2014), PP 23-27 Jyoti Pandey 1 and Prof. Aashih Hiradhar 2 Department
More information1.7 Graphs of Functions
64 Relations and Functions 1.7 Graphs of Functions In Section 1.4 we defined a function as a special type of relation; one in which each x-coordinate was matched with only one y-coordinate. We spent most
More informationExample 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum. asin. k, a, and b. We study stability of the origin x
Lecture 4. LaSalle s Invariance Principle We begin with a motivating eample. Eample 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum Dynamics of a pendulum with friction can be written
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
More informationA characterization of trace zero symmetric nonnegative 5x5 matrices
A characterization of trace zero symmetric nonnegative 5x5 matrices Oren Spector June 1, 009 Abstract The problem of determining necessary and sufficient conditions for a set of real numbers to be the
More information5 Systems of Equations
Systems of Equations Concepts: Solutions to Systems of Equations-Graphically and Algebraically Solving Systems - Substitution Method Solving Systems - Elimination Method Using -Dimensional Graphs to Approximate
More informationSOLVING LINEAR SYSTEMS
SOLVING LINEAR SYSTEMS Linear systems Ax = b occur widely in applied mathematics They occur as direct formulations of real world problems; but more often, they occur as a part of the numerical analysis
More informationITSM-R Reference Manual
ITSM-R Reference Manual George Weigt June 5, 2015 1 Contents 1 Introduction 3 1.1 Time series analysis in a nutshell............................... 3 1.2 White Noise Variance.....................................
More informationEXIT TIME PROBLEMS AND ESCAPE FROM A POTENTIAL WELL
EXIT TIME PROBLEMS AND ESCAPE FROM A POTENTIAL WELL Exit Time problems and Escape from a Potential Well Escape From a Potential Well There are many systems in physics, chemistry and biology that exist
More information(Refer Slide Time: 01:11-01:27)
Digital Signal Processing Prof. S. C. Dutta Roy Department of Electrical Engineering Indian Institute of Technology, Delhi Lecture - 6 Digital systems (contd.); inverse systems, stability, FIR and IIR,
More informationRecent Results on Approximations to Optimal Alarm Systems for Anomaly Detection
Recent Results on Approximations to Optimal Alarm Systems for Anomaly Detection Rodney A. Martin NASA Ames Research Center Mail Stop 269-1 Moffett Field, CA 94035-1000, USA (650) 604-1334 Rodney.Martin@nasa.gov
More informationBindel, Spring 2012 Intro to Scientific Computing (CS 3220) Week 3: Wednesday, Feb 8
Spaces and bases Week 3: Wednesday, Feb 8 I have two favorite vector spaces 1 : R n and the space P d of polynomials of degree at most d. For R n, we have a canonical basis: R n = span{e 1, e 2,..., e
More informationBrief Introduction to Vectors and Matrices
CHAPTER 1 Brief Introduction to Vectors and Matrices In this chapter, we will discuss some needed concepts found in introductory course in linear algebra. We will introduce matrix, vector, vector-valued
More informationMath 526: Brownian Motion Notes
Math 526: Brownian Motion Notes Definition. Mike Ludkovski, 27, all rights reserved. A stochastic process (X t ) is called Brownian motion if:. The map t X t (ω) is continuous for every ω. 2. (X t X t
More informationMath 4310 Handout - Quotient Vector Spaces
Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
More informationDiscrete Frobenius-Perron Tracking
Discrete Frobenius-Perron Tracing Barend J. van Wy and Michaël A. van Wy French South-African Technical Institute in Electronics at the Tshwane University of Technology Staatsartillerie Road, Pretoria,
More informationGoal Problems in Gambling and Game Theory. Bill Sudderth. School of Statistics University of Minnesota
Goal Problems in Gambling and Game Theory Bill Sudderth School of Statistics University of Minnesota 1 Three problems Maximizing the probability of reaching a goal. Maximizing the probability of reaching
More informationEstimating an ARMA Process
Statistics 910, #12 1 Overview Estimating an ARMA Process 1. Main ideas 2. Fitting autoregressions 3. Fitting with moving average components 4. Standard errors 5. Examples 6. Appendix: Simple estimators
More informationThe Heston Model. Hui Gong, UCL http://www.homepages.ucl.ac.uk/ ucahgon/ May 6, 2014
Hui Gong, UCL http://www.homepages.ucl.ac.uk/ ucahgon/ May 6, 2014 Generalized SV models Vanilla Call Option via Heston Itô s lemma for variance process Euler-Maruyama scheme Implement in Excel&VBA 1.
More information6.4 Logarithmic Equations and Inequalities
6.4 Logarithmic Equations and Inequalities 459 6.4 Logarithmic Equations and Inequalities In Section 6.3 we solved equations and inequalities involving exponential functions using one of two basic strategies.
More informationChapter 2. Parameterized Curves in R 3
Chapter 2. Parameterized Curves in R 3 Def. A smooth curve in R 3 is a smooth map σ : (a, b) R 3. For each t (a, b), σ(t) R 3. As t increases from a to b, σ(t) traces out a curve in R 3. In terms of components,
More informationQUANTIZED INTEREST RATE AT THE MONEY FOR AMERICAN OPTIONS
QUANTIZED INTEREST RATE AT THE MONEY FOR AMERICAN OPTIONS L. M. Dieng ( Department of Physics, CUNY/BCC, New York, New York) Abstract: In this work, we expand the idea of Samuelson[3] and Shepp[,5,6] for
More informationChapter 1. Vector autoregressions. 1.1 VARs and the identi cation problem
Chapter Vector autoregressions We begin by taking a look at the data of macroeconomics. A way to summarize the dynamics of macroeconomic data is to make use of vector autoregressions. VAR models have become
More informationMATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform
MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish
More informationDynamical Systems Analysis II: Evaluating Stability, Eigenvalues
Dynamical Systems Analysis II: Evaluating Stability, Eigenvalues By Peter Woolf pwoolf@umich.edu) University of Michigan Michigan Chemical Process Dynamics and Controls Open Textbook version 1.0 Creative
More information1 Solving LPs: The Simplex Algorithm of George Dantzig
Solving LPs: The Simplex Algorithm of George Dantzig. Simplex Pivoting: Dictionary Format We illustrate a general solution procedure, called the simplex algorithm, by implementing it on a very simple example.
More information15 Kuhn -Tucker conditions
5 Kuhn -Tucker conditions Consider a version of the consumer problem in which quasilinear utility x 2 + 4 x 2 is maximised subject to x +x 2 =. Mechanically applying the Lagrange multiplier/common slopes
More informationIEOR 6711: Stochastic Models, I Fall 2012, Professor Whitt, Final Exam SOLUTIONS
IEOR 6711: Stochastic Models, I Fall 2012, Professor Whitt, Final Exam SOLUTIONS There are four questions, each with several parts. 1. Customers Coming to an Automatic Teller Machine (ATM) (30 points)
More informationSome Research Problems in Uncertainty Theory
Journal of Uncertain Systems Vol.3, No.1, pp.3-10, 2009 Online at: www.jus.org.uk Some Research Problems in Uncertainty Theory aoding Liu Uncertainty Theory Laboratory, Department of Mathematical Sciences
More informationBackground 2. Lecture 2 1. The Least Mean Square (LMS) algorithm 4. The Least Mean Square (LMS) algorithm 3. br(n) = u(n)u H (n) bp(n) = u(n)d (n)
Lecture 2 1 During this lecture you will learn about The Least Mean Squares algorithm (LMS) Convergence analysis of the LMS Equalizer (Kanalutjämnare) Background 2 The method of the Steepest descent that
More informationEigenvalues, Eigenvectors, Matrix Factoring, and Principal Components
Eigenvalues, Eigenvectors, Matrix Factoring, and Principal Components The eigenvalues and eigenvectors of a square matrix play a key role in some important operations in statistics. In particular, they
More informationMath 461 Fall 2006 Test 2 Solutions
Math 461 Fall 2006 Test 2 Solutions Total points: 100. Do all questions. Explain all answers. No notes, books, or electronic devices. 1. [105+5 points] Assume X Exponential(λ). Justify the following two
More informationFactor analysis. Angela Montanari
Factor analysis Angela Montanari 1 Introduction Factor analysis is a statistical model that allows to explain the correlations between a large number of observed correlated variables through a small number
More information3. Reaction Diffusion Equations Consider the following ODE model for population growth
3. Reaction Diffusion Equations Consider the following ODE model for population growth u t a u t u t, u 0 u 0 where u t denotes the population size at time t, and a u plays the role of the population dependent
More informationReaction diffusion systems and pattern formation
Chapter 5 Reaction diffusion systems and pattern formation 5.1 Reaction diffusion systems from biology In ecological problems, different species interact with each other, and in chemical reactions, different
More informationCourse 8. An Introduction to the Kalman Filter
Course 8 An Introduction to the Kalman Filter Speakers Greg Welch Gary Bishop Kalman Filters in 2 hours? Hah! No magic. Pretty simple to apply. Tolerant of abuse. Notes are a standalone reference. These
More informationSolutions to Math 51 First Exam January 29, 2015
Solutions to Math 5 First Exam January 29, 25. ( points) (a) Complete the following sentence: A set of vectors {v,..., v k } is defined to be linearly dependent if (2 points) there exist c,... c k R, not
More informationRecall that two vectors in are perpendicular or orthogonal provided that their dot
Orthogonal Complements and Projections Recall that two vectors in are perpendicular or orthogonal provided that their dot product vanishes That is, if and only if Example 1 The vectors in are orthogonal
More information12.6 Logarithmic and Exponential Equations PREPARING FOR THIS SECTION Before getting started, review the following:
Section 1.6 Logarithmic and Exponential Equations 811 1.6 Logarithmic and Exponential Equations PREPARING FOR THIS SECTION Before getting started, review the following: Solve Quadratic Equations (Section
More informationCITY UNIVERSITY LONDON. BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION
No: CITY UNIVERSITY LONDON BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION ENGINEERING MATHEMATICS 2 (resit) EX2005 Date: August
More informationLecture 13: Martingales
Lecture 13: Martingales 1. Definition of a Martingale 1.1 Filtrations 1.2 Definition of a martingale and its basic properties 1.3 Sums of independent random variables and related models 1.4 Products of
More informationOnline Appendix to Stochastic Imitative Game Dynamics with Committed Agents
Online Appendix to Stochastic Imitative Game Dynamics with Committed Agents William H. Sandholm January 6, 22 O.. Imitative protocols, mean dynamics, and equilibrium selection In this section, we consider
More informationSOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties
SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces
More information