In this paper we discuss two methods for the estimation of linear dynamic factor models. The first method is behavioural in nature and consists of the least squares approximation of the observed data by means of a linear system. The second method is based on the statistical concept of principal...

Dynamical low-rank approximation is a differential-equation-based approach to efficiently compute low-rank approximations to time-dependent large data matrices or to solutions of large matrix differential equations. We illustrate its use in the following application areas: as an updating...

A common problem in applied regression analysis is that covariate values may be missing for some observations but imputed values may be available. This situation generates a trade-off between bias and precision: the complete cases are often disarmingly few, but replacing the missing observations...

This paper develops a method to compute second-order perturbations of discretetime heterogeneous agent models. It addresses the three main tasks to make secondorder approximations tractable: state reduction, generating sufficient smoothness, and fast computation of the quadratic terms in the...

A common problem in applied regression analysis is that covariate values may be missing for some observations but imputed values may be available. This situation generates a trade-off between bias and precision: the complete cases are often disarmingly few, but replacing the missing observations...

This paper compares forecast performance of the ALI method and the MESMs and seeks ways of improving the ALI method. Inflation and GDP growth form the forecast objects for comparison, using data from China, Indonesia and the Philippines. The ALI method is found to produce better forecasts than...

Complex systems may often be characterized by their hierarchical dynamics. In this paper we present a method and an operational algorithm that automatically infer this property in a broad range of systems — discrete stochastic processes. The main idea is to systematically explore the set of...

In this work we introduce the Proper Orthogonal Decomposition (POD)approach to the valuation of contingent claims for one–dimensional price models.First, we present the POD in the context of an abstract Hilbert space and we givean application for the numerical pricing of Double Barrier...

Convex Nonparametric Least Squares (CNLSs) is a nonparametric regression method that does not require a priori specification of the functional form. The CNLS problem is solved by mathematical programming techniques; however, since the CNLS problem size grows quadratically as a function of the...