mirror of
https://github.com/josdejong/mathjs.git
synced 2026-01-18 14:59:29 +00:00
74ff86fd4b
git handles compression for us so compressing the matricies we use to test is unnessessary. Additionally, handling the compression made the code significantly more complex and required pulling in extra packages from npm. This commit updates the matrix market code to use uncompressed files. I have also replaced use of the promise libary 'q' with built in promises.
102 lines
3.2 KiB
JavaScript
102 lines
3.2 KiB
JavaScript
import approx from '../../../../tools/approx'
|
|
import math from '../../../../src/main'
|
|
import { csPermute } from '../../../../src/function/algebra/sparse/csPermute'
|
|
import { createCsLu } from '../../../../src/function/algebra/sparse/csLu'
|
|
import { createCsSqr } from '../../../../src/function/algebra/sparse/csSqr'
|
|
import * as market from '../../../../tools/matrixmarket'
|
|
|
|
const { abs, add, divideScalar, multiply, subtract, larger, largerEq, transpose, type: { SparseMatrix } } = math
|
|
|
|
const csLu = createCsLu({ abs, divideScalar, multiply, subtract, larger, largerEq, type: { SparseMatrix } })
|
|
const csSqr = createCsSqr({ add, multiply, transpose })
|
|
|
|
describe('csLu', function () {
|
|
it('should decompose matrix, 48 x 48, natural ordering (order=0), full pivoting, matrix market', function (done) {
|
|
// import matrix
|
|
market.import('tools/matrices/bcsstk01.mtx')
|
|
.then(function (m) {
|
|
// symbolic ordering and analysis, order = 0
|
|
const s = csSqr(0, m, false)
|
|
|
|
// full pivoting
|
|
const r = csLu(m, s, 0.001)
|
|
|
|
// verify
|
|
approx.deepEqual(csPermute(m, r.pinv, s.q, true).valueOf(), math.multiply(r.L, r.U).valueOf())
|
|
|
|
// indicate test has completed
|
|
done()
|
|
})
|
|
.catch(function (error) {
|
|
// indicate test has completed
|
|
done(error)
|
|
})
|
|
})
|
|
|
|
it('should decompose matrix, 48 x 48, amd(A+A\') (order=1), full pivoting, matrix market', function (done) {
|
|
// import matrix
|
|
market.import('tools/matrices/bcsstk01.mtx')
|
|
.then(function (m) {
|
|
// symbolic ordering and analysis, order = 1
|
|
const s = csSqr(1, m, false)
|
|
|
|
// full pivoting
|
|
const r = csLu(m, s, 0.001)
|
|
|
|
// verify
|
|
approx.deepEqual(csPermute(m, r.pinv, s.q, true).valueOf(), math.multiply(r.L, r.U).valueOf())
|
|
|
|
// indicate test has completed
|
|
done()
|
|
})
|
|
.catch(function (error) {
|
|
// indicate test has completed
|
|
done(error)
|
|
})
|
|
})
|
|
|
|
it('should decompose matrix, 48 x 48, amd(A\'*A) (order=2), full pivoting, matrix market', function (done) {
|
|
// import matrix
|
|
market.import('tools/matrices/bcsstk01.mtx')
|
|
.then(function (m) {
|
|
// symbolic ordering and analysis, order = 2
|
|
const s = csSqr(2, m, false)
|
|
|
|
// full pivoting
|
|
const r = csLu(m, s, 0.001)
|
|
|
|
// verify
|
|
approx.deepEqual(csPermute(m, r.pinv, s.q, true).valueOf(), math.multiply(r.L, r.U).valueOf())
|
|
|
|
// indicate test has completed
|
|
done()
|
|
})
|
|
.catch(function (error) {
|
|
// indicate test has completed
|
|
done(error)
|
|
})
|
|
})
|
|
|
|
it('should decompose matrix, 48 x 48, amd(A\'*A) (order=3), full pivoting, matrix market', function (done) {
|
|
// import matrix
|
|
market.import('tools/matrices/bcsstk01.mtx')
|
|
.then(function (m) {
|
|
// symbolic ordering and analysis, order = 3
|
|
const s = csSqr(3, m, false)
|
|
|
|
// full pivoting
|
|
const r = csLu(m, s, 0.001)
|
|
|
|
// verify
|
|
approx.deepEqual(csPermute(m, r.pinv, s.q, true).valueOf(), math.multiply(r.L, r.U).valueOf())
|
|
|
|
// indicate test has completed
|
|
done()
|
|
})
|
|
.catch(function (error) {
|
|
// indicate test has completed
|
|
done(error)
|
|
})
|
|
})
|
|
})
|