Save this PDF as:

Size: px
Start display at page:

## Transcription

1 ONDERZOEKSRAPPORT NR 8904 OPTIMAl PREMIUM CONTROl IN A NON-liFE INSURANCE BUSINESS BY M. VANDEBROEK & J. DHAENE D/1989/2376/5

2 1 IN A OPTIMAl PREMIUM CONTROl NON-liFE INSURANCE BUSINESS By Martina Vandebroek and Jan Dhaene Instituut voor Actuari~le Wetenschappen K. U. Leuven Dekenstraat Leuven (Belgium)

4 3 2. Model. We consider a model that is close to the model given by Martin-L~f [1983) to describe a branch of a non-life insurance business. Suppose that the premium Pt is received at the beginning of year t to cover the operating expenses Dt and the expenses for the claims St that incur in year t. The claims incurred during a particular year are not always determined in the same year but often with a delay of several years. To define the surplus at the end of year t, one estimates the remaining costs for the claims of that year. The difference between the estimated costs and the actual costs for claims in preceding years is called the runoff-profit At. The investment earnings are denoted by It. The total outflow in year t will be denoted by Xt and is defined by Xt = St + Dt - It - At ( 2) We assume that expenses are made in the middle of the year so that the surplus Gt at the end of year t is given by : Gt = R Gt-~ + R Pt - R Xt ( 3) where R = 1 + i stands for the interest factor. We will assume that we can obtain a reliable estimate for E[Xt], t=1,.. T, where T stands for the planning horizon. This may seem a strong assumption, but if one has some evidence that the assumed trend not longer holds, one can easily insert the new estimates in the model and calculate the optimal premium from that period on. We want to determine the premiums in the successive years l,... T in such a way that the following requirements are satisfied : * the accumulated surplus Gt must be sufficient to make the ruin probability as small as prescribed * the surplusses and the premiums should not deviate too much from prescribed values. These criteria can be expressed mathematically as follows where ~t minimize {Pt} T E { k t=l is fixed by the premium level wanted in year t and the Pt are prescribed by ruin theory. ( 4)

5 4 This provides us with a linear-quadratic control model that can be solved by control theory and which possesses some interesting properties. For a summary of that part of control theory that we will use in our derivation, see the appendix. For a detailed overview we refer to Chow [1975]. Our model can be written in the form : 1 [ R J Pc + [ 0 J + [ R~ 0 (EXt - Xc) J ( 5) and the objective function is the conditional expectation of T E l t=1 ( 6) given Ga. With the appropriate matrix definitions, ( 5) can be written as Yc =A Yc-~ + C Pc + be + Ut (7) where the Ut denote random vectors with zero mean, and ( 6) equals T E [ l (Yc t=1 - ac)t K (yt - ac) ]. ( 8) 3. Results As is explained in the appendix, the optimal control can be expressed recursively starting from the last period T. In some situations, these recursions reach a steady state fort smaller than a certain value. We will derive this steady state for our problem and proof that this steady state control can be applied from now on up to a certain time. For the years immediately preceding T, the optimal control must be derived using the equations given in the appendix. It will appear from the numerical examples in section 4 that this steady state solution can be applied for the greatest part of the T years.

6 5 Lemma. The solutions to the following system of matrix equations M -(CT H C)-~ CT H A H K + (A + c M)T H (A + C M) with c, A and K defined by ( 5) ' ( 6) ( 7) and ( 8) are given by H = [ ~ ( 9) (10) ( 11) and M R 2 h [ 0 RZ h ) (12) where h is a solution to 0. ( 13) Proof : From (10) it follows that H is a symmetric matrix. If we set H we will find, after some straightforward calculations that (14) and M 0 (15) For A + C M we get 0 A+CM=[ 0 such that (10) becomes - N-~ (R h2 + RZ h3) R - N-~ (R2 h2 + R3 h3) (16) from which h~. h2 and h3 can be determined. Inserting these values in (14) and (15) provides us with (12). (17) The steady state solution for the premium control exists if the characteristic roots of A + C M ) are smaller than 1 in absolute value. Form (16) we know that this is satisfied if lsi < 1 or h-+-~;-hl < 1. (18)

7 6 For realistic values of R their exists exactly one solution to (13) that satisfies (18). For some interest rates between 0 and 0.1 this solution, together with the value of the characteristic root in (18), is given in table 1. Table 1 R h R/(l+R 2 h) Now we are able to derive the steady state premium control. Theorem. The steady state premium control is given by R 2 h where dt is defined recursively by R 2 h with the initial condition dt [3T R (19) (20) and his determined as the solution to (13), satisfying (18).

8 7 Proof : From the appendix it follows that the steady state solution is given by (21) where M is given by (12) and gt by gt =- (CT H C)- 1 CT (H be - ht) The he in (22) are determined by the following recursion he = K ac + (A + C M)T (ht+1 - H bt+1) with the initial condition The matrix H in (22) and (23) was given in (11). (22) (23) (24) Straightforward calculations provide us with where dt is given by (20). Calculating (22) yields then J 1 gc =- [ ~t + R 312 h EXt+ R de ]. N where N was defined in (14). (25) (26) The premium control given by (19) and (20) clearly is a linear feedback control of a form similar to the one that was given in (1), namely a decreasing function of the surplus and an increasing function of the expected claim. The recursion relation (20) can be solved explicitly to give T-t de = ~t + ~ s~- 1 { s ~t+~ + r ~t+~ + h R 112 s EXc+~ } i=1 where r and s were defined in (17) and are equal to R2 h R r = and s = (27) (28)

9 8 The following special case can be useful to cope with inflation in the model If <Xt - k ext-~ ex~ = ex), f3t - k f3t-~ f3~ = f3) ' (29) and EXt = k EXt-~ (EX:~.. = J.L) (27) becomes dt kt-~ f3 1 - (k S)T-t (30) k s If jk sj < 1 and the considered period is very large, the term (k s)t-t is negligible for t sufficiently small. In case k = 1, we get a steady state premium control with constant coefficients. It is intuitively clear that for constant claim amounts in the successive years (Xt = J.L, t ~ 1) the premium should be given by R-~ J.L and that no reserve should be built up in this case. This assertion is formally stated and proved in the following corollary which gives a first indication that the model provides us with useful results Corollary. If Go = 0, EXt = Xt = J.L, ex = R-~ J.L, f3 = 0 and the period T is sufficiently large then the steady state solution is given by : Gt = 0 and Pt = R-~ J.L (t ~ 1). Proof : From (30) we get J.L 1 - s o. (31) The premium control (19) becomes then R312 h J.L + R-:t../2 J.L Pt = - R s h Gt-:t R 2 h which is equal to Pt - R 2 s h Gt-:t.. + R-~ f.l The result is then obtained with the help of (3). (32)

11 10 This premium is lower than the expected claim because the interest that is received on each year. the surplus and on the premiums provide us with a premium reduction Remark that with our method the premiums and the surplusses converge much faster than with the method that was proposed by Martin-L~f [1975] :3 12 1J I 0.11 O.B 0.7 t; 0.0 OLi 0 claim +premium <> surplus 0.4 O.:J 02 OJ /:! ft 6 II 10 Figure constant claims, initial surplus 0 Given a linear model APPENDIX (Al) where Yt is a vector of dependent variables and lagged control variables, Pt is the control variable, A and C are given constant matrices, bt is a constant vector and the Ut denotes a random vector with zero mean and finite second moments that is independent of Yt-1 Assume further that the following quadratic loss function is given w T ~ (yt- at)t K (yt- at) ]. t=l (A2) The problem consists in choosing P1, P2,... PT to minimize the conditional expectation E(W], given the initial condition Yo.

12 11 The solution is given by Pt Mt Yt-1 + gt with Mt -(CT Ht C)-"- (CT Ht A) (A3) gt -(CT Ht C)-"- CT (Ht bt - he) (A4) Ht-"- K + (A + c Mt)T Ht (A + C Mt) ht-1 K at-"- + (A + c Mt)T (ht - Htbt). and the initial conditions (AS) The solution may reach a steady state for t smaller than a certain value, thus satisfying M -(CT H C)-"- (CT H A) (A6) H K + (A + c M) T H (A + c M). This steady state will exist if and only if all the characteristic roots of (A + C M) are smaller than 1 in absolute value. Remark that even if a steady state is reached, ge and ht will change in time when at and bt vary in time. (A7) References CHOW G.C. (1975) Analysis and control of dynamic economic systems, John Wiley & Sons, Inc. Gray J.R. (1984) Some risky reflections, Scandinavian Actuarial Journal, nr 4, pp MARTIN-LtlF A. (1983) Premium control in an insurance system, an approach using linear control ~heory, Scandinavian Actuarial Journal, nr 1, pp Martina Vandebroek and Jan Dhaene Katholieke Universiteit Leuven Dekenstraat 2 B-3000 LEUVEN

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### 3.7 Non-autonomous linear systems of ODE. General theory

3.7 Non-autonomous linear systems of ODE. General theory Now I will study the ODE in the form ẋ = A(t)x + g(t), x(t) R k, A, g C(I), (3.1) where now the matrix A is time dependent and continuous on some

### Nonparametric adaptive age replacement with a one-cycle criterion

Nonparametric adaptive age replacement with a one-cycle criterion P. Coolen-Schrijner, F.P.A. Coolen Department of Mathematical Sciences University of Durham, Durham, DH1 3LE, UK e-mail: Pauline.Schrijner@durham.ac.uk

### MINIMUM SOLVENCY MARGIN OF A GENERAL INSURANCE COMPANY: PROPOSALS AND CURIOSITIES ROBERTO DARIS GIANNI BOSI

Insurance Convention 1998 General & ASTIN Colloquium MINIMUM SOLVENCY MARGIN OF A GENERAL INSURANCE COMPANY: PROPOSALS AND CURIOSITIES ROBERTO DARIS GIANNI BOSI 1998 GENERAL INSURANCE CONVENTION AND ASTIN

### 5 Indefinite integral

5 Indefinite integral The most of the mathematical operations have inverse operations: the inverse operation of addition is subtraction, the inverse operation of multiplication is division, the inverse

### Fair Valuation and Hedging of Participating Life-Insurance Policies under Management Discretion

Fair Valuation and Hedging of Participating Life-Insurance Policies under Management Discretion Torsten Kleinow Department of Actuarial Mathematics and Statistics and the Maxwell Institute for Mathematical

### Quadratic Equations in Finite Fields of Characteristic 2

Quadratic Equations in Finite Fields of Characteristic 2 Klaus Pommerening May 2000 english version February 2012 Quadratic equations over fields of characteristic 2 are solved by the well known quadratic

### 10.3 POWER METHOD FOR APPROXIMATING EIGENVALUES

58 CHAPTER NUMERICAL METHODS. POWER METHOD FOR APPROXIMATING EIGENVALUES In Chapter 7 you saw that the eigenvalues of an n n matrix A are obtained by solving its characteristic equation n c nn c nn...

### CITY 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

### 5. Convergence of sequences of random variables

5. Convergence of sequences of random variables Throughout this chapter we assume that {X, X 2,...} is a sequence of r.v. and X is a r.v., and all of them are defined on the same probability space (Ω,

### LS.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

### 10.3 POWER METHOD FOR APPROXIMATING EIGENVALUES

55 CHAPTER NUMERICAL METHODS. POWER METHOD FOR APPROXIMATING EIGENVALUES In Chapter 7 we saw that the eigenvalues of an n n matrix A are obtained by solving its characteristic equation n c n n c n n...

### The Method of Least Squares

The Method of Least Squares Steven J. Miller Mathematics Department Brown University Providence, RI 0292 Abstract The Method of Least Squares is a procedure to determine the best fit line to data; the

### Solutions series for some non-harmonic motion equations

Fifth Mississippi State Conference on Differential Equations and Computational Simulations, Electronic Journal of Differential Equations, Conference 10, 2003, pp 115 122. http://ejde.math.swt.edu or http://ejde.math.unt.edu

### Forecasting Methods. What is forecasting? Why is forecasting important? How can we evaluate a future demand? How do we make mistakes?

Forecasting Methods What is forecasting? Why is forecasting important? How can we evaluate a future demand? How do we make mistakes? Prod - Forecasting Methods Contents. FRAMEWORK OF PLANNING DECISIONS....

### Living to 100: Survival to Advanced Ages: Insurance Industry Implication on Retirement Planning and the Secondary Market in Insurance

Living to 100: Survival to Advanced Ages: Insurance Industry Implication on Retirement Planning and the Secondary Market in Insurance Jay Vadiveloo, * Peng Zhou, Charles Vinsonhaler, and Sudath Ranasinghe

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### General Theory of Differential Equations Sections 2.8, 3.1-3.2, 4.1

A B I L E N E C H R I S T I A N U N I V E R S I T Y Department of Mathematics General Theory of Differential Equations Sections 2.8, 3.1-3.2, 4.1 Dr. John Ehrke Department of Mathematics Fall 2012 Questions

### OPTIMAL SELECTION BASED ON RELATIVE RANK* (the "Secretary Problem")

OPTIMAL SELECTION BASED ON RELATIVE RANK* (the "Secretary Problem") BY Y. S. CHOW, S. MORIGUTI, H. ROBBINS AND S. M. SAMUELS ABSTRACT n rankable persons appear sequentially in random order. At the ith

### THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE. Alexander Barvinok

THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE Alexer Barvinok Papers are available at http://www.math.lsa.umich.edu/ barvinok/papers.html This is a joint work with J.A. Hartigan

### CASH FLOW MATCHING PROBLEM WITH CVaR CONSTRAINTS: A CASE STUDY WITH PORTFOLIO SAFEGUARD. Danjue Shang and Stan Uryasev

CASH FLOW MATCHING PROBLEM WITH CVaR CONSTRAINTS: A CASE STUDY WITH PORTFOLIO SAFEGUARD Danjue Shang and Stan Uryasev PROJECT REPORT #2011-1 Risk Management and Financial Engineering Lab Department of

### A 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

### OPTIMAL CONTROL OF A COMMERCIAL LOAN REPAYMENT PLAN. E.V. Grigorieva. E.N. Khailov

DISCRETE AND CONTINUOUS Website: http://aimsciences.org DYNAMICAL SYSTEMS Supplement Volume 2005 pp. 345 354 OPTIMAL CONTROL OF A COMMERCIAL LOAN REPAYMENT PLAN E.V. Grigorieva Department of Mathematics

### CONTROLLABILITY. 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

### COMPLETE MARKETS DO NOT ALLOW FREE CASH FLOW STREAMS

COMPLETE MARKETS DO NOT ALLOW FREE CASH FLOW STREAMS NICOLE BÄUERLE AND STEFANIE GRETHER Abstract. In this short note we prove a conjecture posed in Cui et al. 2012): Dynamic mean-variance problems in

### 7: The CRR Market Model

Ben Goldys and Marek Rutkowski School of Mathematics and Statistics University of Sydney MATH3075/3975 Financial Mathematics Semester 2, 2015 Outline We will examine the following issues: 1 The Cox-Ross-Rubinstein

### MATH 590: Meshfree Methods

MATH 590: Meshfree Methods Chapter 7: Conditionally Positive Definite Functions Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2010 fasshauer@iit.edu MATH 590 Chapter

### 1 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

### Lecture Notes on Polynomials

Lecture Notes on Polynomials Arne Jensen Department of Mathematical Sciences Aalborg University c 008 Introduction These lecture notes give a very short introduction to polynomials with real and complex

### MASSACHUSETTS CAMBRIDGE, MASSACHUSETTS 02139 SLOAN SCHOOL OF MANAGEMENT INSTITUTE OF TECHNOLOGY. Wilcox. Jarrod W. December 1970 495-70

MflaittMi] SLOAN SCHOOL OF MANAGEMENT A SIMPLE THEORY OF FINANCIAL RATIOS AS PREDICTORS OF FAILURE Jarrod W. Wilcox December 1970 495-70 MASSACHUSETTS INSTITUTE OF TECHNOLOGY 50 MEMORIAL DRIVE CAMBRIDGE,

### Second Order Linear Nonhomogeneous Differential Equations; Method of Undetermined Coefficients. y + p(t) y + q(t) y = g(t), g(t) 0.

Second Order Linear Nonhomogeneous Differential Equations; Method of Undetermined Coefficients We will now turn our attention to nonhomogeneous second order linear equations, equations with the standard

### Lecture 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

### NOTES ON LINEAR TRANSFORMATIONS

NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all

### Linear-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

### MATH10212 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

### Lecture Notes to Accompany. Scientific Computing An Introductory Survey. by Michael T. Heath. Chapter 10

Lecture Notes to Accompany Scientific Computing An Introductory Survey Second Edition by Michael T. Heath Chapter 10 Boundary Value Problems for Ordinary Differential Equations Copyright c 2001. Reproduction

### IEOR 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)

### A SURVEY ON CONTINUOUS ELLIPTICAL VECTOR DISTRIBUTIONS

A SURVEY ON CONTINUOUS ELLIPTICAL VECTOR DISTRIBUTIONS Eusebio GÓMEZ, Miguel A. GÓMEZ-VILLEGAS and J. Miguel MARÍN Abstract In this paper it is taken up a revision and characterization of the class of

### D-optimal plans in observational studies

D-optimal plans in observational studies Constanze Pumplün Stefan Rüping Katharina Morik Claus Weihs October 11, 2005 Abstract This paper investigates the use of Design of Experiments in observational

### THREE DIMENSIONAL GEOMETRY

Chapter 8 THREE DIMENSIONAL GEOMETRY 8.1 Introduction In this chapter we present a vector algebra approach to three dimensional geometry. The aim is to present standard properties of lines and planes,

### Lecture 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

### Asymptotics of discounted aggregate claims for renewal risk model with risky investment

Appl. Math. J. Chinese Univ. 21, 25(2: 29-216 Asymptotics of discounted aggregate claims for renewal risk model with risky investment JIANG Tao Abstract. Under the assumption that the claim size is subexponentially

### Jung-Soon Hyun and Young-Hee Kim

J. Korean Math. Soc. 43 (2006), No. 4, pp. 845 858 TWO APPROACHES FOR STOCHASTIC INTEREST RATE OPTION MODEL Jung-Soon Hyun and Young-Hee Kim Abstract. We present two approaches of the stochastic interest

### Multiplicity. Chapter 6

Chapter 6 Multiplicity The fundamental theorem of algebra says that any polynomial of degree n 0 has exactly n roots in the complex numbers if we count with multiplicity. The zeros of a polynomial are

### Chapter 7. BANDIT PROBLEMS.

Chapter 7. BANDIT PROBLEMS. Bandit problems are problems in the area of sequential selection of experiments, and they are related to stopping rule problems through the theorem of Gittins and Jones (974).

### Safety margins for unsystematic biometric risk in life and health insurance

Safety margins for unsystematic biometric risk in life and health insurance Marcus C. Christiansen June 1, 2012 7th Conference in Actuarial Science & Finance on Samos Seite 2 Safety margins for unsystematic

### 1 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

### HW6 Solutions. MATH 20D Fall 2013 Prof: Sun Hui TA: Zezhou Zhang (David) November 14, 2013. Checklist: Section 7.8: 1c, 2, 7, 10, [16]

HW6 Solutions MATH D Fall 3 Prof: Sun Hui TA: Zezhou Zhang David November 4, 3 Checklist: Section 7.8: c,, 7,, [6] Section 7.9:, 3, 7, 9 Section 7.8 In Problems 7.8. thru 4: a Draw a direction field and

### Taylor Polynomials and Taylor Series Math 126

Taylor Polynomials and Taylor Series Math 26 In many problems in science and engineering we have a function f(x) which is too complicated to answer the questions we d like to ask. In this chapter, we will

### COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS

Bull Austral Math Soc 77 (2008), 31 36 doi: 101017/S0004972708000038 COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS IGOR V EROVENKO and B SURY (Received 12 April 2007) Abstract We compute

### JANUARY 2016 EXAMINATIONS. Life Insurance I

PAPER CODE NO. MATH 273 EXAMINER: Dr. C. Boado-Penas TEL.NO. 44026 DEPARTMENT: Mathematical Sciences JANUARY 2016 EXAMINATIONS Life Insurance I Time allowed: Two and a half hours INSTRUCTIONS TO CANDIDATES:

### Lecture 2 of 4-part series. Spring School on Risk Management, Insurance and Finance European University at St. Petersburg, Russia.

Principles and Lecture 2 of 4-part series Capital Spring School on Risk, Insurance and Finance European University at St. Petersburg, Russia 2-4 April 2012 Fair Wang s University of Connecticut, USA page

### Chapter 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

### Applications to Data Smoothing and Image Processing I

Applications to Data Smoothing and Image Processing I MA 348 Kurt Bryan Signals and Images Let t denote time and consider a signal a(t) on some time interval, say t. We ll assume that the signal a(t) is

### Copyrighted Material. Chapter 1 DEGREE OF A CURVE

Chapter 1 DEGREE OF A CURVE Road Map The idea of degree is a fundamental concept, which will take us several chapters to explore in depth. We begin by explaining what an algebraic curve is, and offer two

### Chapter 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

### Control Systems Design

ELEC4410 Control Systems Design Lecture 17: State Feedback Julio H Braslavsky julio@eenewcastleeduau School of Electrical Engineering and Computer Science Lecture 17: State Feedback p1/23 Outline Overview

### Lecture 3: Fourier Series: pointwise and uniform convergence.

Lecture 3: Fourier Series: pointwise and uniform convergence. 1. Introduction. At the end of the second lecture we saw that we had for each function f L ([, π]) a Fourier series f a + (a k cos kx + b k

### These axioms must hold for all vectors ū, v, and w in V and all scalars c and d.

DEFINITION: A vector space is a nonempty set V of objects, called vectors, on which are defined two operations, called addition and multiplication by scalars (real numbers), subject to the following axioms

### Mathematical 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

### Degree project CUBIC CONGRUENCE EQUATIONS

Degree project CUBIC CONGRUENCE EQUATIONS Author: Qadeer Ahmad Supervisor: Per-Anders Svensson Date: 2012-05-09 Subject: Mathematics and Modeling Level: Master Course code:5ma11e Abstract Let N m(f(x))

### FAST SENSITIVITY COMPUTATIONS FOR MONTE CARLO VALUATION OF PENSION FUNDS

FAST SENSITIVITY COMPUTATIONS FOR MONTE CARLO VALUATION OF PENSION FUNDS MARK JOSHI AND DAVID PITT Abstract. Sensitivity analysis, or so-called stress-testing, has long been part of the actuarial contribution

### A Second Course in Elementary Differential Equations: Problems and Solutions. Marcel B. Finan Arkansas Tech University c All Rights Reserved

A Second Course in Elementary Differential Equations: Problems and Solutions Marcel B. Finan Arkansas Tech University c All Rights Reserved Contents 8 Calculus of Matrix-Valued Functions of a Real Variable

### Eigenvalues, 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

### 7.5 Exponential Growth and Decay

7.5 Exponential Growth and Decay Mark Woodard Furman U Fall 2010 Mark Woodard (Furman U) 7.5 Exponential Growth and Decay Fall 2010 1 / 11 Outline 1 The general model 2 Examples 3 Doubling-time and half-life

### Subsets of Euclidean domains possessing a unique division algorithm

Subsets of Euclidean domains possessing a unique division algorithm Andrew D. Lewis 2009/03/16 Abstract Subsets of a Euclidean domain are characterised with the following objectives: (1) ensuring uniqueness

### Introduction to Algebraic Geometry. Bézout s Theorem and Inflection Points

Introduction to Algebraic Geometry Bézout s Theorem and Inflection Points 1. The resultant. Let K be a field. Then the polynomial ring K[x] is a unique factorisation domain (UFD). Another example of a

### SETTING A BONUS-MALUS SCALE IN THE PRESENCE OF OTHER RATING FACTORS GREG TAYLOR

SETTING A BONUS-MALUS SCALE IN THE PRESENCE OF OTHER RATING FACTORS GREG TAYLOR Consultant, Tillinghast-Towers Perrin, GPO Box 3279, Sydney NSW 2001, AUSTRALIA and Professorial Associate, Centre for Actuarial

### (Quasi-)Newton methods

(Quasi-)Newton methods 1 Introduction 1.1 Newton method Newton method is a method to find the zeros of a differentiable non-linear function g, x such that g(x) = 0, where g : R n R n. Given a starting

### Some Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.

Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,

### Scientific Computing: An Introductory Survey

Scientific Computing: An Introductory Survey Chapter 10 Boundary Value Problems for Ordinary Differential Equations Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign

### Solution. Let us write s for the policy year. Then the mortality rate during year s is q 30+s 1. q 30+s 1

Solutions to the May 213 Course MLC Examination by Krzysztof Ostaszewski, http://wwwkrzysionet, krzysio@krzysionet Copyright 213 by Krzysztof Ostaszewski All rights reserved No reproduction in any form

### MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.

MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar

### BOUNDED, ASYMPTOTICALLY STABLE, AND L 1 SOLUTIONS OF CAPUTO FRACTIONAL DIFFERENTIAL EQUATIONS. Muhammad N. Islam

Opuscula Math. 35, no. 2 (215), 181 19 http://dx.doi.org/1.7494/opmath.215.35.2.181 Opuscula Mathematica BOUNDED, ASYMPTOTICALLY STABLE, AND L 1 SOLUTIONS OF CAPUTO FRACTIONAL DIFFERENTIAL EQUATIONS Muhammad

### Safety margins for unsystematic biometric risk in life and health insurance

Safety margins for unsystematic biometric risk in life and health insurance Marcus C. Christiansen Preprint Series: 20-04 Fakultät für Mathematik und Wirtschaftswissenschaften UNIVERSITÄT ULM Safety margins

### Time series Forecasting using Holt-Winters Exponential Smoothing

Time series Forecasting using Holt-Winters Exponential Smoothing Prajakta S. Kalekar(04329008) Kanwal Rekhi School of Information Technology Under the guidance of Prof. Bernard December 6, 2004 Abstract

### ORDINARY DIFFERENTIAL EQUATIONS

ORDINARY DIFFERENTIAL EQUATIONS GABRIEL NAGY Mathematics Department, Michigan State University, East Lansing, MI, 48824. SEPTEMBER 4, 25 Summary. This is an introduction to ordinary differential equations.

### The 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

### Matrix Methods for Linear Systems of Differential Equations

Matrix Methods for Linear Systems of Differential Equations We now present an application of matrix methods to linear systems of differential equations. We shall follow the development given in Chapter

### Lectures on Stochastic Processes. William G. Faris

Lectures on Stochastic Processes William G. Faris November 8, 2001 2 Contents 1 Random walk 7 1.1 Symmetric simple random walk................... 7 1.2 Simple random walk......................... 9 1.3

### 1.5 Elementary Matrices and a Method for Finding the Inverse

.5 Elementary Matrices and a Method for Finding the Inverse Definition A n n matrix is called an elementary matrix if it can be obtained from I n by performing a single elementary row operation Reminder:

### Solution Using the geometric series a/(1 r) = x=1. x=1. Problem For each of the following distributions, compute

Math 472 Homework Assignment 1 Problem 1.9.2. Let p(x) 1/2 x, x 1, 2, 3,..., zero elsewhere, be the pmf of the random variable X. Find the mgf, the mean, and the variance of X. Solution 1.9.2. Using the

### A liability driven approach to asset allocation

A liability driven approach to asset allocation Xinliang Chen 1, Jan Dhaene 2, Marc Goovaerts 2, Steven Vanduffel 3 Abstract. We investigate a liability driven methodology for determining optimal asset

### Linear Equations in One Variable

Linear Equations in One Variable MATH 101 College Algebra J. Robert Buchanan Department of Mathematics Summer 2012 Objectives In this section we will learn how to: Recognize and combine like terms. Solve

### Moreover, under the risk neutral measure, it must be the case that (5) r t = µ t.

LECTURE 7: BLACK SCHOLES THEORY 1. Introduction: The Black Scholes Model In 1973 Fisher Black and Myron Scholes ushered in the modern era of derivative securities with a seminal paper 1 on the pricing

### Summary of week 8 (Lectures 22, 23 and 24)

WEEK 8 Summary of week 8 (Lectures 22, 23 and 24) This week we completed our discussion of Chapter 5 of [VST] Recall that if V and W are inner product spaces then a linear map T : V W is called an isometry

### An Extension Model of Financially-Balanced Bonus-Malus System

An Extension Model of Financially-Balanced Bonus-Malus System Xiao Yugu 1), Meng Shengwang 1), Robert Conger 2) 1. School of Statistics, Renmin University of China 2. Towers Perrin, Chicago Contents Introduction

### T ( a i x i ) = a i T (x i ).

Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)

### Section 4.4 Inner Product Spaces

Section 4.4 Inner Product Spaces In our discussion of vector spaces the specific nature of F as a field, other than the fact that it is a field, has played virtually no role. In this section we no longer

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

### P (A) = lim P (A) = N(A)/N,

1.1 Probability, Relative Frequency and Classical Definition. Probability is the study of random or non-deterministic experiments. Suppose an experiment can be repeated any number of times, so that we

### Lecture 12 Basic Lyapunov theory

EE363 Winter 2008-09 Lecture 12 Basic Lyapunov theory stability positive definite functions global Lyapunov stability theorems Lasalle s theorem converse Lyapunov theorems finding Lyapunov functions 12

### Integer roots of quadratic and cubic polynomials with integer coefficients

Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street

### 4.5 Linear Dependence and Linear Independence

4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then

### 10.4 APPLICATIONS OF NUMERICAL METHODS Applications of Gaussian Elimination with Pivoting

558 HAPTER NUMERIAL METHODS 5. (a) ompute the eigenvalues of A 5. (b) Apply four iterations of the power method with scaling to each matrix in part (a), starting with x,. 5. (c) ompute the ratios for A

### The Delta Method and Applications

Chapter 5 The Delta Method and Applications 5.1 Linear approximations of functions In the simplest form of the central limit theorem, Theorem 4.18, we consider a sequence X 1, X,... of independent and

### Determinants. Dr. Doreen De Leon Math 152, Fall 2015

Determinants Dr. Doreen De Leon Math 52, Fall 205 Determinant of a Matrix Elementary Matrices We will first discuss matrices that can be used to produce an elementary row operation on a given matrix A.

### Name: Exam 1. y = 10 t 2. y(0) = 3

Instructions. Answer each of the questions on your own paper. Be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without