Perturbation Bounds for Determinants and Characteristic Polynomials

Size: px
Start display at page:

Download "Perturbation Bounds for Determinants and Characteristic Polynomials"

Transcription

1 Perturbation Bounds for Determinants and Characteristic Polynomials Ilse Ipsen North Carolina State University, Raleigh, USA Joint work with: Rizwana Rehman

2 Characteristic Polynomials n n complex matrix A det(λi A) = λ n + c 1 λ n c n 1 λ + c n c 1 = trace(a) c n = ( 1) n det(a) Application (Dean Lee, NCSU) Thermodynamic properties of systems of fermions Z k ( 1) k c k is partition function

3 Perturbation Bounds n n complex matrices A and A + E det(λi A) = λ n + c 1 λ n c n 1 λ + c n det(λi (A + E)) = λ n + c 1 λ n c n 1 λ + c n Trace: c 1 c 1 = trace(a+e) trace(a) = trace(e) n E 2 Determinant: c n c n = det(a + E) det(a)? Other coefficients: Bound c k c k by means of results for determinants

4 Existing Bounds for Determinants Friedland 1982, Bhatia 1987 det(a+e) det(a) n max{ A p, A + E p } n 1 E p Proof: Fréchet derivatives of wedge products Godunov, Antonov, Kiriljuk & Kostin 1988 If n A 1 2 E 2 < 1 then det(a + E) det(a) det(a) n A n A 1 2 E 2 E 2 Our idea: Use determinant expansions of diagonal matrices

5 Determinant Expansion of Diagonal Matrices 1 A = σ σ 2 σ 3 e 11 e 12 e 13 E = e 21 e 22 e 23 e 31 e 32 e 33 Expansion: det(a + E) = det(a) + S 1 + S 2 + det(e) where ( ) e22 e S 1 = σ 1 det 23 +σ e 32 e 2 det 33 ( e11 e 13 e 31 e 33 ) +σ 3 det ( ) e11 e 12 e 21 e 22 S 2 = σ 1 σ 2 e 33 + σ 1 σ 3 e 22 + σ 2 σ 3 e 11

6 Determinant Expansion of Diagonal Matrices A = σ 1... Expansion: σ n det(a + E) = det(a) + S S n 1 + det(e) where S k = σ i1 σ ik det(e i1...i k ) 1 i 1 < <i k n σ i1 σ ik det(e i1...i k ) product of k diagonal elements of A principal minor of order n k of E

7 Determinant Bounds for Diagonal Matrices A = diag ( σ 1... σ n ) σ 1... σ n 0 det(a + E) det(a) S S n 1 + det(e) where S k σ i1 σ ik det(e i1...i k ) 1 i 1 < <i k n Hadamard s inequality: det(e i1...i k ) E i1...i k n k E n k (2 norm)

8 Elementary Symmetric Functions S k σ i1 σ ik E n k 1 i 1 < <i k n kth elementary symmetric function of σ 1,..., σ n s k σ i1 σ ik 1 i 1 < <i k n If n = 3 then s 1 = σ 1 + σ 2 + σ 3 s 2 = σ 1 σ 2 + σ 1 σ 3 + σ 2 σ 1 + σ 2 σ 3 + σ 3 σ 1 + σ 3 σ 2 s 3 = σ 1 σ 2 σ 3 S k s k E n k

9 Determinant Bound for Diagonal Matrices Non negative diagonal matrix A = diag ( σ 1... σ n ) σ 1... σ n 0 Elementary symmetric functions of σ 1,..., σ n s k σ i1 σ ik 1 i 1 < <i k n Determinant perturbation bound det(a) det(a + E) s n 1 E + + s 1 E n 1 + E n First order bound det(a) det(a + E) s n 1 E + O ( E 2) where s n 1 n σ 1... σ n 1

10 Determinant Bound for General Matrices Complex n n matrix A with singular values σ 1... σ n 0 Elementary symmetric functions of singular values s k σ i1 σ ik 1 i 1 < <i k n Determinant perturbation bound det(a) det(a + E) s n 1 E + + s 1 E n 1 + E n First order bound det(a) det(a + E) s n 1 E + O ( E 2) where s n 1 n σ 1... σ n 1

11 Derivative of Determinant If x is a real scalar then d dx det(a + xe) x=0 s n 1 E where s n 1 n σ 1... σ n 1 Local (absolute) condition number for determinant: (n 1)st elementary symmetric function of singular values

12 Relative Bound If A is nonsingular then 1/det(A) = det(a 1 ) Determinant expansion of I + A 1 E det(a + E) det(a) det(a) = S S n 1 + det(a 1 E) Minors S k det((a 1 E) i1...i k ) 1 i 1 < <i k n Relative perturbation bound det(a + E) det(a) det(a) ( A 1 E + 1) n 1

13 Coefficients of Characteristic Polynomial n n complex matrices A and A + E det(λi A) = λ n + c 1 λ n c n 1 λ + c n det(λi (A + E)) = λ n + c 1 λ n c n 1 λ + c n Friedland 1982, Bhatia 1987 ( ) n c k c k k max{ A p, A + E p } k 1 E p k Proof: Fréchet derivatives of wedge products

14 A Perturbed Coefficient c k = ( 1) k 1 i 1 <...<i n k n det(a i1...i n k + E i1...i n k ) Sum of ( n k) minors Each minor is determinant of matrix of order k Apply determinant bound to each term Bounds contain k largest singular values σ 1,..., σ k

15 Bound for Perturbed Coefficient Elementary symmetric function of k largest singular values σ 1,..., σ k s (k) j = σ i1... σ ij 1 i 1 <...<i j k Perturbation bound ( ) n ( c k c k s (k) k 1 E + + s(k) 1 k E k 1 + E k) First order bound ( ) n c k c k s (k) k 1 k E + O( E 2 ) where s (k) k 1 k σ 1... σ k 1

16 Normal (or Hermitian) Matrices Perturbation bound c k c k (n k + 1)s k 1 E + ( ) ( ) n 1 n + s 1 E k 1 + E k k 1 k Elementary functions in terms of all singular values (not just the largest ones) Binomial factors smaller than in general bound First order bound c k c k (n k + 1)s k 1 E + O ( E 2) Normal (or Hermitian) matrices may have better conditioned coefficients

17 Summary Characteristic polynomial of n n complex matrix A det(λi A) = λ n + c 1 λ n c n 1 λ + c n c k elementary symmetric functions of eigenvalues Perturbation bounds in terms of elementary symmetric functions of singular values Absolute local (first order) condition numbers Normal (or Hermitian) matrices may have better conditioned coefficients

Some Bounds for the Singular Values of Matrices

Some Bounds for the Singular Values of Matrices Applied Mathematical Sciences, Vol., 007, no. 49, 443-449 Some Bounds for the Singular Values of Matrices Ramazan Turkmen and Haci Civciv Department of Mathematics, Faculty of Art and Science Selcuk University,

More information

Geometry of orthogonally invariant matrix varieties

Geometry of orthogonally invariant matrix varieties Geometry of orthogonally invariant matrix varieties Dmitriy Drusvyatskiy Mathematics, University of Washington Joint work with H.-L. Lee (UW), G. Ottaviano (Florence), and R.R. Thomas (UW) UC Davis Algebra

More information

Direct Methods for linear systems Ax = b basic point: easy to solve triangular systems

Direct Methods for linear systems Ax = b basic point: easy to solve triangular systems NLA p.1/13 Direct Methods for linear systems Ax = b basic point: easy to solve triangular systems... 0 0 0 etc. a n 1,n 1 x n 1 = b n 1 a n 1,n x n solve a n,n x n = b n then back substitution: takes n

More information

SUPERSYMMETRY WITHOUT SUPERSYMMETRY : DETERMINANTS AND PFAFFIANS IN RMT

SUPERSYMMETRY WITHOUT SUPERSYMMETRY : DETERMINANTS AND PFAFFIANS IN RMT SUPERSYMMETRY WITHOUT SUPERSYMMETRY : DETERMINANTS AND PFAFFIANS IN RMT Mario Kieburg Universität Duisburg-Essen SFB/TR-12 Workshop on Langeoog (Germany), February 22 nd 2010 supported by OUTLINE (1) Characteristic

More information

Determinants II Linear Algebra, Fall 2008

Determinants II Linear Algebra, Fall 2008 Determinants II Linear Algebra, Fall 2008 1 Basic Properties of Determinants Here are the basic properties of determinants which you proved in the exercises to the previous handout Theorem 1 Let A be an

More information

Convex-Cardinality Problems Part II

Convex-Cardinality Problems Part II l 1 -norm Methods for Convex-Cardinality Problems Part II total variation iterated weighted l 1 heuristic matrix rank constraints Prof. S. Boyd, EE364b, Stanford University Total variation reconstruction

More information

Chapter 14. The Multi-Underlying Black-Scholes Model and Correlation

Chapter 14. The Multi-Underlying Black-Scholes Model and Correlation Chapter 4 The Multi-Underlying Black-Scholes Model and Correlation So far we have discussed single asset options, the payoff function depended only on one underlying. Now we want to allow multiple underlyings.

More information

ELEMENTS OF MATRIX MATHEMATICS

ELEMENTS OF MATRIX MATHEMATICS QRMC07 9/7/0 4:45 PM Page 5 CHAPTER SEVEN ELEMENTS OF MATRIX MATHEMATICS 7. AN INTRODUCTION TO MATRICES Investors frequently encounter situations involving numerous potential outcomes, many discrete periods

More information

Numerical Methods For American Option Pricing. Peng Liu. June 2008

Numerical Methods For American Option Pricing. Peng Liu. June 2008 Numerical Methods For American Option Pricing Peng Liu June 2008 Abstract An analytic solution does not exist for evaluating the American put option. Usually, the value is obtained by applying numerical

More information

Outline. 1 Introduction. 2 Algorithms. 3 Examples. Algorithm 1 General coordinate minimization framework. 1: Choose x 0 R n and set k 0.

Outline. 1 Introduction. 2 Algorithms. 3 Examples. Algorithm 1 General coordinate minimization framework. 1: Choose x 0 R n and set k 0. Outline Coordinate Minimization Daniel P. Robinson Department of Applied Mathematics and Statistics Johns Hopkins University November 27, 208 Introduction 2 Algorithms Cyclic order with exact minimization

More information

Chapter 5 Finite Difference Methods. Math6911 W07, HM Zhu

Chapter 5 Finite Difference Methods. Math6911 W07, HM Zhu Chapter 5 Finite Difference Methods Math69 W07, HM Zhu References. Chapters 5 and 9, Brandimarte. Section 7.8, Hull 3. Chapter 7, Numerical analysis, Burden and Faires Outline Finite difference (FD) approximation

More information

2.1 Mathematical Basis: Risk-Neutral Pricing

2.1 Mathematical Basis: Risk-Neutral Pricing Chapter Monte-Carlo Simulation.1 Mathematical Basis: Risk-Neutral Pricing Suppose that F T is the payoff at T for a European-type derivative f. Then the price at times t before T is given by f t = e r(t

More information

Write legibly. Unreadable answers are worthless.

Write legibly. Unreadable answers are worthless. MMF 2021 Final Exam 1 December 2016. This is a closed-book exam: no books, no notes, no calculators, no phones, no tablets, no computers (of any kind) allowed. Do NOT turn this page over until you are

More information

DASL a b. Benjamin Reish. Supplement to. Oklahoma State University. Stillwater, OK

DASL a b. Benjamin Reish. Supplement to. Oklahoma State University. Stillwater, OK Benjamin Reish Supplement to Concurrent Learning Adaptive Control for Systems with Unknown Sign of Control Effectiveness DASL a b a technical report from Oklahoma State University Stillwater, OK Report

More information

9.13 Use Crammer s rule to solve the following two systems of equations.

9.13 Use Crammer s rule to solve the following two systems of equations. Curtis Kephart Econ 2B Mathematics for Economists Problem Set 2 Problem 9. Use Crammer s Rule to Invert the following 3 matrices. a) 4 3 3, 4 3 4 2 3 b) 5 6, 8 The (very long) method of computing adj A

More information

A way to improve incremental 2-norm condition estimation

A way to improve incremental 2-norm condition estimation A way to improve incremental 2-norm condition estimation Jurjen Duintjer Tebbens Institute of Computer Science Academy of Sciences of the Czech Republic duintjertebbens@cs.cas.cz Miroslav Tůma Institute

More information

Secant Varieties, Symbolic Powers, Statistical Models

Secant Varieties, Symbolic Powers, Statistical Models Secant Varieties, Symbolic Powers, Statistical Models Seth Sullivant North Carolina State University November 19, 2012 Seth Sullivant (NCSU) Secant Varieties, etc. November 19, 2012 1 / 27 Joins and Secant

More information

LECTURE NOTES 3 ARIEL M. VIALE

LECTURE NOTES 3 ARIEL M. VIALE LECTURE NOTES 3 ARIEL M VIALE I Markowitz-Tobin Mean-Variance Portfolio Analysis Assumption Mean-Variance preferences Markowitz 95 Quadratic utility function E [ w b w ] { = E [ w] b V ar w + E [ w] }

More information

Is Greedy Coordinate Descent a Terrible Algorithm?

Is Greedy Coordinate Descent a Terrible Algorithm? Is Greedy Coordinate Descent a Terrible Algorithm? Julie Nutini, Mark Schmidt, Issam Laradji, Michael Friedlander, Hoyt Koepke University of British Columbia Optimization and Big Data, 2015 Context: Random

More information

symmys.com 3.2 Projection of the invariants to the investment horizon

symmys.com 3.2 Projection of the invariants to the investment horizon 122 3 Modeling the market In the swaption world the underlying rate (3.57) has a bounded range and thus it does not display the explosive pattern typical of a stock price. Therefore the swaption prices

More information

Simulating Continuous Time Rating Transitions

Simulating Continuous Time Rating Transitions Bus 864 1 Simulating Continuous Time Rating Transitions Robert A. Jones 17 March 2003 This note describes how to simulate state changes in continuous time Markov chains. An important application to credit

More information

Show that the column rank and the row rank of A are both equal to 3.

Show that the column rank and the row rank of A are both equal to 3. hapter Vectors and matrices.. Exercises. Let A 2 5 4 3 2 4 2 2 3 5 4 2 4 3 Show that the column rank and the row rank of A are both equal to 3. 2. Let x and y be column vectors of size n, andleti be the

More information

PhD Topics in Macroeconomics

PhD Topics in Macroeconomics PhD Topics in Macroeconomics Lecture 16: heterogeneous firms and trade, part four Chris Edmond 2nd Semester 214 1 This lecture Trade frictions in Ricardian models with heterogeneous firms 1- Dornbusch,

More information

Comparison of MINQUE and Simple Estimate of the Error Variance in the General Linear Models

Comparison of MINQUE and Simple Estimate of the Error Variance in the General Linear Models Acta Mathematicae Applicatae Sinica, English Series Vol. 19, No. 1 (003) 13 18 Comparison of MINQUE and Simple Estimate of the Error Variance in the General Linear Models Song-gui Wang 1,Mi-xiaWu,Wei-qingMa

More information

CLASSIC TWO-STEP DURBIN-TYPE AND LEVINSON-TYPE ALGORITHMS FOR SKEW-SYMMETRIC TOEPLITZ MATRICES

CLASSIC TWO-STEP DURBIN-TYPE AND LEVINSON-TYPE ALGORITHMS FOR SKEW-SYMMETRIC TOEPLITZ MATRICES CLASSIC TWO-STEP DURBIN-TYPE AND LEVINSON-TYPE ALGORITHMS FOR SKEW-SYMMETRIC TOEPLITZ MATRICES IYAD T ABU-JEIB Abstract We present ecient classic two-step Durbin-type and Levinsontype algorithms for even

More information

Dynamic Portfolio Execution Detailed Proofs

Dynamic Portfolio Execution Detailed Proofs Dynamic Portfolio Execution Detailed Proofs Gerry Tsoukalas, Jiang Wang, Kay Giesecke March 16, 2014 1 Proofs Lemma 1 (Temporary Price Impact) A buy order of size x being executed against i s ask-side

More information

New Formal Description of Expert Views of Black-Litterman Asset Allocation Model

New Formal Description of Expert Views of Black-Litterman Asset Allocation Model BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 17, No 4 Sofia 2017 Print ISSN: 1311-9702; Online ISSN: 1314-4081 DOI: 10.1515/cait-2017-0043 New Formal Description of Expert

More information

1102 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 3, MARCH Genyuan Wang and Xiang-Gen Xia, Senior Member, IEEE

1102 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 3, MARCH Genyuan Wang and Xiang-Gen Xia, Senior Member, IEEE 1102 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 51, NO 3, MARCH 2005 On Optimal Multilayer Cyclotomic Space Time Code Designs Genyuan Wang Xiang-Gen Xia, Senior Member, IEEE Abstract High rate large

More information

Modelling Credit Spread Behaviour. FIRST Credit, Insurance and Risk. Angelo Arvanitis, Jon Gregory, Jean-Paul Laurent

Modelling Credit Spread Behaviour. FIRST Credit, Insurance and Risk. Angelo Arvanitis, Jon Gregory, Jean-Paul Laurent Modelling Credit Spread Behaviour Insurance and Angelo Arvanitis, Jon Gregory, Jean-Paul Laurent ICBI Counterparty & Default Forum 29 September 1999, Paris Overview Part I Need for Credit Models Part II

More information

IEOR E4004: Introduction to OR: Deterministic Models

IEOR E4004: Introduction to OR: Deterministic Models IEOR E4004: Introduction to OR: Deterministic Models 1 Dynamic Programming Following is a summary of the problems we discussed in class. (We do not include the discussion on the container problem or the

More information

Design of a Financial Application Driven Multivariate Gaussian Random Number Generator for an FPGA

Design of a Financial Application Driven Multivariate Gaussian Random Number Generator for an FPGA Design of a Financial Application Driven Multivariate Gaussian Random Number Generator for an FPGA Chalermpol Saiprasert, Christos-Savvas Bouganis and George A. Constantinides Department of Electrical

More information

Chapter 6 Simple Correlation and

Chapter 6 Simple Correlation and Contents Chapter 1 Introduction to Statistics Meaning of Statistics... 1 Definition of Statistics... 2 Importance and Scope of Statistics... 2 Application of Statistics... 3 Characteristics of Statistics...

More information

Cumulants and triangles in Erdős-Rényi random graphs

Cumulants and triangles in Erdős-Rényi random graphs Cumulants and triangles in Erdős-Rényi random graphs Valentin Féray partially joint work with Pierre-Loïc Méliot (Orsay) and Ashkan Nighekbali (Zürich) Institut für Mathematik, Universität Zürich Probability

More information

Symmetry, Sliding Windows and Transfer Matrices.

Symmetry, Sliding Windows and Transfer Matrices. Symmetry, Sliding Windows and Transfer Matrices Alexander Shpunt Department of Physics, Massachusetts Institute of Technology, Cambridge, MA 02139, USA (Dated: May 16, 2008) In this paper we study 1D k-neighbor

More information

A Correlated Sampling Method for Multivariate Normal and Log-normal Distributions

A Correlated Sampling Method for Multivariate Normal and Log-normal Distributions A Correlated Sampling Method for Multivariate Normal and Log-normal Distributions Gašper Žerovni, Andrej Trov, Ivan A. Kodeli Jožef Stefan Institute Jamova cesta 39, SI-000 Ljubljana, Slovenia gasper.zerovni@ijs.si,

More information

HIGH ORDER DISCONTINUOUS GALERKIN METHODS FOR 1D PARABOLIC EQUATIONS. Ahmet İzmirlioğlu. BS, University of Pittsburgh, 2004

HIGH ORDER DISCONTINUOUS GALERKIN METHODS FOR 1D PARABOLIC EQUATIONS. Ahmet İzmirlioğlu. BS, University of Pittsburgh, 2004 HIGH ORDER DISCONTINUOUS GALERKIN METHODS FOR D PARABOLIC EQUATIONS by Ahmet İzmirlioğlu BS, University of Pittsburgh, 24 Submitted to the Graduate Faculty of Art and Sciences in partial fulfillment of

More information

The skew-rank of oriented graphs

The skew-rank of oriented graphs The skew-rank of oriented graphs Xueliang Li a, Guihai Yu a,b, a Center for Combinatorics and LPMC-TJKLC arxiv:14047230v1 [mathco] 29 Apr 2014 Nankai University, Tianjin 300071, China b Department of Mathematics

More information

Multilevel quasi-monte Carlo path simulation

Multilevel quasi-monte Carlo path simulation Multilevel quasi-monte Carlo path simulation Michael B. Giles and Ben J. Waterhouse Lluís Antoni Jiménez Rugama January 22, 2014 Index 1 Introduction to MLMC Stochastic model Multilevel Monte Carlo Milstein

More information

Chapter 7: Portfolio Theory

Chapter 7: Portfolio Theory Chapter 7: Portfolio Theory 1. Introduction 2. Portfolio Basics 3. The Feasible Set 4. Portfolio Selection Rules 5. The Efficient Frontier 6. Indifference Curves 7. The Two-Asset Portfolio 8. Unrestriceted

More information

End-to-End Congestion Control for the Internet: Delays and Stability

End-to-End Congestion Control for the Internet: Delays and Stability End-to-End Congestion Control for the Internet: Delays and Stability Ramesh Johari and David Tan Statistical Laboratory, University of Cambridge March 16, 2000 Abstract Under the assumption that queueing

More information

The rth moment of a real-valued random variable X with density f(x) is. x r f(x) dx

The rth moment of a real-valued random variable X with density f(x) is. x r f(x) dx 1 Cumulants 1.1 Definition The rth moment of a real-valued random variable X with density f(x) is µ r = E(X r ) = x r f(x) dx for integer r = 0, 1,.... The value is assumed to be finite. Provided that

More information

Exercise List: Proving convergence of the (Stochastic) Gradient Descent Method for the Least Squares Problem.

Exercise List: Proving convergence of the (Stochastic) Gradient Descent Method for the Least Squares Problem. Exercise List: Proving convergence of the (Stochastic) Gradient Descent Method for the Least Squares Problem. Robert M. Gower. October 3, 07 Introduction This is an exercise in proving the convergence

More information

Error Bounds for P-matrix Linear Complementarity Problems and Their Applications

Error Bounds for P-matrix Linear Complementarity Problems and Their Applications Error Bounds for P-matrix Linear Complementarity Problems and Their Applications Xiaojun Chen The Hong Kong Polytechnic University NPA2008, Beijing, 7-9 April Outline Computational Global Error Bounds

More information

1 Auctions. 1.1 Notation (Symmetric IPV) Independent private values setting with symmetric riskneutral buyers, no budget constraints.

1 Auctions. 1.1 Notation (Symmetric IPV) Independent private values setting with symmetric riskneutral buyers, no budget constraints. 1 Auctions 1.1 Notation (Symmetric IPV) Ancient market mechanisms. use. A lot of varieties. Widespread in Independent private values setting with symmetric riskneutral buyers, no budget constraints. Simple

More information

Chapter 2. Random variables. 2.3 Expectation

Chapter 2. Random variables. 2.3 Expectation Random processes - Chapter 2. Random variables 1 Random processes Chapter 2. Random variables 2.3 Expectation 2.3 Expectation Random processes - Chapter 2. Random variables 2 Among the parameters representing

More information

A Non-Normal Principal Components Model for Security Returns

A Non-Normal Principal Components Model for Security Returns A Non-Normal Principal Components Model for Security Returns Sander Gerber Babak Javid Harry Markowitz Paul Sargen David Starer February 21, 219 Abstract We introduce a principal components model for securities

More information

Multiname and Multiscale Default Modeling

Multiname and Multiscale Default Modeling Multiname and Multiscale Default Modeling Jean-Pierre Fouque University of California Santa Barbara Joint work with R. Sircar (Princeton) and K. Sølna (UC Irvine) Special Semester on Stochastics with Emphasis

More information

MATH4512 Fundamentals of Mathematical Finance. Topic Two Mean variance portfolio theory. 2.1 Mean and variance of portfolio return

MATH4512 Fundamentals of Mathematical Finance. Topic Two Mean variance portfolio theory. 2.1 Mean and variance of portfolio return MATH4512 Fundamentals of Mathematical Finance Topic Two Mean variance portfolio theory 2.1 Mean and variance of portfolio return 2.2 Markowitz mean-variance formulation 2.3 Two-fund Theorem 2.4 Inclusion

More information

IE 495 Lecture 11. The LShaped Method. Prof. Jeff Linderoth. February 19, February 19, 2003 Stochastic Programming Lecture 11 Slide 1

IE 495 Lecture 11. The LShaped Method. Prof. Jeff Linderoth. February 19, February 19, 2003 Stochastic Programming Lecture 11 Slide 1 IE 495 Lecture 11 The LShaped Method Prof. Jeff Linderoth February 19, 2003 February 19, 2003 Stochastic Programming Lecture 11 Slide 1 Before We Begin HW#2 $300 $0 http://www.unizh.ch/ior/pages/deutsch/mitglieder/kall/bib/ka-wal-94.pdf

More information

Modelling, Estimation and Hedging of Longevity Risk

Modelling, Estimation and Hedging of Longevity Risk IA BE Summer School 2016, K. Antonio, UvA 1 / 50 Modelling, Estimation and Hedging of Longevity Risk Katrien Antonio KU Leuven and University of Amsterdam IA BE Summer School 2016, Leuven Module II: Fitting

More information

9.1 Principal Component Analysis for Portfolios

9.1 Principal Component Analysis for Portfolios Chapter 9 Alpha Trading By the name of the strategies, an alpha trading strategy is to select and trade portfolios so the alpha is maximized. Two important mathematical objects are factor analysis and

More information

Modeling multiple runoff tables

Modeling multiple runoff tables Modeling multiple runoff tables Vincent Lous www.posthuma-partners.nl Motivation Why creating a "model" for all lines of business is important Motivation Why creating a "model" for all lines of business

More information

Using condition numbers to assess numerical quality in HPC applications

Using condition numbers to assess numerical quality in HPC applications Using condition numbers to assess numerical quality in HPC applications Marc Baboulin Inria Saclay / Université Paris-Sud, France INRIA - Illinois Petascale Computing Joint Laboratory 9th workshop, June

More information

Lecture 4. Finite difference and finite element methods

Lecture 4. Finite difference and finite element methods Finite difference and finite element methods Lecture 4 Outline Black-Scholes equation From expectation to PDE Goal: compute the value of European option with payoff g which is the conditional expectation

More information

1. Which pair of factors of 8 has a sum of 9? 1 and 8 2. Which pair of factors of 30 has a sum of. r 2 4r 45

1. Which pair of factors of 8 has a sum of 9? 1 and 8 2. Which pair of factors of 30 has a sum of. r 2 4r 45 Warm Up 1. Which pair of factors of 8 has a sum of 9? 1 and 8 2. Which pair of factors of 30 has a sum of 17? 2 and 15 Multiply. 3. (x +2)(x +3) x 2 + 5x + 6 4. (r + 5)(r 9) r 2 4r 45 Objective Factor

More information

Revisiting Near-collinearity: Numerical vs. Statistical Perspectives

Revisiting Near-collinearity: Numerical vs. Statistical Perspectives Revisiting Near-collinearity: Numerical vs. Statistical Perspectives Aris Spanos Department of Economics, Virginia Tech, Blacksburg, VA 24061, USA October 2016 Abstract The primary objective is to bring

More information

Financial Time Series Lecture 10: Analysis of Multiple Financial Time Series with Applications

Financial Time Series Lecture 10: Analysis of Multiple Financial Time Series with Applications Financial Time Series Lecture 10: Analysis of Multiple Financial Time Series with Applications Reference: Chapters 8 and 10 of the textbook. We shall focus on two series (i.e., the bivariate case) Time

More information

5 Numerical Solution of Linear Systems

5 Numerical Solution of Linear Systems 5 Numerical Solution of Linear Systems In this chapter we present several methods for solving linear systems of the form Ax = b. HereA is a (m m) matrix and both x and b are m-dimensional vectors. Our

More information

6-3 Dividing Polynomials

6-3 Dividing Polynomials Polynomials can be divided using long division just like you learned with numbers. Divide) 24 6 5 6 24-8 4-0 4 Remainder 24 6 = 5 4 6 Example : Using Long Division to Divide a Polynomial Divide using

More information

As an example, we consider the following PDE with one variable; Finite difference method is one of numerical method for the PDE.

As an example, we consider the following PDE with one variable; Finite difference method is one of numerical method for the PDE. 7. Introduction to the numerical integration of PDE. As an example, we consider the following PDE with one variable; Finite difference method is one of numerical method for the PDE. Accuracy requirements

More information

Catalan functions and k-schur positivity

Catalan functions and k-schur positivity Catalan functions and k-schur positivity Jonah Blasiak Drexel University joint work with Jennifer Morse, Anna Pun, and Dan Summers April 2018 Strengthened Macdonald positivity conjecture Theorem (Haiman)

More information

Sensitivity Analysis on Long-term Cash flows

Sensitivity Analysis on Long-term Cash flows Sensitivity Analysis on Long-term Cash flows Hyungbin Park Worcester Polytechnic Institute 19 March 2016 Eastern Conference on Mathematical Finance Worcester Polytechnic Institute, Worceseter, MA 1 / 49

More information

No-Arbitrage Conditions for a Finite Options System

No-Arbitrage Conditions for a Finite Options System No-Arbitrage Conditions for a Finite Options System Fabio Mercurio Financial Models, Banca IMI Abstract In this document we derive necessary and sufficient conditions for a finite system of option prices

More information

Alain Hertz 1 and Sacha Varone 2. Introduction A NOTE ON TREE REALIZATIONS OF MATRICES. RAIRO Operations Research Will be set by the publisher

Alain Hertz 1 and Sacha Varone 2. Introduction A NOTE ON TREE REALIZATIONS OF MATRICES. RAIRO Operations Research Will be set by the publisher RAIRO Operations Research Will be set by the publisher A NOTE ON TREE REALIZATIONS OF MATRICES Alain Hertz and Sacha Varone 2 Abstract It is well known that each tree metric M has a unique realization

More information

Optimal Portfolios and Random Matrices

Optimal Portfolios and Random Matrices Optimal Portfolios and Random Matrices Javier Acosta Nai Li Andres Soto Shen Wang Ziran Yang University of Minnesota, Twin Cities Mentor: Chris Bemis, Whitebox Advisors January 17, 2015 Javier Acosta Nai

More information

Log-linear Dynamics and Local Potential

Log-linear Dynamics and Local Potential Log-linear Dynamics and Local Potential Daijiro Okada and Olivier Tercieux [This version: November 28, 2008] Abstract We show that local potential maximizer ([15]) with constant weights is stochastically

More information

Skewness in DSGE models

Skewness in DSGE models Skewness in DSGE models Grzegorz Grabek a, Bohdan K los a, Grzegorz Koloch a,b,c a National Bank of Poland, Economic Institute, Bureau of Applied Research b Warsaw School of Economics, Institute of Econometrics

More information

arxiv: v1 [math.st] 6 Jun 2014

arxiv: v1 [math.st] 6 Jun 2014 Strong noise estimation in cubic splines A. Dermoune a, A. El Kaabouchi b arxiv:1406.1629v1 [math.st] 6 Jun 2014 a Laboratoire Paul Painlevé, USTL-UMR-CNRS 8524. UFR de Mathématiques, Bât. M2, 59655 Villeneuve

More information

On the complexity of computing the handicap of a sufficient matrix

On the complexity of computing the handicap of a sufficient matrix On the complexity of computing the handicap of a sufficient matrix Etienne de Klerk and Marianna Nagy September 14, 2010 Abstract The class of sufficient matrices is important in the study of the linear

More information

Image analysis of malign melanoma: Waveles and svd

Image analysis of malign melanoma: Waveles and svd Image analysis of malign melanoma: Waveles and svd Dan Dolonius University of Gothenburg gusdolod@student.gu.se April 28, 2015 Dan Dolonius (Applied Mathematics) Image analysis of malign melanoma April

More information

Integrating rational functions (Sect. 8.4)

Integrating rational functions (Sect. 8.4) Integrating rational functions (Sect. 8.4) Integrating rational functions, p m(x) q n (x). Polynomial division: p m(x) The method of partial fractions. p (x) (x r )(x r 2 ) p (n )(x). (Repeated roots).

More information

Higher Order Freeness: A Survey. Roland Speicher Queen s University Kingston, Canada

Higher Order Freeness: A Survey. Roland Speicher Queen s University Kingston, Canada Higher Order Freeness: A Survey Roland Speicher Queen s University Kingston, Canada Second order freeness and fluctuations of random matrices: Mingo + Speicher: I. Gaussian and Wishart matrices and cyclic

More information

Graph signal processing for clustering

Graph signal processing for clustering Graph signal processing for clustering Nicolas Tremblay PANAMA Team, INRIA Rennes with Rémi Gribonval, Signal Processing Laboratory 2, EPFL, Lausanne with Pierre Vandergheynst. What s clustering? N. Tremblay

More information

LECTURE 3: FREE CENTRAL LIMIT THEOREM AND FREE CUMULANTS

LECTURE 3: FREE CENTRAL LIMIT THEOREM AND FREE CUMULANTS LECTURE 3: FREE CENTRAL LIMIT THEOREM AND FREE CUMULANTS Recall from Lecture 2 that if (A, φ) is a non-commutative probability space and A 1,..., A n are subalgebras of A which are free with respect to

More information

Applying the Principles of Quantitative Finance to the Construction of Model-Free Volatility Indices

Applying the Principles of Quantitative Finance to the Construction of Model-Free Volatility Indices Applying the Principles of Quantitative Finance to the Construction of Model-Free Volatility Indices Christopher Ting http://www.mysmu.edu/faculty/christophert/ Christopher Ting : christopherting@smu.edu.sg

More information

Simulating more interesting stochastic processes

Simulating more interesting stochastic processes Chapter 7 Simulating more interesting stochastic processes 7. Generating correlated random variables The lectures contained a lot of motivation and pictures. We'll boil everything down to pure algebra

More information

OPTIMAL PORTFOLIO CONTROL WITH TRADING STRATEGIES OF FINITE

OPTIMAL PORTFOLIO CONTROL WITH TRADING STRATEGIES OF FINITE Proceedings of the 44th IEEE Conference on Decision and Control, and the European Control Conference 005 Seville, Spain, December 1-15, 005 WeA11.6 OPTIMAL PORTFOLIO CONTROL WITH TRADING STRATEGIES OF

More information

PRICING AND HEDGING MULTIVARIATE CONTINGENT CLAIMS

PRICING AND HEDGING MULTIVARIATE CONTINGENT CLAIMS PRICING AND HEDGING MULTIVARIATE CONTINGENT CLAIMS RENÉ CARMONA AND VALDO DURRLEMAN ABSTRACT This paper provides with approximate formulas that generalize Black-Scholes formula in all dimensions Pricing

More information

MAT 4250: Lecture 1 Eric Chung

MAT 4250: Lecture 1 Eric Chung 1 MAT 4250: Lecture 1 Eric Chung 2Chapter 1: Impartial Combinatorial Games 3 Combinatorial games Combinatorial games are two-person games with perfect information and no chance moves, and with a win-or-lose

More information

IDENTIFYING BROAD AND NARROW FINANCIAL RISK FACTORS VIA CONVEX OPTIMIZATION: PART I

IDENTIFYING BROAD AND NARROW FINANCIAL RISK FACTORS VIA CONVEX OPTIMIZATION: PART I 1 IDENTIFYING BROAD AND NARROW FINANCIAL RISK FACTORS VIA CONVEX OPTIMIZATION: PART I Lisa Goldberg lrg@berkeley.edu MMDS Workshop. June 22, 2016. joint with Alex Shkolnik and Jeff Bohn. Identifying Broad

More information

Computational Finance Finite Difference Methods

Computational Finance Finite Difference Methods Explicit finite difference method Computational Finance Finite Difference Methods School of Mathematics 2018 Today s Lecture We now introduce the final numerical scheme which is related to the PDE solution.

More information

Idiosyncratic risk, insurance, and aggregate consumption dynamics: a likelihood perspective

Idiosyncratic risk, insurance, and aggregate consumption dynamics: a likelihood perspective Idiosyncratic risk, insurance, and aggregate consumption dynamics: a likelihood perspective Alisdair McKay Boston University June 2013 Microeconomic evidence on insurance - Consumption responds to idiosyncratic

More information

Lecture Note of Bus 41202, Spring 2010: Analysis of Multiple Series with Applications. x 1t x 2t. holdings (OIH) and energy select section SPDR (XLE).

Lecture Note of Bus 41202, Spring 2010: Analysis of Multiple Series with Applications. x 1t x 2t. holdings (OIH) and energy select section SPDR (XLE). Lecture Note of Bus 41202, Spring 2010: Analysis of Multiple Series with Applications Focus on two series (i.e., bivariate case) Time series: Data: x 1, x 2,, x T. X t = Some examples: (a) U.S. quarterly

More information

Optimization in Finance

Optimization in Finance Research Reports on Mathematical and Computing Sciences Series B : Operations Research Department of Mathematical and Computing Sciences Tokyo Institute of Technology 2-12-1 Oh-Okayama, Meguro-ku, Tokyo

More information

FINITE DIFFERENCE METHODS

FINITE DIFFERENCE METHODS FINITE DIFFERENCE METHODS School of Mathematics 2013 OUTLINE Review 1 REVIEW Last time Today s Lecture OUTLINE Review 1 REVIEW Last time Today s Lecture 2 DISCRETISING THE PROBLEM Finite-difference approximations

More information

BOUNDS FOR THE LEAST SQUARES RESIDUAL USING SCALED TOTAL LEAST SQUARES

BOUNDS FOR THE LEAST SQUARES RESIDUAL USING SCALED TOTAL LEAST SQUARES BOUNDS FOR THE LEAST SQUARES RESIDUAL USING SCALED TOTAL LEAST SQUARES Christopher C. Paige School of Computer Science, McGill University Montreal, Quebec, Canada, H3A 2A7 paige@cs.mcgill.ca Zdeněk Strakoš

More information

Technical Note: Multi-Product Pricing Under the Generalized Extreme Value Models with Homogeneous Price Sensitivity Parameters

Technical Note: Multi-Product Pricing Under the Generalized Extreme Value Models with Homogeneous Price Sensitivity Parameters Technical Note: Multi-Product Pricing Under the Generalized Extreme Value Models with Homogeneous Price Sensitivity Parameters Heng Zhang, Paat Rusmevichientong Marshall School of Business, University

More information

Validation of Credit Rating Models - A Preliminary Look at Methodology and Literature Review

Validation of Credit Rating Models - A Preliminary Look at Methodology and Literature Review JCIC JCIC Column 1 93 1-15 Validation of Credit Rating Models - A Preliminary Look at Methodology and Literature Review Ming-Yi Sun, Szu-Fang Wang JCIC Risk Research Team I. Introduction In preparing for

More information

(Ir)rational Exuberance: Optimism, Ambiguity and Risk

(Ir)rational Exuberance: Optimism, Ambiguity and Risk (Ir)rational Exuberance: Optimism, Ambiguity and Risk Anat Bracha and Don Brown Boston FRB and Yale University October 2013 (Revised) nat Bracha and Don Brown (Boston FRB and Yale University) (Ir)rational

More information

The Null Condition and Global Existence of Nonlinear Elastic Waves

The Null Condition and Global Existence of Nonlinear Elastic Waves The Null ondition and Global Existence of Nonlinear Elastic Waves Thomas. Sideris 1 Department of Mathematics University of alifornia Santa Barbara, A 93106 1. Introduction The equations of motion for

More information

How can we factor polynomials?

How can we factor polynomials? How can we factor polynomials? Factoring refers to writing something as a product. Factoring completely means that all of the factors are relatively prime (they have a GCF of 1). Methods of factoring:

More information

Factors of 10 = = 2 5 Possible pairs of factors:

Factors of 10 = = 2 5 Possible pairs of factors: Factoring Trinomials Worksheet #1 1. b 2 + 8b + 7 Signs inside the two binomials are identical and positive. Factors of b 2 = b b Factors of 7 = 1 7 b 2 + 8b + 7 = (b + 1)(b + 7) 2. n 2 11n + 10 Signs

More information

Lecture 3 Representation of Games

Lecture 3 Representation of Games ecture 3 epresentation of Games 4. Game Theory Muhamet Yildiz oad Map. Cardinal representation Expected utility theory. Quiz 3. epresentation of games in strategic and extensive forms 4. Dominance; dominant-strategy

More information

Internet Appendix for Infrequent Rebalancing, Return Autocorrelation, and Seasonality

Internet Appendix for Infrequent Rebalancing, Return Autocorrelation, and Seasonality Internet Appendix for Infrequent Rebalancing, Return Autocorrelation, and Seasonality VINCENT BOGOUSSLAVSKY This appendix is in eight sections. Section I provides equilibrium existence conditions. Section

More information

1 Residual life for gamma and Weibull distributions

1 Residual life for gamma and Weibull distributions Supplement to Tail Estimation for Window Censored Processes Residual life for gamma and Weibull distributions. Gamma distribution Let Γ(k, x = x yk e y dy be the upper incomplete gamma function, and let

More information

Exercise sheet 10. Discussion: Thursday,

Exercise sheet 10. Discussion: Thursday, Exercise sheet 10 Discussion: Thursday, 04.02.2016. Exercise 10.1 Let K K n o, t > 0. Show that N (K, t B n ) N (K, 4t B n ) N (B n, (t/16)k ), N (B n, t K) N (B n, 4t K) N (K, (t/16)b n ). Hence, e.g.,

More information

General Equilibrium under Uncertainty

General Equilibrium under Uncertainty General Equilibrium under Uncertainty The Arrow-Debreu Model General Idea: this model is formally identical to the GE model commodities are interpreted as contingent commodities (commodities are contingent

More information

COMPREHENSIVE WRITTEN EXAMINATION, PAPER III FRIDAY AUGUST 18, 2006, 9:00 A.M. 1:00 P.M. STATISTICS 174 QUESTIONS

COMPREHENSIVE WRITTEN EXAMINATION, PAPER III FRIDAY AUGUST 18, 2006, 9:00 A.M. 1:00 P.M. STATISTICS 174 QUESTIONS COMPREHENSIVE WRITTEN EXAMINATION, PAPER III FRIDAY AUGUST 18, 2006, 9:00 A.M. 1:00 P.M. STATISTICS 174 QUESTIONS Answer all parts. Closed book, calculators allowed. It is important to show all working,

More information

Surface Curvatures. (Com S 477/577 Notes) Yan-Bin Jia. Oct 23, Curve on a Surface: Normal and Geodesic Curvatures

Surface Curvatures. (Com S 477/577 Notes) Yan-Bin Jia. Oct 23, Curve on a Surface: Normal and Geodesic Curvatures Surface Curvatures (Com S 477/577 Notes) Yan-Bin Jia Oct 23, 2017 1 Curve on a Surface: Normal and Geodesic Curvatures One way to examine how much a surface bends is to look at the curvature of curves

More information

EE/AA 578 Univ. of Washington, Fall Homework 8

EE/AA 578 Univ. of Washington, Fall Homework 8 EE/AA 578 Univ. of Washington, Fall 2016 Homework 8 1. Multi-label SVM. The basic Support Vector Machine (SVM) described in the lecture (and textbook) is used for classification of data with two labels.

More information