-
Notifications
You must be signed in to change notification settings - Fork 0
/
dlagtm.go
127 lines (108 loc) · 3.54 KB
/
dlagtm.go
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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
// 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"
"testing"
"math/rand"
"github.com/gopherd/gonum/blas"
"github.com/gopherd/gonum/blas/blas64"
"github.com/gopherd/gonum/floats"
"github.com/gopherd/gonum/lapack"
)
type Dlagtmer interface {
Dlagtm(trans blas.Transpose, m, n int, alpha float64, dl, d, du []float64, b []float64, ldb int, beta float64, c []float64, ldc int)
}
func DlagtmTest(t *testing.T, impl Dlagtmer) {
rnd := rand.New(rand.NewSource(1))
for _, trans := range []blas.Transpose{blas.NoTrans, blas.Trans, blas.ConjTrans} {
t.Run(transToString(trans), func(t *testing.T) {
for _, m := range []int{0, 1, 2, 3, 4, 5, 10} {
for _, n := range []int{0, 1, 2, 3, 4, 5, 10} {
for _, ldb := range []int{max(1, n), n + 3} {
for _, ldc := range []int{max(1, n), n + 4} {
for _, alpha := range []float64{0, 1, rnd.NormFloat64()} {
for _, beta := range []float64{0, 1, rnd.NormFloat64()} {
dlagtmTest(t, impl, rnd, trans, m, n, ldb, ldc, alpha, beta)
}
}
}
}
}
}
})
}
}
func dlagtmTest(t *testing.T, impl Dlagtmer, rnd *rand.Rand, trans blas.Transpose, m, n int, ldb, ldc int, alpha, beta float64) {
const (
tol = 1e-14
extra = 10
)
name := fmt.Sprintf("Case m=%v,n=%v,ldb=%v,ldc=%v,alpha=%v,beta=%v", m, n, ldb, ldc, alpha, beta)
// Generate three random diagonals.
dl := randomSlice(n+extra, rnd)
dlCopy := make([]float64, len(dl))
copy(dlCopy, dl)
d := randomSlice(n+1+extra, rnd)
dCopy := make([]float64, len(d))
copy(dCopy, d)
du := randomSlice(n+extra, rnd)
duCopy := make([]float64, len(du))
copy(duCopy, du)
b := randomGeneral(m, n, ldb, rnd)
bCopy := cloneGeneral(b)
got := randomGeneral(m, n, ldc, rnd)
want := cloneGeneral(got)
// Deal with zero-sized matrices early.
if m == 0 || n == 0 {
impl.Dlagtm(trans, m, n, alpha, dl, d, du, b.Data, b.Stride, beta, got.Data, got.Stride)
if !floats.Same(dl, dlCopy) {
t.Errorf("%v: unexpected modification in dl", name)
}
if !floats.Same(d, dCopy) {
t.Errorf("%v: unexpected modification in d", name)
}
if !floats.Same(du, duCopy) {
t.Errorf("%v: unexpected modification in du", name)
}
if !floats.Same(b.Data, bCopy.Data) {
t.Errorf("%v: unexpected modification in B", name)
}
if !floats.Same(got.Data, want.Data) {
t.Errorf("%v: unexpected modification in C", name)
}
return
}
impl.Dlagtm(trans, m, n, alpha, dl, d, du, b.Data, b.Stride, beta, got.Data, got.Stride)
if !floats.Same(dl, dlCopy) {
t.Errorf("%v: unexpected modification in dl", name)
}
if !floats.Same(d, dCopy) {
t.Errorf("%v: unexpected modification in d", name)
}
if !floats.Same(du, duCopy) {
t.Errorf("%v: unexpected modification in du", name)
}
if !floats.Same(b.Data, bCopy.Data) {
t.Errorf("%v: unexpected modification in B", name)
}
// Generate a dense representation of the matrix and compute the wanted result.
a := zeros(m, m, m)
for i := 0; i < m-1; i++ {
a.Data[i*a.Stride+i] = d[i]
a.Data[i*a.Stride+i+1] = du[i]
a.Data[(i+1)*a.Stride+i] = dl[i]
}
a.Data[(m-1)*a.Stride+m-1] = d[m-1]
blas64.Gemm(trans, blas.NoTrans, alpha, a, b, beta, want)
for i := 0; i < m; i++ {
for j := 0; j < n; j++ {
got.Data[i*got.Stride+j] -= want.Data[i*want.Stride+j]
}
}
diff := dlange(lapack.MaxColumnSum, got.Rows, got.Cols, got.Data, got.Stride)
if diff > tol {
t.Errorf("%v: unexpected result; diff=%v, want<=%v", name, diff, tol)
}
}