Mercurial > hg > de.mpg.mpiwg.itgroup.digilib.plugin
diff libs/commons-math-2.1/docs/apidocs/src-html/org/apache/commons/math/analysis/interpolation/SmoothingBicubicSplineInterpolator.html @ 13:cbf34dd4d7e6
commons-math-2.1 added
author | dwinter |
---|---|
date | Tue, 04 Jan 2011 10:02:07 +0100 |
parents | |
children |
line wrap: on
line diff
--- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/libs/commons-math-2.1/docs/apidocs/src-html/org/apache/commons/math/analysis/interpolation/SmoothingBicubicSplineInterpolator.html Tue Jan 04 10:02:07 2011 +0100 @@ -0,0 +1,236 @@ +<HTML> +<BODY BGCOLOR="white"> +<PRE> +<FONT color="green">001</FONT> /*<a name="line.1"></a> +<FONT color="green">002</FONT> * Licensed to the Apache Software Foundation (ASF) under one or more<a name="line.2"></a> +<FONT color="green">003</FONT> * contributor license agreements. See the NOTICE file distributed with<a name="line.3"></a> +<FONT color="green">004</FONT> * this work for additional information regarding copyright ownership.<a name="line.4"></a> +<FONT color="green">005</FONT> * The ASF licenses this file to You under the Apache License, Version 2.0<a name="line.5"></a> +<FONT color="green">006</FONT> * (the "License"); you may not use this file except in compliance with<a name="line.6"></a> +<FONT color="green">007</FONT> * the License. You may obtain a copy of the License at<a name="line.7"></a> +<FONT color="green">008</FONT> *<a name="line.8"></a> +<FONT color="green">009</FONT> * http://www.apache.org/licenses/LICENSE-2.0<a name="line.9"></a> +<FONT color="green">010</FONT> *<a name="line.10"></a> +<FONT color="green">011</FONT> * Unless required by applicable law or agreed to in writing, software<a name="line.11"></a> +<FONT color="green">012</FONT> * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.12"></a> +<FONT color="green">013</FONT> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.13"></a> +<FONT color="green">014</FONT> * See the License for the specific language governing permissions and<a name="line.14"></a> +<FONT color="green">015</FONT> * limitations under the License.<a name="line.15"></a> +<FONT color="green">016</FONT> */<a name="line.16"></a> +<FONT color="green">017</FONT> package org.apache.commons.math.analysis.interpolation;<a name="line.17"></a> +<FONT color="green">018</FONT> <a name="line.18"></a> +<FONT color="green">019</FONT> import org.apache.commons.math.DimensionMismatchException;<a name="line.19"></a> +<FONT color="green">020</FONT> import org.apache.commons.math.MathRuntimeException;<a name="line.20"></a> +<FONT color="green">021</FONT> import org.apache.commons.math.MathException;<a name="line.21"></a> +<FONT color="green">022</FONT> import org.apache.commons.math.util.MathUtils;<a name="line.22"></a> +<FONT color="green">023</FONT> import org.apache.commons.math.analysis.UnivariateRealFunction;<a name="line.23"></a> +<FONT color="green">024</FONT> import org.apache.commons.math.analysis.BivariateRealFunction;<a name="line.24"></a> +<FONT color="green">025</FONT> import org.apache.commons.math.analysis.polynomials.PolynomialSplineFunction;<a name="line.25"></a> +<FONT color="green">026</FONT> <a name="line.26"></a> +<FONT color="green">027</FONT> /**<a name="line.27"></a> +<FONT color="green">028</FONT> * Generates a bicubic interpolation function.<a name="line.28"></a> +<FONT color="green">029</FONT> * Before interpolating, smoothing of the input data is performed using<a name="line.29"></a> +<FONT color="green">030</FONT> * splines.<a name="line.30"></a> +<FONT color="green">031</FONT> * See <b>Handbook on splines for the user</b>, ISBN 084939404X,<a name="line.31"></a> +<FONT color="green">032</FONT> * chapter 2.<a name="line.32"></a> +<FONT color="green">033</FONT> *<a name="line.33"></a> +<FONT color="green">034</FONT> * @version $Revision$ $Date$<a name="line.34"></a> +<FONT color="green">035</FONT> * @since 2.1<a name="line.35"></a> +<FONT color="green">036</FONT> */<a name="line.36"></a> +<FONT color="green">037</FONT> public class SmoothingBicubicSplineInterpolator<a name="line.37"></a> +<FONT color="green">038</FONT> implements BivariateRealGridInterpolator {<a name="line.38"></a> +<FONT color="green">039</FONT> /**<a name="line.39"></a> +<FONT color="green">040</FONT> * {@inheritDoc}<a name="line.40"></a> +<FONT color="green">041</FONT> */<a name="line.41"></a> +<FONT color="green">042</FONT> public BivariateRealFunction interpolate(final double[] xval,<a name="line.42"></a> +<FONT color="green">043</FONT> final double[] yval,<a name="line.43"></a> +<FONT color="green">044</FONT> final double[][] zval)<a name="line.44"></a> +<FONT color="green">045</FONT> throws MathException, IllegalArgumentException {<a name="line.45"></a> +<FONT color="green">046</FONT> if (xval.length == 0 || yval.length == 0 || zval.length == 0) {<a name="line.46"></a> +<FONT color="green">047</FONT> throw MathRuntimeException.createIllegalArgumentException("no data");<a name="line.47"></a> +<FONT color="green">048</FONT> }<a name="line.48"></a> +<FONT color="green">049</FONT> if (xval.length != zval.length) {<a name="line.49"></a> +<FONT color="green">050</FONT> throw new DimensionMismatchException(xval.length, zval.length);<a name="line.50"></a> +<FONT color="green">051</FONT> }<a name="line.51"></a> +<FONT color="green">052</FONT> <a name="line.52"></a> +<FONT color="green">053</FONT> MathUtils.checkOrder(xval, 1, true);<a name="line.53"></a> +<FONT color="green">054</FONT> MathUtils.checkOrder(yval, 1, true);<a name="line.54"></a> +<FONT color="green">055</FONT> <a name="line.55"></a> +<FONT color="green">056</FONT> final int xLen = xval.length;<a name="line.56"></a> +<FONT color="green">057</FONT> final int yLen = yval.length;<a name="line.57"></a> +<FONT color="green">058</FONT> <a name="line.58"></a> +<FONT color="green">059</FONT> // Samples (first index is y-coordinate, i.e. subarray variable is x)<a name="line.59"></a> +<FONT color="green">060</FONT> // 0 <= i < xval.length<a name="line.60"></a> +<FONT color="green">061</FONT> // 0 <= j < yval.length<a name="line.61"></a> +<FONT color="green">062</FONT> // zX[j][i] = f(xval[i], yval[j])<a name="line.62"></a> +<FONT color="green">063</FONT> final double[][] zX = new double[yLen][xLen];<a name="line.63"></a> +<FONT color="green">064</FONT> for (int i = 0; i < xLen; i++) {<a name="line.64"></a> +<FONT color="green">065</FONT> if (zval[i].length != yLen) {<a name="line.65"></a> +<FONT color="green">066</FONT> throw new DimensionMismatchException(zval[i].length, yLen);<a name="line.66"></a> +<FONT color="green">067</FONT> }<a name="line.67"></a> +<FONT color="green">068</FONT> <a name="line.68"></a> +<FONT color="green">069</FONT> for (int j = 0; j < yLen; j++) {<a name="line.69"></a> +<FONT color="green">070</FONT> zX[j][i] = zval[i][j];<a name="line.70"></a> +<FONT color="green">071</FONT> }<a name="line.71"></a> +<FONT color="green">072</FONT> }<a name="line.72"></a> +<FONT color="green">073</FONT> <a name="line.73"></a> +<FONT color="green">074</FONT> final SplineInterpolator spInterpolator = new SplineInterpolator();<a name="line.74"></a> +<FONT color="green">075</FONT> <a name="line.75"></a> +<FONT color="green">076</FONT> // For each line y[j] (0 <= j < yLen), construct a 1D spline with<a name="line.76"></a> +<FONT color="green">077</FONT> // respect to variable x<a name="line.77"></a> +<FONT color="green">078</FONT> final PolynomialSplineFunction[] ySplineX = new PolynomialSplineFunction[yLen];<a name="line.78"></a> +<FONT color="green">079</FONT> for (int j = 0; j < yLen; j++) {<a name="line.79"></a> +<FONT color="green">080</FONT> ySplineX[j] = spInterpolator.interpolate(xval, zX[j]);<a name="line.80"></a> +<FONT color="green">081</FONT> }<a name="line.81"></a> +<FONT color="green">082</FONT> <a name="line.82"></a> +<FONT color="green">083</FONT> // For every knot (xval[i], yval[j]) of the grid, calculate corrected<a name="line.83"></a> +<FONT color="green">084</FONT> // values zY_1<a name="line.84"></a> +<FONT color="green">085</FONT> final double[][] zY_1 = new double[xLen][yLen];<a name="line.85"></a> +<FONT color="green">086</FONT> for (int j = 0; j < yLen; j++) {<a name="line.86"></a> +<FONT color="green">087</FONT> final PolynomialSplineFunction f = ySplineX[j];<a name="line.87"></a> +<FONT color="green">088</FONT> for (int i = 0; i < xLen; i++) {<a name="line.88"></a> +<FONT color="green">089</FONT> zY_1[i][j] = f.value(xval[i]);<a name="line.89"></a> +<FONT color="green">090</FONT> }<a name="line.90"></a> +<FONT color="green">091</FONT> }<a name="line.91"></a> +<FONT color="green">092</FONT> <a name="line.92"></a> +<FONT color="green">093</FONT> // For each line x[i] (0 <= i < xLen), construct a 1D spline with<a name="line.93"></a> +<FONT color="green">094</FONT> // respect to variable y generated by array zY_1[i]<a name="line.94"></a> +<FONT color="green">095</FONT> final PolynomialSplineFunction[] xSplineY = new PolynomialSplineFunction[xLen];<a name="line.95"></a> +<FONT color="green">096</FONT> for (int i = 0; i < xLen; i++) {<a name="line.96"></a> +<FONT color="green">097</FONT> xSplineY[i] = spInterpolator.interpolate(yval, zY_1[i]);<a name="line.97"></a> +<FONT color="green">098</FONT> }<a name="line.98"></a> +<FONT color="green">099</FONT> <a name="line.99"></a> +<FONT color="green">100</FONT> // For every knot (xval[i], yval[j]) of the grid, calculate corrected<a name="line.100"></a> +<FONT color="green">101</FONT> // values zY_2<a name="line.101"></a> +<FONT color="green">102</FONT> final double[][] zY_2 = new double[xLen][yLen];<a name="line.102"></a> +<FONT color="green">103</FONT> for (int i = 0; i < xLen; i++) {<a name="line.103"></a> +<FONT color="green">104</FONT> final PolynomialSplineFunction f = xSplineY[i];<a name="line.104"></a> +<FONT color="green">105</FONT> for (int j = 0; j < yLen; j++) {<a name="line.105"></a> +<FONT color="green">106</FONT> zY_2[i][j] = f.value(yval[j]);<a name="line.106"></a> +<FONT color="green">107</FONT> }<a name="line.107"></a> +<FONT color="green">108</FONT> }<a name="line.108"></a> +<FONT color="green">109</FONT> <a name="line.109"></a> +<FONT color="green">110</FONT> // Partial derivatives with respect to x at the grid knots<a name="line.110"></a> +<FONT color="green">111</FONT> final double[][] dZdX = new double[xLen][yLen];<a name="line.111"></a> +<FONT color="green">112</FONT> for (int j = 0; j < yLen; j++) {<a name="line.112"></a> +<FONT color="green">113</FONT> final UnivariateRealFunction f = ySplineX[j].derivative();<a name="line.113"></a> +<FONT color="green">114</FONT> for (int i = 0; i < xLen; i++) {<a name="line.114"></a> +<FONT color="green">115</FONT> dZdX[i][j] = f.value(xval[i]);<a name="line.115"></a> +<FONT color="green">116</FONT> }<a name="line.116"></a> +<FONT color="green">117</FONT> }<a name="line.117"></a> +<FONT color="green">118</FONT> <a name="line.118"></a> +<FONT color="green">119</FONT> // Partial derivatives with respect to y at the grid knots<a name="line.119"></a> +<FONT color="green">120</FONT> final double[][] dZdY = new double[xLen][yLen];<a name="line.120"></a> +<FONT color="green">121</FONT> for (int i = 0; i < xLen; i++) {<a name="line.121"></a> +<FONT color="green">122</FONT> final UnivariateRealFunction f = xSplineY[i].derivative();<a name="line.122"></a> +<FONT color="green">123</FONT> for (int j = 0; j < yLen; j++) {<a name="line.123"></a> +<FONT color="green">124</FONT> dZdY[i][j] = f.value(yval[j]);<a name="line.124"></a> +<FONT color="green">125</FONT> }<a name="line.125"></a> +<FONT color="green">126</FONT> }<a name="line.126"></a> +<FONT color="green">127</FONT> <a name="line.127"></a> +<FONT color="green">128</FONT> // Cross partial derivatives<a name="line.128"></a> +<FONT color="green">129</FONT> final double[][] dZdXdY = new double[xLen][yLen];<a name="line.129"></a> +<FONT color="green">130</FONT> for (int i = 0; i < xLen ; i++) {<a name="line.130"></a> +<FONT color="green">131</FONT> final int nI = nextIndex(i, xLen);<a name="line.131"></a> +<FONT color="green">132</FONT> final int pI = previousIndex(i);<a name="line.132"></a> +<FONT color="green">133</FONT> for (int j = 0; j < yLen; j++) {<a name="line.133"></a> +<FONT color="green">134</FONT> final int nJ = nextIndex(j, yLen);<a name="line.134"></a> +<FONT color="green">135</FONT> final int pJ = previousIndex(j);<a name="line.135"></a> +<FONT color="green">136</FONT> dZdXdY[i][j] = (zY_2[nI][nJ] - zY_2[nI][pJ] -<a name="line.136"></a> +<FONT color="green">137</FONT> zY_2[pI][nJ] + zY_2[pI][pJ]) /<a name="line.137"></a> +<FONT color="green">138</FONT> ((xval[nI] - xval[pI]) * (yval[nJ] - yval[pJ])) ;<a name="line.138"></a> +<FONT color="green">139</FONT> }<a name="line.139"></a> +<FONT color="green">140</FONT> }<a name="line.140"></a> +<FONT color="green">141</FONT> <a name="line.141"></a> +<FONT color="green">142</FONT> // Create the interpolating splines<a name="line.142"></a> +<FONT color="green">143</FONT> return new BicubicSplineInterpolatingFunction(xval, yval, zY_2,<a name="line.143"></a> +<FONT color="green">144</FONT> dZdX, dZdY, dZdXdY);<a name="line.144"></a> +<FONT color="green">145</FONT> }<a name="line.145"></a> +<FONT color="green">146</FONT> <a name="line.146"></a> +<FONT color="green">147</FONT> /**<a name="line.147"></a> +<FONT color="green">148</FONT> * Compute the next index of an array, clipping if necessary.<a name="line.148"></a> +<FONT color="green">149</FONT> * It is assumed (but not checked) that {@code i} is larger than or equal to 0}.<a name="line.149"></a> +<FONT color="green">150</FONT> *<a name="line.150"></a> +<FONT color="green">151</FONT> * @param i Index<a name="line.151"></a> +<FONT color="green">152</FONT> * @param max Upper limit of the array<a name="line.152"></a> +<FONT color="green">153</FONT> * @return the next index<a name="line.153"></a> +<FONT color="green">154</FONT> */<a name="line.154"></a> +<FONT color="green">155</FONT> private int nextIndex(int i, int max) {<a name="line.155"></a> +<FONT color="green">156</FONT> final int index = i + 1;<a name="line.156"></a> +<FONT color="green">157</FONT> return index < max ? index : index - 1;<a name="line.157"></a> +<FONT color="green">158</FONT> }<a name="line.158"></a> +<FONT color="green">159</FONT> /**<a name="line.159"></a> +<FONT color="green">160</FONT> * Compute the previous index of an array, clipping if necessary.<a name="line.160"></a> +<FONT color="green">161</FONT> * It is assumed (but not checked) that {@code i} is smaller than the size of the array.<a name="line.161"></a> +<FONT color="green">162</FONT> *<a name="line.162"></a> +<FONT color="green">163</FONT> * @param i Index<a name="line.163"></a> +<FONT color="green">164</FONT> * @return the previous index<a name="line.164"></a> +<FONT color="green">165</FONT> */<a name="line.165"></a> +<FONT color="green">166</FONT> private int previousIndex(int i) {<a name="line.166"></a> +<FONT color="green">167</FONT> final int index = i - 1;<a name="line.167"></a> +<FONT color="green">168</FONT> return index >= 0 ? index : 0;<a name="line.168"></a> +<FONT color="green">169</FONT> }<a name="line.169"></a> +<FONT color="green">170</FONT> }<a name="line.170"></a> + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +</PRE> +</BODY> +</HTML>