-
Notifications
You must be signed in to change notification settings - Fork 526
/
dgerqf.go
133 lines (123 loc) · 2.63 KB
/
dgerqf.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
128
129
130
131
132
133
// 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 testlapack
import (
"testing"
"golang.org/x/exp/rand"
"gonum.org/v1/gonum/blas"
"gonum.org/v1/gonum/blas/blas64"
)
type Dgerqfer interface {
Dgerqf(m, n int, a []float64, lda int, tau, work []float64, lwork int)
}
func DgerqfTest(t *testing.T, impl Dgerqfer) {
const tol = 1e-13
rnd := rand.New(rand.NewSource(1))
for c, test := range []struct {
m, n, lda int
}{
{1, 1, 0},
{2, 2, 0},
{3, 2, 0},
{2, 3, 0},
{1, 12, 0},
{2, 6, 0},
{3, 4, 0},
{4, 3, 0},
{6, 2, 0},
{12, 1, 0},
{200, 180, 0},
{180, 200, 0},
{200, 200, 0},
{1, 1, 20},
{2, 2, 20},
{3, 2, 20},
{2, 3, 20},
{1, 12, 20},
{2, 6, 20},
{3, 4, 20},
{4, 3, 20},
{6, 2, 20},
{12, 1, 20},
{200, 180, 220},
{180, 200, 220},
{200, 200, 220},
} {
n := test.n
m := test.m
lda := test.lda
if lda == 0 {
lda = test.n
}
a := make([]float64, m*lda)
for i := range a {
a[i] = rnd.Float64()
}
aCopy := make([]float64, len(a))
copy(aCopy, a)
k := min(m, n)
tau := make([]float64, k)
for i := range tau {
tau[i] = rnd.Float64()
}
work := []float64{0}
impl.Dgerqf(m, n, a, lda, tau, work, -1)
lwkopt := int(work[0])
for _, wk := range []struct {
name string
length int
}{
{name: "short", length: m},
{name: "medium", length: lwkopt - 1},
{name: "long", length: lwkopt},
} {
if wk.length < max(1, m) {
continue
}
lwork := wk.length
work = make([]float64, lwork)
for i := range work {
work[i] = rnd.Float64()
}
copy(a, aCopy)
impl.Dgerqf(m, n, a, lda, tau, work, lwork)
// Test that the RQ factorization has completed successfully. Compute
// Q based on the vectors.
q := constructQ("RQ", m, n, a, lda, tau)
// Check that Q is orthogonal.
if !isOrthonormal(q) {
t.Errorf("Case %v, Q not orthogonal", c)
}
// Check that A = R * Q
r := blas64.General{
Rows: m,
Cols: n,
Stride: n,
Data: make([]float64, m*n),
}
for i := 0; i < m; i++ {
off := m - n
for j := max(0, i-off); j < n; j++ {
r.Data[i*r.Stride+j] = a[i*lda+j]
}
}
got := blas64.General{
Rows: m,
Cols: n,
Stride: lda,
Data: make([]float64, m*lda),
}
blas64.Gemm(blas.NoTrans, blas.NoTrans, 1, r, q, 0, got)
want := blas64.General{
Rows: m,
Cols: n,
Stride: lda,
Data: aCopy,
}
if !equalApproxGeneral(got, want, tol) {
t.Errorf("Case %d, R*Q != a %s\ngot: %+v\nwant:%+v", c, wk.name, got, want)
}
}
}
}