extendmatrix 0.3.1 → 0.4

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 41d2eb4e69c1269aea537992ff8651672afbfd06
+  data.tar.gz: 13dc88d722a5503ae54aaf1085cd01474f18f125
+SHA512:
+  metadata.gz: 46bcba1edb7edc880547b04a0a96d187e3e81a12f59313c70099e07481e67a7b1bfc5e0442e85f6dba5924d172f82638d1833f5c70975508281149976a52d8e9
+  data.tar.gz: d9b7acf76163487e6d1ac537c314d4479ddba9d4d88367b0b0a19bcd45300289519bb942e578695af97eae4ca0f0cd64883999c69f61b6167290b2de6f14a35d

data/.gitignore

@@ -0,0 +1,6 @@
+.rvmrc
+Gemfile
+*.lock
+*~
+pkg
+*.gem

data/.rspec

@@ -0,0 +1 @@
+--color

data/History.txt

@@ -1,3 +1,9 @@
+=== 0.4
+* Code cleanup
+* Added separate version.rb file for storing VERSION info
+* Added gem essentials like gemspec, etc.
+* Removed support for ruby < 1.9.3
+
 === 0.3.1 / 2010-08-16
 * Bug fix: method mssq returns only the last row squares
 * Added method diagonal 

data/{README.txt → README.md}

@@ -1,17 +1,17 @@
-= extendmatrix
+# extendmatrix
 
-* http://github.com/clbustos/extendmatrix
+* http://github.com/SciRuby/extendmatrix
 
-== DESCRIPTION:
+## 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.
 
-Original code from http://rubyforge.org/projects/matrix/ , done by Cosmin Bonchis as a Google Summer of Code 2007 project for Ruby Central Inc.
+Original code done by Cosmin Bonchis as a Google Summer of Code 2007 project for Ruby Central Inc.
 
-Gem, github repository and current version manteined by Claudio Bustos.
+Gem, github repository and current version mantained by Claudio Bustos and the Ruby Science Foundation.
 
-== SYNOPSIS:
+## SYNOPSIS:
 
   require 'extendmatrix'
   v = Vector[1, 2, 3, 4]
@@ -36,20 +36,20 @@ Gem, github repository and current version manteined by Claudio Bustos.
   m.eigenvaluesJacobi => Vector[0.523942339006665, 0.0632833995384682, 2.41277426145487]
   m.cJacobiV
   # => Matrix[[0.818814082563014, 0.249617871497675, 0.516947208547894], [-0.550168858227442, 0.598307531004925, 0.58253096551128], [-0.163883268313767, -0.761392813580323, 0.62723461144538]]
-== REQUIREMENTS:
 
-* Only Ruby
+## REQUIREMENTS:
 
-== INSTALL:
+* Ruby > 1.9.3
 
-* sudo gem install matrix-extensions
-
-== LICENSE:
+## INSTALL:
 
+* sudo gem install extendmatrix
 
+## LICENSE:
 
 Copyright [2007] Cosmin Bonchis
 Copyright [2010] Claudio Bustos
+Copyright [2015] Ruby Science Foundation
 
 Licensed under the Apache License, Version 2.0 (the "License"); you may not use 
 this file except in compliance with the License. You may obtain a copy of the 
@@ -62,5 +62,4 @@ under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
 CONDITIONS OF ANY KIND, either express or implied. See the License for the 
 specific language governing permissions and limitations under the License. 
 
-
 See LICENSE.txt for more details

data/Rakefile

@@ -2,12 +2,13 @@
 $:.unshift(File.dirname(__FILE__)+"/lib")
 require 'rubygems'
 require 'hoe'
-require 'extendmatrix.rb'
-Hoe.plugin :git
-Hoe.spec 'extendmatrix' do
-  self.rubyforge_name = 'ruby-statsample'
-  self.version = Matrix::EXTENSION_VERSION
-  self.developer('Cosmin Bonchis', 'cbonchis_info.uvt.ro')
-end
+require 'version'
+
+require 'rspec'
+require 'rspec/core/rake_task'
 
+RSpec::Core::RakeTask.new do |t|
+  t.rspec_opts = ["-c", "-f progress"]
+  t.pattern = 'spec/**/*_spec.rb'
+end
 # vim: syntax=ruby

data/extendmatrix.gemspec

@@ -0,0 +1,32 @@
+# coding: utf-8
+$:.unshift File.expand_path("../lib", __FILE__)
+
+require 'version.rb'
+
+DESCRIPTION = <<MSG
+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.
+
+Includes some aditional code to obtains marginal for rows and columns.
+MSG
+
+Gem::Specification.new do |spec|
+  spec.name          = 'extendmatrix'
+  spec.version       = Matrix::EXTENSION_VERSION
+  spec.authors       = ['Cosmin Bonchis', 'Claudio Bustos', 'Sameer Deshmukh']
+  spec.email         = ['sameer.deshmukh93@gmail.com']
+  spec.summary       = %q{Enhancements to ruby "Matrix" and "Vector" modules}
+  spec.description   = DESCRIPTION
+  spec.homepage      = "http://github.com/SciRuby/extendmatrix"
+  spec.license       = 'Apache v2'
+
+  spec.files         = `git ls-files -z`.split("\x0")
+  spec.executables   = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
+  spec.test_files    = spec.files.grep(%r{^(test|spec|features)/})
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency 'bundler'
+  spec.add_development_dependency 'rake'
+  spec.add_development_dependency 'rspec'
+end

data/lib/extendmatrix.rb

@@ -2,18 +2,6 @@ require 'rational'
 require 'matrix'
 class Vector
   include Enumerable
-  # fix for Vector#coerce on Ruby 1.8.x
-  if RUBY_VERSION<="1.9.0"
-    alias_method :old_coerce, :coerce
-    def coerce(other)
-      case other
-      when Numeric
-        return Matrix::Scalar.new(other), self
-      else
-        raise TypeError, "#{self.class} can't be coerced into #{other.class}"
-      end
-    end
-  end
 
   module Norm
     def self.sqnorm(obj, p)
@@ -21,6 +9,7 @@ class Vector
     end
   end
 
+  alias :to_ary :to_a
   alias :length :size
   alias :index :[]
   #
@@ -221,10 +210,9 @@ class Vector
 end
 
 class Matrix
-
-  EXTENSION_VERSION="0.3.1"
   include Enumerable
 
+  alias :to_ary :to_a
   attr_reader :rows, :wrap
   @wrap = nil
   #
@@ -250,7 +238,6 @@ class Matrix
   # m[1, 2] => 5
   # m[3,1..2] => Vector[10, 11]
   # m[0..1, 0..2] => Matrix[[0, 1, 2], [3, 4, 5]]
-  #
   def [](i, j)
     case i
     when Range
@@ -270,9 +257,6 @@ class Matrix
     end
   end
 
-
-
-
   #
   # Set the values of a matrix
   # m = Matrix.build(3, 3){|i, j| i * 3 + j}
@@ -283,7 +267,6 @@ class Matrix
   # m[2,1..2] = Vector[8, 8] => Matrix[[0, 1, 2], [3, 8, 8], [6, 7, 8]]
   # m[0..1, 0..1] = Matrix[[0, 0, 0],[0, 0, 0]]
   # 		=> Matrix[[0, 0, 2], [0, 0, 8], [6, 7, 8]]
-  #
   def []=(i, j, v)
     case i
     when Range
@@ -318,7 +301,6 @@ class Matrix
 
   #
   # Return a duplicate matrix, with all elements copied
-  #
   def dup
     (self.class).rows(self.rows.dup)
   end
@@ -335,8 +317,6 @@ class Matrix
       # Creates a matrix <tt>n</tt> x <tt>m</tt>
       # If you provide a block, it will be used to set the values.
       # If not, <tt>val</tt> will be used
-      #
-
       def build(n,m,val=0)
         f = (block_given?)? lambda {|i,j| yield(i, j)} : lambda {|i,j| val}
         Matrix.rows((0...n).collect {|i| (0...m).collect {|j| f.call(i,j)}})
@@ -449,7 +429,6 @@ class Matrix
   def cols_len
     (0...column_size).collect {|j| max_len_column(j)}
   end
-
   alias :to_s_old :to_s
 
   #
@@ -495,18 +474,22 @@ class Matrix
       self[row,column].send(op,other[row,column])
     end
   end
+
   # Element wise multiplication
   def e_mult(other)
     elementwise_operation(:*,other)
   end
+
   # Element wise multiplication
   def e_quo(other)
     elementwise_operation(:quo,other)
   end
+
   # Matrix sum of squares
   def mssq
     @rows.inject(0){|ac,row| ac+(row.inject(0) {|acr,i| acr+(i**2)})}
   end
+  
   def eigenpairs
     eigval, eigvec= eigenvaluesJacobi, cJacobiV
     eigenpairs=eigval.size.times.map {|i|
@@ -514,6 +497,7 @@ class Matrix
     }
     eigenpairs=eigenpairs.sort{|a,b| a[0]<=>b[0]}.reverse
   end
+
   # Returns eigenvalues and eigenvectors of a matrix on a Hash
   # like CALL EIGEN on SPSS.
   # * _:eigenvectors_: contains the eigenvectors as columns of a new Matrix, ordered in descendent order
@@ -547,8 +531,7 @@ class Matrix
   # :section: Advanced methods
   #
   
-  #
-  # a hided module of Matrix
+  # a hidden module of Matrix
   module MMatrix
     def self.default_block(block)
       block ? lambda { |i| block.call(i) } : lambda {|i| i }
@@ -559,7 +542,6 @@ class Matrix
     # 1) the index of row/column and
     # 2) the values Vector for changing the row/column and
     # 3) the range of changes
-    #
     def self.id_vect_range(args, l)
       i = args[0] # the column(/the row) to be change
       vect = args[1] # the values vector
@@ -577,7 +559,6 @@ class Matrix
   #
   # Returns an array with the elements collected from the row "i".
   # When a block is given, the elements of that vector are iterated.
-  #
   def row_collect(i, &block)
     f = MMatrix.default_block(block)
     @rows[i].collect {|e| f.call(e)}
@@ -586,7 +567,6 @@ class Matrix
   #
   # Returns row vector number "i" like Matrix.row as a Vector.
   # When the block is given, the elements of row "i" are modified
-  #
   def row!(i)
     if block_given?
       @rows[i].collect! {|e| yield e }
@@ -599,176 +579,171 @@ class Matrix
   #
   # Returns an array with the elements collected from the column "j".
   # When a block is given, the elements of that vector are iterated.
-  #
   def column_collect(j, &block)
     f = MMatrix.default_block(block)
     (0...row_size).collect {|r| f.call(self[r, j])}
   end
 
-#
-# Returns column vector number "j" as a Vector.
-# When the block is given, the elements of column "j" are mmodified
-#
-def column!(j)
-  if block_given?
-    (0...row_size).collect { |i| @rows[i][j] = yield @rows[i][j] }
-  else
-    column(j)
+  #
+  # Returns column vector number "j" as a Vector.
+  # When the block is given, the elements of column "j" are mmodified
+  #
+  def column!(j)
+    if block_given?
+      (0...row_size).collect { |i| @rows[i][j] = yield @rows[i][j] }
+    else
+      column(j)
+    end
   end
-end
-alias :column_collect! :column!
-
-#
-# Set a certain column with the values of a Vector
-# m = Matrix.build(3, 3){|i, j| i * 3 + j + 1}
-# m.column= 1, Vector[1, 1, 1], 1..2
-# m => 1 2 3
-#      4 1 6
-#      7 1 9
-#
-def column=(args)
-  m = row_size
-  c, v, r = MMatrix.id_vect_range(args, m)
-  (m..r.begin - 1).each{|i| self[i, c] = 0}
-  [v.size, r.entries.size].min.times{|i| self[i + r.begin, c] = v[i]}
-  ((v.size + r.begin)..r.entries.last).each {|i| self[i, c] = 0}
-end
-
-#
-# Set a certain row with the values of a Vector
-# m = Matrix.new(3, 3){|i, j| i * 3 + j + 1}
-# m.row= 0, Vector[0, 0], 1..2
-# m => 1 0 0
-#      4 5 6
-#      7 8 9
-#
-def row=(args)
-  i, val, range = MMatrix.id_vect_range(args, column_size)
-  row!(i)[range] = val
-end
-
-def norm(p = 2)
-  Vector::Norm.sqnorm(self, p) ** (1.quo(p))
-end
+  alias :column_collect! :column!
 
-def norm_frobenius
-  norm
-end
-alias :normF :norm_frobenius
-
-#
-# Tests if the matrix is empty or not
-#
-def empty?
-  @rows.empty? if @rows
-end
-
-#
-# Returns row(s) of matrix as a Matrix
-#
-
-def row2matrix(r)
-  if r.is_a? Range
-    a=r.map {|v| v<row_size ? row(v).to_a : nil }.find_all {|v| !v.nil?}
-  else
-    a = row(r).to_a
-  end
-  if r.is_a?(Range) and r.entries.size > 1
-    return Matrix[*a]
-  else
-    return Matrix[a]
+  #
+  # Set a certain column with the values of a Vector
+  # m = Matrix.build(3, 3){|i, j| i * 3 + j + 1}
+  # m.column= 1, Vector[1, 1, 1], 1..2
+  # m => 1 2 3
+  #      4 1 6
+  #      7 1 9
+  #
+  def column=(args)
+    m = row_size
+    c, v, r = MMatrix.id_vect_range(args, m)
+    (m..r.begin - 1).each{|i| self[i, c] = 0}
+    [v.size, r.entries.size].min.times{|i| self[i + r.begin, c] = v[i]}
+    ((v.size + r.begin)..r.entries.last).each {|i| self[i, c] = 0}
   end
-end
 
-#
-# Returns the column/s of matrix as a Matrix
-#
-def column2matrix(c)
-  if c.is_a?(Range)
-    a=c.map {|v| column(v).to_a}.find_all {|v| v.size>0}
-  else
-    a = column(c).to_a
+  #
+  # Set a certain row with the values of a Vector
+  # m = Matrix.new(3, 3){|i, j| i * 3 + j + 1}
+  # m.row= 0, Vector[0, 0], 1..2
+  # m => 1 0 0
+  #      4 5 6
+  #      7 8 9
+  #
+  def row=(args)
+    i, val, range = MMatrix.id_vect_range(args, column_size)
+    row!(i)[range] = val
   end
-  if c.is_a?(Range)
-    return Matrix.columns(a)
-  else
-    return Matrix[*a.collect{|x| [x]}]
+
+  def norm(p = 2)
+    Vector::Norm.sqnorm(self, p) ** (1.quo(p))
   end
-end
 
-# Returns the marginal of rows
-def row_sum
-  (0...row_size).collect {|i|
-    row(i).sum
-  }
-end
-# Returns  the marginal of columns
-def column_sum
-  (0...column_size).collect {|i|
-    column(i).sum
-  }
-end
-# Calculate sum of cells
-def total_sum
-  row_sum.inject(&:+)
-end
+  def norm_frobenius
+    norm
+  end
+  alias :normF :norm_frobenius
 
-module LU
   #
-  #	Return the Gauss vector, MC, Golub, 3.2.1 Gauss Transformation, p94
+  # Tests if the matrix is empty or not
   #
-  def self.gauss_vector(mat, k)
-    t = mat.column2matrix(k)
-    tk = t[k, 0]
-    (0..k).each{|i| t[i, 0] = 0}
-    return t if tk == 0
-    (k+1...mat.row_size).each{|i| t[i, 0] = t[i, 0].to_f / tk}
-    t
+  def empty?
+    @rows.empty? if @rows
   end
 
   #
-  # Return the Gauss transformation matrix: M_k = I - tau * e_k^T
+  # Returns row(s) of matrix as a Matrix
   #
-  def self.gauss(mat, k)
-    i = Matrix.I(mat.column_size)
-    tau = gauss_vector(mat, k)
-    e = i.row2matrix(k)
-    i - tau * e
+
+  def row2matrix(r)
+    if r.is_a? Range
+      a=r.map {|v| v<row_size ? row(v).to_a : nil }.find_all {|v| !v.nil?}
+    else
+      a = row(r).to_a
+    end
+    if r.is_a?(Range) and r.entries.size > 1
+      return Matrix[*a]
+    else
+      return Matrix[a]
+    end
   end
 
   #
-  # LU factorization: A = LU
-  # where L is lower triangular and U is upper triangular
+  # Returns the column/s of matrix as a Matrix
   #
-  def self.factorization(mat)
-    u = mat.clone
-    n = u.column_size
-    i = Matrix.I(n)
-    l = i.clone
-    (n-1).times {|k|
-      mk = gauss(u, k)
-      u = mk * u	# M_{n-1} * ... * M_1 * A = U
-      l += i - mk	# L = M_1^{-1} * ... * M_{n-1}^{-1} = I + sum_{k=1}^{n-1} tau * e
+  def column2matrix(c)
+    if c.is_a?(Range)
+      a=c.map {|v| column(v).to_a}.find_all {|v| v.size>0}
+    else
+      a = column(c).to_a
+    end
+    if c.is_a?(Range)
+      return Matrix.columns(a)
+    else
+      return Matrix[*a.collect{|x| [x]}]
+    end
+  end
+
+  # Returns the marginal of rows
+  def row_sum
+    (0...row_size).collect {|i|
+      row(i).sum
     }
-    return l, u
   end
-end
+  # Returns  the marginal of columns
+  def column_sum
+    (0...column_size).collect {|i|
+      column(i).sum
+    }
+  end
+  # Calculate sum of cells
+  def total_sum
+    row_sum.inject(&:+)
+  end
 
-#
-# Return the upper triangular matrix of LU factorization
-# M_{n-1} * ... * M_1 * A = U
-#
-def U
-  LU.factorization(self)[1]
-end
+  module LU
+    #
+    #	Return the Gauss vector, MC, Golub, 3.2.1 Gauss Transformation, p94
+    #
+    def self.gauss_vector(mat, k)
+      t = mat.column2matrix(k)
+      tk = t[k, 0]
+      (0..k).each{|i| t[i, 0] = 0}
+      return t if tk == 0
+      (k+1...mat.row_size).each{|i| t[i, 0] = t[i, 0].to_f / tk}
+      t
+    end
 
-#
-# Return the lower triangular matrix of LU factorization
-# L = M_1^{-1} * ... * M_{n-1}^{-1} = I + sum_{k=1}^{n-1} tau * e
-#
-def L
-  LU.factorization(self)[0]
-end
+    #
+    # Return the Gauss transformation matrix: M_k = I - tau * e_k^T
+    def self.gauss(mat, k)
+      i = Matrix.I(mat.column_size)
+      tau = gauss_vector(mat, k)
+      e = i.row2matrix(k)
+      i - tau * e
+    end
+
+    #
+    # LU factorization: A = LU
+    # where L is lower triangular and U is upper triangular
+    def self.factorization(mat)
+      u = mat.clone
+      n = u.column_size
+      i = Matrix.I(n)
+      l = i.clone
+      (n-1).times {|k|
+        mk = gauss(u, k)
+        u = mk * u	# M_{n-1} * ... * M_1 * A = U
+        l += i - mk	# L = M_1^{-1} * ... * M_{n-1}^{-1} = I + sum_{k=1}^{n-1} tau * e
+      }
+      return l, u
+    end
+  end
+
+  #
+  # Return the upper triangular matrix of LU factorization
+  # M_{n-1} * ... * M_1 * A = U
+  def U
+    LU.factorization(self)[1]
+  end
+
+  #
+  # Return the lower triangular matrix of LU factorization
+  # L = M_1^{-1} * ... * M_{n-1}^{-1} = I + sum_{k=1}^{n-1} tau * e
+  def L
+    LU.factorization(self)[0]
+  end
 
   module Householder
     #
@@ -1083,8 +1058,12 @@ end
     #
     def self.J(p, q, c, s, n)
       j = Matrix.I(n)
-      j[p,p] = c; j[p, q] = s
-      j[q,p] = -s; j[q, q] = c
+
+      j[p,p] = c 
+      j[p,q] = s
+      j[q,p] = -s 
+      j[q,q] = c
+
       j
     end
   end
@@ -1133,5 +1112,3 @@ end
     cJacobi(tol)[1]
   end
 end
-
-

data/lib/version.rb

@@ -0,0 +1,3 @@
+class Matrix
+  EXTENSION_VERSION = "0.4"
+end

data/spec/extendmatrix_spec.rb

@@ -1,6 +1,6 @@
 $:.unshift(File.dirname(__FILE__)+"/../lib")
-require 'spec'
-require 'spec/autorun'
+require 'rspec'
+require 'rspec/core/rake_task'
 
 require 'extendmatrix'
 
@@ -90,6 +90,11 @@ describe "Vector class extension:" do
   it "sum method returns the sum of elements" do
     @v.sum.should==10
   end
+  
+  it "allows for multiple assignment" do
+    a, b, c, d = @v
+    [a, b, c, d].should == [1, 2, 3, 4]
+  end
 end
 
 describe "Matrix class extension:" do
@@ -287,10 +292,22 @@ describe "Matrix class extension:" do
     eigenvalues=[1.92,1.88,0.0,0.0]
     eigen=m.eigen
     eigen[:eigenvalues].each_with_index do |v,i|
-      v.should be_close(eigenvalues[i],0.01)
+      v.should be_within(0.01).of(eigenvalues[i])
     end
     eigenvectors=Matrix[[0.5, 0.5, 0.0, 0.707106781186547], [0.5, 0.5, 0.0, -0.707106781186547], [0.5, -0.5, 0.707106781186547, 0.0], [0.5, -0.5, -0.707106781186547, 0.0]]
-    Matrix.equal_in_delta?(eigen[:eigenvectors], eigenvectors).should be_true
+    expect(Matrix.equal_in_delta?(eigen[:eigenvectors], eigenvectors)).to be(true)
+  end
+  it "eigenpairs" do
+    m=Matrix[[0.95,0.95,0.01,0.01],[0.95,0.95,0.01,0.01],[0.01, 0.01,0.95,0.95], [0.01, 0.01, 0.95, 0.95]]
+    eigenpairs=[[1.92, Vector[0.5, 0.5, 0.5, 0.5]], [1.88, Vector[0.5, 0.5, -0.5, -0.5]], [0.0, Vector[0.0, 0.0, 0.707, -0.707]], [0.0, Vector[0.707, -0.707, 0.0, 0.0]]]
+    observed=m.eigenpairs
+    eigenpairs.each_with_index do |v,i|
+      observed[i][0].should be_within(0.001).of(v[0])
+      observed[i][1].each_with_index {|vv,ii|
+        vv.should be_within(0.001).of(v[1][ii])
+      }
+      
+    end
   end
   it "sqrt" do
     m=Matrix[[1,4,9],[16,25,36]]
@@ -418,6 +435,11 @@ describe "Matrix class extension:" do
     [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
+  
+  it "allows for multiple assignment" do
+    a, b = @m
+    [a, b].should == [[1, 2, 222], [2, 33, 4]]
+  end
 end
 

metadata

@@ -1,130 +1,103 @@
---- !ruby/object:Gem::Specification 
+--- !ruby/object:Gem::Specification
 name: extendmatrix
-version: !ruby/object:Gem::Version 
-  prerelease: false
-  segments: 
-  - 0
-  - 3
-  - 1
-  version: 0.3.1
+version: !ruby/object:Gem::Version
+  version: '0.4'
 platform: ruby
-authors: 
+authors:
 - Cosmin Bonchis
+- Claudio Bustos
+- Sameer Deshmukh
 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-08-16 00:00:00 -04:00
-default_executable: 
-dependencies: 
-- !ruby/object:Gem::Dependency 
-  name: rubyforge
+cert_chain: []
+date: 2015-05-23 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
   prerelease: false
-  requirement: &id001 !ruby/object:Gem::Requirement 
-    requirements: 
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
     - - ">="
-      - !ruby/object:Gem::Version 
-        segments: 
-        - 2
-        - 0
-        - 4
-        version: 2.0.4
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
   type: :development
-  version_requirements: *id001
-- !ruby/object:Gem::Dependency 
-  name: hoe
   prerelease: false
-  requirement: &id002 !ruby/object:Gem::Requirement 
-    requirements: 
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
     - - ">="
-      - !ruby/object:Gem::Version 
-        segments: 
-        - 2
-        - 6
-        - 1
-        version: 2.6.1
+      - !ruby/object:Gem::Version
+        version: '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.
-  
-  Original code from http://rubyforge.org/projects/matrix/ , done by Cosmin Bonchis as a Google Summer of Code 2007 project for Ruby Central Inc.
-  
-  Gem, github repository and current version manteined by Claudio Bustos.
-email: 
-- cbonchis_info.uvt.ro
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+description: "The project consists of some enhancements to the Ruby \"Matrix\" module
+  and \nincludes: LU and QR (Householder, Givens, Gram Schmidt, Hessenberg) \ndecompositions,
+  bidiagonalization, eigenvalue and eigenvector calculations.\n\nIncludes some aditional
+  code to obtains marginal for rows and columns.\n"
+email:
+- sameer.deshmukh93@gmail.com
 executables: []
-
 extensions: []
-
-extra_rdoc_files: 
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".rspec"
 - History.txt
 - LICENSE.txt
-- Manifest.txt
-- ORIGINAL_README.txt
-- README.txt
-files: 
-- History.txt
-- LICENSE.txt
-- Manifest.txt
-- ORIGINAL_README.txt
-- README.txt
+- README.md
 - Rakefile
+- extendmatrix.gemspec
 - lib/extendmatrix.rb
+- lib/version.rb
 - spec/extendmatrix_spec.rb
-- spec/spec.opts
-has_rdoc: true
-homepage: http://github.com/clbustos/extendmatrix
-licenses: []
-
+homepage: http://github.com/SciRuby/extendmatrix
+licenses:
+- Apache v2
+metadata: {}
 post_install_message: 
-rdoc_options: 
-- --main
-- README.txt
-require_paths: 
+rdoc_options: []
+require_paths:
 - lib
-required_ruby_version: !ruby/object:Gem::Requirement 
-  requirements: 
+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
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
   - - ">="
-    - !ruby/object:Gem::Version 
-      segments: 
-      - 0
-      version: "0"
+    - !ruby/object:Gem::Version
+      version: '0'
 requirements: []
-
-rubyforge_project: ruby-statsample
-rubygems_version: 1.3.6
+rubyforge_project: 
+rubygems_version: 2.4.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: []
-
+specification_version: 4
+summary: Enhancements to ruby "Matrix" and "Vector" modules
+test_files:
+- spec/extendmatrix_spec.rb
+has_rdoc: 

data/Manifest.txt

@@ -1,9 +0,0 @@
-History.txt
-LICENSE.txt
-Manifest.txt
-ORIGINAL_README.txt
-README.txt
-Rakefile
-lib/extendmatrix.rb
-spec/extendmatrix_spec.rb
-spec/spec.opts

data/ORIGINAL_README.txt

@@ -1,22 +0,0 @@
-Extensions to the Ruby Matrix module
-====================================
-
-This README is a small description of the work done by Cosmin Bonchis as a 
-Google Summer of Code 2007 project for Ruby Central Inc.
-
-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.            
-
-This archive contains in extendmatrix.rb file the source code of the project, an implementation of mapcar used in extending matrix, and all the tests files in the "tests" directory.  
-
-The code can also 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).
-
-svn checkout svn://rubyforge.org/var/svn/matrix
-svn checkout http://matrix.rubyforge.org/svn/trunk/
-
-
-Relevant URLs:
-==============
-
-Project sources:
-http://matrix.rubyforge.org/svn/trunk/
-

data/spec/spec.opts

@@ -1 +0,0 @@
---color