Generalization of one algorithm for constructing recurrent splines

Authors

DOI:

https://doi.org/10.15587/1729-4061.2018.128312

Keywords:

smoothing spline, a time series, algorithm stability, matrix conditionality, algorithm resource-intensity

Abstract

We have analyzed two algorithms, close in composition, for constructing a smoothing spline, which imply a change only in the last link of the spline when new experimental data arrive. The main feature of the N. D. Dicoussar algorithm is the form of a polynomial representation in order to describe a link of the spline. It is shown that a given polynomial is one of the hierarchical form of the Hermitian polynomial.

We have proposed a modification to the D. A. Silaev algorithm for constructing a smoothing spline with different orders of smoothness: from zero to the second, aimed at enhancing the stability of this algorithm. To this end, we substantiated recommendations related to the form of polynomials representation, which describe the links of splines of the specified form. For this purpose, we estimated conditionality of matrices used in the algorithm. For the spline of zero-order smoothness, the most advisable is to apply a polynomial in the N. D. Dicoussar form, and for splines with higher orders of smoothness of joining the links, it is appropriate to use different forms of the Hermitian polynomials.

Based on computational examples, a possibility was demonstrated to generalize the D. A. Silaev algorithm to construct a spline with links of various lengths, which is determined by the rate of change in the examined parameter. That makes it possible to reduce the volume of information that contains a description of the spline itself, and to prevent such a widespread shortcoming of approximation when using polynomials as parasitic oscillations. It was shown as well that in the presence of significant measurement errors in experimental data there may occur a need to decrease the length of the spline's link (compared to that derived by the D. A. Silaev rule) in order to provide the spline with a property of robustness

Author Biographies

Galina Tuluchenko, Kherson National Technical University Beryslavske highway, 24, Kherson, Ukraine, 73008

Doctor of Technical Sciences, Professor

Department of Higher Mathematics and Mathematical Modelling

Gennadii Virchenko, National Technical University of Ukraine «Igor Sikorsky Kyiv Polytechnic Institute» Peremohy ave., 37, Kyiv, Ukraine, 03056

Doctor of Technical Sciences, Associate Professor

Department of Descriptive Geometry, Engineering and Computer Graphics

Galyna Getun, Kyiv National University of Сonstruction and Architecture Povitroflotskyi ave., 31, Kyiv, Ukraine, 03037

PhD, Associate Professor

Department of Architectural Constructions

Viacheslav Martynov, Kyiv National University of Сonstruction and Architecture Povitroflotskyi ave., 31, Kyiv, Ukraine, 03037

Doctor of Technical Sciences, Associate Professor

Department of Architectural Constructions

Mykola Tymofieiev, Kyiv National University of Сonstruction and Architecture Povitroflotskyi ave., 31, Kyiv, Ukraine, 03037

PhD, Associate Professor

Department of Architectural Constructions

References

  1. Wang, Y. (2011). Smoothing Splines: Methods and Applications. New York, 384. doi: 10.1201/b10954
  2. Helwig, N. E., Shorter, K. A., Ma, P., Hsiao-Wecksler, E. T. (2016). Smoothing spline analysis of variance models: A new tool for the analysis of cyclic biomechanical data. Journal of Biomechanics, 49 (14), 3216–3222. doi: 10.1016/j.jbiomech.2016.07.035
  3. Liu, Z., Guo, W. (2010). Data Driven Adaptive Spline Smoothing. Statistica Sinica, 20, 1143–1163.
  4. Spiriti, S., Eubank, R., Smith, P. W., Young, D. (2013). Knot selection for least-squares and penalized splines. Journal of Statistical Computation and Simulation, 83 (6), 1020–1036. doi: 10.1080/00949655.2011.647317
  5. Yuan, Y., Chen, N., Zhou, S. (2013). Adaptive B-spline knot selection using multi-resolution basis set. IIE Transactions, 45 (12), 1263–1277. doi: 10.1080/0740817x.2012.726758
  6. Kang, H., Chen, F., Li, Y., Deng, J., Yang, Z. (2015). Knot calculation for spline fitting via sparse optimization. Computer-Aided Design, 58, 179–188. doi: 10.1016/j.cad.2014.08.022
  7. Brandt, C., Seidel, H.-P., Hildebrandt, K. (2015). Optimal Spline Approximation via ℓ0-Minimization. Computer Graphics Forum, 34 (2), 617–626. doi: 10.1111/cgf.12589
  8. Bureick, J., Alkhatib, H., Neumann, I. (2016). Robust Spatial Approximation of Laser Scanner Point Clouds by Means of Free-form Curve Approaches in Deformation Analysis. Journal of Applied Geodesy, 10 (1). doi: 10.1515/jag-2015-0020
  9. Dikusar, N. D. (2016). Optimizaciya resheniya v zadachah kusochno-polinomial'noy approksimacii. Dubna, 14.
  10. Silaev, D. A. (2013). Polulokal'niye sglazhivayushchie splayny. Trudy seminara im. I. G. Petrovskogo, 29, 443–454.
  11. Silaev, D. A. (2010). Polulokal'nye sglazhivayushchie S-splayny. Komp'yuternye issledovaniya i modelirovanie, 2 (4), 349–357.
  12. Silaev, D. A. et. al. (2007). Polulokal'nye sglazhivayushchie splayny klassa S1. Trudy seminara imeni I. G. Petrovskogo, 26, 347–367.
  13. Liu, X., Yang, Q., Jin, H. (2013). New Representations of the Group Inverse of 2×2 Block Matrices. Journal of Applied Mathematics, 2013, 1–10. doi: 10.1155/2013/247028
  14. Pinezhaninov, F., Pinezhaninov, P. Bazisnye funkcii dlya konechnyh elementov. Available at: http://old.exponenta.ru/soft/mathemat/pinega/a1/a1.asp
  15. Van Manh, P. (2017). Hermite interpolation with symmetric polynomials. Numerical Algorithms, 76 (3), 709–725. doi: 10.1007/s11075-017-0278-0

Downloads

Published

2018-04-10

How to Cite

Tuluchenko, G., Virchenko, G., Getun, G., Martynov, V., & Tymofieiev, M. (2018). Generalization of one algorithm for constructing recurrent splines. Eastern-European Journal of Enterprise Technologies, 2(4 (92), 53–62. https://doi.org/10.15587/1729-4061.2018.128312

Issue

Section

Mathematics and Cybernetics - applied aspects