LU decomposition: Difference between revisions
m
→{{header|Sidef}}: updated code
No edit summary |
m (→{{header|Sidef}}: updated code) |
||
Line 5,582:
<syntaxhighlight lang="ruby">func is_square(m) { m.all { .len == m.len } }
func matrix_zero(n, m=n) { m.of { n.of(0) } }
func matrix_ident(n) { n.of {|i|
func pivotize(m) {
var size = m.len
var id = matrix_ident(size)
for i in (^size) {
var max = m[i][i]
var row = i
for j in (i ..^ size
if (m[j][i] > max) {
max = m[j][i]
Line 5,596:
}
}
if (row
id.swap(row, i)
}
Line 5,602:
return id
}
func mmult(a, b) {
var p = []
for r
}
return p
}
func lu(a) {
is_square(a) || die "Defined only for square matrices!";
Line 5,620 ⟶ 5,618:
var L = matrix_ident(n)
var U = matrix_zero(n)
for i
if (j >= i) {
U[i][j] = (Aʼ[i][j] - sum(^i, { U[_][j] * L[i][_] }
} else {
L[i][j] = ((Aʼ[i][j] - sum(^j, { U[_][j] * L[i][_] }
}
}
return [P, Aʼ, L, U]
}
func say_it(message, array) {
say "\n#{message}"
Line 5,636 ⟶ 5,634:
}
}
var t = [[
%n(1 3 5),
Line 5,647 ⟶ 5,645:
%n( 2 5 7 1),
]]
t.each { |test|
say_it('A Matrix', test)
for a,b in (['P Matrix', 'Aʼ Matrix', 'L Matrix', 'U Matrix'] ~Z lu(test)) {
say_it(a, b)
}
| |||