Results 221 to 230 of about 856,472 (265)
Some of the next articles are maybe not open access.
Error estimation and control for ODEs
Journal of Scientific Computing, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Error estimation and error bounds for neural networks
Proceedings 1995 Second New Zealand International Two-Stream Conference on Artificial Neural Networks and Expert Systems, 2002A method is proposed to estimate the standard error of predicted values in multilayer perceptron (MLP). It is based on likelihood theory. It holds for all feedforward networks, irrespective of the topology or the specific task at hand. In addition, the bounds on a neural network with perturbed weights and inputs is analytically derived.
Hualou Liang, Guiliang Dai
openaire +1 more source
On Quasi-Norm Interpolation Error Estimation And A Posteriori Error Estimates for p-Laplacian
SIAM Journal on Numerical Analysis, 2002The paper is devoted to the finite element approximation of the \(p\)-Laplacian with zero Dirichlet data. The authors establish a series of interpolation error estimates for several widely used averaging interpolators in some quasi-norms. These estimates are among the key ingredients in their improved a posteriori error analysis for the \(p\)-Laplacian.
Wenbin Liu, Ningning Yan
openaire +1 more source
Generalization error of ensemble estimators
Proceedings of International Conference on Neural Networks (ICNN'96), 2002It has been empirically shown that a better estimate with less generalization error can be obtained by averaging outputs of multiple estimators. This paper presents an analytical result for the generalization error of ensemble estimators. First, we derive a general expression of the ensemble generalization error by using factors of interest (bias ...
Naonori Ueda, Ryohei Nakano
openaire +1 more source
Bounds and error estimates for radiosity
Proceedings of the 21st annual conference on Computer graphics and interactive techniques - SIGGRAPH '94, 1994We present a method for determining a posteriori bounds and estimates for local and total errors in radiosity solutions. The ability to obtain bounds and estimates for the total error is crucial fro reliably judging the acceptability of a solution. Realistic estimates of the local error improve the efficiency of adaptive radiosity algorithms, such as ...
Dani Lischinski +2 more
openaire +1 more source
Local error estimates in quadrature
BIT, 1991zbMATH Open Web Interface contents unavailable due to conflicting licenses.
ROMANI, FRANCESCO, Favati P, Lotti G.
openaire +5 more sources
Microstructural Decomposition Error Estimates
ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1999AbstractComputational simulations of interacting microstructure in solid structures, with methods such as the finite element method, require solutions to numerically enormous boundary value problems. The primary objective of this work is to introduce a‐posteriori error bounds for a domain decomposition which can be used to reduce the computational ...
Zohdi, T., Wriggers, P.
openaire +1 more source
Error Estimation for the Particle Filter
2019 53rd Annual Conference on Information Sciences and Systems (CISS), 2019The particle filter is a popular algorithm for solving the state-space problem for its easy implement. Many previous studies have been conducted to study the asymptotical behavior of particle filters. In our previous works, we divided the error of particle filter into two parts.
Ziyu Liu 0001, James C. Spall
openaire +1 more source
2003
In this chapter we assume the spacetime K is foliated by a double null canonical foliation that satisfies the assumptions $$O \leqslant \epsilon_0 ,\,D \leqslant \epsilon_0 ,$$ (6.0.1) and we make use of the inequality proved in Theorem M7 $$R \leqslant cQ_K^{\frac{1} {2}} .$$ (6.0.2)
Sergiu Klainerman, Francesco Nicolò
openaire +1 more source
In this chapter we assume the spacetime K is foliated by a double null canonical foliation that satisfies the assumptions $$O \leqslant \epsilon_0 ,\,D \leqslant \epsilon_0 ,$$ (6.0.1) and we make use of the inequality proved in Theorem M7 $$R \leqslant cQ_K^{\frac{1} {2}} .$$ (6.0.2)
Sergiu Klainerman, Francesco Nicolò
openaire +1 more source
Estimating the Error in the Koebe Construction
Computational Methods and Function Theory, 2012\textit{P. Koebe} [``Über eine neue Methode der konformen Abbildung und Uniformisierung'', Gött. Nachr. 1912, 861--878 (1912; JFM 43.0520.01)] proposed an iterative method, the so-called Koebe construction, for approximating the unique conformal map \(f\) of a nondegenerate \(n\)-connected domain \(D\) with \(\infty\in D\) and \(0\not\in D\) onto a ...
Andreev, Valentin V. +1 more
openaire +1 more source