AbstractThe evaluation of the integral of an analytic function f over the entire real line may be accurately approximated by the trapezoidal method of integration or by “mapped” trapezoidal rules. Typically the latter is employed to accelerate the convergence rate of the rule at the expense of a bit more complicated formula. In the case that the integrand f decreases rapidly and has its singularities sufficiently removed from the real line, the trapezoidal rule provides not only a simpler method of evaluation but also a more accurate method of approximation
Abstract: The method of steepest-descent is re-visited in continuous time. It is shown that the cont...
Consider the evaluation of If:=^^f201f(x) dx . Among all the quadrature rules for the appr...
The method of steepest-descent is re-visited in continuous time. It is shown that the continuous tim...
It is well known that the trapezoidal rule converges geometrically when applied to analytic function...
The general principle of the trapezoidal rule of numerical integration is given. A specific example...
In many applied problems, efficient calculation of quadratures with high accuracy is required. The e...
AbstractWe examine a single-step implicit-integration algorithm which is obtained by a modification ...
In this paper, by the use of some classical results from the Theory of Inequalities, we point out qu...
The derivative-based trapezoid rule for the Riemann-Stieltjes integral is presented which uses 2 der...
A generalisation of the trapezoid rule for the Riemann-Stieltjes integral and applications for speci...
AbstractThe problem of finding a class of functions for which the trapezoidal rule gives the exact v...
We present a family of high order trapezoidal rule-based quadratures for a class of singular integra...
In this paper, we find the solution f1, f2, f3, f4, f5, g1: R→ R of f1(y) − g1(x) = (y − x) [f2(x) ...
A quadrature rule for the numerical evaluation of integrals of analytic functions along directed lin...
The objective is to calculate the integral of a function f over an interval (i.e. area under the cur...
Abstract: The method of steepest-descent is re-visited in continuous time. It is shown that the cont...
Consider the evaluation of If:=^^f201f(x) dx . Among all the quadrature rules for the appr...
The method of steepest-descent is re-visited in continuous time. It is shown that the continuous tim...
It is well known that the trapezoidal rule converges geometrically when applied to analytic function...
The general principle of the trapezoidal rule of numerical integration is given. A specific example...
In many applied problems, efficient calculation of quadratures with high accuracy is required. The e...
AbstractWe examine a single-step implicit-integration algorithm which is obtained by a modification ...
In this paper, by the use of some classical results from the Theory of Inequalities, we point out qu...
The derivative-based trapezoid rule for the Riemann-Stieltjes integral is presented which uses 2 der...
A generalisation of the trapezoid rule for the Riemann-Stieltjes integral and applications for speci...
AbstractThe problem of finding a class of functions for which the trapezoidal rule gives the exact v...
We present a family of high order trapezoidal rule-based quadratures for a class of singular integra...
In this paper, we find the solution f1, f2, f3, f4, f5, g1: R→ R of f1(y) − g1(x) = (y − x) [f2(x) ...
A quadrature rule for the numerical evaluation of integrals of analytic functions along directed lin...
The objective is to calculate the integral of a function f over an interval (i.e. area under the cur...
Abstract: The method of steepest-descent is re-visited in continuous time. It is shown that the cont...
Consider the evaluation of If:=^^f201f(x) dx . Among all the quadrature rules for the appr...
The method of steepest-descent is re-visited in continuous time. It is shown that the continuous tim...