Approximation with discrete projective transformation
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 [\textit{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 [\textit{D. Roy} et al., Comput. Phys. Commun. 78, 29--54 (1993; Zbl 0878.65011)].
- Summation of power series by self-similar factor approximants
- The discretization for a special class of ideal projectors
- 4-point transforms and approximation
- Reference points based transformation and approximation
- Approximation of discrete data by discrete weighted transform
- On one approach to local surface smoothing
- Piecewise approximation and neural networks
This page was built for publication: Approximation with discrete projective transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1972483)