| Cranley, R. and T.N.L. Patterson, (1971) On the automatic numerical evaluation of definite integrals, Comput. J., vol. 14, pp. 189--198. |
....e i n X i=1 x i Gamma x i Gamma1 b Gamma a ffl = ffl: 3.15) A global scheme, in contrast, terminates as soon as n X i=1 e i ffl: 3.16) At each stage, the subinterval with the largest error estimate is selected for bisection. This algorithm, attributed to Cranley and Patterson [10], can be written in pseudo code as follows: Algorithm CP: apply quadrature rule to the interval [a; b] initialise list of subintervals with [a; b] do while (error estimate ffl) and (no. of rule evaluations N max ) bisect the subinterval with largest error estimate apply quadrature rule to two ....
Cranley, R. and T.N.L. Patterson, (1971) On the automatic numerical evaluation of definite integrals, Comput. J., vol. 14, pp. 189--198.
....e i n X i=1 x i Gamma x i Gamma1 b Gamma a ffl = ffl: 3.15) A global scheme, in contrast, terminates as soon as n X i=1 e i ffl: 3.16) At each stage, the subinterval with the largest error estimate is selected for bisection. This algorithm, attributed to Cranley and Patterson [10], can be written in pseudo code as follows: Algorithm CP: apply quadrature rule to the interval [a; b] initialise list of subintervals with [a; b] do while (error estimate ffl) and (no. of rule evaluations N max ) bisect the subinterval with largest error estimate apply quadrature rule to two ....
Cranley, R. and T.N.L. Patterson, (1971) On the automatic numerical evaluation of definite integrals, Comput. J., vol. 14, pp. 189--198.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC