zbMATH — the first resource for mathematics

Approximation with discrete projective transformation. (English) Zbl 1058.65506
The Discrete Projective Transform (DPT) approximation is a polynomial approximation for a function in an interval. The approximating conditions correspond to requiring that derivatives in the end points of the interval coincide for the function and its approximation. The basis with respect to which the approximant is represented is inspired by the DPT introduced in [N.D. Dikoussar, Comput. Phys. Commun. 79, 39–51 (1994)]. The paper describes some numerical experiments and compares them with the u-approximation introduced in [D. Roy et al., Comput. Phys. Commun. 78, 29–54 (1993; Zbl 0878.65011)].

65D15 Algorithms for approximation of functions
41A21 Padé approximation
Full Text: DOI
[1] Cheney, E.W., Introduction to approximation theory, (1996), McGraw-Hill New York · Zbl 0912.41001
[2] Dikoussar, N.D., Adaptive projective filters for track finding, Comput. phys. commun., 79, 39-51, (1994)
[3] Dikoussar, N.D., Function approximation and smoothing by 4-points transformations, (1995), JINR Dubna Russia, (Preprint) · Zbl 0927.65009
[4] Roy, D., Rational approximants generated by the u-transform, Comput. phys. commun., 78, 29-54, (1993) · Zbl 0878.65011
[5] ()
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.