File: dormlq.go

package info (click to toggle)
golang-gonum-v1-gonum 0.15.1-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 18,792 kB
  • sloc: asm: 6,252; fortran: 5,271; sh: 377; ruby: 211; makefile: 98
file content (131 lines) | stat: -rw-r--r-- 3,384 bytes parent folder | download
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
// 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/floats"
)

type Dormlqer interface {
	Dorml2er
	Dormlq(side blas.Side, trans blas.Transpose, m, n, k int, a []float64, lda int, tau, c []float64, ldc int, work []float64, lwork int)
}

func DormlqTest(t *testing.T, impl Dormlqer) {
	rnd := rand.New(rand.NewSource(1))
	for _, side := range []blas.Side{blas.Left, blas.Right} {
		for _, trans := range []blas.Transpose{blas.NoTrans, blas.Trans} {
			for _, wl := range []worklen{minimumWork, mediumWork, optimumWork} {
				for _, test := range []struct {
					common, adim, cdim, lda, ldc int
				}{
					{0, 0, 0, 0, 0},
					{6, 7, 8, 0, 0},
					{6, 8, 7, 0, 0},
					{7, 6, 8, 0, 0},
					{7, 8, 6, 0, 0},
					{8, 6, 7, 0, 0},
					{8, 7, 6, 0, 0},
					{100, 200, 300, 0, 0},
					{100, 300, 200, 0, 0},
					{200, 100, 300, 0, 0},
					{200, 300, 100, 0, 0},
					{300, 100, 200, 0, 0},
					{300, 200, 100, 0, 0},
					{100, 200, 300, 400, 500},
					{100, 300, 200, 400, 500},
					{200, 100, 300, 400, 500},
					{200, 300, 100, 400, 500},
					{300, 100, 200, 400, 500},
					{300, 200, 100, 400, 500},
					{100, 200, 300, 500, 400},
					{100, 300, 200, 500, 400},
					{200, 100, 300, 500, 400},
					{200, 300, 100, 500, 400},
					{300, 100, 200, 500, 400},
					{300, 200, 100, 500, 400},
				} {
					var ma, na, mc, nc int
					if side == blas.Left {
						ma = test.adim
						na = test.common
						mc = test.common
						nc = test.cdim
					} else {
						ma = test.adim
						na = test.common
						mc = test.cdim
						nc = test.common
					}
					// Generate a random matrix
					lda := test.lda
					if lda == 0 {
						lda = max(1, na)
					}
					a := make([]float64, ma*lda)
					for i := range a {
						a[i] = rnd.Float64()
					}
					// Compute random C matrix
					ldc := test.ldc
					if ldc == 0 {
						ldc = nc
					}
					c := make([]float64, mc*ldc)
					for i := range c {
						c[i] = rnd.Float64()
					}

					// Compute LQ
					k := min(ma, na)
					tau := make([]float64, k)
					work := make([]float64, 1)
					impl.Dgelqf(ma, na, a, lda, tau, work, -1)
					work = make([]float64, int(work[0]))
					impl.Dgelqf(ma, na, a, lda, tau, work, len(work))

					cCopy := make([]float64, len(c))
					copy(cCopy, c)
					ans := make([]float64, len(c))
					copy(ans, cCopy)

					var nw int
					if side == blas.Left {
						nw = nc
					} else {
						nw = mc
					}
					work = make([]float64, max(1, nw))
					impl.Dorml2(side, trans, mc, nc, k, a, lda, tau, ans, ldc, work)

					var lwork int
					switch wl {
					case minimumWork:
						lwork = nw
					case optimumWork:
						impl.Dormlq(side, trans, mc, nc, k, a, lda, tau, c, ldc, work, -1)
						lwork = int(work[0])
					case mediumWork:
						work := make([]float64, 1)
						impl.Dormlq(side, trans, mc, nc, k, a, lda, tau, c, ldc, work, -1)
						lwork = (int(work[0]) + nw) / 2
					}
					lwork = max(1, lwork)
					work = make([]float64, lwork)

					impl.Dormlq(side, trans, mc, nc, k, a, lda, tau, c, ldc, work, lwork)
					if !floats.EqualApprox(c, ans, 1e-13) {
						t.Errorf("Dormqr and Dorm2r results mismatch")
					}
				}
			}
		}
	}
}