Skip to content
This repository has been archived by the owner on Dec 10, 2018. It is now read-only.

Commit

Permalink
Use Dtrsm
Browse files Browse the repository at this point in the history
  • Loading branch information
kortschak committed Mar 21, 2015
1 parent 13bd105 commit e1bc584
Showing 1 changed file with 9 additions and 40 deletions.
49 changes: 9 additions & 40 deletions mat64/cholesky.go
Expand Up @@ -100,46 +100,15 @@ func (m *Dense) SolveTri(t *Triangular, b Matrix) error {
m.Copy(b)
}

if t.mat.Uplo == blas.Upper {
// Solve U'*Y = B;
for k := 0; k < n; k++ {
for j := 0; j < bn; j++ {
for i := 0; i < k; i++ {
m.set(k, j, m.at(k, j)-m.at(i, j)*t.at(i, k))
}
m.set(k, j, m.at(k, j)/t.at(k, k))
}
}

// Solve U*X = Y;
for k := n - 1; k >= 0; k-- {
for j := 0; j < bn; j++ {
for i := k + 1; i < n; i++ {
m.set(k, j, m.at(k, j)-m.at(i, j)*t.at(k, i))
}
m.set(k, j, m.at(k, j)/t.at(k, k))
}
}
} else {
// Solve L*Y = B;
for k := 0; k < n; k++ {
for j := 0; j < bn; j++ {
for i := 0; i < k; i++ {
m.set(k, j, m.at(k, j)-m.at(i, j)*t.at(k, i))
}
m.set(k, j, m.at(k, j)/t.at(k, k))
}
}

// Solve L'*X = Y;
for k := n - 1; k >= 0; k-- {
for j := 0; j < bn; j++ {
for i := k + 1; i < n; i++ {
m.set(k, j, m.at(k, j)-m.at(i, j)*t.at(i, k))
}
m.set(k, j, m.at(k, j)/t.at(k, k))
}
}
switch t.mat.Uplo {
case blas.Upper:
blas64.Trsm(blas.Left, blas.Trans, 1, t.mat, m.mat)
blas64.Trsm(blas.Left, blas.NoTrans, 1, t.mat, m.mat)
case blas.Lower:
blas64.Trsm(blas.Left, blas.NoTrans, 1, t.mat, m.mat)
blas64.Trsm(blas.Left, blas.Trans, 1, t.mat, m.mat)
default:
panic(ErrUplo)
}

return nil
Expand Down

0 comments on commit e1bc584

Please sign in to comment.