Weighted compound integration rules with higher order convergence for all N
نویسندگان
چکیده
منابع مشابه
On quasi-Monte Carlo rules achieving higher order convergence
Quasi-Monte Carlo rules which can achieve arbitrarily high order of convergence have been introduced recently. The construction is based on digital nets and the analysis of the integration error uses Walsh functions. Various approaches have been used to show arbitrarily high convergence. In this paper we explain the ideas behind higher order quasi-Monte Carlo rules by leaving out most of the te...
متن کاملWeighted quadrature rules with binomial nodes
In this paper, a new class of a weighted quadrature rule is represented as -------------------------------------------- where is a weight function, are interpolation nodes, are the corresponding weight coefficients and denotes the error term. The general form of interpolation nodes are considered as that and we obtain the explicit expressions of the coefficients using the q-...
متن کاملOn convergence of higher order schemes for the projective integration method for stiff ordinary differential equations
We present a convergence proof for higher order implementations of the projective integration method (PI) for a class of deterministic multi-scale systems in which fast variables quickly settle on a slow manifold. The error is shown to contain contributions associated with the length of the microsolver, the numerical accuracy of the macrosolver and the distance from the slow manifold caused by ...
متن کاملSequence Labeling with Non-Negative Weighted Higher Order Features
In sequence labeling, using higher order features leads to high inference complexity. A lot of studies have been conducted to address this problem. In this paper, we propose a new exact decoding algorithm under the assumption that weights of all higher order features are non-negative. In the worst case, the time complexity of our algorithm is quadratic on the number of higher order features. Co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Algorithms
سال: 2011
ISSN: 1017-1398,1572-9265
DOI: 10.1007/s11075-011-9482-5