mirror of https://github.com/pyodide/pyodide.git
30 lines
798 B
Python
30 lines
798 B
Python
|
import pytest
|
||
|
|
from pyodide_test_runner import run_in_pyodide
|
||
|
|
|
||
|
|
|
||
|
|
@pytest.mark.driver_timeout(40)
|
||
|
|
@run_in_pyodide(packages=["scipy", "sparseqr"])
|
||
|
|
def test_scipy_linalg(selenium):
|
||
|
|
import numpy
|
||
|
|
import scipy.sparse.linalg
|
||
|
|
import sparseqr
|
||
|
|
from numpy.testing import assert_allclose
|
||
|
|
|
||
|
|
# QR decompose a sparse matrix M such that Q R = M E
|
||
|
|
|
||
|
|
n_test = 10
|
||
|
|
#
|
||
|
|
M = scipy.sparse.rand(n_test, n_test, density=0.1)
|
||
|
|
Q, R, E, rank = sparseqr.qr(M)
|
||
|
|
# print( abs( Q*R - M*sparseqr.permutation_vector_to_matrix(E) ).sum() ) # should be approximately zero
|
||
|
|
|
||
|
|
for ib in range(n_test):
|
||
|
|
|
||
|
|
b = numpy.zeros(10)
|
||
|
|
b[ib] = 1
|
||
|
|
|
||
|
|
v = Q.dot(R.dot(b))
|
||
|
|
w = M.dot(sparseqr.permutation_vector_to_matrix(E).dot(b))
|
||
|
|
|
||
|
|
assert_allclose(v, w, rtol=1e-07, atol=1e-9)
|