Lecture VIII. Global Approximation Methods: I

Transcription

1 Lecture VIII Global Approximation Methods: I Gianluca Violante New York University Quantitative Macroeconomics G. Violante, Global Methods p. 1 /29

2 Global function approximation Global methods: function interpolation over the entire domain First choice: type of approximation 1. Interpolation I: finite element methods Splines (e.g., B-splines, cubic splines, Schumaker splines) 2. Interpolation II: spectral methods Orthogonal polynomials (e.g., Chebyshev, Lagrange, etc...) Second choice: how to minimize residuals between true function and interpolant 1. Collocation 2. Least squares 3. Galerkin method G. Violante, Global Methods p. 2 /29

3 Interpolation Today, one dimension. We want to represent a real-valued function f on [a,b] with a computationally tractable function Interpolation is a form of function approximation in which the approximating (interpolant) and the true function must agree, i.e. they must have same value, at a finite number of points. In some cases additional restrictions are imposed on the interpolant. E.g., f evaluated at a finite number of points may have to agree with that of the underlying function. Other examples include additional constraints imposed on the interpolant such as monotonicity, convexity, or smoothness requirements. In general, interpolation is any method that takes information at a finite set of points, X, and finds a function which satisfies that information at X. G. Violante, Global Methods p. 3 /29

4 Interpolation We want to approximate a known function f (x). The interpolant ˆf is chosen to be a linear combination of a collection of basis functions {φ j (x)} n j=0 where n is the order/degree of interpolation Basis functions: linearly independent functions that span the family of functions chosen for the interpolation (the function space) any function in the space can be obtained as a linear combination of basis functions, just as every vector in a vector space can be obtained as a linear combination of basis vectors. In general we are interested in the space of continuous or continuously differentiable functions. G. Violante, Global Methods p. 4 /29

5 Interpolation Thus, for a given family of basis function {φ j } n j=0 we have: f(x) ˆf(x) n w j φ j (x) j=0 We have reduced the problem of characterizing an infinite-dimensional object, f, to the problem of determining the n weights (or coefficients) {w j } There is arbitrariness in interpolation: there are arbitrarily many functions passing through a finite number of points. Which basis? Choices: spectral or finite element methods depending whether the basis functions are nonzero over the entire domain of the true function (except possibly at a finite number of points) or nonzero only on a subinterval of the domain. G. Violante, Global Methods p. 5 /29

6 Finite element methods Use local basis These are called splines An order n spline consists of a series of n th order polynomial segments spliced together so as to preserve continuity of derivatives of order n 1 or less. The points at which the pieces are spliced together are called knots or breakpoints. By convention the first and last knots are the two extremes of the function domain. G. Violante, Global Methods p. 6 /29

7 Splines An order n spline with K +1 knots has K(n+1) parameters. The simplest way to proceed (Judd calls it the kindergarten procedure of connecting the dots ) is to use linear B-splines, where B stands for basic. Suppose we have a grid with knots x 0 <...x k <... < x K and we want to approximate a function f (x). B 0 splines are defined as right-continuous step functions B 0 k(x) = { 1 if x k x < x k+1 0 otherwise So interpolant is: ˆf (x) = K 1 k=0 [ ] f (xk )+f (x k+1 ) B 0 2 k(x) G. Violante, Global Methods p. 7 /29

8 Linear B-splines B 1 splines implement piece-wise linear interpolation B 1 k(x) = x x k 1 x k x k 1 if x k 1 x < x k x k+1 x x k+1 x k if x k x < x k+1 0 elsewhere and each one looks like a tent-function with peak at x k equal to one, thus the weight of the interpolant must be f (x k ) The interpolant is therefore defined as: ˆf (x) = K f (x k )Bk(x) 1 k=0 You can also obtain the same weights from 2K conditions: ˆf at knots equal to f(x) (K + 1 conditions), and interpolant continuous at interior knots (K 1 conditions) G. Violante, Global Methods p. 8 /29

9 Linear spline Basis Functions on [0, 1] G. Violante, Global Methods p. 9 /29

10 Linear B-splines It is easy to see that for any given point x on an interval [x k,x k+1 ] there are only two nonzero basis at x, B k (x) and B k+1 (x). To locate the knots (k,k +1) that bracket x you use a bracketing algorithm that essentially proceeds by bisection. Thus ˆf (x) = f (x k ) x k+1 x x k+1 x k +f (x k+1 ) x x k x k+1 x k = f (x k ) x k+1 x x k +x k x k+1 x k +f (x k+1 ) x x k x k+1 x k = f (x k )+[f (x k+1 ) f (x k )] x x k x k+1 x k that is a familiar formula for linear interpolation of decision rules (see later...) G. Violante, Global Methods p. 10 /29

11 Linear Spline approximation (7 knots) x 0 =a x 1 x 2 x 3 x 4 x 5 x 6 =b G. Violante, Global Methods p. 11 /29

12 Pros and cons of linear splines Pros: Preserves monotonicity and concavity of f. We can exploit information about f clustering points more closely together in areas of high curvature or areas where we know a kink exists in order to increase our accuracy. We can capture binding inequality constraints very well. Cons: The approximated function is not differentiable at the knots (they become kinks). ˆf = 0 where it exists (it does not exist at the knots). Function not smooth. G. Violante, Global Methods p. 12 /29

13 Cubic splines Cubic spline (n = 3), has 4K coefficients to be determined ˆf (xk ) = f (x k ) (K +1 conditions) Continuity of ˆf at interior points Continuity of ˆf at interior points Continuity of ˆf at interior points (K 1 conditions) (K 1 conditions) (K 1 conditions) ˆf (x 0 ) = ˆf (x K ) = 0 (2 conditions) These last two can be modified to something else depending on what is suitable in the particular case at hand, they are ad-hoc and they can be more than 2. G. Violante, Global Methods p. 13 /29

14 Cubic spline Basis Functions on [0,1] G. Violante, Global Methods p. 14 /29

15 Cubic spline Basis Functions on [0,1] Spline 1: Piecewise Linear Interpolation Spline 2: Piecewise Cubic Interpolation Data G. Violante, Global Methods p. 15 /29

16 Pros and cons of cubic splines Pros: Easy to compute: interpolant matrix very sparse, easy to invert. Smooth approximation Cons: It may not be able to handle constraints well It does not preserve monotonicity and concavity of f G. Violante, Global Methods p. 16 /29

17 Schumaker splines So far: linear interpolation preserves shape (monotonicity and concavity), but not differentiability. Cubic splines preserves differentiability, but not shape. Schumaker quadratic splines preserve both (Schumaker, 1983, SIAM Journal on Numerical Analysis). By shape we mean that in those intervals where the data is monotonically increasing or decreasing, the spline has the same property. Similarly for convexity or concavity. Idea: add knots to a subinterval by means of an algorithm G. Violante, Global Methods p. 17 /29

18 Solving the income fluctuation problem V (a,y j ) = max {c,a } u(c)+β s.t. y i Y π(y i y j )V (a,y i ) c+a Ra+y j a a The Euler equation, once we substitute in the budget constraint, reads: u c (Ra+y j a ) βr π(y i y j )u c (Ra +y i a ) 0. y i Y where the strict inequality holds when the constraint binds. G. Violante, Global Methods p. 18 /29

19 Policy function iteration with linear interpolation 1. Construct a grid on the asset space {a 0,a 2,...,a m } with a 0 = a = Guess an initial vector of decision rules for a on the grid points, call it â 0 (a i,y j ), where the subscript 0 denotes the initial iteration 3. For each point (a i,y j ) on the grid, check whether the borrowing constraint binds. I.e. check whether: u c (Ra i +y j a 0 ) βr y Y π(y y j )u c (Ra 0 +y â 0 (a 0,y )) > If this inequality holds, the borrowing constraint binds. Then, set a 0(a i,y j ) = a 0 and repeat this check for the next grid point. If the equation instead holds with the < inequality, we have an interior solution (it is optimal to save for the household) and we proceed to the next step. G. Violante, Global Methods p. 19 /29

20 Policy function iteration with linear interpolation 5. For each point (a i,y j ) on the grid, use a nonlinear equation solver to find the solution a of the nonlinear equation u c (Ra i +y j a ) βr y Y π(y y j )u c (Ra +y â 0 (a,y )) = 0 (a) Need to evaluate the function â 0 (a,y ) outside grid points: assume it is piecewise linear. (b) Every time the solver calls an a which lies between grid points, do as follows. First, find the pair of adjacent grid points {a i,a i+1 } such that a i < a < a i+1, and then compute (â0 â 0 (a,y ) = â 0 (a i,y )+(a (a i+1,y ) â 0 (a i,y ) ) a i ) a i+1 a i (c) If the solution of the nonlinear equation is a, then set a 0(a i,y j ) = a and iterate on the next grid point. G. Violante, Global Methods p. 20 /29

21 Policy function iteration with linear interpolation 6. Check convergence by comparing a 0(a i,y j ) â 0 (a i,y j ) through some pre-specified norm. For example, declare convergence at iteration n when max i,j { a n(a i,y j ) â n (a i,y j ) } < ε for some small number ε which determines the degree of tolerance in the solution algorithm. 7. If convergence is achieved, stop. Otherwise, go back to point 3 with the new guess â 1 (a i,y j ) = a 0(a i,y j ). Note that the most time-consuming step in this procedure is 5, the root-finding problem. We now discuss how to avoid it. G. Violante, Global Methods p. 21 /29

22 Endogenous grid method (EGM) EGM is much faster than the traditional method because it does not require the use of a nonlinear equation solver The essential idea of the method is to construct a grid on a, next period s asset holdings, rather than on a, as is done in the standard algorithm. The method also requires the policy function to be at least weakly monotonic in the state Recall the Euler equation: u c (c(a,y)) βr y Y π(y y)u c (c(a,y )). As usual, we start from a guess ĉ 0 (a,y) and iterate on the Euler Equation until the decision rule for consumption that we solve for is essentially identical to the one in the previous iteration. G. Violante, Global Methods p. 22 /29

23 EGM: Algorithm 1. Construct a grid for (a,y) 2. Guess a policy function ĉ 0 (a i,y j ). If y is persistent, a good initial guess is to set ĉ 0 (a i,y j ) = ra i +y j which is the solution under quadratic utility if income follows a random walk. 3. Fix y j. Instead of iterating over {a i }, we iterate over {a i }. For any pair {a i,y j} on the mesh construct the RHS of the Euler equation [call it B(a i,y j)] B(a i,y j ) βr y Y π(y y j )u c (ĉ 0 (a i,y )) where the RHS of this equation uses the guess ĉ 0 on the grid G. Violante, Global Methods p. 23 /29

24 EGM: Algorithm 4. Use the Euler equation to solve for the value c(a i,y j) that satisfies u c ( c(a i,y j )) = B(a i,y j ) and note that it can be done analytically, e.g. for u c (c) = c γ we have c(a i,y j) = [B(a i,y j)] 1 γ. Here algorithm becomes much more efficient because it does not require a nonlinear solver. 5. From the budget constraint: c(a i,y j )+a i = Ra i +y j solve for a (a i,y j) the value of assets today that would lead the consumer to have a i assets tomorrow if her income shock was y j today. This yields c(a i,y j) = c(a i,y j), a function not defined on the grid points. This is the endogenous grid and it changes on each iteration. G. Violante, Global Methods p. 24 /29

25 EGM: Algorithm 6. Let a 0 be the value of asset holdings that induces the borrowing constraint to bind next period, i.e., the value for a that solves that equation at the point a 0, the lower bound of the grid. 7. Now we need to update our guess defined on the original grid. To get new guess ĉ 1 (a i,y j ) on grid points a i > a 0 we can use simple linear interpolation methods using values for { c(a n,y j ),c ( )} a n+1,y j on the two most adjacent values { } a n,a n+1 that bracket ai. If some points a i are beyond a m, the upper bound of the endogenous grid, just extend linearly the function G. Violante, Global Methods p. 25 /29

26 EGM: Algorithm To update the consumption policy function on grid values a i < a 0, we use the budget constraint: ĉ 1 (a i,y j ) = Ra i +y j a 0 since we cannot use the Euler equation as the borrowing constraint is binding for sure next period: the reason is that we found it was binding at a 0, therefore a fortiori it will be binding for a i < a Check convergence as before. G. Violante, Global Methods p. 26 /29

27 Envelope condition method (ECM) It is an alternative method that, in some cases, like the EGM, avoids the use of nonlinear solvers 1. Construct a grid on a with K +1 points: call it A. 2. Guess a value function ˆV 0 (a,y j ) = K k=0 w0 kj B k(a) where B k are cubic splines. 3. Compute the derivative of the value function on the nodes of A: ˆV 0 (a i,y j ) = K wkjb 0 k(a i ) k=0 Note: if you wish to use B 1 splines instead, you need to use a different grid in the above step because ˆV 0 is not differentiable on the nodes of the original grid A G. Violante, Global Methods p. 27 /29

28 Envelope Condition Method (ECM) 5. For any pair {a i,y j } on A Y construct the envelope condition: ˆV 0 (a i,y j ) = u c (Ra i +y j â 0 (a i,y j ))R from which we can obtain: â 0 (a i,y j ) = Ra i +y j u 1 c ( ) ˆV 0 (a i,y j ) R On each point of the grid we must verify if the borrowing constraint binds and if it does, we set â 0 (a i,y j ) = Update the value function from the Bellman equation. For each point of the grid A compute: ˆV 1 (a i,y j ) = u(ra i +y j â 0 (a i,y j ))+β y j Y π(y j y j ) ˆV 0 (â 0 (a i,y j ),y j ) G. Violante, Global Methods p. 28 /29

29 Envelope Condition Method (ECM) In practice, need to solve (K +1)J equations in (K +1)J { } coefficients wkj 1 of the type: K wkjb 1 k (a i ) = u(ra i +y j â 0 (a i,y j )) k=0 +β K π(y j y j ) wkj 0 B k(â 0 (a i,y j )) y j Y k=0 for all gridpoints, i = 0,1,...K and j = 1,2,...,J It is a linear system of equations G. Violante, Global Methods p. 29 /29