package/gonum
1
0
Fork 0
mirror of https://github.com/gonum/gonum.git synced 2025-10-25 00:00:24 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

testlapack: change randomSparseGeneral to unbalancedSparseGeneral

Browse Source 
... and make it take the number of nonzeros instead of just the probability of
an element being nonzero.
This commit is contained in:
Vladimir Chalupecky
2016-08-31 15:31:27 +09:00
parent 2242f80802
commit 5a6eecdca0
2 changed files with 17 additions and 19 deletions
Download Patch File Download Diff File Expand all files Collapse all files

23
testlapack/general.go
View File

@@ -1014,17 +1014,18 @@ func isUpperTriangular(a blas64.General) bool {
return true
}
// randomSparseGeneral returns an m×n general matrix whose each element is set
// to a non-zero value with probability p.
func randomSparseGeneral(m, n, stride int, p float64, rnd *rand.Rand) blas64.General {
a := nanGeneral(m, n, stride)
for i := 0; i < m; i++ {
for j := 0; j < n; j++ {
if rnd.NormFloat64() < p {
a.Data[i*stride+j] = rnd.NormFloat64()
} else {
a.Data[i*stride+j] = 0
}
// unbalancedSparseGeneral returns an m×n dense matrix with a random sparse
// structure consisting of nz nonzero elements. The matrix will be unbalanced by
// multiplying each element randomly by its row or column index.
func unbalancedSparseGeneral(m, n, stride int, nonzeros int, rnd *rand.Rand) blas64.General {
a := zeros(m, n, stride)
for k := 0; k < nonzeros; k++ {
i := rnd.Intn(n)
j := rnd.Intn(n)
if rnd.Float64() < 0.5 {
a.Data[i*stride+j] = float64(i+1) * rnd.NormFloat64()
} else {
a.Data[i*stride+j] = float64(j+1) * rnd.NormFloat64()
}
}
return a