quad_utils.txx 4.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226
  1. /**
  2. * \file quad_utils.txx
  3. * \author Dhairya Malhotra, dhairya.malhotra@gmail.com
  4. * \date 7-16-2014
  5. * \brief This file contains quadruple-precision related functions.
  6. */
  7. #include <iomanip>
  8. #include <cstdlib>
  9. #include <cmath>
  10. QuadReal_t atoquad(const char* str){
  11. size_t i=0;
  12. QuadReal_t sign=1.0;
  13. for(;str[i]!='\0';i++){
  14. char c=str[i];
  15. if(c=='-') sign=-sign;
  16. if(c>='0' && c<='9') break;
  17. }
  18. QuadReal_t val=0.0;
  19. for(;str[i]!='\0';i++){
  20. char c=str[i];
  21. if(c>='0' && c<='9') val=val*10+(c-'0');
  22. else break;
  23. }
  24. if(str[i]=='.'){
  25. i++;
  26. QuadReal_t exp=1.0;exp/=10;
  27. for(;str[i]!='\0';i++){
  28. char c=str[i];
  29. if(c>='0' && c<='9') val=val+(c-'0')*exp;
  30. else break;
  31. exp/=10;
  32. }
  33. }
  34. return sign*val;
  35. }
  36. QuadReal_t fabs(const QuadReal_t& f){
  37. if(f>=0.0) return f;
  38. else return -f;
  39. }
  40. QuadReal_t sqrt(const QuadReal_t& a){
  41. QuadReal_t b=sqrt((double)a);
  42. b=b+(a/b-b)*0.5;
  43. b=b+(a/b-b)*0.5;
  44. return b;
  45. }
  46. QuadReal_t sin(const QuadReal_t& a){
  47. const size_t N=200;
  48. static std::vector<QuadReal_t> theta;
  49. static std::vector<QuadReal_t> sinval;
  50. static std::vector<QuadReal_t> cosval;
  51. if(theta.size()==0){
  52. #pragma omp critical (QUAD_SIN)
  53. if(theta.size()==0){
  54. theta.resize(N);
  55. sinval.resize(N);
  56. cosval.resize(N);
  57. QuadReal_t t=1.0;
  58. for(int i=0;i<N;i++){
  59. theta[i]=t;
  60. t=t*0.5;
  61. }
  62. sinval[N-1]=theta[N-1];
  63. cosval[N-1]=1.0-sinval[N-1]*sinval[N-1];
  64. for(int i=N-2;i>=0;i--){
  65. sinval[i]=2.0*sinval[i+1]*cosval[i+1];
  66. cosval[i]=sqrt(1.0-sinval[i]*sinval[i]);
  67. }
  68. }
  69. }
  70. QuadReal_t t=(a<0.0?-a:a);
  71. QuadReal_t sval=0.0;
  72. QuadReal_t cval=1.0;
  73. for(int i=0;i<N;i++){
  74. while(theta[i]<=t){
  75. QuadReal_t sval_=sval*cosval[i]+cval*sinval[i];
  76. QuadReal_t cval_=cval*cosval[i]-sval*sinval[i];
  77. sval=sval_;
  78. cval=cval_;
  79. t=t-theta[i];
  80. }
  81. }
  82. return (a<0.0?-sval:sval);
  83. }
  84. QuadReal_t cos(const QuadReal_t& a){
  85. const size_t N=200;
  86. static std::vector<QuadReal_t> theta;
  87. static std::vector<QuadReal_t> sinval;
  88. static std::vector<QuadReal_t> cosval;
  89. if(theta.size()==0){
  90. #pragma omp critical (QUAD_COS)
  91. if(theta.size()==0){
  92. theta.resize(N);
  93. sinval.resize(N);
  94. cosval.resize(N);
  95. QuadReal_t t=1.0;
  96. for(int i=0;i<N;i++){
  97. theta[i]=t;
  98. t=t*0.5;
  99. }
  100. sinval[N-1]=theta[N-1];
  101. cosval[N-1]=1.0-sinval[N-1]*sinval[N-1];
  102. for(int i=N-2;i>=0;i--){
  103. sinval[i]=2.0*sinval[i+1]*cosval[i+1];
  104. cosval[i]=sqrt(1.0-sinval[i]*sinval[i]);
  105. }
  106. }
  107. }
  108. QuadReal_t t=(a<0.0?-a:a);
  109. QuadReal_t sval=0.0;
  110. QuadReal_t cval=1.0;
  111. for(int i=0;i<N;i++){
  112. while(theta[i]<=t){
  113. QuadReal_t sval_=sval*cosval[i]+cval*sinval[i];
  114. QuadReal_t cval_=cval*cosval[i]-sval*sinval[i];
  115. sval=sval_;
  116. cval=cval_;
  117. t=t-theta[i];
  118. }
  119. }
  120. return cval;
  121. }
  122. QuadReal_t exp(const QuadReal_t& a){
  123. const size_t N=200;
  124. static std::vector<QuadReal_t> theta0;
  125. static std::vector<QuadReal_t> theta1;
  126. static std::vector<QuadReal_t> expval0;
  127. static std::vector<QuadReal_t> expval1;
  128. if(theta0.size()==0){
  129. #pragma omp critical (QUAD_EXP)
  130. if(theta0.size()==0){
  131. theta0.resize(N);
  132. theta1.resize(N);
  133. expval0.resize(N);
  134. expval1.resize(N);
  135. theta0[0]=1.0;
  136. theta1[0]=1.0;
  137. expval0[0]=const_e<QuadReal_t>();
  138. expval1[0]=const_e<QuadReal_t>();
  139. for(int i=1;i<N;i++){
  140. theta0[i]=theta0[i-1]*0.5;
  141. theta1[i]=theta1[i-1]*2.0;
  142. expval0[i]=sqrt(expval0[i-1]);
  143. expval1[i]=expval1[i-1]*expval1[i-1];
  144. }
  145. }
  146. }
  147. QuadReal_t t=(a<0.0?-a:a);
  148. QuadReal_t eval=1.0;
  149. for(int i=N-1;i>0;i--){
  150. while(theta1[i]<=t){
  151. eval=eval*expval1[i];
  152. t=t-theta1[i];
  153. }
  154. }
  155. for(int i=0;i<N;i++){
  156. while(theta0[i]<=t){
  157. eval=eval*expval0[i];
  158. t=t-theta0[i];
  159. }
  160. }
  161. eval=eval*(1.0+t);
  162. return (a<0.0?1.0/eval:eval);
  163. return eval;
  164. }
  165. std::ostream& operator<<(std::ostream& output, const QuadReal_t& q_){
  166. int width=output.width();
  167. output<<std::setw(1);
  168. QuadReal_t q=q_;
  169. if(q<0.0){
  170. output<<"-";
  171. q=-q;
  172. }else if(q>0){
  173. output<<" ";
  174. }else{
  175. output<<" ";
  176. output<<"0.0";
  177. return output;
  178. }
  179. int exp=0;
  180. static const QuadReal_t ONETENTH=(QuadReal_t)1/10;
  181. while(q<1.0 && abs(exp)<10000){
  182. q=q*10;
  183. exp--;
  184. }
  185. while(q>=10 && abs(exp)<10000){
  186. q=q*ONETENTH;
  187. exp++;
  188. }
  189. for(size_t i=0;i<34;i++){
  190. output<<(int)q;
  191. if(i==0) output<<".";
  192. q=(q-int(q))*10;
  193. if(q==0 && i>0) break;
  194. }
  195. if(exp>0){
  196. std::cout<<"e+"<<exp;
  197. }else if(exp<0){
  198. std::cout<<"e"<<exp;
  199. }
  200. return output;
  201. }