Advertisement
Guest User

Untitled

a guest
May 28th, 2017
58
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.49 KB | None | 0 0
  1. void LU_decomposition (double *a, double *d, double *c, int n) {
  2.     int i;
  3.    
  4.     c[0] = c[0]/a[0];
  5.  
  6.     for (i = 1; i < n; ++i) {
  7.         a[i] -= d[i-1]*c[i-1];
  8.         c[i] = c[i]/a[i];
  9.     }
  10.     a[n] = a[n] - d[n-1]*c[n-1];
  11.  
  12.     return;
  13. }
  14.  
  15. void solve_line_system (double *a, double *d, double *c, double *b, double *x, int n) {
  16.     int i;
  17.    
  18.     x[0] = b[0]/a[0];
  19.  
  20.     for (i = 1; i < n+1; ++i)
  21.         x[3*i] = (b[i] - d[i-1]*x[3*(i-1)])/a[i];
  22.    
  23.     for (i = n-1; i > -1; --i)
  24.         x[3*i] -= c[i]*x[3*(i+1)];
  25.    
  26.     return;
  27. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement