Circulant embedding is a technique that has been used to generate realizations from certain real-valued Gaussian stationary processes. This technique has two potential advantages over competing methods for simulating time series. First, the statistical properties of the generating procedure are exactly the same as those of the target stationary process. Second, the technique is based upon the discrete Fourier trans-form and hence is computationally attractive when this transform is computed via a fast Fourier transform (FFT) algorithm. In this paper we show how, when used with a standard ‘powers of two ’ FFT algorithm, circulant embedding can be readily adapted to handle complex-valued Gaussian stationary processes
The main results of our research related to first passage time (FPT) problems for stationary Gaussi...
Abstract. We present a robust method for simulating an increment of a Lévy process, based on decomp...
Fast Fourier transforms are used to develop algorithms for the fast generation of correlated Gaussi...
<p>This paper is concerned with the study of the embedding circulant matrix method to simulate stati...
This paper provides an algorithm for simulating improper (or noncircular) complex-valued stationary ...
The circulant embedding method for generating statistically exact simulations of time series from ce...
The high-dimensionality typically associated with discretized approximations to Gaussian random fiel...
Random fields are families of random variables, indexed by a d-dimensional parameter x with d> 1....
International audienceThe Circulant Embedding Method (CEM) is a well known technique to generate sta...
<div><p>When generating Gaussian stationary random fields, a standard method based on circulant matr...
AbstractIn this note, recurrent representation of stationary Gaussian processes is derived from thei...
Abstract. Fast Fourier transforms are used to develop algorithms for the fast generation of correlat...
Abstract---We discuss the problem of generating realizations of length N from a Gaussian stationary ...
This article proposes a new method for simulating a Gaussian process, whose spectrum diverges at one...
ABSTRACT. This paper compares two strategies that reduce the cost of running a simulator of the freq...
The main results of our research related to first passage time (FPT) problems for stationary Gaussi...
Abstract. We present a robust method for simulating an increment of a Lévy process, based on decomp...
Fast Fourier transforms are used to develop algorithms for the fast generation of correlated Gaussi...
<p>This paper is concerned with the study of the embedding circulant matrix method to simulate stati...
This paper provides an algorithm for simulating improper (or noncircular) complex-valued stationary ...
The circulant embedding method for generating statistically exact simulations of time series from ce...
The high-dimensionality typically associated with discretized approximations to Gaussian random fiel...
Random fields are families of random variables, indexed by a d-dimensional parameter x with d> 1....
International audienceThe Circulant Embedding Method (CEM) is a well known technique to generate sta...
<div><p>When generating Gaussian stationary random fields, a standard method based on circulant matr...
AbstractIn this note, recurrent representation of stationary Gaussian processes is derived from thei...
Abstract. Fast Fourier transforms are used to develop algorithms for the fast generation of correlat...
Abstract---We discuss the problem of generating realizations of length N from a Gaussian stationary ...
This article proposes a new method for simulating a Gaussian process, whose spectrum diverges at one...
ABSTRACT. This paper compares two strategies that reduce the cost of running a simulator of the freq...
The main results of our research related to first passage time (FPT) problems for stationary Gaussi...
Abstract. We present a robust method for simulating an increment of a Lévy process, based on decomp...
Fast Fourier transforms are used to develop algorithms for the fast generation of correlated Gaussi...