-
The [LDL package](http://www.cise.ufl.edu/research/sparse/ldl/), part of [SuiteSparse](http://www.cise.ufl.edu/research/sparse/SuiteSparse/) by Tim Davis, provides a really compact implementation of s…
-
@trilinos/muelu See e.g., this test result:
https://testing.sandia.gov/cdash/testDetails.php?test=41460718&build=3121008
Here is a sample bit of output:
```
593. PetraOperator_std_complex0doub…
-
Hi @fqnchina,
I am trying to run your code, I followed your instructions in the readme file but I am getting the following error:
```
$ th test_MIT.lua
.../torch/install/bin/luajit: .../torc…
-
If a user needs to define custom inner products for general Hilbert spaces, what is the current state in Base for this type of generalization? https://github.com/JuliaLang/julia/issues/16573 is a rela…
-
The NAG libraries often cause problems with portability of code. NAG is not freely available. Simple changes in release number (R23 vs. R24) can break codes. It is proposed that we fork a branch of…
-
NetworkX includes sophisticated analyses of directed weighted graphs, evaluating or ranking nodes according to HITS or PageRank, implemented in the `link_analysis` sub-package http://networkx.github.i…
-
Thinking more about it, I think we need to improve the consistency of the LinearSystemSolver with the rest of MathematicalProgram. I think that if one were to add (only) a bunch of linear constraint…
-
On the following example:
```python
import numpy
import scipy.sparse
from osqp import OSQP
if __name__ == "__main__":
n = 4
P = scipy.sparse.lil_matrix(scipy.sparse.eye(n))
for i…
-
Some linear algebra routines are slow on ArrayFire.
``` julia
a = rand(1000, 1000) #Generate double precision random values
ad = AFArray(a) #Transfer to GPU
@time svd(a); # CPU
0.487003 seconds (43 …
-
Hi,
Thanks for the fastest tool for EIGEN implementation, it's so useful for very large matrices. I am working with a FE project which is related to solving eigenvalues of a system.
I am getting d…