-
It would also be neat to have a set of tools for working with iterative solvers for sparse matrices, or those which are constructed implicitly.
Instead of taking an ndarray as input, an iterative lin…
-
```
Using a direct sparse linear solver (umfpack) is very convenient as it can
solve any nonsingular system very quickly. If the LU-decomposed matrix fits
into memory, that is.
-> Iterative solvers a…
-
### Is your feature request related to a problem? Please describe.
Sparse lobpcg and linear iterative solvers are pure Python and ideal candidates for array API support.
### Describe the solutio…
-
```
Using a direct sparse linear solver (umfpack) is very convenient as it can
solve any nonsingular system very quickly. If the LU-decomposed matrix fits
into memory, that is.
-> Iterative solvers a…
-
### Describe your issue.
When calling iterative methods for linear systems from the ``scipy.sparse.linalg`` module (like ``cg`` or ``gmres``) with a right hand side ``b`` of shape ``(N,1)`` the retur…
-
### 🚀 The feature, motivation and pitch
I am a compute fluid dynamic software developer. Pytorch really helped me for using GPU to accelerate computing. However, in compute fluid dynamic or other m…
-
I would expect this Python implementation to be quite a bit slower than `linalg.solve`. If this is the case, the applications of this would be to use it with custom operators, which PyTorch doesn't cu…
-
```
On recent GPU devices the matrix vector multiplication in adda is as fast as
the preparation of the next argument vector within the iterative solver
(currently done by the CPU). Therefore the it…
-
In a discussion with my friend @skieninger about the speed of sparse linear solvers of Matlab versus Python for solving a large system of equation (around 1e6) , we compared the backslash solver of Ma…
-
1- any one can give an example of iterative solvers of linear system Ax = b.
I am not able to completely understand the input of the function.
lets say I have marrix A and vector b and i want to us…