## a b s t r a c t We give an efficient algorithm for partitioning the domain of a numeric function f into segments. The function f is realized as a polynomial in each segment, and a lookup table stores the coefficients of the polynomial. Such an algorithm is an essential part of the design of look
โฆ LIBER โฆ
A fast numerical algorithm for the integration of rational functions
โ Scribed by Dante V. Manna; Luis A. Medina; Victor H. Moll; Armin Straub
- Publisher
- Springer-Verlag
- Year
- 2010
- Tongue
- English
- Weight
- 259 KB
- Volume
- 115
- Category
- Article
- ISSN
- 0029-599X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A fast segmentation algorithm for piecew
โ
Jon T. Butler; C.L. Frenzen; Njuguna Macaria; Tsutomu Sasao
๐
Article
๐
2011
๐
Elsevier Science
๐
English
โ 262 KB
A numerical method for the integration o
โ
R. Piessens; F. Poleunis
๐
Article
๐
1971
๐
Springer Netherlands
๐
English
โ 532 KB
Rectifying Transformations for the Integ
โ
D.J. Jeffrey
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 370 KB
The paper presents four rectifying transformations that can be applied to the integration of a real rational expression of trigonometric functions. Integration is with respect to a real variable. The transformations remove, from the real line, discontinuities and singularities that would otherwise a
A fast algorithm for computing integrals
โ
A. Eydeland
๐
Article
๐
1994
๐
Springer US
๐
English
โ 408 KB
Algorithm 22 Algorithm for the automatic
โ
R. Piessens; Ann Haegemans
๐
Article
๐
1974
๐
Springer Vienna
๐
English
โ 444 KB
A numerical algorithm for inner-outer fa
โ
M.C. Tsai; L.W. Chen
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 446 KB