Class: Matrix

Inherits:
Object
  • Object
show all
Defined in:
lib/classifier/extensions/vector.rb

Class Method Summary collapse

Instance Method Summary collapse

Class Method Details

.diag(s) ⇒ Object



39
40
41
# File 'lib/classifier/extensions/vector.rb', line 39

def Matrix.diag(s)
   Matrix.diagonal(*s)
end

Instance Method Details

#[]=(i, j, val) ⇒ Object



106
107
108
# File 'lib/classifier/extensions/vector.rb', line 106

def []=(i,j,val)
  @rows[i][j] = val
end

#SV_decomp(maxSweeps = 20) ⇒ Object



45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
# File 'lib/classifier/extensions/vector.rb', line 45

def SV_decomp(maxSweeps = 20)
  if self.row_size >= self.column_size
    q = self.trans * self
  else
    q = self * self.trans
  end
  
  qrot    = q.dup
  v       = Matrix.identity(q.row_size)
  azrot   = nil
  mzrot   = nil
  cnt     = 0
  s_old   = nil
  mu      = nil

  while true do
    cnt += 1
    for row in (0...qrot.row_size-1) do
      for col in (1..qrot.row_size-1) do
        next if row == col
        h = Math.atan((2 * qrot[row,col])/(qrot[row,row]-qrot[col,col]))/2.0
        hcos = Math.cos(h)
        hsin = Math.sin(h)
        mzrot = Matrix.identity(qrot.row_size)
        mzrot[row,row] = hcos
        mzrot[row,col] = -hsin
        mzrot[col,row] = hsin
        mzrot[col,col] = hcos
        qrot = mzrot.trans * qrot * mzrot
        v = v * mzrot
      end 
    end
    s_old = qrot.dup if cnt == 1
    sum_qrot = 0.0 
    if cnt > 1
      qrot.row_size.times do |r|
        sum_qrot += (qrot[r,r]-s_old[r,r]).abs if (qrot[r,r]-s_old[r,r]).abs > 0.001
      end
      s_old = qrot.dup
    end 
    break if (sum_qrot <= 0.001 and cnt > 1) or cnt >= maxSweeps
  end # of do while true
  s = []
  qrot.row_size.times do |r|
    s << Math.sqrt(qrot[r,r])
  end
  #puts "cnt = #{cnt}"
  if self.row_size >= self.column_size
    mu = self *  v * Matrix.diagonal(*s).inverse     
    return [mu, v, s]
  else
    puts v.row_size
    puts v.column_size
    puts self.row_size
    puts self.column_size
    puts s.size

    mu = (self.trans * v *  Matrix.diagonal(*s).inverse)
    return [mu, v, s]
  end
end