-
Notifications
You must be signed in to change notification settings - Fork 16
/
tc_solve.rb
63 lines (52 loc) · 1.46 KB
/
tc_solve.rb
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
#
# Copyright (c) 2004-2008 by James M. Lawrence
#
# See LICENSE
#
require 'linalg-test'
class TestSolve < Test::Unit::TestCase
def test_solve
$count.times {
a = DMatrix.rand(n = 1 + rand($dim), n)
b = DMatrix.rand(a.vsize, 1 + rand($dim))
begin
x = DMatrix.solve(a, b)
assert_close(a*x, b)
rescue SingularMatrix
assert_block { true }
end
}
end
def test_solve_bang
$count.times {
a0 = DMatrix.rand(n = 1 + rand($dim), n)
b0 = DMatrix.rand(a0.vsize, 1 + rand($dim))
a = a0.clone
b = b0.clone
begin
x = Linalg::DMatrix.solve!(a, b)
assert(b == x)
assert(b.object_id == x.object_id)
assert_close(a0*x, b0)
rescue SingularMatrix
assert_block { true }
end
}
end
def test_singular
a = DMatrix[[1,1],[2,2]]
b = DMatrix.columns [[3,3]]
assert_raises(SingularMatrix) { DMatrix.solve(a,b) }
($count/2).times {
a = DMatrix.rand(n = 2 + rand($dim), n)
b = DMatrix.rand(a.vsize, 1 + rand($dim))
# introduce a singularity: two rows the same
r0 = rand(a.vsize)
while (r1 = rand(a.vsize)) == r0 ; end
a.map_with_index! { |e, i, j|
(i == r0 || i == r1) ? 1.0 : e
}
assert_raises(SingularMatrix) { DMatrix.solve(a,b) }
}
end
end