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
|
// comptest.cc: test program for complex functions
//////////////////////////////////////////////////////////////////////////
//
// Copyright 1990-2012 John Cremona
//
// This file is part of the eclib package.
//
// eclib 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.
//
// eclib 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 eclib; if not, write to the Free Software Foundation,
// Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
//
//////////////////////////////////////////////////////////////////////////
#include <eclib/compproc.h>
#include <eclib/marith.h>
int main(void)
{
set_precision("Enter precision in bits");
#ifdef MPFP
long original_output_precision = RR::OutputPrecision();
RR::SetOutputPrecision(original_output_precision-1);
#endif
bigfloat x=to_bigfloat(double(3.125)), y=to_bigfloat(4.25);
bigcomplex z = bigcomplex(x,y);
bigcomplex a = bigcomplex(to_bigfloat(1),to_bigfloat(1));
bigcomplex b = bigcomplex(to_bigfloat(2),to_bigfloat(1));
bigcomplex c;
cout << "z = " << z << "\n";
cout << " has real part = " << real(z) << "\n";
cout << " and imaginary part = " << imag(z) << "i\n";
cout << "z has complex conjugate = " << conj(z) << "\n";
c = cagm(z,to_bigfloat(1));
cout << "AGM(" << z << "," << bigcomplex(to_bigfloat(1)) << ") = ";
cout << c << "\n\n";
cout << "AGM(" << a << "," << b << ") = "<<flush;
c = cagm(a,b);
cout << c << "\n\n";
bigint ia,ib,ic,id,ie; long nr;
vector<bigint> roots;
cout << "Enter Integer coefficients of a (monic) cubic:";
cin>>ia>>ib>>ic;
roots = Introotscubic(ia,ib,ic);
nr=roots.size();
if (nr==0) cout << "No integer roots"<<endl;
else cout << "The "<<nr<<" root(s) are:\n"<<roots<<endl;
// Test of complex cube root
bigcomplex rootz;
bigfloat three(to_bigfloat(3));
bigcomplex w = bigcomplex(to_bigfloat(-1),
sqrt(three))/to_bigfloat(2);
cout << "Enter a real or complex: "; cin >> z;
rootz=exp(log(z)/three);
cout << "Main cube root = " << rootz << endl;
cout << "whose cube is " << pow(rootz,3) << endl;
rootz*=w;
cout << "Next cube root = " << rootz << endl;
cout << "whose cube is " << pow(rootz,3) << endl;
rootz*=w;
cout << "Next cube root = " << rootz << endl;
cout << "whose cube is " << pow(rootz,3) << endl;
// Test for quartic root-finding:
bigfloat xa,xb,xc,xd,xe;
cout << "Enter real coefficients a b c d e of a quartic:";
cin>>xa>>xb>>xc>>xd>>xe;
int iroot;
vector<bigcomplex> croots = solverealquartic((xa), (xb),(xc),(xd),(xe));
cout<<"Quartic [" <<xa << "," << xb << "," << xc << "," << xd << "," << xe
<< "] has roots:\n";
for(iroot=0; iroot<4; iroot++) cout<<croots[iroot]<<"\n";
cout<<endl;
#ifdef MPFP
RR::SetOutputPrecision(original_output_precision);
#endif
}
|
