-
Notifications
You must be signed in to change notification settings - Fork 313
/
complex.c
1488 lines (1291 loc) · 35.3 KB
/
complex.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* R : A Computer Language for Statistical Data Analysis
* Copyright (C) 1995, 1996, 1997 Robert Gentleman and Ross Ihaka
* Copyright (C) 2000-2016 The R Core Team
* Copyright (C) 2005 The R Foundation
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, a copy is available at
* https://www.R-project.org/Licenses/
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
/* Note: gcc -peantic may warn in several places about C99 features
as extensions.
This was a very-long-standing GCC bug, http://gcc.gnu.org/PR7263
The system <complex.h> header can work around it: some do.
It should have been resolved (after a decade) in 2012.
*/
#if defined(HAVE_CTANH) && !defined(HAVE_WORKING_CTANH)
#undef HAVE_CTANH
#endif
#if 0
/* For testing substitute fns */
#undef HAVE_CARG
#undef HAVE_CABS
#undef HAVE_CPOW
#undef HAVE_CEXP
#undef HAVE_CLOG
#undef HAVE_CSQRT
#undef HAVE_CSIN
#undef HAVE_CCOS
#undef HAVE_CTAN
#undef HAVE_CASIN
#undef HAVE_CACOS
#undef HAVE_CATAN
#undef HAVE_CSINH
#undef HAVE_CCOSH
#undef HAVE_CTANH
#endif
#ifdef __SUNPRO_C
/* segfaults in Solaris Studio 12.3 */
#undef HAVE_CPOW
#endif
#include <Defn.h> /* -> ../include/R_ext/Complex.h */
#include <Internal.h>
#include <Rmath.h>
#include "arithmetic.h" /* complex_* */
#include <complex.h>
#include "Rcomplex.h" /* I, C99_COMPLEX2, SET_C99_COMPLEX, toC99 */
#include <R_ext/Itermacros.h>
/* interval at which to check interrupts, a guess */
#define NINTERRUPT 10000000
SEXP attribute_hidden complex_unary(ARITHOP_TYPE code, SEXP s1, SEXP call)
{
R_xlen_t i, n;
SEXP ans;
switch(code) {
case PLUSOP:
return s1;
case MINUSOP:
ans = NO_REFERENCES(s1) ? s1 : duplicate(s1);
n = XLENGTH(s1);
for (i = 0; i < n; i++) {
Rcomplex x = COMPLEX(s1)[i];
COMPLEX(ans)[i].r = -x.r;
COMPLEX(ans)[i].i = -x.i;
}
return ans;
default:
errorcall(call, _("invalid complex unary operator"));
}
return R_NilValue; /* -Wall */
}
static R_INLINE double complex R_cpow_n(double complex X, int k)
{
if(k == 0) return (double complex) 1.;
else if(k == 1) return X;
else if(k < 0) return 1. / R_cpow_n(X, -k);
else {/* k > 0 */
double complex z = (double complex) 1.;;
while (k > 0) {
if (k & 1) z = z * X;
if (k == 1) break;
k >>= 1; /* efficient division by 2; now have k >= 1 */
X = X * X;
}
return z;
}
}
#if defined(Win32)
# undef HAVE_CPOW
#endif
/* reason for this:
1) X^n (e.g. for n = +/- 2, 3) is unnecessarily inaccurate in glibc;
cut-off 65536 : guided from empirical speed measurements
2) On Mingw (but not Mingw-w64) the system cpow is explicitly linked
against the (slow) MSVCRT pow, and gets (0+0i)^Y as 0+0i for all Y.
3) PPC macOS crashed on powers of 0+0i (at least under Rosetta).
Really 0i^-1 should by Inf+NaNi, but getting that portably seems too hard.
(C1x's CMPLX will eventually be possible.)
*/
static double complex mycpow (double complex X, double complex Y)
{
double complex Z;
double yr = creal(Y), yi = cimag(Y);
int k;
if (X == 0.0) {
if (yi == 0.0) Z = R_pow(0.0, yr); else Z = R_NaN + R_NaN*I;
} else if (yi == 0.0 && yr == (k = (int) yr) && abs(k) <= 65536)
Z = R_cpow_n(X, k);
else
#ifdef HAVE_CPOW
Z = cpow(X, Y);
#else
{
/* Used for FreeBSD and MingGW, hence mainly with gcc */
double rho, r, i, theta;
r = hypot(creal(X), cimag(X));
i = atan2(cimag(X), creal(X));
theta = i * yr;
if (yi == 0.0)
rho = pow(r, yr);
else {
/* rearrangement of cexp(X * clog(Y)) */
r = log(r);
theta += r * yi;
rho = exp(r * yr - i * yi);
}
#ifdef __GNUC__
__real__ Z = rho * cos(theta);
__imag__ Z = rho * sin(theta);
#else
Z = rho * cos(theta) + (rho * sin(theta)) * I;
#endif
}
#endif
return Z;
}
SEXP attribute_hidden complex_binary(ARITHOP_TYPE code, SEXP s1, SEXP s2)
{
R_xlen_t i, i1, i2, n, n1, n2;
SEXP ans;
/* Note: "s1" and "s2" are protected in the calling code. */
n1 = XLENGTH(s1);
n2 = XLENGTH(s2);
/* S4-compatibility change: if n1 or n2 is 0, result is of length 0 */
if (n1 == 0 || n2 == 0) return(allocVector(CPLXSXP, 0));
n = (n1 > n2) ? n1 : n2;
ans = R_allocOrReuseVector(s1, s2, CPLXSXP, n);
PROTECT(ans);
switch (code) {
case PLUSOP:
MOD_ITERATE2_CHECK(NINTERRUPT, n, n1, n2, i, i1, i2, {
Rcomplex x1 = COMPLEX(s1)[i1];
Rcomplex x2 = COMPLEX(s2)[i2];
COMPLEX(ans)[i].r = x1.r + x2.r;
COMPLEX(ans)[i].i = x1.i + x2.i;
});
break;
case MINUSOP:
MOD_ITERATE2_CHECK(NINTERRUPT, n, n1, n2, i, i1, i2, {
Rcomplex x1 = COMPLEX(s1)[i1];
Rcomplex x2 = COMPLEX(s2)[i2];
COMPLEX(ans)[i].r = x1.r - x2.r;
COMPLEX(ans)[i].i = x1.i - x2.i;
});
break;
case TIMESOP:
MOD_ITERATE2_CHECK(NINTERRUPT, n, n1, n2, i, i1, i2, {
SET_C99_COMPLEX(COMPLEX(ans), i,
C99_COMPLEX2(s1, i1) * C99_COMPLEX2(s2, i2));
});
break;
case DIVOP:
MOD_ITERATE2_CHECK(NINTERRUPT, n, n1, n2, i, i1, i2, {
SET_C99_COMPLEX(COMPLEX(ans), i,
C99_COMPLEX2(s1, i1) / C99_COMPLEX2(s2, i2));
});
break;
case POWOP:
MOD_ITERATE2_CHECK(NINTERRUPT, n, n1, n2, i, i1, i2, {
SET_C99_COMPLEX(COMPLEX(ans), i,
mycpow(C99_COMPLEX2(s1, i1), C99_COMPLEX2(s2, i2)));
});
break;
default:
error(_("unimplemented complex operation"));
}
UNPROTECT(1);
/* quick return if there are no attributes */
if (ATTRIB(s1) == R_NilValue && ATTRIB(s2) == R_NilValue)
return ans;
/* Copy attributes from longer argument. */
if (ans != s2 && n == n2 && ATTRIB(s2) != R_NilValue)
copyMostAttrib(s2, ans);
if (ans != s1 && n == n1 && ATTRIB(s1) != R_NilValue)
copyMostAttrib(s1, ans); /* Done 2nd so s1's attrs overwrite s2's */
return ans;
}
SEXP attribute_hidden do_cmathfuns(SEXP call, SEXP op, SEXP args, SEXP env)
{
SEXP x, y = R_NilValue; /* -Wall*/
R_xlen_t i, n;
checkArity(op, args);
check1arg(args, call, "z");
if (DispatchGroup("Complex", call, op, args, env, &x))
return x;
x = CAR(args);
if (isComplex(x)) {
n = XLENGTH(x);
switch(PRIMVAL(op)) {
case 1: /* Re */
y = allocVector(REALSXP, n);
for(i = 0 ; i < n ; i++)
REAL(y)[i] = COMPLEX(x)[i].r;
break;
case 2: /* Im */
y = allocVector(REALSXP, n);
for(i = 0 ; i < n ; i++)
REAL(y)[i] = COMPLEX(x)[i].i;
break;
case 3: /* Mod */
case 6: /* abs */
y = allocVector(REALSXP, n);
for(i = 0 ; i < n ; i++)
#if HAVE_CABS
REAL(y)[i] = cabs(C99_COMPLEX2(x, i));
#else
REAL(y)[i] = hypot(COMPLEX(x)[i].r, COMPLEX(x)[i].i);
#endif
break;
case 4: /* Arg */
y = allocVector(REALSXP, n);
for(i = 0 ; i < n ; i++)
#if HAVE_CARG
REAL(y)[i] = carg(C99_COMPLEX2(x, i));
#else
REAL(y)[i] = atan2(COMPLEX(x)[i].i, COMPLEX(x)[i].r);
#endif
break;
case 5: /* Conj */
y = NO_REFERENCES(x) ? x : allocVector(CPLXSXP, n);
for(i = 0 ; i < n ; i++) {
COMPLEX(y)[i].r = COMPLEX(x)[i].r;
COMPLEX(y)[i].i = -COMPLEX(x)[i].i;
}
break;
}
}
else if(isNumeric(x)) { /* so no complex numbers involved */
n = XLENGTH(x);
if(isReal(x)) PROTECT(x);
else PROTECT(x = coerceVector(x, REALSXP));
y = NO_REFERENCES(x) ? x : allocVector(REALSXP, n);
switch(PRIMVAL(op)) {
case 1: /* Re */
case 5: /* Conj */
for(i = 0 ; i < n ; i++)
REAL(y)[i] = REAL(x)[i];
break;
case 2: /* Im */
for(i = 0 ; i < n ; i++)
REAL(y)[i] = 0.0;
break;
case 4: /* Arg */
for(i = 0 ; i < n ; i++)
if(ISNAN(REAL(x)[i]))
REAL(y)[i] = REAL(x)[i];
else if (REAL(x)[i] >= 0)
REAL(y)[i] = 0;
else
REAL(y)[i] = M_PI;
break;
case 3: /* Mod */
case 6: /* abs */
for(i = 0 ; i < n ; i++)
REAL(y)[i] = fabs(REAL(x)[i]);
break;
}
UNPROTECT(1);
}
else errorcall(call, _("non-numeric argument to function"));
if (x != y && ATTRIB(x) != R_NilValue) {
PROTECT(x);
PROTECT(y);
SHALLOW_DUPLICATE_ATTRIB(y, x);
UNPROTECT(2);
}
return y;
}
/* used in format.c and printutils.c */
#define MAX_DIGITS 22
void attribute_hidden z_prec_r(Rcomplex *r, Rcomplex *x, double digits)
{
double m = 0.0, m1, m2;
int dig, mag;
r->r = x->r; r->i = x->i;
m1 = fabs(x->r); m2 = fabs(x->i);
if(R_FINITE(m1)) m = m1;
if(R_FINITE(m2) && m2 > m) m = m2;
if (m == 0.0) return;
if (!R_FINITE(digits)) {
if(digits > 0) return; else {r->r = r->i = 0.0; return ;}
}
dig = (int)floor(digits+0.5);
if (dig > MAX_DIGITS) return; else if (dig < 1) dig = 1;
mag = (int)floor(log10(m));
dig = dig - mag - 1;
if (dig > 306) {
double pow10 = 1.0e4;
digits = (double)(dig - 4);
r->r = fround(pow10 * x->r, digits)/pow10;
r->i = fround(pow10 * x->i, digits)/pow10;
} else {
digits = (double)(dig);
r->r = fround(x->r, digits);
r->i = fround(x->i, digits);
}
}
/* These substitute functions are rarely used, and not extensively
tested, e.g. over CRAN. Please do not change without very good
reason!
Currently (Feb 2011) they are used on FreeBSD.
*/
#ifndef HAVE_CLOG
#define clog R_clog
/* FIXME: maybe add full IEC60559 support */
static double complex clog(double complex x)
{
double xr = creal(x), xi = cimag(x);
return log(hypot(xr, xi)) + atan2(xi, xr)*I;
}
#endif
#ifndef HAVE_CSQRT
#define csqrt R_csqrt
/* FreeBSD does have this one */
static double complex csqrt(double complex x)
{
return mycpow(x, 0.5+0.0*I);
}
#endif
#ifndef HAVE_CEXP
#define cexp R_cexp
/* FIXME: check/add full IEC60559 support */
static double complex cexp(double complex x)
{
double expx = exp(creal(x)), y = cimag(x);
return expx * cos(y) + (expx * sin(y)) * I;
}
#endif
#ifndef HAVE_CCOS
#define ccos R_ccos
static double complex ccos(double complex x)
{
double xr = creal(x), xi = cimag(x);
return cos(xr)*cosh(xi) - sin(xr)*sinh(xi)*I; /* A&S 4.3.56 */
}
#endif
#ifndef HAVE_CSIN
#define csin R_csin
static double complex csin(double complex x)
{
double xr = creal(x), xi = cimag(x);
return sin(xr)*cosh(xi) + cos(xr)*sinh(xi)*I; /* A&S 4.3.55 */
}
#endif
#ifndef HAVE_CTAN
#define ctan R_ctan
static double complex ctan(double complex z)
{
/* A&S 4.3.57 */
double x2, y2, den, ri;
x2 = 2.0 * creal(z);
y2 = 2.0 * cimag(z);
den = cos(x2) + cosh(y2);
/* any threshold between -log(DBL_EPSILON) and log(DBL_XMAX) will do*/
if (ISNAN(y2) || fabs(y2) < 50.0) ri = sinh(y2)/den;
else ri = (y2 < 0 ? -1.0 : 1.0);
return sin(x2)/den + ri * I;
}
#endif
#ifndef HAVE_CASIN
#define casin R_casin
static double complex casin(double complex z)
{
/* A&S 4.4.37 */
double alpha, t1, t2, x = creal(z), y = cimag(z), ri;
t1 = 0.5 * hypot(x + 1, y);
t2 = 0.5 * hypot(x - 1, y);
alpha = t1 + t2;
ri = log(alpha + sqrt(alpha*alpha - 1));
/* This comes from
'z_asin() is continuous from below if x >= 1
and continuous from above if x <= -1.'
*/
if(y < 0 || (y == 0 && x > 1)) ri *= -1;
return asin(t1 - t2) + ri*I;
}
#endif
#ifndef HAVE_CACOS
#define cacos R_cacos
static double complex cacos(double complex z)
{
return M_PI_2 - casin(z);
}
#endif
#ifndef HAVE_CATAN
#define catan R_catan
static double complex catan(double complex z)
{
double x = creal(z), y = cimag(z), rr, ri;
rr = 0.5 * atan2(2 * x, (1 - x * x - y * y));
ri = 0.25 * log((x * x + (y + 1) * (y + 1)) /
(x * x + (y - 1) * (y - 1)));
return rr + ri*I;
}
#endif
#ifndef HAVE_CCOSH
#define ccosh R_ccosh
static double complex ccosh(double complex z)
{
return ccos(z * I); /* A&S 4.5.8 */
}
#endif
#ifndef HAVE_CSINH
#define csinh R_csinh
static double complex csinh(double complex z)
{
return -I * csin(z * I); /* A&S 4.5.7 */
}
#endif
static double complex z_tan(double complex z)
{
double y = cimag(z);
double complex r = ctan(z);
if(R_FINITE(y) && fabs(y) > 25.0) {
/* at this point the real part is nearly zero, and the
imaginary part is one: but some OSes get the imag as NaN */
#if __GNUC__
__imag__ r = y < 0 ? -1.0 : 1.0;
#else
r = creal(r) + (y < 0 ? -1.0 : 1.0) * I;
#endif
}
return r;
}
#ifndef HAVE_CTANH
#define ctanh R_ctanh
static double complex ctanh(double complex z)
{
return -I * z_tan(z * I); /* A&S 4.5.9 */
}
#endif
/* Don't rely on the OS at the branch cuts */
static double complex z_asin(double complex z)
{
if(cimag(z) == 0 && fabs(creal(z)) > 1) {
double alpha, t1, t2, x = creal(z), ri;
t1 = 0.5 * fabs(x + 1);
t2 = 0.5 * fabs(x - 1);
alpha = t1 + t2;
ri = log(alpha + sqrt(alpha*alpha - 1));
if(x > 1) ri *= -1;
return asin(t1 - t2) + ri*I;
}
return casin(z);
}
static double complex z_acos(double complex z)
{
if(cimag(z) == 0 && fabs(creal(z)) > 1) return M_PI_2 - z_asin(z);
return cacos(z);
}
static double complex z_atan(double complex z)
{
if(creal(z) == 0 && fabs(cimag(z)) > 1) {
double y = cimag(z), rr, ri;
rr = (y > 0) ? M_PI_2 : -M_PI_2;
ri = 0.25 * log(((y + 1) * (y + 1))/((y - 1) * (y - 1)));
return rr + ri*I;
}
return catan(z);
}
static double complex z_acosh(double complex z)
{
return z_acos(z) * I;
}
static double complex z_asinh(double complex z)
{
return -I * z_asin(z * I);
}
static double complex z_atanh(double complex z)
{
return -I * z_atan(z * I);
}
static Rboolean cmath1(double complex (*f)(double complex),
Rcomplex *x, Rcomplex *y, R_xlen_t n)
{
R_xlen_t i;
Rboolean naflag = FALSE;
for (i = 0 ; i < n ; i++) {
if (ISNA(x[i].r) || ISNA(x[i].i)) {
y[i].r = NA_REAL; y[i].i = NA_REAL;
} else {
SET_C99_COMPLEX(y, i, f(toC99(x + i)));
if ( (ISNAN(y[i].r) || ISNAN(y[i].i)) &&
!(ISNAN(x[i].r) || ISNAN(x[i].i)) ) naflag = TRUE;
}
}
return naflag;
}
SEXP attribute_hidden complex_math1(SEXP call, SEXP op, SEXP args, SEXP env)
{
SEXP x, y;
R_xlen_t n;
Rboolean naflag = FALSE;
PROTECT(x = CAR(args));
n = XLENGTH(x);
PROTECT(y = allocVector(CPLXSXP, n));
switch (PRIMVAL(op)) {
case 10003: naflag = cmath1(clog, COMPLEX(x), COMPLEX(y), n); break;
case 3: naflag = cmath1(csqrt, COMPLEX(x), COMPLEX(y), n); break;
case 10: naflag = cmath1(cexp, COMPLEX(x), COMPLEX(y), n); break;
case 20: naflag = cmath1(ccos, COMPLEX(x), COMPLEX(y), n); break;
case 21: naflag = cmath1(csin, COMPLEX(x), COMPLEX(y), n); break;
case 22: naflag = cmath1(z_tan, COMPLEX(x), COMPLEX(y), n); break;
case 23: naflag = cmath1(z_acos, COMPLEX(x), COMPLEX(y), n); break;
case 24: naflag = cmath1(z_asin, COMPLEX(x), COMPLEX(y), n); break;
case 25: naflag = cmath1(z_atan, COMPLEX(x), COMPLEX(y), n); break;
case 30: naflag = cmath1(ccosh, COMPLEX(x), COMPLEX(y), n); break;
case 31: naflag = cmath1(csinh, COMPLEX(x), COMPLEX(y), n); break;
case 32: naflag = cmath1(ctanh, COMPLEX(x), COMPLEX(y), n); break;
case 33: naflag = cmath1(z_acosh, COMPLEX(x), COMPLEX(y), n); break;
case 34: naflag = cmath1(z_asinh, COMPLEX(x), COMPLEX(y), n); break;
case 35: naflag = cmath1(z_atanh, COMPLEX(x), COMPLEX(y), n); break;
default:
/* such as sign, gamma */
errorcall(call, _("unimplemented complex function"));
}
if (naflag)
warningcall(call, "NaNs produced in function \"%s\"", PRIMNAME(op));
SHALLOW_DUPLICATE_ATTRIB(y, x);
UNPROTECT(2);
return y;
}
static void z_rround(Rcomplex *r, Rcomplex *x, Rcomplex *p)
{
r->r = fround(x->r, p->r);
r->i = fround(x->i, p->r);
}
static void z_prec(Rcomplex *r, Rcomplex *x, Rcomplex *p)
{
z_prec_r(r, x, p->r);
}
static void z_logbase(Rcomplex *r, Rcomplex *z, Rcomplex *base)
{
double complex dz = toC99(z), dbase = toC99(base);
SET_C99_COMPLEX(r, 0, clog(dz)/clog(dbase));
}
static void z_atan2(Rcomplex *r, Rcomplex *csn, Rcomplex *ccs)
{
double complex dr, dcsn = toC99(csn), dccs = toC99(ccs);
if (dccs == 0) {
if(dcsn == 0) {
r->r = NA_REAL; r->i = NA_REAL; /* Why not R_NaN? */
return;
} else {
double y = creal(dcsn);
if (ISNAN(y)) dr = y;
else dr = ((y >= 0) ? M_PI_2 : -M_PI_2);
}
} else {
dr = catan(dcsn / dccs);
if(creal(dccs) < 0) dr += M_PI;
if(creal(dr) > M_PI) dr -= 2 * M_PI;
}
SET_C99_COMPLEX(r, 0, dr);
}
/* Complex Functions of Two Arguments */
typedef void (*cm2_fun)(Rcomplex *, Rcomplex *, Rcomplex *);
SEXP attribute_hidden complex_math2(SEXP call, SEXP op, SEXP args, SEXP env)
{
R_xlen_t i, n, na, nb, ia, ib;
Rcomplex ai, bi, *a, *b, *y;
SEXP sa, sb, sy;
Rboolean naflag = FALSE;
cm2_fun f;
switch (PRIMVAL(op)) {
case 0: /* atan2 */
f = z_atan2; break;
case 10001: /* round */
f = z_rround; break;
case 2: /* passed from do_log1arg */
case 10:
case 10003: /* passed from do_log */
f = z_logbase; break;
case 10004: /* signif */
f = z_prec; break;
default:
error_return(_("unimplemented complex function"));
}
PROTECT(sa = coerceVector(CAR(args), CPLXSXP));
PROTECT(sb = coerceVector(CADR(args), CPLXSXP));
na = XLENGTH(sa); nb = XLENGTH(sb);
if ((na == 0) || (nb == 0)) {
UNPROTECT(2);
return(allocVector(CPLXSXP, 0));
}
n = (na < nb) ? nb : na;
PROTECT(sy = allocVector(CPLXSXP, n));
a = COMPLEX(sa); b = COMPLEX(sb); y = COMPLEX(sy);
MOD_ITERATE2(n, na, nb, i, ia, ib, {
ai = a[ia]; bi = b[ib];
if(ISNA(ai.r) && ISNA(ai.i) &&
ISNA(bi.r) && ISNA(bi.i)) {
y[i].r = NA_REAL; y[i].i = NA_REAL;
} else {
f(&y[i], &ai, &bi);
if ( (ISNAN(y[i].r) || ISNAN(y[i].i)) &&
!(ISNAN(ai.r) || ISNAN(ai.i) || ISNAN(bi.r) || ISNAN(bi.i)) )
naflag = TRUE;
}
});
if (naflag)
warning("NaNs produced in function \"%s\"", PRIMNAME(op));
if(n == na) {
SHALLOW_DUPLICATE_ATTRIB(sy, sa);
} else if(n == nb) {
SHALLOW_DUPLICATE_ATTRIB(sy, sb);
}
UNPROTECT(3);
return sy;
}
SEXP attribute_hidden do_complex(SEXP call, SEXP op, SEXP args, SEXP rho)
{
/* complex(length, real, imaginary) */
SEXP ans, re, im;
R_xlen_t i, na, nr, ni;
checkArity(op, args);
na = asInteger(CAR(args));
if(na == NA_INTEGER || na < 0)
error(_("invalid length"));
PROTECT(re = coerceVector(CADR(args), REALSXP));
PROTECT(im = coerceVector(CADDR(args), REALSXP));
nr = XLENGTH(re);
ni = XLENGTH(im);
/* is always true: if (na >= 0) {*/
na = (nr > na) ? nr : na;
na = (ni > na) ? ni : na;
/* }*/
ans = allocVector(CPLXSXP, na);
for(i=0 ; i<na ; i++) {
COMPLEX(ans)[i].r = 0;
COMPLEX(ans)[i].i = 0;
}
UNPROTECT(2);
if(na > 0 && nr > 0) {
for(i=0 ; i<na ; i++)
COMPLEX(ans)[i].r = REAL(re)[i%nr];
}
if(na > 0 && ni > 0) {
for(i=0 ; i<na ; i++)
COMPLEX(ans)[i].i = REAL(im)[i%ni];
}
return ans;
}
static void R_cpolyroot(double *opr, double *opi, int *degree,
double *zeror, double *zeroi, Rboolean *fail);
SEXP attribute_hidden do_polyroot(SEXP call, SEXP op, SEXP args, SEXP rho)
{
SEXP z, zr, zi, r, rr, ri;
Rboolean fail;
int degree, i, n;
checkArity(op, args);
z = CAR(args);
switch(TYPEOF(z)) {
case CPLXSXP:
PROTECT(z);
break;
case REALSXP:
case INTSXP:
case LGLSXP:
PROTECT(z = coerceVector(z, CPLXSXP));
break;
default:
UNIMPLEMENTED_TYPE("polyroot", z);
}
#ifdef LONG_VECTOR_SUPPORT
R_xlen_t nn = XLENGTH(z);
if (nn > R_SHORT_LEN_MAX) error("long vectors are not supported");
n = (int) nn;
#else
n = LENGTH(z);
#endif
degree = 0;
for(i = 0; i < n; i++) {
if(COMPLEX(z)[i].r!= 0.0 || COMPLEX(z)[i].i != 0.0) degree = i;
}
n = degree + 1; /* omit trailing zeroes */
if(degree >= 1) {
PROTECT(rr = allocVector(REALSXP, n));
PROTECT(ri = allocVector(REALSXP, n));
PROTECT(zr = allocVector(REALSXP, n));
PROTECT(zi = allocVector(REALSXP, n));
for(i = 0 ; i < n ; i++) {
if(!R_FINITE(COMPLEX(z)[i].r) || !R_FINITE(COMPLEX(z)[i].i))
error(_("invalid polynomial coefficient"));
REAL(zr)[degree-i] = COMPLEX(z)[i].r;
REAL(zi)[degree-i] = COMPLEX(z)[i].i;
}
R_cpolyroot(REAL(zr), REAL(zi), °ree, REAL(rr), REAL(ri), &fail);
if(fail) error(_("root finding code failed"));
UNPROTECT(2);
r = allocVector(CPLXSXP, degree);
for(i = 0 ; i < degree ; i++) {
COMPLEX(r)[i].r = REAL(rr)[i];
COMPLEX(r)[i].i = REAL(ri)[i];
}
UNPROTECT(3);
}
else {
UNPROTECT(1);
r = allocVector(CPLXSXP, 0);
}
return r;
}
/* Formerly src/appl/cpoly.c:
*
* Copyright (C) 1997-1998 Ross Ihaka
* Copyright (C) 1999-2001 R Core Team
*
* cpoly finds the zeros of a complex polynomial.
*
* On Entry
*
* opr, opi - double precision vectors of real and
* imaginary parts of the coefficients in
* order of decreasing powers.
*
* degree - int degree of polynomial.
*
*
* On Return
*
* zeror, zeroi - output double precision vectors of
* real and imaginary parts of the zeros.
*
* fail - output int parameter, true only if
* leading coefficient is zero or if cpoly
* has found fewer than degree zeros.
*
* The program has been written to reduce the chance of overflow
* occurring. If it does occur, there is still a possibility that
* the zerofinder will work provided the overflowed quantity is
* replaced by a large number.
*
* This is a C translation of the following.
*
* TOMS Algorithm 419
* Jenkins and Traub.
* Comm. ACM 15 (1972) 97-99.
*
* Ross Ihaka
* February 1997
*/
#include <R_ext/Arith.h> /* for declaration of hypot */
#include <R_ext/Memory.h> /* for declaration of R_alloc */
#include <float.h> /* for FLT_RADIX */
#include <Rmath.h> /* for R_pow_di */
static void calct(Rboolean *);
static Rboolean fxshft(int, double *, double *);
static Rboolean vrshft(int, double *, double *);
static void nexth(Rboolean);
static void noshft(int);
static void polyev(int, double, double,
double *, double *, double *, double *, double *, double *);
static double errev(int, double *, double *, double, double, double, double);
static double cpoly_cauchy(int, double *, double *);
static double cpoly_scale(int, double *, double, double, double, double);
static void cdivid(double, double, double, double, double *, double *);
/* Global Variables (too many!) */
static int nn;
static double *pr, *pi, *hr, *hi, *qpr, *qpi, *qhr, *qhi, *shr, *shi;
static double sr, si;
static double tr, ti;
static double pvr, pvi;
static const double eta = DBL_EPSILON;
static const double are = /* eta = */DBL_EPSILON;
static const double mre = 2. * M_SQRT2 * /* eta, i.e. */DBL_EPSILON;
static const double infin = DBL_MAX;
static void R_cpolyroot(double *opr, double *opi, int *degree,
double *zeror, double *zeroi, Rboolean *fail)
{
static const double smalno = DBL_MIN;
static const double base = (double)FLT_RADIX;
static int d_n, i, i1, i2;
static double zi, zr, xx, yy;
static double bnd, xxx;
Rboolean conv;
int d1;
double *tmp;
static const double cosr =/* cos 94 */ -0.06975647374412529990;
static const double sinr =/* sin 94 */ 0.99756405025982424767;
xx = M_SQRT1_2;/* 1/sqrt(2) = 0.707.... */
yy = -xx;
*fail = FALSE;
nn = *degree;
d1 = nn - 1;
/* algorithm fails if the leading coefficient is zero. */
if (opr[0] == 0. && opi[0] == 0.) {
*fail = TRUE;
return;
}
/* remove the zeros at the origin if any. */
while (opr[nn] == 0. && opi[nn] == 0.) {
d_n = d1-nn+1;
zeror[d_n] = 0.;
zeroi[d_n] = 0.;
nn--;
}
nn++;
/*-- Now, global var. nn := #{coefficients} = (relevant degree)+1 */
if (nn == 1) return;
/* Use a single allocation as these as small */
const void *vmax = vmaxget();
tmp = (double *) R_alloc((size_t) (10*nn), sizeof(double));
pr = tmp; pi = tmp + nn; hr = tmp + 2*nn; hi = tmp + 3*nn;
qpr = tmp + 4*nn; qpi = tmp + 5*nn; qhr = tmp + 6*nn; qhi = tmp + 7*nn;
shr = tmp + 8*nn; shi = tmp + 9*nn;
/* make a copy of the coefficients and shr[] = | p[] | */
for (i = 0; i < nn; i++) {
pr[i] = opr[i];
pi[i] = opi[i];
shr[i] = hypot(pr[i], pi[i]);
}
/* scale the polynomial with factor 'bnd'. */
bnd = cpoly_scale(nn, shr, eta, infin, smalno, base);
if (bnd != 1.) {
for (i=0; i < nn; i++) {
pr[i] *= bnd;
pi[i] *= bnd;
}
}
/* start the algorithm for one zero */
while (nn > 2) {
/* calculate bnd, a lower bound on the modulus of the zeros. */
for (i=0 ; i < nn ; i++)
shr[i] = hypot(pr[i], pi[i]);
bnd = cpoly_cauchy(nn, shr, shi);
/* outer loop to control 2 major passes */
/* with different sequences of shifts */
for (i1 = 1; i1 <= 2; i1++) {
/* first stage calculation, no shift */
noshft(5);
/* inner loop to select a shift */
for (i2 = 1; i2 <= 9; i2++) {
/* shift is chosen with modulus bnd */
/* and amplitude rotated by 94 degrees */
/* from the previous shift */
xxx= cosr * xx - sinr * yy;
yy = sinr * xx + cosr * yy;
xx = xxx;
sr = bnd * xx;
si = bnd * yy;
/* second stage calculation, fixed shift */
conv = fxshft(i2 * 10, &zr, &zi);
if (conv)
goto L10;
}
}
/* the zerofinder has failed on two major passes */
/* return empty handed */
*fail = TRUE;
vmaxset(vmax);
return;
/* the second stage jumps directly to the third stage iteration.
* if successful, the zero is stored and the polynomial deflated.
*/