Abstract
This paper discusses various aspects of the smoothing and estimation of derivatives of equispaced data using least squares and polynomials. The various alternatives for programs in a computing center's library are discussed and a particular alternative is selected as most suitable. An algorithm named SMOOTH is given (in Fortran) which implements this alternative. SMOOTH estimates the smoothed value of the data or its first or second derivative based on specified polynomial degree and number of points to enter the smoothing. The paper concludes with a discussion of methods suitable to compute large arrays of smoothing weights
†Dedicated to Arthur E. Erdélyi on the occasion of his seventieth birthday.
‡This work was partially supported by a grant from the National Science Foundation. The present address of J. J. Casaletto is USAMSSA, Staff Systems Division, Pentagon, Room BD1037, Washington, D.C. 20310.
†Dedicated to Arthur E. Erdélyi on the occasion of his seventieth birthday.
‡This work was partially supported by a grant from the National Science Foundation. The present address of J. J. Casaletto is USAMSSA, Staff Systems Division, Pentagon, Room BD1037, Washington, D.C. 20310.
Notes
†Dedicated to Arthur E. Erdélyi on the occasion of his seventieth birthday.
‡This work was partially supported by a grant from the National Science Foundation. The present address of J. J. Casaletto is USAMSSA, Staff Systems Division, Pentagon, Room BD1037, Washington, D.C. 20310.