this = c * s
153154155156157158159160161162163
} // See implementation note in class javadoc. final Complex theta = new Complex(dpsi, x); final Complex power = new Complex(theta); final Complex z = new Complex(); z.multiply(A[0], power); for (int i=1; i<A.length; i++) { power.multiply(power, theta); z.addMultiply(z, A[i], power); } if (ptDst != null) {
177178179180181182183184185186187
{ // See implementation note in class javadoc. final Complex z = new Complex(y, x); final Complex power = new Complex(z); final Complex theta = new Complex(); theta.multiply(B[0], z); for (int j=1; j<B.length; j++) { power.multiply(power, z); theta.addMultiply(theta, B[j], power); } // Increasing the number of iterations through this loop decreases
192193194195196197198199200201202
for (int j=0; j<3; j++) { power.power(theta, 2); num.addMultiply(z, A[1], power); for (int k=2; k<A.length; k++) { power.multiply(power, theta); t.multiply(A[k], power); t.multiply(t, k); num.add(num, t); } power.real = 1; power.imag = 0;
193194195196197198199200201202203
power.power(theta, 2); num.addMultiply(z, A[1], power); for (int k=2; k<A.length; k++) { power.multiply(power, theta); t.multiply(A[k], power); t.multiply(t, k); num.add(num, t); } power.real = 1; power.imag = 0; denom.copy(A[0]);
201202203204205206207208209210211
power.real = 1; power.imag = 0; denom.copy(A[0]); for (int k=1; k<A.length; k++) { power.multiply(power, theta); t.multiply(A[k], power); t.multiply(t, k+1); denom.add(denom, t); } theta.divide(num, denom); }
202203204205206207208209210211212
power.imag = 0; denom.copy(A[0]); for (int k=1; k<A.length; k++) { power.multiply(power, theta); t.multiply(A[k], power); t.multiply(t, k+1); denom.add(denom, t); } theta.divide(num, denom); } final double dpsi = theta.real;