Lines Matching defs:terms
141 * a more automated way of determining terms is found.
143 * Note the slight re-ordering of the terms for a quadratic polynomial
149 /* Return the number of terms for a 2d polynomial */
162 case 2: return( y ); /* affine order = 1 terms = 3 */
163 case 3: return( x*y ); /* bilinear order = 1.5 terms = 4 */
165 case 5: return( y*y ); /* quadratic order = 2 terms = 6 */
169 case 9: return( y*y*y ); /* cubic order = 3 terms = 10 */
174 case 14: return( y*y*y*y ); /* quartic order = 4 terms = 15 */
180 case 20: return( y*y*y*y*y ); /* quintic order = 5 terms = 21 */
190 case 2: return("*jj"); /* affine order = 1 terms = 3 */
191 case 3: return("*ii*jj"); /* bilinear order = 1.5 terms = 4 */
193 case 5: return("*jj*jj"); /* quadratic order = 2 terms = 6 */
197 case 9: return("*jj*jj*jj"); /* cubic order = 3 terms = 10 */
202 case 14: return("*jj*jj*jj*jj"); /* quartic order = 4 terms = 15 */
208 case 20: return("*jj*jj*jj*jj*jj"); /* quintic order = 5 terms = 21 */
218 case 2: return( 0.0 ); /* affine order = 1 terms = 3 */
219 case 3: return( y ); /* bilinear order = 1.5 terms = 4 */
221 case 5: return( 0.0 ); /* quadratic order = 2 terms = 6 */
225 case 9: return( 0.0 ); /* cubic order = 3 terms = 10 */
230 case 14: return( 0.0 ); /* quartic order = 4 terms = 15 */
236 case 20: return( 0.0 ); /* quintic order = 5 terms = 21 */
246 case 2: return( 1.0 ); /* affine order = 1 terms = 3 */
247 case 3: return( x ); /* bilinear order = 1.5 terms = 4 */
249 case 5: return( y ); /* quadratic order = 2 terms = 6 */
253 is due to the re-arrangement of terms to allow for 'bilinear'
546 terms[3];
569 terms[0] = arguments[i+cp_x]; /* x */
570 terms[1] = arguments[i+cp_y]; /* y */
571 terms[2] = 1; /* 1 */
572 LeastSquaresAddTerms(matrix,vectors,terms,
580 terms[0] = arguments[cp_x]
582 terms[1] = arguments[cp_y] +
584 terms[2] = 1; /* 1 */
591 LeastSquaresAddTerms(matrix,vectors,terms,uv2,3UL,2UL);
595 LeastSquaresAddTerms(matrix,vectors,terms,
783 terms[8];
812 terms[0]=arguments[i+cp_x]; /* c0*x */
813 terms[1]=arguments[i+cp_y]; /* c1*y */
814 terms[2]=1.0; /* c2*1 */
815 terms[3]=0.0;
816 terms[4]=0.0;
817 terms[5]=0.0;
818 terms[6]=-terms[0]*arguments[i+cp_u]; /* 1/(c6*x) */
819 terms[7]=-terms[1]*arguments[i+cp_u]; /* 1/(c7*y) */
820 LeastSquaresAddTerms(matrix,vectors,terms,&(arguments[i+cp_u]),
823 terms[0]=0.0;
824 terms[1]=0.0;
825 terms[2]=0.0;
826 terms[3]=arguments[i+cp_x]; /* c3*x */
827 terms
828 terms[5]=1.0; /* c5*1 */
829 terms[6]=-terms[3]*arguments[i+cp_v]; /* 1/(c6*x) */
830 terms[7]=-terms[4]*arguments[i+cp_v]; /* 1/(c7*y) */
831 LeastSquaresAddTerms(matrix,vectors,terms,&(arguments[i+cp_v]),
902 terms[4];
934 terms[0] = arguments[i+cp_x]; /* x */
935 terms[1] = arguments[i+cp_y]; /* y */
936 terms[2] = terms[0]*terms[1]; /* x*y */
937 terms[3] = 1; /* 1 */
938 LeastSquaresAddTerms(matrix,vectors,terms,
1040 *terms;
1043 nterms; /* number of polynomial terms per number_values */
1056 /* create matrix, a fake vectors matrix, and least sqs terms */
1059 terms = (double *) AcquireQuantumMemory(nterms, sizeof(*terms));
1062 terms == (double *) NULL )
1066 terms = (double *) RelinquishMagickMemory(terms);
1079 terms[j] = poly_basis_fn(j,arguments[i+cp_x],arguments[i+cp_y]);
1080 LeastSquaresAddTerms(matrix,vectors,terms,
1083 terms = (double *) RelinquishMagickMemory(terms);
2114 (void) FormatLocaleFile(stderr, "Polynomial (order %lg, terms %lu), FX Equivelent\n",