2
2
# include <projects.h>
3
3
# define NEAR_ONE 1.00001
4
4
static double ceval(struct PW_COEF *C, int n, projUV w, projUV w2) {
5
double d=0, dd=0, vd, vdd, tmp, *c;
5
double d=0, dd=0, vd, vdd, tmp, *c;
8
for (C += n ; n-- ; --C ) {
11
for (c = C->c + --j; j ; --j ) {
12
vd = w2.v * (tmp = vd) - vdd + *c--;
15
d = w2.u * (tmp = d) - dd + w.v * vd - vdd + 0.5 * *c;
17
d = w2.u * (tmp = d) - dd;
22
for (c = C->c + --j; j ; --j ) {
23
vd = w2.v * (tmp = vd) - vdd + *c--;
26
return (w.u * d - dd + 0.5 * ( w.v * vd - vdd + 0.5 * *c ));
28
return (w.u * d - dd);
8
for (C += n ; n-- ; --C ) {
9
if ( (j = C->m) != 0) {
11
for (c = C->c + --j; j ; --j ) {
12
vd = w2.v * (tmp = vd) - vdd + *c--;
15
d = w2.u * (tmp = d) - dd + w.v * vd - vdd + 0.5 * *c;
17
d = w2.u * (tmp = d) - dd;
20
if ( (j = C->m) != 0 ) {
22
for (c = C->c + --j; j ; --j ) {
23
vd = w2.v * (tmp = vd) - vdd + *c--;
26
return (w.u * d - dd + 0.5 * ( w.v * vd - vdd + 0.5 * *c ));
28
return (w.u * d - dd);
30
projUV /* bivariate Chebyshev polynomial entry point */
31
projUV /* bivariate Chebyshev polynomial entry point */
31
32
bcheval(projUV in, Tseries *T) {
35
w.u = ( in.u + in.u - T->a.u ) * T->b.u;
36
w.v = ( in.v + in.v - T->a.v ) * T->b.v;
37
if (fabs(w.u) > NEAR_ONE || fabs(w.v) > NEAR_ONE) {
38
out.u = out.v = HUGE_VAL;
40
} else { /* double evaluation */
43
out.u = ceval(T->cu, T->mu, w, w2);
44
out.v = ceval(T->cv, T->mv, w, w2);
36
w.u = ( in.u + in.u - T->a.u ) * T->b.u;
37
w.v = ( in.v + in.v - T->a.v ) * T->b.v;
38
if (fabs(w.u) > NEAR_ONE || fabs(w.v) > NEAR_ONE) {
39
out.u = out.v = HUGE_VAL;
41
} else { /* double evaluation */
44
out.u = ceval(T->cu, T->mu, w, w2);
45
out.v = ceval(T->cv, T->mv, w, w2);
48
projUV /* bivariate power polynomial entry point */
50
projUV /* bivariate power polynomial entry point */
49
51
bpseval(projUV in, Tseries *T) {
55
for (i = T->mu; i >= 0; --i) {
60
row = *--c + in.v * row;
62
out.u = row + in.u * out.u;
64
for (i = T->mv; i >= 0; --i) {
69
row = *--c + in.v * row;
71
out.v = row + in.u * out.v;
57
for (i = T->mu; i >= 0; --i) {
59
if ((m = T->cu[i].m) != 0) {
62
row = *--c + in.v * row;
64
out.u = row + in.u * out.u;
66
for (i = T->mv; i >= 0; --i) {
68
if ((m = T->cv[i].m) != 0) {
71
row = *--c + in.v * row;
73
out.v = row + in.u * out.v;
76
78
projUV /* general entry point selecting evaluation mode */