diff options
author | shigek <shigek@b2dd03c8-39d4-4d8f-98ff-823fe69b080e> | 2003-07-18 15:24:25 +0000 |
---|---|---|
committer | shigek <shigek@b2dd03c8-39d4-4d8f-98ff-823fe69b080e> | 2003-07-18 15:24:25 +0000 |
commit | e242cf9defb5442ef223535abe93399352cf139e (patch) | |
tree | b8eb591e57c326fd4e7cb49365f7e51783179237 /ext/bigdecimal/lib/ludcmp.rb | |
parent | b10272dc371a03844f685dc6db765c2bea11d29b (diff) |
More pathes from Tadasi Saito.
As discussed in ruby-dev ML:
E,PI, etc are disabled.
BigDecimal op String disabled.
to_f changed.
lib directory moved.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@4092 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
Diffstat (limited to 'ext/bigdecimal/lib/ludcmp.rb')
-rw-r--r-- | ext/bigdecimal/lib/ludcmp.rb | 75 |
1 files changed, 0 insertions, 75 deletions
diff --git a/ext/bigdecimal/lib/ludcmp.rb b/ext/bigdecimal/lib/ludcmp.rb deleted file mode 100644 index c36f0dea5b..0000000000 --- a/ext/bigdecimal/lib/ludcmp.rb +++ /dev/null @@ -1,75 +0,0 @@ -# -# ludcmp.rb -# -module LUSolve - def ludecomp(a,n,zero=0.0,one=1.0) - ps = [] - scales = [] - for i in 0...n do # pick up largest(abs. val.) element in each row. - ps <<= i - nrmrow = zero - ixn = i*n - for j in 0...n do - biggst = a[ixn+j].abs - nrmrow = biggst if biggst>nrmrow - end - if nrmrow>zero then - scales <<= one/nrmrow - else - raise "Singular matrix" - end - end - n1 = n - 1 - for k in 0...n1 do # Gaussian elimination with partial pivoting. - biggst = zero; - for i in k...n do - size = a[ps[i]*n+k].abs*scales[ps[i]] - if size>biggst then - biggst = size - pividx = i - end - end - raise "Singular matrix" if biggst<=zero - if pividx!=k then - j = ps[k] - ps[k] = ps[pividx] - ps[pividx] = j - end - pivot = a[ps[k]*n+k] - for i in (k+1)...n do - psin = ps[i]*n - a[psin+k] = mult = a[psin+k]/pivot - if mult!=zero then - pskn = ps[k]*n - for j in (k+1)...n do - a[psin+j] -= mult*a[pskn+j] - end - end - end - end - raise "Singular matrix" if a[ps[n1]*n+n1] == zero - ps - end - - def lusolve(a,b,ps,zero=0.0) - n = ps.size - x = [] - for i in 0...n do - dot = zero - psin = ps[i]*n - for j in 0...i do - dot = a[psin+j]*x[j] + dot - end - x <<= b[ps[i]] - dot - end - (n-1).downto(0) do |i| - dot = zero - psin = ps[i]*n - for j in (i+1)...n do - dot = a[psin+j]*x[j] + dot - end - x[i] = (x[i]-dot)/a[psin+i] - end - x - end -end |