Antonio S. Torralba
Universidad Complutense  

Chemistry

BBM1

Biophysics

 

FUNDER - Theoretical Background


Feria Only in Spanish. Sorry!

Funder

Main

Theory

Documents

Example

Download

Contact


 

Neville's algorithm for polynomial extrapolation

Prev

Theoretical background

Up

Documentation of FUNDER

Next



SAVITZKY-GOLAY FILTERS


The computation of the susceptibilities of a system from experimental data involves specific problems that have to be addressed. Neville's algorithm is suitable for the computation of derivatives from nearly exact data. However, when the level of noise is significant, alternative procedures must be used. One of them is the Savitzky-Golay algorithm for smoothing and differentiation.


The idea is to fit Number of points equally-spaced data points within a moving window, Generic point, with Left and right points, to a polynomial of order Order of the polynomial. For this, a least-squares procedure can be used. Since the polynomial is of the form Polynomial in i, we must solve the matrix equation


Overdetermined matrix equation

(1)


where Matrix of powers is the matrix of powers


Explicit matrix of powers

(2)


Coefficients of the polynomial is the vector of coefficients of the polynomial and Data is the vector of data. Note that Distance to middle point is the distance of the kth point to the central point in the window of data.


The matrix Matrix of powers has more rows than columns and, hence, the system (1) is overdetermined, as long as the rank is Order of the polynomial, i.e., full-rank. In order to obtain the least-squares solution, one must solve the normal equations:


Normal equations

(3)


That is,


Least-squares solution

(4)


The key point of the Savitzky-Golay method is the realization that, because eq. (3) is linear, eq. (4) can be expressed as


Least-squares solution

(5)


where Matrix of filter coefficients, a Savitzky-Golay matrix, does not depend on the vector of data. Therefore, there exist universal sets of Savitzky-Golay coefficients that transform any vector of data into the vector of polynomial coefficients for the best fit, Coefficients of the polynomial. This means that one need not repeat the least-squares fit for every vector of data, but it is possible to precalculate Matrix of filter coefficients, once Number of points and Order of the polynomial have been specified.


Moreover, the polynomial coefficients are related to the first Order of the polynomial derivatives, plus the zeroth-order one, at the central point in the window, Central point:


Derivative at the central point

(6)


Interval between points is the interval between points (in the context of biochemical susceptibilities, a perturbation magnitude, i.e., a variation of a concentration). As a consequence of eq. (6), if the goal is smoothing the data (zeroth-order term), only the first row of Matrix of filter coefficients is needed, for the first derivative, the second row suffices, etc. This can be written as a convolution (linear combination),


Filter by convolution

(7)


from which the filtered nth order derivative can be calculated.


Now, we note that, if fi=deltaij, then cnj=an, with n=0,...,M and j=-l,...,r, where deltaij is Kronecker's delta. Substituting in eq. (4), we get


Savitzky-Golay coefficient

(8)


These are the Savitzky-Golay coefficients for smoothing and differentiation. They satisfy the normalization condition


Normalization

(9)


REFERENCE


A. Savitzky and M.J.E. Golay "Smoothing and differentiation of data by simplified least squares procedures" Anal. Chem., 36, 1627-1639 (1964)



Prev

Up

Next

Neville's algorithm for
polynomial extrapolation

Theoretical background

Documentation of FUNDER

 

Valid HTML 4.01!

Copyright © 2003-2013 Antonio Sánchez Torralba
Last modified:
Monday, 04-Mar-2013 11:58:25 CET

© 2013 Antonio Sánchez Torralba