Partition of unity method and smooth approximation

This work presents a new piecewise polynomial method of smooth analytic approximation for any dimension and variability of experimental data. Alternatives to this method are cubic and bicubic splines which have their advantages and disadvantages. There are many researches in the field of big data flexible approximation; however nothing similar was found to what is presented in the work, especially concerning multivariate dependencies. Experimental data frequently depend on many variables which for the purposes of compression, prediction, and transmission locally expressed by relatively simple analytic functions. It can be local polynomials, either on some intervals in onedimensional case or polygons — in two-dimensional cases. Presented in the work method of local functions smooth matching extends from the one-dimension piecewise polynomial approximation method to higher dimensions that has a variety of scientific and practical applications. Under this condition, it makes sense to store and transmit coefficients of local polynomials or other local functions rather than use raw data for those purposes, which frequently requires an unacceptably large amount of resources. In the method described, we use cellular subdivision of the area of interest, and define low-degree polynomials or other parametric functions on the cells. At the junctions between cells, there are overlapping transition zones where local functions match to each other. Their amount is defined by the index of the topological compact covering. As a result, the matching obtains a single double-differentiable analytic function on the entire compact. Defined in the work basic functions are second- and third-degree especial polynomials. The values of these functions smoothly transit from one to zero within a closed unit interval. Derivatives on the interval edges both are equal to zero. The matching is performed by the homotopy which maps a unit interval to the space of functions. Efficiency of the method is demonstrated for one-dimensional case by matching a set of approximating parabolas. We extend this method to the two-dimensional case by applying the known unit partitioning technique with topological maps coverage. The computational experiment demonstrates that even in this case local functions smoothly match making a double-differentiable function on the entire compact. First result is a development of a smooth matching method for experimental data approximation by local parametric functions on a large interval. Second result is development of a new method, based on a unit partitioning, for matching two-dimensional local functions making an approximation on the two-dimensional compact. Third result is a theoretical proof of the method extension from dimension of one and two to any dimension. Task of this study consisted in the development of a useful tool for efficient storage and transmission of experimental data.

1. Shapiai M.I., Ibrahim Z., Khalid M., Jau L.W., Pavlovic V., Watad J. Function and surface approximation based on enhanced kernel regression for small sample sets. International Journal of Innovative Computing, Information and Control, 2011, vol. 7, no. 10, pp. 5947– 5960.

2. Méhauté A.L., Rabut Ch., Schumaker L.L. Surface Fitting and Multiresolution Methods. V. II. Vanderbilt University Press, 1997, 354 p.

3. Friedman B. Principles and Techniques of Applied Mathematics. NY, Dover Publications Inc., 1990, 315 p.

4. Lancaster P., Šalkauskas K. Curve and Surface Fitting. An Introduction. London, Orlando, Academic Press, 1986, 280 p.

5. Wavelets, Images, and Surface Fitting. Ed by P.-J. Laurent, A.L. Méhauté, L. Schumaker. CRC Press, 1994, 544 p.

6. Myers R.H., Montgomery D.C., Anderson-Cook Ch.M. Response Surface Methodology: Process and Product Optimization Using Designed Experiments. 4th ed. Wiley, 2016, 856 p.

7. Havil J. Curves for the Mathematically Curious: An Anthology of the Unpredictable, Historical, Beautiful, and Romantic. Princeton University Press, 2019, 280 p.

8. Rogers D., Adams J. Mathematical Elements for Computer Graphics. McGraw-Hill, 1989, 512 p.

9. Lawson J. Partitions of Unity and Smooth Functions. Available at: https://www.math.lsu.edu/~lawson/Chapter4.pdf. (accessed: 15.02.2024).

10. Grangé P., Mathiot J.-F., Werner E. Taylor-lagrange renormalization scheme: Application to light-front dynamics. Physical Review D, 2009, vol. 80, no. 10, pp. 105012. https://doi.org/10.1103/physrevd.80.105012

11. Cavoretto R. Adaptive radial basis function partition of unity interpolation: A bivariate algorithm for unstructured data. Journal of Scientific Computing, 2021, vol. 87, no. 2, pp. 41. https://doi.org/10.1007/s10915-021-01432-z

12. Yasmin G., Muhui A., Araci S. Certain Results of q -Sheffer–Appell polynomials. Symmetry, 2019, vol. 11, no. 2, pp. 159. https://doi.org/10.3390/sym11020159

13. Weierstrass K. Mathematische Werke. Bd.3. P.1.

14. Pasioti A. On the constrained solution of RBF surface approximation. Mathematics, 2022, vol. 10, no. 15, pp. 2582. https://doi.org/10.3390/math10152582

15. Engelking R. General Topology. Polish Scientific Publ., 1977, 626 p.

16. Fuks D.B., Rokhlin V.A. Beginner’s Course in Topology: Geometric Chapters. Springer-Verlag, 1984. 519 p.

17. Tolstykh V.N. Neural networks for a time series extrapolation. H&ES Research, 2023, vol. 15, no. 6, pp. 4–11. (in Russian). https://doi.org/10.36724/2409-5419-2023-15-6-4-11

18. Tolstykh V.N. On the development of classification and regression methods. Wave Electronics and Infocommunication Systems. Proc. of the XXVI International Scientific Conference. In 3 parts. Part 1. St. Petersburg, St. Petersburg State University of Aerospace Instrumentation, 2023, pp. 113–117. (in Russian)