ISSN:
0029-5981
Keywords:
Engineering
;
Engineering General
Source:
Wiley InterScience Backfile Collection 1832-2000
Topics:
Mathematics
,
Technology
Notes:
We report on a very effective program for uniform approximation of functions (or discrete data) by generalized rational functions of any number of variables over point sets so large that conventional methods are inapplicable. The points need not be arranged in a regular pattern, but if they are, the number of points is normally limited only by the computer time available. The program extends the differential correction algorithm discussed in an earlier article in this journal by combining it with a first Remes-type exchange procedure, while retaining the flexibility and robustness of differential correction. Furthermore, this algorithm is guaranteed to converge in theory. Testing has shown that, even when the point set is small enough for differential correction to be applied directly, this algorithm is usually faster. We discuss the algorithm and program along with several numerical examples, one of which involves more than three million data points. A FORTRAN listing with illustrative output can be obtained from the first author.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1002/nme.1620181011
