|
This article is cited in 16 scientific papers (total in 16 papers)
Monotone and convex interpolation by weighted cubic splines
B. I. Kvasov Institute of Computational Technologies, Siberian Branch, Russian Academy of Sciences, pr. Akademika Lavrent'eva 6, Novosibirsk, 630090, Russia
Abstract:
Algorithms for interpolating by weighted cubic splines are constructed with the aim of preserving the monotonicity and convexity of the original discrete data. The analysis performed in this paper makes it possible to develop two algorithms with the automatic choice of the shape-controlling parameters (weights). One of them preserves the monotonicity of the data, while the other preserves the convexity. Certain numerical results are presented.
Key words:
monotone and convex interpolation, weighted cubic splines, adaptive choice of the shape-controlling parameters.
Received: 25.03.2013
Citation:
B. I. Kvasov, “Monotone and convex interpolation by weighted cubic splines”, Zh. Vychisl. Mat. Mat. Fiz., 53:10 (2013), 1610–1621; Comput. Math. Math. Phys., 53:10 (2013), 1428–1439
Linking options:
https://www.mathnet.ru/eng/zvmmf9925 https://www.mathnet.ru/eng/zvmmf/v53/i10/p1610
|
Statistics & downloads: |
Abstract page: | 664 | Full-text PDF : | 367 | References: | 83 | First page: | 34 |
|