A Krylov Subspace Method for Covariance Approximation and Simulation of Random Processes and Fields
نویسندگان
چکیده
This paper proposes a new iterative algorithm for simultaneously computing an approximation to the covariance matrix of a random vector and drawing a sample from that approximation. The algorithm is especially suited to cases for which the elements of the random vector are samples of a stochastic process or random field. The proposed algorithm has close connections to the conjugate gradient method for solving linear systems of equations. A comparison is made between our algorithm’s structure and complexity and other methods for simulation and covariance matrix approximation, including those based on FFTs and Lanczos methods. The convergence of our iterative algorithm is analyzed both analytically and empirically, and a preconditioning technique for accelerating convergence is explored. The numerical examples include a fractional Brownian motion and a random field with the spherical covariance used in geostatistics.
منابع مشابه
Karhunen-loève Approximation of Random Fields Using Hierarchical Matrix Techniques
In stochastic finite element computations for modelling uncertainty a popular approach for separating the deterministic and stochastic dependencies of a random field is to compute the first few terms of its Karhunen-Loève (KL) expansion. This entails approximating the dominant eigenpairs of its covariance operator, leading to a large dense eigenvalue problem, in particular since the operator ty...
متن کاملSolving large systems arising from fractional models by preconditioned methods
This study develops and analyzes preconditioned Krylov subspace methods to solve linear systems arising from discretization of the time-independent space-fractional models. First, we apply shifted Grunwald formulas to obtain a stable finite difference approximation to fractional advection-diffusion equations. Then, we employee two preconditioned iterative methods, namely, the preconditioned gen...
متن کاملKarhunen-Loève approximation of random fields by generalized fast multipole methods
KL approximation of a possibly instationary random field a(ω, x) ∈ L2(Ω, dP ; L∞(D)) subject to prescribed meanfield Ea(x) = ∫ Ω a(ω, x)dP (ω) and covariance Va(x, x ′) = ∫ Ω(a(ω, x) − Ea(x))(a(ω, x′) − Ea(x))dP (ω) in a polyhedral domain D ⊂ Rd is analyzed. We show how for stationary covariances Va(x, x ′) = ga(|x − x′|) with ga(z) analytic outside of z = 0, an M -term approximate KL-expansion...
متن کاملKrylov Subspace Approximation for Local Community Detection
Community detection is an important information mining task in many fields including computer science, social sciences, biology and physics. For increasingly common large network data sets, global community detection is prohibitively expensive, and attention has shifted to methods that mine local communities, i.e. methods that identify all latent members of a particular community from a few lab...
متن کاملSampling Gaussian Distributions in Krylov Spaces with Conjugate Gradients
This paper introduces a conjugate gradient sampler that is a simple extension of the method of conjugate gradients (CG) for solving linear systems. The CG sampler iteratively generates samples from a Gaussian probability density, using either a symmetric positive definite covariance or precision matrix, whichever is more convenient to model. Similar to how the Lanczos method solves an eigenvalu...
متن کامل