Dir. rearrangement according to the suggestions from Minero Aoki.

git-svn-id: http://svn.ruby-lang.org/repos/ruby/trunk@3722 b2dd03c8-39d4-4d8f-98ff-823fe69b080e

1 files changed, 0 insertions, 46 deletions

diff --git a/ext/bigdecimal/lib/linear.rb b/ext/bigdecimal/lib/linear.rb
deleted file mode 100644
index f93404fb6..000000000
--- a/ext/bigdecimal/lib/linear.rb
+++ /dev/null
@@ -1,46 +0,0 @@
-#!/usr/local/bin/ruby
-
-#
-# linear.rb
-#
-# Solves linear equation system(A*x = b) by LU decomposition method.
-#  where  A is a coefficient matrix,x is an answer vector,b is a constant vector.
-#
-require "bigdecimal"
-require "ludcmp"
-
-include LUSolve
-
-def rd_order
-   printf("Number of equations ?")
-   n = gets().chomp.to_i
-end
-
-zero = BigDecimal::new("0.0")
-one  = BigDecimal::new("1.0")
-
-while (n=rd_order())>0
-  a = []
-  as= []
-  b = []
-  printf("\nEnter coefficient matrix element A[i,j]\n");
-  for i in 0...n do
-    for j in 0...n do
-      printf("A[%d,%d]? ",i,j); s = gets
-      a <<=BigDecimal::new(s);
-      as<<=BigDecimal::new(s);
-    end
-    printf("Contatant vector element b[%d] ? ",i);b<<=BigDecimal::new(gets);
-  end
-  printf "ANS="
-  x = lusolve(a,b,ludecomp(a,n,zero,one),zero)
-  p x
-  printf "A*x-b\n"
-  for i in 0...n do
-    s = zero
-    for j in 0...n do
-       s = s + as[i*n+j]*x[j]
-    end
-    p s-b[i]
-  end
-end