A Ternary Shape-Preserving Refinement Algorithm with Fourth Order Accuracy
DOI:
https://doi.org/10.37256/cm.7320268896Keywords:
refinement algorithm, monotonicity, accuracy, iterative optimization, update rule, learning rate, gradient-based update, local computation, convergence analysisAbstract
This paper introduces a new class of stationary refinement algorithms that combine the advantages of the four-point interpolatory algorithm and the cubic B-spline. This algorithm includes a tension parameter. This analysis identifies the range of this parameter and specifies conditions under which the proposed algorithm maintains shape-preserving properties such as monotonicity and convexity. The algorithm achieves improved smoothness, reaching C3 and fourth-order accuracy, while maintaining the same support length as both parent algorithms. Unlike many high-order algorithms that are nonlinear and complex, this method remains simple and efficient. Numerical examples are provided to demonstrate its practical performance, and the proposed algorithm is particularly well-suited for a discontinuous type of data set.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2026 Fahad Sameer Alshammari, et al

This work is licensed under a Creative Commons Attribution 4.0 International License.
