gsl_integration__qmomo.c 4.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194
  1. /* integration/qmomo.c
  2. *
  3. * Copyright (C) 1996, 1997, 1998, 1999, 2000, 2007 Brian Gough
  4. *
  5. * This program is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU General Public License as published by
  7. * the Free Software Foundation; either version 3 of the License, or (at
  8. * your option) any later version.
  9. *
  10. * This program is distributed in the hope that it will be useful, but
  11. * WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  13. * General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU General Public License
  16. * along with this program; if not, write to the Free Software
  17. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
  18. */
  19. #include "gsl__config.h"
  20. #include <stdlib.h>
  21. #include "gsl_integration.h"
  22. #include "gsl_errno.h"
  23. static void
  24. initialise (double * ri, double * rj, double * rg, double * rh,
  25. double alpha, double beta);
  26. gsl_integration_qaws_table *
  27. gsl_integration_qaws_table_alloc (double alpha, double beta, int mu, int nu)
  28. {
  29. gsl_integration_qaws_table * t;
  30. if (alpha < -1.0)
  31. {
  32. GSL_ERROR_VAL ("alpha must be greater than -1.0", GSL_EINVAL, 0);
  33. }
  34. if (beta < -1.0)
  35. {
  36. GSL_ERROR_VAL ("beta must be greater than -1.0", GSL_EINVAL, 0);
  37. }
  38. if (mu != 0 && mu != 1)
  39. {
  40. GSL_ERROR_VAL ("mu must be 0 or 1", GSL_EINVAL, 0);
  41. }
  42. if (nu != 0 && nu != 1)
  43. {
  44. GSL_ERROR_VAL ("nu must be 0 or 1", GSL_EINVAL, 0);
  45. }
  46. t = (gsl_integration_qaws_table *)
  47. malloc(sizeof(gsl_integration_qaws_table));
  48. if (t == 0)
  49. {
  50. GSL_ERROR_VAL ("failed to allocate space for qaws_table struct",
  51. GSL_ENOMEM, 0);
  52. }
  53. t->alpha = alpha;
  54. t->beta = beta;
  55. t->mu = mu;
  56. t->nu = nu;
  57. initialise (t->ri, t->rj, t->rg, t->rh, alpha, beta);
  58. return t;
  59. }
  60. int
  61. gsl_integration_qaws_table_set (gsl_integration_qaws_table * t,
  62. double alpha, double beta, int mu, int nu)
  63. {
  64. if (alpha < -1.0)
  65. {
  66. GSL_ERROR ("alpha must be greater than -1.0", GSL_EINVAL);
  67. }
  68. if (beta < -1.0)
  69. {
  70. GSL_ERROR ("beta must be greater than -1.0", GSL_EINVAL);
  71. }
  72. if (mu != 0 && mu != 1)
  73. {
  74. GSL_ERROR ("mu must be 0 or 1", GSL_EINVAL);
  75. }
  76. if (nu != 0 && nu != 1)
  77. {
  78. GSL_ERROR ("nu must be 0 or 1", GSL_EINVAL);
  79. }
  80. t->alpha = alpha;
  81. t->beta = beta;
  82. t->mu = mu;
  83. t->nu = nu;
  84. initialise (t->ri, t->rj, t->rg, t->rh, alpha, beta);
  85. return GSL_SUCCESS;
  86. }
  87. void
  88. gsl_integration_qaws_table_free (gsl_integration_qaws_table * t)
  89. {
  90. free (t);
  91. }
  92. static void
  93. initialise (double * ri, double * rj, double * rg, double * rh,
  94. double alpha, double beta)
  95. {
  96. const double alpha_p1 = alpha + 1.0;
  97. const double beta_p1 = beta + 1.0;
  98. const double alpha_p2 = alpha + 2.0;
  99. const double beta_p2 = beta + 2.0;
  100. const double r_alpha = pow (2.0, alpha_p1);
  101. const double r_beta = pow (2.0, beta_p1);
  102. size_t i;
  103. double an, anm1;
  104. ri[0] = r_alpha / alpha_p1;
  105. ri[1] = ri[0] * alpha / alpha_p2;
  106. an = 2.0;
  107. anm1 = 1.0;
  108. for (i = 2; i < 25; i++)
  109. {
  110. ri[i] = -(r_alpha + an * (an - alpha_p2) * ri[i - 1])
  111. / (anm1 * (an + alpha_p1));
  112. anm1 = an;
  113. an = an + 1.0;
  114. }
  115. rj[0] = r_beta / beta_p1;
  116. rj[1] = rj[0] * beta / beta_p2;
  117. an = 2.0;
  118. anm1 = 1.0;
  119. for (i = 2; i < 25; i++)
  120. {
  121. rj[i] = -(r_beta + an * (an - beta_p2) * rj[i - 1])
  122. / (anm1 * (an + beta_p1));
  123. anm1 = an;
  124. an = an + 1.0;
  125. }
  126. rg[0] = -ri[0] / alpha_p1;
  127. rg[1] = -rg[0] - 2.0 * r_alpha / (alpha_p2 * alpha_p2);
  128. an = 2.0;
  129. anm1 = 1.0;
  130. for (i = 2; i < 25; i++)
  131. {
  132. rg[i] = -(an * (an - alpha_p2) * rg[i - 1] - an * ri[i - 1]
  133. + anm1 * ri[i]) / (anm1 * (an + alpha_p1));
  134. anm1 = an;
  135. an = an + 1.0;
  136. }
  137. rh[0] = -rj[0] / beta_p1;
  138. rh[1] = -rh[0] - 2.0 * r_beta / (beta_p2 * beta_p2);
  139. an = 2.0;
  140. anm1 = 1.0;
  141. for (i = 2; i < 25; i++)
  142. {
  143. rh[i] = -(an * (an - beta_p2) * rh[i - 1] - an * rj[i - 1]
  144. + anm1 * rj[i]) / (anm1 * (an + beta_p1));
  145. anm1 = an;
  146. an = an + 1.0;
  147. }
  148. for (i = 1; i < 25; i += 2)
  149. {
  150. rj[i] *= -1;
  151. rh[i] *= -1;
  152. }
  153. }