Skip to content
Snippets Groups Projects
Select Git revision
  • e4c8f816819076455bd2c854fca272550b3e6e04
  • master default protected
  • test-dof-hash
  • dof-renumbering
  • gdemesy-master-patch-30528
  • eval-space-time
  • oscillating_multiharm
  • MH_movement
  • axisqu
  • write_vtu_and_ensight_formats
  • movingband
  • CP_1972_add_vtu_file_writing
  • mortar
  • fast_freq_sweep_Resolution
  • applyresolvent_again
  • marteaua-master-patch-54323
  • patch-1
  • binde-master-patch-08072
  • binde-master-patch-52461
  • BCGSL
  • resolvent
  • getdp_3_5_0
  • getdp_3_4_0
  • getdp_3_3_0
  • getdp_3_2_0
  • getdp_3_1_0
  • getdp_3_0_4
  • getdp_3_0_3
  • getdp_3_0_2
  • getdp_3_0_1
  • getdp_3_0_0
  • onelab_mobile_2.1.0
  • getdp_2_11_3 protected
  • getdp_2_11_2 protected
  • getdp_2_11_1 protected
  • getdp_2_11_0 protected
  • getdp_2_10_0 protected
  • getdp_2_9_2 protected
  • getdp_2_9_1 protected
  • getdp_2_9_0 protected
  • getdp_2_8_0 protected
41 results

Legendre.h

Blame
  • ludcmp.cpp 1.36 KiB
    /* $Id: ludcmp.cpp,v 1.2 2000-11-23 14:11:24 geuzaine Exp $ */
    #include <math.h>
    #define NRANSI
    #include "nrutil.h"
    #define TINY 1.0e-20;
    
    void 
    ludcmp (float **a, int n, int *indx, float *d)
    {
      int i, imax, j, k;
      float big, dum, sum, temp;
      float *vv;
    
      vv = vector (1, n);
      *d = 1.0;
      for (i = 1; i <= n; i++)
        {
          big = 0.0;
          for (j = 1; j <= n; j++)
    	if ((temp = fabs (a[i][j])) > big)
    	  big = temp;
          if (big == 0.0)
    	nrerror ("Singular matrix in routine ludcmp");
          vv[i] = 1.0 / big;
        }
      for (j = 1; j <= n; j++)
        {
          for (i = 1; i < j; i++)
    	{
    	  sum = a[i][j];
    	  for (k = 1; k < i; k++)
    	    sum -= a[i][k] * a[k][j];
    	  a[i][j] = sum;
    	}
          big = 0.0;
          for (i = j; i <= n; i++)
    	{
    	  sum = a[i][j];
    	  for (k = 1; k < j; k++)
    	    sum -= a[i][k] * a[k][j];
    	  a[i][j] = sum;
    	  if ((dum = vv[i] * fabs (sum)) >= big)
    	    {
    	      big = dum;
    	      imax = i;
    	    }
    	}
          if (j != imax)
    	{
    	  for (k = 1; k <= n; k++)
    	    {
    	      dum = a[imax][k];
    	      a[imax][k] = a[j][k];
    	      a[j][k] = dum;
    	    }
    	  *d = -(*d);
    	  vv[imax] = vv[j];
    	}
          indx[j] = imax;
          if (a[j][j] == 0.0)
    	a[j][j] = TINY;
          if (j != n)
    	{
    	  dum = 1.0 / (a[j][j]);
    	  for (i = j + 1; i <= n; i++)
    	    a[i][j] *= dum;
    	}
        }
      free_vector (vv, 1, n);
    }
    #undef TINY
    #undef NRANSI
    /* (C) Copr. 1986-92 Numerical Recipes Software J!0. */