An adaptive numerical integration code for a chain of transputers (Q750084): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0167-8191(90)90068-k / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1964988624 / rank | |||
Normal rank |
Latest revision as of 09:09, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An adaptive numerical integration code for a chain of transputers |
scientific article |
Statements
An adaptive numerical integration code for a chain of transputers (English)
0 references
1990
0 references
The finite integration interval is splitted up into subintervals of equal length. On every subinterval a transputer calculates an approximation to this integral. This approximation uses an adaptive method based on the ten point Gaussian rule and the twenty-one point Kronrod extension [See also the QUADPACK routine DQAGS described by \textit{R. Piessens}, \textit{E. de Doncker-Kapenga}, \textit{C. W. Überhuber} and \textit{D. K. Kahaner}; QUADPACK, A subroutine package for automatic integration (1983; Zbl 0508.65005)]. Numerical tests (on examples of the book listed above) show on a chain of 32 T800s that if a large number of function evaluations is needed then linear speed-ups are achievable with any number of transputers.
0 references
transputers
0 references
adaptive numerical integration
0 references
Gaussian rule
0 references
Kronrod rule
0 references