mdarray 0.5.3-java → 0.5.4-java

data/test/colt/test_complete.rb

@@ -19,8 +19,7 @@
 # OR MODIFICATIONS.
 ##########################################################################################
 
-#=begin
 require_relative 'test_statistics'
 require_relative 'test_stat_list'
 require_relative 'test_math'
-#=end
+require_relative 'test_matrix'

data/test/colt/test_double_matrix2d.rb

@@ -0,0 +1,186 @@
+# -*- coding: utf-8 -*-
+
+##########################################################################################
+# Copyright © 2013 Rodrigo Botafogo. All Rights Reserved. Permission to use, copy, modify, 
+# and distribute this software and its documentation, without fee and without a signed 
+# licensing agreement, is hereby granted, provided that the above copyright notice, this 
+# paragraph and the following two paragraphs appear in all copies, modifications, and 
+# distributions.
+#
+# IN NO EVENT SHALL RODRIGO BOTAFOGO BE LIABLE TO ANY PARTY FOR DIRECT, INDIRECT, SPECIAL, 
+# INCIDENTAL, OR CONSEQUENTIAL DAMAGES, INCLUDING LOST PROFITS, ARISING OUT OF THE USE OF 
+# THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF RODRIGO BOTAFOGO HAS BEEN ADVISED OF THE 
+# POSSIBILITY OF SUCH DAMAGE.
+#
+# RODRIGO BOTAFOGO SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING, BUT NOT LIMITED TO, 
+# THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE 
+# SOFTWARE AND ACCOMPANYING DOCUMENTATION, IF ANY, PROVIDED HEREUNDER IS PROVIDED "AS IS". 
+# RODRIGO BOTAFOGO HAS NO OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, 
+# OR MODIFICATIONS.
+##########################################################################################
+
+require 'rubygems'
+require "test/unit"
+require 'shoulda'
+
+require 'mdarray'
+
+class MDArrayTest < Test::Unit::TestCase
+
+  context "Colt Matrix" do
+
+    setup do
+
+   
+    end
+
+    #-------------------------------------------------------------------------------------
+    #
+    #-------------------------------------------------------------------------------------
+
+    should "test matrix functions" do
+
+      b = MDMatrix.double([3], [1.5, 1, 1.3])
+
+      pos = MDArray.double([3, 3], [2, -1, 0, -1, 2, -1, 0, -1, 2])
+      matrix = MDMatrix.from_mdarray(pos)
+      result = matrix.chol
+      p "Cholesky decomposition"
+      result.print
+      printf("\n\n")
+
+      eig = matrix.eig
+      p "eigen decomposition"
+      p "eigenvalue matrix"
+      eig[0].print
+      printf("\n\n")
+      p "imaginary parts of the eigenvalues"
+      eig[1].print
+      printf("\n\n")
+      p "real parts of the eigenvalues"
+      eig[2].print
+      printf("\n\n")
+      p "eigenvector matrix"
+      eig[3].print
+      printf("\n\n")
+
+      lu = matrix.lu
+      p "lu decomposition"
+      p "is non singular: #{lu[0]}"
+      p "determinant: #{lu[1]}"
+      p "pivot vector: #{lu[2]}"
+      p "lower triangular matrix"
+      lu[3].print
+      printf("\n\n")
+      p "upper triangular matrix"
+      lu[4].print
+      printf("\n\n")
+
+      # Returns the condition of matrix A, which is the ratio of largest to 
+      # smallest singular value.
+      p "condition of matrix"
+      p matrix.cond
+
+      # Solves the upper triangular system U*x=b;
+      p "solving the equation by backward_solve"
+      solve = lu[4].backward_solve(b)
+      solve.print
+      printf("\n\n")
+
+      # Solves the lower triangular system U*x=b;
+      p "solving the equation by forward_solve"
+      solve = lu[3].forward_solve(b)
+      solve.print
+      printf("\n\n")
+
+      qr = matrix.qr
+      p "QR decomposition"
+      p "Matrix has full rank: #{qr[0]}"
+      p "Orthogonal factor Q:"
+      qr[1].print
+      printf("\n\n")
+      p "Upper triangular factor, R"
+      qr[2].print
+      printf("\n\n")
+
+      svd = matrix.svd
+      p "Singular value decomposition"
+      p "operation success? #{svd[0]}" # 0 success; < 0 ith value is illegal; > 0 not converge
+      p "cond: #{svd[1]}"
+      p "norm2: #{svd[2]}"
+      p "rank: #{svd[3]}"
+      p "singular values"
+      p svd[4]
+      p "Diagonal matrix of singular values"
+      # svd[5].print
+      printf("\n\n")
+      p "left singular vectors U"
+      svd[6].print
+      printf("\n\n")
+      p "right singular vectors V"
+      svd[7].print
+      printf("\n\n")
+
+      m = MDArray.typed_arange("double", 0, 16)
+      m.reshape!([4, 4])
+      matrix1 = MDMatrix.from_mdarray(m)
+      # mat2 = matrix.chol
+      matrix1.print
+      printf("\n\n")
+
+      m = MDArray.typed_arange("double", 16, 32)
+      m.reshape!([4, 4])
+      matrix2 = MDMatrix.from_mdarray(m)
+      matrix2.print
+      printf("\n\n")
+      
+      result = matrix1 * matrix2
+      p "matrix multiplication"
+      result.print 
+      printf("\n\n")
+
+      result = matrix1.kron(matrix2)
+      p "Kronecker multiplication"
+      result.print
+      printf("\n\n")
+
+      print "determinant is: #{result.det}"
+      printf("\n\n")
+
+      p "norm1"
+      p result.norm1
+
+      p "norm2"
+      p result.norm2
+
+      p "Returns the Frobenius norm of matrix A, which is Sqrt(Sum(A[i,j]^2))"
+      p result.normF
+
+      p "Returns the infinity norm of matrix A, which is the maximum absolute row sum."
+      p result.norm_infinity
+
+      power3 = result ** 3
+      power3.print 
+      printf("\n\n")
+
+      p result.trace
+
+      trap_lower = result.trapezoidal_lower
+      trap_lower.print
+      printf("\n\n")
+
+      p result.vector_norm2
+
+      result.normalize!
+      result.print
+      printf("\n\n")
+
+      p "summing all values of result: #{result.sum}"
+
+      result.mdarray.print
+
+    end
+#=end
+  end
+
+end

data/test/colt/test_float_matrix2d.rb

@@ -0,0 +1,171 @@
+# -*- coding: utf-8 -*-
+
+##########################################################################################
+# Copyright © 2013 Rodrigo Botafogo. All Rights Reserved. Permission to use, copy, modify, 
+# and distribute this software and its documentation, without fee and without a signed 
+# licensing agreement, is hereby granted, provided that the above copyright notice, this 
+# paragraph and the following two paragraphs appear in all copies, modifications, and 
+# distributions.
+#
+# IN NO EVENT SHALL RODRIGO BOTAFOGO BE LIABLE TO ANY PARTY FOR DIRECT, INDIRECT, SPECIAL, 
+# INCIDENTAL, OR CONSEQUENTIAL DAMAGES, INCLUDING LOST PROFITS, ARISING OUT OF THE USE OF 
+# THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF RODRIGO BOTAFOGO HAS BEEN ADVISED OF THE 
+# POSSIBILITY OF SUCH DAMAGE.
+#
+# RODRIGO BOTAFOGO SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING, BUT NOT LIMITED TO, 
+# THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE 
+# SOFTWARE AND ACCOMPANYING DOCUMENTATION, IF ANY, PROVIDED HEREUNDER IS PROVIDED "AS IS". 
+# RODRIGO BOTAFOGO HAS NO OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, 
+# OR MODIFICATIONS.
+##########################################################################################
+
+require 'rubygems'
+require "test/unit"
+require 'shoulda'
+
+require 'mdarray'
+
+class MDArrayTest < Test::Unit::TestCase
+
+  context "Colt Matrix" do
+
+    setup do
+
+   
+    end
+
+    #-------------------------------------------------------------------------------------
+    #
+    #-------------------------------------------------------------------------------------
+
+    should "test matrix functions" do
+
+      b = MDMatrix.float([3], [1.5, 1, 1.3])
+
+      pos = MDArray.float([3, 3], [2, -1, 0, -1, 2, -1, 0, -1, 2])
+      matrix = MDMatrix.from_mdarray(pos)
+      result = matrix.chol
+      p "Cholesky decomposition"
+      result.print
+      printf("\n\n")
+
+      eig = matrix.eig
+      p "eigen decomposition"
+      p "eigenvalue matrix"
+      eig[0].print
+      printf("\n\n")
+      p "imaginary parts of the eigenvalues"
+      eig[1].print
+      printf("\n\n")
+      p "real parts of the eigenvalues"
+      eig[2].print
+      printf("\n\n")
+      p "eigenvector matrix"
+      eig[3].print
+      printf("\n\n")
+
+      lu = matrix.lu
+      p "lu decomposition"
+      p "is non singular: #{lu[0]}"
+      p "determinant: #{lu[1]}"
+      p "pivot vector: #{lu[2]}"
+      p "lower triangular matrix"
+      lu[3].print
+      printf("\n\n")
+      p "upper triangular matrix"
+      lu[4].print
+      printf("\n\n")
+
+      # Returns the condition of matrix A, which is the ratio of largest to 
+      # smallest singular value.
+      p "condition of matrix"
+      p matrix.cond
+
+      # Solves the upper triangular system U*x=b;
+      p "solving the equation by backward_solve"
+      solve = lu[4].backward_solve(b)
+      solve.print
+      printf("\n\n")
+
+      # Solves the lower triangular system U*x=b;
+      p "solving the equation by forward_solve"
+      solve = lu[3].forward_solve(b)
+      solve.print
+      printf("\n\n")
+
+      qr = matrix.qr
+      p "QR decomposition"
+      p "Matrix has full rank: #{qr[0]}"
+      p "Householder vectors"
+      qr[1].print
+      printf("\n\n")
+      p "Orthogonal factor Q:"
+      qr[2].print
+      printf("\n\n")
+      p "Upper triangular factor, R"
+      qr[3].print
+      printf("\n\n")
+
+      m = MDArray.typed_arange("float", 0, 16)
+      m.reshape!([4, 4])
+      matrix1 = MDMatrix.from_mdarray(m)
+      # mat2 = matrix.chol
+      matrix1.print
+      printf("\n\n")
+
+      m = MDArray.typed_arange("float", 16, 32)
+      m.reshape!([4, 4])
+      matrix2 = MDMatrix.from_mdarray(m)
+      matrix2.print
+      printf("\n\n")
+      
+      result = matrix1 * matrix2
+      p "matrix multiplication"
+      result.print 
+      printf("\n\n")
+
+      result = matrix1.kron(matrix2)
+      p "Kronecker multiplication"
+      result.print
+      printf("\n\n")
+
+      print "determinant is: #{result.det}"
+      printf("\n\n")
+
+      p "norm1"
+      p result.norm1
+
+      p "norm2"
+      p result.norm2
+
+      p "Returns the Frobenius norm of matrix A, which is Sqrt(Sum(A[i,j]^2))"
+      p result.normF
+
+      p "Returns the infinity norm of matrix A, which is the maximum absolute row sum."
+      p result.norm_infinity
+
+      power3 = result ** 3
+      power3.print 
+      printf("\n\n")
+
+      p result.trace
+
+      trap_lower = result.trapezoidal_lower
+      trap_lower.print
+      printf("\n\n")
+
+      p result.vector_norm2
+
+      result.normalize!
+      result.print
+      printf("\n\n")
+
+      p "summing all values of result: #{result.sum}"
+
+      result.mdarray.print
+
+    end
+#=end
+  end
+
+end

data/test/colt/test_math.rb

@@ -1,3 +1,24 @@
+# -*- coding: utf-8 -*-
+
+##########################################################################################
+# Copyright © 2013 Rodrigo Botafogo. All Rights Reserved. Permission to use, copy, modify, 
+# and distribute this software and its documentation, without fee and without a signed 
+# licensing agreement, is hereby granted, provided that the above copyright notice, this 
+# paragraph and the following two paragraphs appear in all copies, modifications, and 
+# distributions.
+#
+# IN NO EVENT SHALL RODRIGO BOTAFOGO BE LIABLE TO ANY PARTY FOR DIRECT, INDIRECT, SPECIAL, 
+# INCIDENTAL, OR CONSEQUENTIAL DAMAGES, INCLUDING LOST PROFITS, ARISING OUT OF THE USE OF 
+# THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF RODRIGO BOTAFOGO HAS BEEN ADVISED OF THE 
+# POSSIBILITY OF SUCH DAMAGE.
+#
+# RODRIGO BOTAFOGO SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING, BUT NOT LIMITED TO, 
+# THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE 
+# SOFTWARE AND ACCOMPANYING DOCUMENTATION, IF ANY, PROVIDED HEREUNDER IS PROVIDED "AS IS". 
+# RODRIGO BOTAFOGO HAS NO OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, 
+# OR MODIFICATIONS.
+##########################################################################################
+
 require 'rubygems'
 require "test/unit"
 require 'shoulda'

data/test/colt/test_matrix.rb

@@ -0,0 +1,172 @@
+# -*- coding: utf-8 -*-
+
+##########################################################################################
+# Copyright © 2013 Rodrigo Botafogo. All Rights Reserved. Permission to use, copy, modify, 
+# and distribute this software and its documentation, without fee and without a signed 
+# licensing agreement, is hereby granted, provided that the above copyright notice, this 
+# paragraph and the following two paragraphs appear in all copies, modifications, and 
+# distributions.
+#
+# IN NO EVENT SHALL RODRIGO BOTAFOGO BE LIABLE TO ANY PARTY FOR DIRECT, INDIRECT, SPECIAL, 
+# INCIDENTAL, OR CONSEQUENTIAL DAMAGES, INCLUDING LOST PROFITS, ARISING OUT OF THE USE OF 
+# THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF RODRIGO BOTAFOGO HAS BEEN ADVISED OF THE 
+# POSSIBILITY OF SUCH DAMAGE.
+#
+# RODRIGO BOTAFOGO SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING, BUT NOT LIMITED TO, 
+# THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE 
+# SOFTWARE AND ACCOMPANYING DOCUMENTATION, IF ANY, PROVIDED HEREUNDER IS PROVIDED "AS IS". 
+# RODRIGO BOTAFOGO HAS NO OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, 
+# OR MODIFICATIONS.
+##########################################################################################
+
+require 'rubygems'
+require "test/unit"
+require 'shoulda'
+
+require 'mdarray'
+
+class MDArrayTest < Test::Unit::TestCase
+
+  context "Colt Matrix" do
+
+    setup do
+
+    end
+
+    #-------------------------------------------------------------------------------------
+    #
+    #-------------------------------------------------------------------------------------
+
+    should "create 1D matrices" do
+
+      d1 = MDArray.double([5, 3, 6, 7])
+      assert_raise (RuntimeError) { matrix = MDMatrix.from_mdarray(d1) }
+
+      d2 = MDArray.typed_arange("double", 0, 15)
+      double_matrix = MDMatrix.from_mdarray(d2)
+      double_matrix.print
+      printf("\n\n")
+
+      f1 = MDArray.typed_arange("float", 0, 15)
+      float_matrix = MDMatrix.from_mdarray(f1)
+      float_matrix.print
+      printf("\n\n")
+
+      l1 = MDArray.typed_arange("long", 0, 15)
+      long_matrix = MDMatrix.from_mdarray(l1)
+      long_matrix.print
+      printf("\n\n")
+
+      i1 = MDArray.typed_arange("int", 0, 15)
+      int_matrix = MDMatrix.from_mdarray(i1)
+      int_matrix.print
+      printf("\n\n")
+
+    end
+
+    #-------------------------------------------------------------------------------------
+    #
+    #-------------------------------------------------------------------------------------
+
+    should "create 3D matrices" do
+
+      d1 = MDArray.double([5, 3, 6, 7])
+      assert_raise (RuntimeError) { matrix = MDMatrix.from_mdarray(d1) }
+
+      d2 = MDArray.typed_arange("double", 0, 60)
+      d2.reshape!([5, 3, 4])
+      double_matrix = MDMatrix.from_mdarray(d2)
+      double_matrix.print
+      printf("\n\n")
+
+      f1 = MDArray.typed_arange("float", 0, 60)
+      f1.reshape!([5, 3, 4])
+      float_matrix = MDMatrix.from_mdarray(f1)
+      float_matrix.print
+      printf("\n\n")
+
+      l1 = MDArray.typed_arange("long", 0, 60)
+      l1.reshape!([5, 3, 4])
+      long_matrix = MDMatrix.from_mdarray(l1)
+      long_matrix.print
+      printf("\n\n")
+
+      i1 = MDArray.typed_arange("int", 0, 60)
+      i1.reshape!([5, 3, 4])
+      int_matrix = MDMatrix.from_mdarray(i1)
+      int_matrix.print
+      printf("\n\n")
+
+    end
+
+    #-------------------------------------------------------------------------------------
+    #
+    #-------------------------------------------------------------------------------------
+#=begin
+    should "create 2D matrices" do
+
+      d1 = MDArray.double([5, 3, 6, 7])
+      assert_raise (RuntimeError) { matrix = MDMatrix.from_mdarray(d1) }
+
+      d2 = MDArray.typed_arange("double", 0, 15)
+      d2.reshape!([5, 3])
+      double_matrix = MDMatrix.from_mdarray(d2)
+      double_matrix.print
+      printf("\n\n")
+
+      f1 = MDArray.typed_arange("float", 0, 15)
+      f1.reshape!([5, 3])
+      float_matrix = MDMatrix.from_mdarray(f1)
+      float_matrix.print
+      printf("\n\n")
+
+      l1 = MDArray.typed_arange("long", 0, 15)
+      l1.reshape!([5, 3])
+      long_matrix = MDMatrix.from_mdarray(l1)
+      long_matrix.print
+      printf("\n\n")
+
+      i1 = MDArray.typed_arange("int", 0, 15)
+      i1.reshape!([5, 3])
+      int_matrix = MDMatrix.from_mdarray(i1)
+      int_matrix.print
+      printf("\n\n")
+
+    end
+
+    #-------------------------------------------------------------------------------------
+    #
+    #-------------------------------------------------------------------------------------
+
+    should "create matrices from sliced MDArray" do
+
+      d1 = MDArray.typed_arange("double", 0, 90)
+      d1.reshape!([5, 3, 6])
+
+      d1.print
+      d2 = d1.slice(0, 0)
+      d2.print
+      matrix = MDMatrix.from_mdarray(d2)
+      matrix.print
+      p " "
+
+      d2 = d1.slice(0, 1)
+      d2.print
+      matrix = MDMatrix.from_mdarray(d2)
+      matrix.print
+      p " "
+
+      d2 = d1.slice(1, 1)
+      d2.print
+      matrix = MDMatrix.from_mdarray(d2)
+      matrix.print
+      p " "
+
+    end
+
+  end
+
+end
+
+require_relative 'test_double_matrix2d'
+# require_relative 'test_float_matrix2d'