Adaptively weighted numerical integration over arbitrary domains
نویسندگان
چکیده
منابع مشابه
Adaptively weighted numerical integration over arbitrary domains
In adaptivelyweightednumerical integration, for a given set of quadrature nodes, order and domain of integration, the quadrature weights are obtained by solving a system of suitable moment fitting equations in least square sense. The moments in the moment equations are approximated over a simplified domain that is homeomorphic to the original domain, and then are corrected for the deviation fro...
متن کاملAdaptively Weighted Numerical Integration in the Finite Cell Method
With Adaptively Weighted (AW) numerical integration, for a given set of quadrature nodes, order and domain of integration, the quadrature weights are obtained by solving a system of suitable moment fitting equations in least square sense. The moments in the moment equations are approximated over a simplified domain that is homeomorphic to the original domain, and then are corrected for the devi...
متن کاملError Analysis of Adaptively Weighted Numerical 1 Integration
With Adaptively Weighted (AW) numerical integration, for a given set of quadrature 4 nodes, order and domain of integration, the quadrature weights are obtained by solving a system of 5 suitable moment fitting equations in least square sense. The moments in the moment equations 6 are approximated over a simplified domain that is homeomorphic to the original domain, and then 7 are corrected for ...
متن کاملAsymptotically Optimal Weighted Numerical Integration
We study numerical integration of H older{type functions with respect to weights on the real line. Our study extends previous work by F. Curbera, [2] and relies on a connection between this problem and the approximation of distribution functions by empirical ones. The analysis is based on a lemma which is important within the theory of optimal designs for approximating stochastic processes. As...
متن کاملNumerical integration in arbitrary-precision ball arithmetic
We present an implementation of arbitrary-precision numerical integration with rigorous error bounds in the Arb library. Rapid convergence is ensured for piecewise complex analytic integrals by use of the Petras algorithm, which combines adaptive bisection with adaptive Gaussian quadrature where error bounds are determined via complex magnitudes without evaluating derivatives. The code is gener...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2014
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2014.03.001