ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    ISSN: 1573-8868
    Keywords: Gaussian random fields ; geostatistics ; Monte Carlo simulations ; orthogonal polynomials
    Source: Springer Online Journal Archives 1860-2000
    Topics: Geosciences , Mathematics
    Notes: Abstract Consider the problem of generating a realization y1 of a Gaussian random field on a dense grid of points Ω1 conditioned on field observations y2 collected on a sparse grid of points Ω2. An approach to this is to generate first an unconditional realization y over the grid Ω=Ω1 ∪ Ω2, and then to produce y1 by conditioning y on the data y2. As standard methods for generating y, such as the turning bands, spectral or Cholesky approaches can have various limitations, it has been proposed by M. W. Davis to generate realizations from a matrix polynomial approximations to the square root of the covariance matrix. In this paper we describe how to generate a direct approximation to the conditional realization y1, on Ω1 using a variant of Davis' approach based on approximation by Chebyshev polynomials. The resulting algorithm is simple to implement, numerically stable, and bounds on the approximation error are readily available. Furthermore we show that the conditional realization y1 can be generated directly with a lower order polynomial than the unconditional realization y, and that further reductions can be achieved by exploiting a nugget effect if one is present. A pseudocode version of the algorithm is provided that can be implemented using the fast Fourier transform if the field is stationary and the grid Ω1 is rectangular. Finally, numerical illustrations are given of the algorithm's performance in generating various 2-D realizations of conditional processes on large sampling grids.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical geology 23 (1991), S. 119-135 
    ISSN: 1573-8868
    Keywords: Gaussian random field ; covariance estimation ; geostatistics ; eigenvalue decomposition
    Source: Springer Online Journal Archives 1860-2000
    Topics: Geosciences , Mathematics
    Notes: Abstract In kriging, parametric approaches to covariance (or variogram) estimation require that unknown parameters be inferred from a single realization of the underlying random field. An approach to such an estimation problem is to assume the field to be Gaussian and iteratively minimize a (restricted) negative loglikelihood over the parameter space. In doing so, the associated computational burden can be considerable. Also, it is usually not easy to check whether or not the minimum achieved is global. In this note, we show that in many practical cases, the structure of the covariance (or variogram) function can be exploited so that iterative minimizing algorithms may be advantageously replaced by a procedure that requires the computation of the roots of a simple rational function and the search for the minimum of a function depending on one variable only. As a consequence, our approach allows one to observe in a straightforward fashion the presence of local minima. Furthermore, it is shown that insensitivity of the likelihood function to changes in parameter value can be easily detected. The note concludes with numerical simulations that illustrate some key features of our estimation procedure.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical geology 25 (1993), S. 439-451 
    ISSN: 1573-8868
    Keywords: block Toeplitz structure ; Cholesky factorization ; geostatistics ; Monte Carlo simulations ; spatial random field
    Source: Springer Online Journal Archives 1860-2000
    Topics: Geosciences , Mathematics
    Notes: Abstract The generation over two-dimensional grids of normally distributed random fields conditioned on available data is often required in reservoir modeling and mining investigations. Such fields can be obtained from application of turning band or spectral methods. However, both methods have limitations. First, they are only asymptotically exact in that the ensemble of realizations has the correlation structure required only if enough harmonics are used in the spectral method, or enough lines are generated in the turning bands approach. Moreover, the spectral method requires fine tuning of process parameters. As for the turning bands method, it is essentially restricted to processes with stationary and radially symmetric correlation functions. Another approach, which has the advantage of being general and exact, is to use a Cholesky factorization of the covariance matrix representing grid points correlation. For fields of large size, however, the Cholesky factorization can be computationally prohibitive. In this paper, we show that if the data are stationary and generated over a grid with regular mesh, the structure of the data covariance matrix can be exploited to significantly reduce the overall computational burden of conditional simulations based on matrix factorization techniques. A feature of this approach is its computational simplicity and suitability to parallel implementation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...