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

mat: rename Vector->VecDense

Browse Source
This commit is contained in:
kortschak
2017-07-28 13:35:07 +09:30
committed by Dan Kortschak
parent c91540fef5
commit 862a4c5a4f
45 changed files with 383 additions and 383 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
optimize/convex/lp/simplex_test.go
View File

@@ -176,9 +176,9 @@ func testSimplex(t *testing.T, initialBasic []int, c []float64, a mat.Matrix, b
primalOpt, primalX, _, errPrimal := simplex(initialBasic, c, a, b, convergenceTol)
if errPrimal == nil {
// No error solving the simplex, check that the solution is feasible.
var bCheck mat.Vector
bCheck.MulVec(a, mat.NewVector(len(primalX), primalX))
if !mat.EqualApprox(&bCheck, mat.NewVector(len(b), b), 1e-10) {
var bCheck mat.VecDense
bCheck.MulVec(a, mat.NewVecDense(len(primalX), primalX))
if !mat.EqualApprox(&bCheck, mat.NewVecDense(len(b), b), 1e-10) {
t.Errorf("No error in primal but solution infeasible")
}
}
@@ -223,9 +223,9 @@ func testSimplex(t *testing.T, initialBasic []int, c []float64, a mat.Matrix, b
dualOpt, dualX, _, errDual := simplex(nil, cNew, aNew, bNew, convergenceTol)
if errDual == nil {
// Check that the dual is feasible
var bCheck mat.Vector
bCheck.MulVec(aNew, mat.NewVector(len(dualX), dualX))
if !mat.EqualApprox(&bCheck, mat.NewVector(len(bNew), bNew), 1e-10) {
var bCheck mat.VecDense
bCheck.MulVec(aNew, mat.NewVecDense(len(dualX), dualX))
if !mat.EqualApprox(&bCheck, mat.NewVecDense(len(bNew), bNew), 1e-10) {
t.Errorf("No error in dual but solution infeasible")
}
}