AbstractWe present a detailed study of some problems encountered when quadrature over [0,1] is attempted with integrands that have a singularity at 1. Methods designed to increase the accuracy of such quadratures, for example, the application of periodising transformations, are examined in the context of the representational limitations of 64-bit IEEE arithmetic near 1 in [0,1]. A heuristic is proposed for the forecasting of a lower bound on the irremovable error due to these limitations. We conclude by affirming the commonly accepted procedure that where possible, integrals should be symbolically transformed so that any remaining singularity occurs at 0
The classical bounds on the truncation errorofquadrature formulas obtained by Peano's Theorem are re...
AbstractThe classical bounds on the truncation error of quadrature formulas obtained by Peano's Theo...
We present algorithms for performing the four elementary arithmetic operations (+, -, ×, and ÷) in f...
AbstractWe present a detailed study of some problems encountered when quadrature over [0,1] is attem...
AbstractIn this paper, the asymptotic bit operation cost of a family of quadrature formulas, especia...
Floating-point arithmetic is an approximation of real arithmetic in which each operation may introdu...
Floating-point arithmetic is an approximation of real arithmetic in which each operation may introdu...
Floating-point arithmetic is an approximation of real arithmetic in which each operation may introdu...
Floating-point arithmetic is an approximation of real arithmetic in which each operation may introdu...
Floating-point arithmetic is an approximation of real arithmetic in which each operation may introdu...
AbstractThe computational cost of automatic quadrature programs is analyzed under the hypothesis of ...
AbstractThe computational cost of automatic quadrature programs is analyzed under the hypothesis of ...
The representation formats and behaviors of floating point arithmetics available in computers are de...
The representation formats and behaviors of floating point arithmetics available in computers are de...
The representation formats and behaviors of floating point arithmetics available in computers are de...
The classical bounds on the truncation errorofquadrature formulas obtained by Peano's Theorem are re...
AbstractThe classical bounds on the truncation error of quadrature formulas obtained by Peano's Theo...
We present algorithms for performing the four elementary arithmetic operations (+, -, ×, and ÷) in f...
AbstractWe present a detailed study of some problems encountered when quadrature over [0,1] is attem...
AbstractIn this paper, the asymptotic bit operation cost of a family of quadrature formulas, especia...
Floating-point arithmetic is an approximation of real arithmetic in which each operation may introdu...
Floating-point arithmetic is an approximation of real arithmetic in which each operation may introdu...
Floating-point arithmetic is an approximation of real arithmetic in which each operation may introdu...
Floating-point arithmetic is an approximation of real arithmetic in which each operation may introdu...
Floating-point arithmetic is an approximation of real arithmetic in which each operation may introdu...
AbstractThe computational cost of automatic quadrature programs is analyzed under the hypothesis of ...
AbstractThe computational cost of automatic quadrature programs is analyzed under the hypothesis of ...
The representation formats and behaviors of floating point arithmetics available in computers are de...
The representation formats and behaviors of floating point arithmetics available in computers are de...
The representation formats and behaviors of floating point arithmetics available in computers are de...
The classical bounds on the truncation errorofquadrature formulas obtained by Peano's Theorem are re...
AbstractThe classical bounds on the truncation error of quadrature formulas obtained by Peano's Theo...
We present algorithms for performing the four elementary arithmetic operations (+, -, ×, and ÷) in f...