mirror of
https://github.com/gonum/gonum.git
synced 2025-10-04 23:02:42 +08:00
147 lines
3.8 KiB
Go
147 lines
3.8 KiB
Go
// Copyright ©2020 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 testlapack
|
|
|
|
import (
|
|
"fmt"
|
|
"math"
|
|
"testing"
|
|
|
|
"golang.org/x/exp/rand"
|
|
|
|
"gonum.org/v1/gonum/blas"
|
|
"gonum.org/v1/gonum/blas/blas64"
|
|
"gonum.org/v1/gonum/floats"
|
|
"gonum.org/v1/gonum/lapack"
|
|
)
|
|
|
|
type Dtbtrser interface {
|
|
Dtbtrs(uplo blas.Uplo, trans blas.Transpose, diag blas.Diag, n, kd, nrhs int, a []float64, lda int, b []float64, ldb int) bool
|
|
}
|
|
|
|
func DtbtrsTest(t *testing.T, impl Dtbtrser) {
|
|
rnd := rand.New(rand.NewSource(1))
|
|
|
|
for _, trans := range []blas.Transpose{blas.NoTrans, blas.Trans, blas.ConjTrans} {
|
|
name := transToString(trans)
|
|
t.Run(name, func(t *testing.T) {
|
|
for _, uplo := range []blas.Uplo{blas.Upper, blas.Lower} {
|
|
for _, diag := range []blas.Diag{blas.Unit, blas.NonUnit} {
|
|
for _, n := range []int{0, 1, 2, 3, 4, 5, 10, 23} {
|
|
for _, kd := range []int{0, 1, 2, n / 2, max(0, n-1), n, n + 5} {
|
|
for _, nrhs := range []int{0, 1, 2, 3, 4, 5} {
|
|
for _, lda := range []int{kd + 1, kd + 3} {
|
|
for _, ldb := range []int{max(1, nrhs), nrhs + 3} {
|
|
if diag == blas.Unit {
|
|
dtbtrsTest(t, impl, rnd, uplo, trans, diag, n, kd, nrhs, lda, ldb, false)
|
|
} else {
|
|
dtbtrsTest(t, impl, rnd, uplo, trans, diag, n, kd, nrhs, lda, ldb, true)
|
|
dtbtrsTest(t, impl, rnd, uplo, trans, diag, n, kd, nrhs, lda, ldb, false)
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
})
|
|
}
|
|
}
|
|
|
|
func dtbtrsTest(t *testing.T, impl Dtbtrser, rnd *rand.Rand, uplo blas.Uplo, trans blas.Transpose, diag blas.Diag, n, kd, nrhs int, lda, ldb int, singular bool) {
|
|
if singular && diag == blas.Unit {
|
|
panic("blas.Unit triangular matrix cannot be singular")
|
|
}
|
|
|
|
const tol = 1e-14
|
|
|
|
if n == 0 {
|
|
singular = false
|
|
}
|
|
name := fmt.Sprintf("uplo=%v,diag=%v,n=%v,kd=%v,nrhs=%v,lda=%v,ldb=%v,sing=%v", string(uplo), string(diag), n, kd, nrhs, lda, ldb, singular)
|
|
|
|
// Generate a random triangular matrix A. One of its triangles won't be
|
|
// referenced.
|
|
a := make([]float64, n*lda)
|
|
for i := range a {
|
|
a[i] = rnd.NormFloat64()
|
|
}
|
|
if singular {
|
|
i := rnd.Intn(n)
|
|
if uplo == blas.Upper {
|
|
a[i*lda] = 0
|
|
} else {
|
|
a[i*lda+kd] = 0
|
|
}
|
|
}
|
|
aCopy := make([]float64, len(a))
|
|
copy(aCopy, a)
|
|
|
|
// Generate a random solution matrix X.
|
|
x := make([]float64, n*ldb)
|
|
for i := range x {
|
|
x[i] = rnd.NormFloat64()
|
|
}
|
|
|
|
// Generate the right-hand side B as A * X or Aᵀ * X.
|
|
b := make([]float64, len(x))
|
|
copy(b, x)
|
|
bi := blas64.Implementation()
|
|
if n > 0 {
|
|
for j := 0; j < nrhs; j++ {
|
|
bi.Dtbmv(uplo, trans, diag, n, kd, a, lda, b[j:], ldb)
|
|
}
|
|
}
|
|
|
|
got := make([]float64, len(b))
|
|
copy(got, b)
|
|
ok := impl.Dtbtrs(uplo, trans, diag, n, kd, nrhs, a, lda, got, ldb)
|
|
|
|
if !floats.Equal(a, aCopy) {
|
|
t.Errorf("%v: unexpected modification of A", name)
|
|
}
|
|
|
|
if ok == singular {
|
|
t.Errorf("%v: misdetected singular matrix, ok=%v", name, ok)
|
|
}
|
|
|
|
if !ok {
|
|
if !floats.Equal(got, b) {
|
|
t.Errorf("%v: unexpected modification of B when singular", name)
|
|
}
|
|
return
|
|
}
|
|
|
|
if n == 0 || nrhs == 0 {
|
|
return
|
|
}
|
|
|
|
work := make([]float64, n)
|
|
|
|
// Compute the 1-norm of A or Aᵀ.
|
|
var aNorm float64
|
|
if trans == blas.NoTrans {
|
|
aNorm = dlantb(lapack.MaxColumnSum, uplo, diag, n, kd, a, lda, work)
|
|
} else {
|
|
aNorm = dlantb(lapack.MaxRowSum, uplo, diag, n, kd, a, lda, work)
|
|
}
|
|
|
|
// Compute the maximum over the number of right-hand sides of
|
|
// |op(A)*x-b| / (|op(A)| * |x|)
|
|
var resid float64
|
|
for j := 0; j < nrhs; j++ {
|
|
bi.Dcopy(n, got[j:], ldb, work, 1)
|
|
bi.Dtbmv(uplo, trans, diag, n, kd, a, lda, work, 1)
|
|
bi.Daxpy(n, -1, b[j:], ldb, work, 1)
|
|
rjNorm := bi.Dasum(n, work, 1)
|
|
xNorm := bi.Dasum(n, got[j:], ldb)
|
|
resid = math.Max(resid, rjNorm/aNorm/xNorm)
|
|
}
|
|
if resid > tol {
|
|
t.Errorf("%v: unexpected result; resid=%v,want<=%v", name, resid, tol)
|
|
}
|
|
}
|