1989/01/01 by Randall L. Dougherty, Randall Dougherty, Alan Edelman +2 · 2 citations
Engineering · Computer Science · #Advanced Numerical Analysis Techniques #Polynomial and algebraic computation #Numerical Methods and Algorithms
paper · pdf · doi:10.1090/s0025-5718-1989-0962209-1
The Hermite polynomials are simple, effective interpolants of discrete data. These interpolants can preserve local positivity, monotonicity, and convexity of the data if we restrict their derivatives to satisfy constraints at the data points. This paper describes the conditions that must be satisfied for cubic and quintic Hermite interpolants to preserve these properties when they exist in the discrete data. We construct algorithms to ensure that these constraints are satisfied and give numerical examples to illustrate the effectiveness of the algorithms on locally smooth and rough data.