GMS:Quadratic Nodal Functions: Difference between revisions

From XMS Wiki
Jump to navigationJump to search
No edit summary
No edit summary
 
(10 intermediate revisions by 2 users not shown)
Line 1: Line 1:
The nodal functions used in inverse distance weighted interpolation can be higher degree polynomial functions constrained to pass through the scatter point and approximate the nearby points in a least squares manner. Quadratic polynomials have been found to work well in many cases (Franke & Nielson 1980; Franke 1982). The resulting surface reproduces local variations implicit in the data set, is smooth, and approximates the quadratic nodal functions near the scatter points. The equation used for the quadratic nodal function centered at point k is as follows:
The nodal functions used in inverse distance weighted interpolation can be higher degree polynomial functions constrained to pass through the data points and approximate the nearby points in a least squares manner. Quadratic polynomials have been found to work well in many cases (Franke & Nielson 1980; Franke 1982). The resulting surface reproduces local variations implicit in the dataset, is smooth, and approximates the quadratic nodal functions near the data points. The equation used for the quadratic nodal function centered at point ''k'' is as follows:


<!--[[Image:idw_eq7.gif]]
:<math>Q_k(x,y) = a_{k1}+a_{k2} \left ( x-x_k \right )+a_{k3}(y-y_k)+a_{k4}(x-x_k)^2+a_{k5}(x-x_k)(y-y_k)+a_{k6}(y-y_k)^2</math>
<math>Q_k(x,y) = a_{k1}+a_{k2} \left ( x-x_k \right )+a_{k3}(y-y_k)+a_{k4}(x-x_k)^2+a_{k5}(x-x_k)(y-y_k)+a_{k6}(y-y_k)^2</math>-->
<!--[[Image:quadnodef1.jpg]]-->
[[Image:quadnodef1.jpg]]


To define the function, the six coefficients a<sub>k1</sub>..a<sub>k6</sub> must be found. Since the function is centered at the point k and passes through point k, we know beforehand that a<sub>k1</sub>=f<sub>k</sub> where f<sub>k</sub> is the function value at point k. The equation simplifies to:
To define the function, the six coefficients ''a<sub>k1</sub>..a<sub>k6</sub>'' must be found. Since the function is centered at the point ''k'' and passes through point ''k'', we know beforehand that ''a<sub>k1</sub>=f<sub>k</sub>'' where ''f<sub>k</sub>'' is the function value at point ''k''. The equation simplifies to:


<!--[[Image:idw_eq8.gif]]
<!--<math>Q_k \left ( x,y \right ) = f_k+a_{k2}(x-x_k)+a_{k3}(y-y_k)+a_{k4}(x-x_k)^2+a_{k5}(x-x_k)(y-y_k)+a_{k6}(y-y_k)^2</math>-->
<math>Q_k \left ( x,y \right ) = f_k+a_{k2}(x-x_k)+a_{k3}(y-y_k)+a_{k4}(x-x_k)^2+a_{k5}(x-x_k)(y-y_k)+a_{k6}(y-y_k)^2</math>-->
:[[Image:quadnodef2.jpg]]
[[Image:quadnodef2.jpg]]


Now there are only five unknown coefficients. The coefficients are found by fitting the quadratic to the nearest NQ scatter points using a weighted least squares approach. In order for the matrix equation used to solve for the coefficients to be stable, there should be at least five scatter points in the set.
Now there are only five unknown coefficients. The coefficients are found by fitting the quadratic to the nearest ''NQ'' data points using a weighted least squares approach. In order for the matrix equation used to solve for the coefficients to be stable, there should be at least five data points in the set.


====3D Interpolation====
==3D Interpolation==
For 3D interpolation, the following equation is added to the quadratic nodal function:
For 3D interpolation, the following equation is added to the quadratic nodal function:


<!--[[Image:idw3d_eq4.gif]]
<!--<math>+a_{k5} \left ( x-x_k \right )(y-y_k)+a_{k6}(x-x_k)(z-z_k)+a_{k7}(y-y_k)(z-z_k)</math>-->
<math>+a_{k5} \left ( x-x_k \right )(y-y_k)+a_{k6}(x-x_k)(z-z_k)+a_{k7}(y-y_k)(z-z_k)</math>-->
:[[Image:quadnodef3.jpg]]
[[Image:quadnodef3.jpg]]


To define the function, the ten coefficients a<sub>k1</sub>..a<sub>k10</sub> must be found. Since the function is centered on point k, we know that a<sub>k1</sub>=f<sub>k</sub> where f<sub>k</sub> is the data value at point k. The equation simplifies to:
To define the function, the ten coefficients ''a<sub>k1</sub>..a<sub>k10</sub>'' must be found. Since the function is centered on point ''k'', we know that ''a<sub>k1</sub>=f<sub>k</sub>'' where ''f<sub>k</sub>'' is the data value at point ''k''. The equation simplifies to:


<!--[[Image:idw3d_eq6.gif]]
<!--<math>Q_k \left ( x,y \right ) = f_k+a_{k2}(x-x_k)+a_{k3}(y-y_k)+a_{k4}(z-z_k)</math>-->
<math>Q_k \left ( x,y \right ) = f_k+a_{k2}(x-x_k)+a_{k3}(y-y_k)+a_{k4}(z-z_k)</math>-->
:[[Image:quadnodef4.jpg]]
[[Image:quadnodef4.jpg]]


Now there are only nine unknown coefficients. The coefficients are found by fitting the quadratic to a subset of the neighboring scatter points in a weighted least squares fashion. In order for the matrix equation used to be solve for the coefficients to be stable, there should be at least ten non-coplanar scatter points in the set.
Now there are only nine unknown coefficients. The coefficients are found by fitting the quadratic to a subset of the neighboring data points in a weighted least squares fashion. In order for the matrix equation used to be solve for the coefficients to be stable, there should be at least ten non-coplanar data points in the set.
 
==Related Topics==
* [[GMS:Inverse Distance Weighted|Inverse Distance Weighted]]




{{Navbox GMS}}
{{Navbox GMS}}
[[Category:Interpolation]]
[[Category:Interpolation]]
[[Category:Equations|Q]]

Latest revision as of 14:02, 12 September 2017

The nodal functions used in inverse distance weighted interpolation can be higher degree polynomial functions constrained to pass through the data points and approximate the nearby points in a least squares manner. Quadratic polynomials have been found to work well in many cases (Franke & Nielson 1980; Franke 1982). The resulting surface reproduces local variations implicit in the dataset, is smooth, and approximates the quadratic nodal functions near the data points. The equation used for the quadratic nodal function centered at point k is as follows:

To define the function, the six coefficients ak1..ak6 must be found. Since the function is centered at the point k and passes through point k, we know beforehand that ak1=fk where fk is the function value at point k. The equation simplifies to:

Quadnodef2.jpg

Now there are only five unknown coefficients. The coefficients are found by fitting the quadratic to the nearest NQ data points using a weighted least squares approach. In order for the matrix equation used to solve for the coefficients to be stable, there should be at least five data points in the set.

3D Interpolation

For 3D interpolation, the following equation is added to the quadratic nodal function:

Quadnodef3.jpg

To define the function, the ten coefficients ak1..ak10 must be found. Since the function is centered on point k, we know that ak1=fk where fk is the data value at point k. The equation simplifies to:

Quadnodef4.jpg

Now there are only nine unknown coefficients. The coefficients are found by fitting the quadratic to a subset of the neighboring data points in a weighted least squares fashion. In order for the matrix equation used to be solve for the coefficients to be stable, there should be at least ten non-coplanar data points in the set.

Related Topics