mirror of
https://github.com/gonum/gonum.git
synced 2025-10-31 10:36:30 +08:00
82 lines
2.3 KiB
Go
82 lines
2.3 KiB
Go
// Copyright ©2015 The gonum Authors. All rights reserved.
|
||
// Use of this source code is governed by a BSD-style
|
||
// license that can be found in the LICENSE file.
|
||
|
||
package native
|
||
|
||
import "github.com/gonum/blas"
|
||
|
||
// Dorml2 multiplies a general matrix C by an orthogonal matrix from an LQ factorization
|
||
// determined by Dgelqf.
|
||
// C = Q * C if side == blas.Left and trans == blas.NoTrans
|
||
// C = Q^T * C if side == blas.Left and trans == blas.Trans
|
||
// C = C * Q if side == blas.Right and trans == blas.NoTrans
|
||
// C = C * Q^T if side == blas.Right and trans == blas.Trans
|
||
// If side == blas.Left, a is a matrix of side k×m, and if side == blas.Right
|
||
// a is of size k×n.
|
||
//
|
||
// Tau contains the Householder factors and is of length at least k and this function will
|
||
// panic otherwise.
|
||
//
|
||
// Work is temporary storage of length at least n if side == blas.Left
|
||
// and at least m if side == blas.Right and this function will panic otherwise.
|
||
func (impl Implementation) Dorml2(side blas.Side, trans blas.Transpose, m, n, k int, a []float64, lda int, tau, c []float64, ldc int, work []float64) {
|
||
if side != blas.Left && side != blas.Right {
|
||
panic(badSide)
|
||
}
|
||
if trans != blas.Trans && trans != blas.NoTrans {
|
||
panic(badTrans)
|
||
}
|
||
|
||
left := side == blas.Left
|
||
notran := trans == blas.NoTrans
|
||
if left {
|
||
checkMatrix(k, m, a, lda)
|
||
if len(work) < n {
|
||
panic(badWork)
|
||
}
|
||
} else {
|
||
checkMatrix(k, n, a, lda)
|
||
if len(work) < m {
|
||
panic(badWork)
|
||
}
|
||
}
|
||
checkMatrix(m, n, c, ldc)
|
||
if m == 0 || n == 0 || k == 0 {
|
||
return
|
||
}
|
||
switch {
|
||
case left && notran:
|
||
for i := 0; i < k; i++ {
|
||
aii := a[i*lda+i]
|
||
a[i*lda+i] = 1
|
||
impl.Dlarf(side, m-i, n, a[i*lda+i:], 1, tau[i], c[i*ldc:], ldc, work)
|
||
a[i*lda+i] = aii
|
||
}
|
||
|
||
case left && !notran:
|
||
for i := k - 1; i >= 0; i-- {
|
||
aii := a[i*lda+i]
|
||
a[i*lda+i] = 1
|
||
impl.Dlarf(side, m-i, n, a[i*lda+i:], 1, tau[i], c[i*ldc:], ldc, work)
|
||
a[i*lda+i] = aii
|
||
}
|
||
|
||
case !left && notran:
|
||
for i := k - 1; i >= 0; i-- {
|
||
aii := a[i*lda+i]
|
||
a[i*lda+i] = 1
|
||
impl.Dlarf(side, m, n-i, a[i*lda+i:], 1, tau[i], c[i:], ldc, work)
|
||
a[i*lda+i] = aii
|
||
}
|
||
|
||
case !left && !notran:
|
||
for i := 0; i < k; i++ {
|
||
aii := a[i*lda+i]
|
||
a[i*lda+i] = 1
|
||
impl.Dlarf(side, m, n-i, a[i*lda+i:], 1, tau[i], c[i:], ldc, work)
|
||
a[i*lda+i] = aii
|
||
}
|
||
}
|
||
}
|