extendmatrix 0.1.0

data/spec/extendmatrix_spec.rb

@@ -0,0 +1,357 @@
+$:.unshift(File.dirname(__FILE__)+"/../lib")
+require 'spec'
+require 'spec/autorun'
+
+require 'extendmatrix'
+
+describe "Vector class extension:" do
+  before do
+    @v = Vector.[](1, 2, 3, 4)
+  end
+
+  it "[] method" do
+    v = @v.clone
+    v[1..2] = Vector[9, 9, 9, 9, 9]
+    v.should == Vector[1, 9, 9, 4]
+  end
+
+  it "Vector.concat method" do
+    Vector.concat(Vector[1], Vector[2, 3]).should == Vector[1, 2, 3]
+    Vector.concat(Vector[1], Vector[2, 3], Vector[4, 5]).should ==  Vector[1, 2, 3, 4, 5]
+  end
+
+  it "collect method" do
+    @v.collect!{|i| i * i}.should == Vector.[](1, 4, 9, 16)
+    @v.collect!{|i| 3 * i}.should == Vector.[](3, 12, 27, 48)
+  end
+
+  it "each method" do
+    r = []
+    @v.each{|i| r << i+1}
+    r.should == [2, 3, 4, 5]
+  end
+
+  it "max element" do
+    @v.max.should == 4
+  end
+
+  it "max element" do
+    @v.min.should == 1
+  end
+
+  it "norm method" do
+    v = Vector.[](3, 4)
+    v.norm.should == 5
+  end
+
+  it "method p_norm(1)" do
+    v = Vector.[](3, 4)
+    v.norm(1).should == 7
+  end
+
+  it "method p_norm(2)" do
+    v = Vector.[](3, 4)
+    v.norm(2).should == 5
+  end
+
+  it "method p_norm(3)" do
+    v = Vector.[](3, 4)
+    v.norm(3).should > 4.49
+    v.norm(3).should < 4.50
+  end
+
+  it "method p_norm(4)" do
+    v = Vector.[](3, 4)
+    v.norm(4).should > 4.28
+    v.norm(4).should < 4.29
+  end
+
+  it "[]= method" do
+    @v[3] = 10
+    @v.should == Vector.[](1, 2, 3, 10)
+  end
+
+  it "norm_inf" do
+    @v.norm_inf.should == 4
+  end
+end
+
+describe "Matrix class extension:" do
+  before do
+    @m = Matrix[[1, 2, 222], [2, 33, 4]]
+  end
+  it "to_s method" do
+    @m.to_s.size.should_not == 0
+  end
+  it "[] method" do
+    m = Matrix.new(4, 3){|i, j| i * 3 + j}
+    m[1, 2].should == 5
+    m[3, 1..2].should ==  Vector[10, 11]
+    m[0..1, 0..2].should == Matrix[[0, 1, 2], [3, 4, 5]]
+  end
+  it "row_sum method" do
+	  @m.row_sum[0].should==225
+  end
+  it "column_sum method" do
+	  @m.column_sum[0].should==3
+  end
+  it "total_sum method" do
+	  @m.total_sum.should==264
+  end
+  
+  it "[]= method" do
+    m = Matrix.new(3, 3){|i, j| i * 3 + j}
+    m[1, 2] = 9
+    m.should == Matrix[[0, 1, 2], [3, 4, 9], [6, 7, 8]]
+    m[1, 1..2] = Vector[8, 8]
+    m.should == Matrix[[0, 1, 2], [3, 8, 8], [6, 7, 8]]
+    m[0..1, 0..1] = Matrix[[0, 0, 0], [0, 0, 0]]
+    m.should == Matrix[[0, 0, 2], [0, 0, 8], [6, 7, 8]]
+  end
+
+  it "set method" do
+    n = Matrix.new(2, 3)
+    n.set(@m)
+    n.should == @m
+  end
+
+  it "set method and wrap value" do
+    @m.wrap = :torus
+    n = Matrix.new(2, 3)
+    n.set(@m)
+    n.wrap.should == :torus
+  end
+
+  it "wrap method" do
+    @m.wrap=:torus
+    @m[2, 3].should == 1
+    @m.wrap=:h_cylinder
+    @m[2, 0].should == 1
+    @m.wrap=:v_cylinder
+    @m[0, 3].should == 1
+  end
+
+  it "maximum length of a column" do
+    @m.max_len_column(1).should == 2
+  end
+
+  it "list of maximum lengths of columns" do
+    @m.cols_len.should == [1, 2, 3]
+  end
+
+  it "matrix each method" do
+    r = []
+    @m.each{|x| r << x + 3}
+    r.should == [4, 5, 225, 5, 36, 7]
+
+    s = 0
+    @m.each{|x| s += x}
+    s.should == 264
+  end
+
+  it "row! method" do
+    @m.row!(0){|x| x+x}.should == [2, 4, 444]
+    @m.should == Matrix[[2, 4, 444], [2, 33, 4]]
+  end
+
+  it "row_collect method" do
+    @m.row_collect(1){|x| x+10}.should == [12, 43, 14]
+  end
+
+  it "column_collect method" do
+    @m.column_collect(0){|x| x*3}.should == [3, 6]
+  end
+
+  it "row_collect! method, identicaly with row!" do
+    @m.row_collect!(0){|x| x+x}.should == [2, 4, 444]
+    @m.should == Matrix[[2, 4, 444], [2, 33, 4]]
+  end
+
+  it "column_collect! method" do
+    @m.column_collect!(2){|x| x+10}.should == [232, 14]
+    @m.should == Matrix[[1, 2, 232], [2, 33, 14]]
+  end
+
+  it "column= " do
+    m = Matrix.new(3, 3){|i, j| i * 3 + j + 1}
+    m.column= 1, Vector[1,1,1,1,1,1]
+    m.should == Matrix[[1, 1, 3],[4, 1, 6],[7, 1, 9]]
+    m.column= 2, Vector[9,9], 0..1
+    m.should == Matrix[[1, 1, 9],[4, 1, 9],[7, 1, 9]]
+  end
+
+  it "row= " do
+    m = Matrix.new(3, 3){|i, j| i * 3 + j + 1}
+    m.row= 1, Vector[1,1,1,1,1,1]
+    m.should == Matrix[[1, 2, 3],[1, 1, 1],[7, 8, 9]]
+    m.row= 2, Vector[9,9], 0..2
+    m.should == Matrix[[1, 2, 3],[1, 1, 1],[9, 9, 0]]
+  end
+
+  it "norm of a matrix" do
+    m = Matrix[[1, 2, 3], [1, 2, 3]]
+    m.norm.should == Math.sqrt(28)
+  end
+
+  it "test empty matrix" do
+    @m.empty?.should == false
+    n = Matrix[]
+    n.empty?.should == true
+  end
+
+  it "row2matrix" do
+    m = Matrix.new(4, 3){|i, j| i * 3 + j + 1}
+    m.row2matrix(1..2).should == Matrix[[4, 5, 6],[7, 8, 9]]
+    m.row2matrix(2).should == Matrix[[7, 8, 9]]
+    m.row2matrix(0..4).should == m
+  end
+
+  it "column2matrix" do
+    m = Matrix.new(4, 3){|i, j| i * 3 + j + 1}
+    m.column2matrix(1).should == Matrix[[2], [5], [8], [11]]
+  end
+
+  it "diag" do
+    m1 = Matrix[[1]]
+    m2 = Matrix[[2, 0], [0, 3]]
+    m3 = Matrix[[4, 0, 0], [0, 5, 0], [0, 0, 6]]
+    a1 = Matrix.new(6, 6){|i, j| i == j ? i + 1: 0}
+    Matrix.diag(m1, m2, m3).should == a1
+    Matrix.diag(m2).should == m2
+    a2 = Matrix[[2, 0, 0, 0],
+      [0, 3, 0, 0],
+      [0, 0, 2, 0],
+    [0, 0, 0, 3]]
+    Matrix.diag(m2, m2).should == a2
+  end
+
+  it "equal_in_delta" do
+    m = Matrix.new(4, 3){|i, j| i * 3 + j +1}
+    Matrix.equal_in_delta?(m, m).should == true
+    mm = m.clone
+    mm[0,0] += 2
+    Matrix.equal_in_delta?(m, mm, 0.001).should == false
+    Matrix.equal_in_delta?(m, mm, 2).should == true
+  end
+
+  it "diag_in_delta" do
+    Matrix.diag_in_delta?(Matrix.I(5), Matrix.new(4, 4){|i, j| i + j}).should == false
+    m  = Matrix.new(5, 5){|i, j| i == j ? 1 + 0.001 * (i+1) : i + j}
+    Matrix.diag_in_delta?(Matrix.I(5), m, 0.01).should == true
+  end
+
+  it "LU " do
+    m = Matrix[[1, 4, 7],
+      [2, 5, 8],
+    [3, 6, 10]]
+    l = Matrix[[1, 0, 0],[2, 1, 0],[3, 2, 1]]
+    m.L.should == l
+    u = Matrix[[1, 4, 7],[0, -3, -6],[0, 0, 1]]
+    m.U.should == u
+  end
+
+  it "L " do
+    # e.g.: MC, Golub, 3.2 LU factorization, pg 94
+    m = Matrix[[3, 5],
+    [6, 7]]
+    l = Matrix[[1, 0],
+    [2, 1]]
+    m.L.should == l
+  end
+
+  it "U " do
+    # e.g.: MC, Golub, 3.2 LU factorization, pg 94
+    m = Matrix[[3, 5],
+    [6, 7]]
+    u = Matrix[[3, 5],
+    [0, -3]]
+    m.U.should == u
+  end
+
+  it "houseQR " do
+    m = Matrix.new(4, 3){|i, j| i * 3 + j +1}
+    Matrix.equal_in_delta?(m, m.houseQ * m.houseR).should == true
+    q = Matrix[[0.0776, 0.8330, 0.5329,  0.1264],
+      [0.3104, 0.4512, -0.8048, 0.2286],
+      [0.5433, 0.0694, 0.0108, -0.8365],
+    [0.7761, -0.3123, 0.2610, 0.4815]]
+    Matrix.equal_in_delta?(m.houseQ, q, 0.0001).should == true
+  end
+
+  it "houseR " do
+    m = Matrix.new(4, 3){|i, j| i * 3 + j +1}
+    r = Matrix[[12.88409, 14.59162, 16.29916],
+      [       0,  1.04131, 2.082630],
+      [       0,        0,        0],
+    [       0,        0,        0]]
+    Matrix.equal_in_delta?(r, m.houseR, 1.0e-5).should == true
+  end
+
+  it "bidiagonalization" do
+    # MC, Golub, p252, Example 5.4.2
+    m = Matrix.new(4, 3){|i, j| i * 3 + j +1}
+    bidiag = Matrix[[12.884,  21.876, 0     ],
+      [0,       2.246,  -0.613],
+      [0,       0,      0     ],
+    [0,       0,      0     ]]
+    Matrix.equal_in_delta?(bidiag, m.bidiagonal, 0.001).should == true
+  end
+
+  it "gram_schmidt" do
+    m = Matrix[[1,     1],
+      [0.001, 0],
+    [0, 0.001]]
+    gsQ = Matrix[[    1,         0],
+      [0.001, -0.707107],
+    [    0,  0.707100]]
+    Matrix.equal_in_delta?(gsQ, m.gram_schmidt[0], 0.001).should == true
+    Matrix.equal_in_delta?(m,m.gram_schmidt[0] * m.gram_schmidt[1], 1.0e-5).should == true
+  end
+
+  it "givens " do
+    m = Matrix.new(4, 3){|i, j| i * 3 + j +1}
+    Matrix.equal_in_delta?(m, m.givensQ * m.givensR, 0.001).should == true
+  end
+
+  it "hessenbergQR " do
+    hess = Matrix[[1, 2, 1, 2, 1],
+      [1, 3, 2, 3, 4],
+      [0, 2, 4, 3, 5],
+      [0, 0, 1, 4, 3],
+    [0, 0, 0, 6, 1]]
+    hessR = hess.hessenbergR
+    r = Matrix[[1.41421,  3.53553,  2.12132,  3.53553,  3.53553],
+      [      0, -2.12132, -4.00693, -3.06412, -5.42115],
+      [      0,        0, -1.20185, -3.51310, -2.31125],
+      [      0,        0,        0, -6.30628, -1.54912],
+    [      0,        0,        0,        0,  1.53929]]
+
+    Matrix.equal_in_delta?(r, hessR, 1.0e-5).should == true
+    Matrix.equal_in_delta?(hessR, hess.hessenbergQ.t * hess, 1.0e-5).should == true
+  end
+
+  it "hessenberg_form " do
+    m = Matrix[[1, 5, 7],[3, 0, 6],[4, 3, 1]]
+    h = Matrix[[1, 8.6, -0.2],[5, 4.96, -0.72],[0, 2.28, -3.96]]
+    Matrix.equal_in_delta?(h, m.hessenberg_form_H, 0.001).should == true
+  end
+
+  it "realSchur" do
+    m = Matrix.new(3, 3){1} + Matrix.diagonal(2, 2, 2)
+    e = Matrix[[5, 0, 0],[0, 2, 0],[0, 0, 2]]
+    Matrix.diag_in_delta?(m.realSchur, e, 1.0e-5).should == true
+  end
+
+  it "Classic Jacobi algorithm" do
+    m = Matrix[[3, 1, 1],[1, 3, 1],[1, 1, 3]]
+    v = Matrix[[2, 0, 0],[0, 5, 0],[0, 0, 2]]
+    Matrix.diag_in_delta?(v, m.cJacobiA, 0.01).should == true
+    a = Matrix[[1, 1, 1, 4],
+      [1, 1, 0, 5],
+      [1, 0, 1, 4],
+    [4, 5, 4, 1]]
+    e = Matrix[[-0.26828, 0, 0, 0], [0, -5.97550, 0, 0], [0, 0, 1.01373, 0], [0, 0, 0, 9.23004]]
+    Matrix.diag_in_delta?(e, a.cJacobiA, 1.0e-5).should == true
+  end
+end
+

metadata

@@ -0,0 +1,127 @@
+--- !ruby/object:Gem::Specification 
+name: extendmatrix
+version: !ruby/object:Gem::Version 
+  prerelease: false
+  segments: 
+  - 0
+  - 1
+  - 0
+  version: 0.1.0
+platform: ruby
+authors: 
+- Cosmin Bonchis
+autorequire: 
+bindir: bin
+cert_chain: 
+- |
+  -----BEGIN CERTIFICATE-----
+  MIIDMjCCAhqgAwIBAgIBADANBgkqhkiG9w0BAQUFADA/MREwDwYDVQQDDAhjbGJ1
+  c3RvczEVMBMGCgmSJomT8ixkARkWBWdtYWlsMRMwEQYKCZImiZPyLGQBGRYDY29t
+  MB4XDTEwMDMyOTIxMzg1NVoXDTExMDMyOTIxMzg1NVowPzERMA8GA1UEAwwIY2xi
+  dXN0b3MxFTATBgoJkiaJk/IsZAEZFgVnbWFpbDETMBEGCgmSJomT8ixkARkWA2Nv
+  bTCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBALf8JVMGqE7m5kYb+PNN
+  neZv2pcXV5fQCi6xkyG8bi2/SIFy/LyxuvLzEeOxBeaz1Be93bayIUquOIqw3dyw
+  /KXWa31FxuNuvAm6CN8fyeRYX/ou4cw3OIUUnIvB7RMNIu4wbgeM6htV/QEsNLrv
+  at1/mh9JpqawPrcjIOVMj4BIp67vmzJCaUf+S/H2uYtSO09F+YQE3tv85TPeRmqU
+  yjyXyTc/oJiw1cXskUL8UtMWZmrwNLHXuZWWIMzkjiz3UNdhJr/t5ROk8S2WPznl
+  0bMy/PMIlAbqWolRn1zl2VFJ3TaXScbqImY8Wf4g62b/1ZSUlGrtnLNsCYXrWiso
+  UPUCAwEAAaM5MDcwCQYDVR0TBAIwADALBgNVHQ8EBAMCBLAwHQYDVR0OBBYEFGu9
+  rrJ1H64qRmNNu3Jj/Qjvh0u5MA0GCSqGSIb3DQEBBQUAA4IBAQCV0Unka5isrhZk
+  GjqSDqY/6hF+G2pbFcbWUpjmC8NWtAxeC+7NGV3ljd0e1SLfoyBj4gnFtFmY8qX4
+  K02tgSZM0eDV8TpgFpWXzK6LzHvoanuahHLZEtk/+Z885lFene+nHadkem1n9iAB
+  cs96JO9/JfFyuXM27wFAwmfHCmJfPF09R4VvGHRAvb8MGzSVgk2i06OJTqkBTwvv
+  JHJdoyw3+8bw9RJ+jLaNoQ+xu+1pQdS2bb3m7xjZpufml/m8zFCtjYM/7qgkKR8z
+  /ZZt8lCiKfFArppRrZayE2FVsps4X6WwBdrKTMZ0CKSXTRctbEj1BAZ67eoTvBBt
+  rpP0jjs0
+  -----END CERTIFICATE-----
+
+date: 2010-05-04 00:00:00 -04:00
+default_executable: 
+dependencies: 
+- !ruby/object:Gem::Dependency 
+  name: rubyforge
+  prerelease: false
+  requirement: &id001 !ruby/object:Gem::Requirement 
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 2
+        - 0
+        - 4
+        version: 2.0.4
+  type: :development
+  version_requirements: *id001
+- !ruby/object:Gem::Dependency 
+  name: hoe
+  prerelease: false
+  requirement: &id002 !ruby/object:Gem::Requirement 
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 2
+        - 6
+        - 0
+        version: 2.6.0
+  type: :development
+  version_requirements: *id002
+description: |-
+  The project consists of some enhancements to the Ruby "Matrix" module and includes: LU and QR (Householder, Givens, Gram Schmidt, Hessenberg) decompositions, bidiagonalization, eigenvalue and eigenvector calculations.
+  Include some aditional code to obtains marginal for rows and columns.
+  
+  The original code can be found on the RubyForge repository at http://matrix.rubyforge.org/svn/trunk/ or the project's SVN repository can be checked out through anonymous access with the following command(s).
+  
+  Work done by Cosmin Bonchis as a Google Summer of Code 2007 project for Ruby Central Inc.
+email: 
+- cbonchis_info.uvt.ro
+executables: []
+
+extensions: []
+
+extra_rdoc_files: 
+- History.txt
+- Manifest.txt
+- ORIGINAL_README.txt
+- README.txt
+files: 
+- History.txt
+- Manifest.txt
+- ORIGINAL_README.txt
+- README.txt
+- Rakefile
+- lib/extendmatrix.rb
+- spec/extendmatrix_spec.rb
+has_rdoc: true
+homepage: http://github.com/clbustos/extendmatrix
+licenses: []
+
+post_install_message: 
+rdoc_options: 
+- --main
+- README.txt
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      segments: 
+      - 0
+      version: "0"
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      segments: 
+      - 0
+      version: "0"
+requirements: []
+
+rubyforge_project: ruby-statsample
+rubygems_version: 1.3.6
+signing_key: 
+specification_version: 3
+summary: "The project consists of some enhancements to the Ruby \"Matrix\" module and includes: LU and QR (Householder, Givens, Gram Schmidt, Hessenberg) decompositions, bidiagonalization, eigenvalue and eigenvector calculations"
+test_files: []
+