Multifidelity adaptive kriging metamodel based on discretization error bounds
نویسندگان
چکیده
منابع مشابه
Optimal A Priori Discretization Error Bounds for Geodesic Finite Elements
We prove optimal bounds for the discretization error of geodesic finite elements for variational partial differential equations for functions that map into a nonlinear space. For this we first generalize the well-known Céa lemma to nonlinear function spaces. In a second step we prove optimal interpolation error estimates for pointwise interpolation by geodesic finite elements of arbitrary order...
متن کاملSet-Membership Adaptive Algorithms based on Time-Varying Error Bounds for Interference Suppression
This work presents set-membership adaptive algorithms based on time-varying error bounds for CDMA interference suppression. We introduce a modified family of set-membership adaptive algorithms for parameter estimation with time-varying error bounds. The algorithms considered include modified versions of the set-membership normalized least mean squares (SM-NLMS), the affine projection (SM-AP) an...
متن کاملError-Based and Entropy-Based Discretization of Continuous Features
We present a comparison of error-based and entropybased methods for discretization of continuous features. Our study includes both an extensive empirical comparison as well as an analysis of scenarios where error minimization may be an inappropriate discretization criterion. We present a discretization method based on the C4.5 decision tree algorithm and compare it to an existing entropy-based ...
متن کاملEvaluating the performance of cost-based discretization versus entropy- and error-based discretization
Discretization is defined as the process that divides continuous numeric values into intervals of discrete categorical values. In this article, the concept of cost-based discretization as a pre-processing step to the induction of a classifier is introduced in order to obtain an optimal multi-interval splitting for each numeric attribute. A transparent description of the method and the steps inv...
متن کاملAdaptive rank filtering based on error minimization
A method for adaptive (on-line) pruning and constructing a (layered) computational network is introduced. The dimensions of the network are updated for every new available sample, which makes this technique highly suitable for tracking nonstationary sources. This method extends work on predictive least squares by Rissanen [1] and Wax [2] to an adaptive updating scheme. The algorithm is demonstr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal for Numerical Methods in Engineering
سال: 2020
ISSN: 0029-5981,1097-0207
DOI: 10.1002/nme.6451