Hierarchical Kriging for multi-fidelity aero-servo-elastic simulators - Application to extreme loads on wind turbines

I. Abdallah; C. Lataniotis; B. Sudret

Home/Archive/arXiv

arXiv · 1709.07637

Hierarchical Kriging for multi-fidelity aero-servo-elastic simulators - Application to extreme loads on wind turbines

I. Abdallah·C. Lataniotis·B. Sudret

View original source ↗Read source document ↗Export metadata ↓

Abstract

In the present work, we consider multi-fidelity surrogate modelling to fuse the output of multiple aero-servo-elastic computer simulators of varying complexity. In many instances, predictions from multiple simulators for the same quantity of interest on a wind turbine are available. In this type of situation, there is strong evidence that fusing the output from multiple aero-servo-elastic simulators yields better predictive ability and lower model uncertainty than using any single simulator. Hierarchical Kriging is a multi-fidelity surrogate modelling method in which the Kriging surrogate model of the cheap (low-fidelity) simulator is used as a trend of the Kriging surrogate model of the higher fidelity simulator. We propose a parametric approach to Hierarchical Kriging where the best surrogate models are selected based on evaluating all possible combinations of the available Kriging parameters candidates. The parametric Hierarchical Kriging approach is illustrated by fusing the extreme flapwise bending moment at the blade root of a large multi-megawatt wind turbine as a function of wind velocity, turbulence and wind shear exponent in the presence of model uncertainty and heterogeneously noisy output. The extreme responses are obtained by two widely accepted wind turbine specific aero-servo-elastic computer simulators, FAST and Bladed. With limited high-fidelity simulations, Hierarchical Kriging produces more accurate predictions of validation data compared to conventional Kriging. In addition, contrary to conventional Kriging, Hierarchical Kriging is shown to be a robust surrogate modelling technique because it is less sensitive to the choice of the Kriging parameters and the choice of the estimation error.

Explore related subjects

stat.CO stat.AP

Keep this discovery

BibTeX RIS

I. Abdallah, C. Lataniotis, B. Sudret. 2017-09-22. Hierarchical Kriging for multi-fidelity aero-servo-elastic simulators - Application to extreme loads on wind turbines. https://arxiv.org/abs/1709.07637

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Extended One-Liners for the Gamma, Poisson, and Binomial Distributions

We demonstrate explicit transformations of three independent uniforms with exact Gamma$(a,1)$, $a>0$, Poisson$(\lambda)$, $\lambda>0$, and Binomial$(N,p)$, $N\geq 1$, $0\leq p \leq 1$ laws using only elementary operations.

stat.CO↗

arXiv2026

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO↗

arXiv2026

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO↗