-
Similarly as CouplingSequentialBase, create a base class CouplingIterativeBase to allow iterations between processes within one computational time step. Required for poroelasticity.
Then just imple…
-
### Is your feature request related to a problem? Please describe.
All current iterative solvers in `sparse` are for `Ax=b`. Multiple right-hand sides commonly appear in applications and are most e…
-
For my use-case, I would like to avoid having Flipt on the critical path to request handling, i.e. high latency or errors from Flipt should not fail a request. This can already be accomplished, but in…
-
```
Some older versions of ADDA (before the public release) had an option to used
single precision. But it was removed because CPU have been efficient with
double precision already at that time. The…
-
## Behavior
When I ran iterative methods like SART on a CT scan (512×512×463, can be downloaded [here](https://drive.google.com/file/d/1BGGxrHR984JRAF0AYlLAWksPivCU9hKw/view?usp=drive_link)), it wa…
-
Why can I not run OSP for `--osp_upto_k` values greater than 16? Whenever I set the values to some high numbers such as 200, I get the following error:
```
Traceback (most recent call last):
F…
-
**Is your feature request related to a problem? Please describe.**
`faer` is very fast at computing all eigenvalues of a matrix, but oftentimes you only need a few eigenvalues (e.g. the largest/small…
-
I have a computation that solves an implicit equation using iterative numerical methods (bisection, Brent, etc). I would like to use FiniteDifferences.jl for unit testing partials I write for ChainRul…
tpapp updated
3 years ago
-
In HW1 exercise #3, we solved Ax=b using Gauss Seidel method, by reorganizing the system into
(D+U) \* x_k1 = b - L \* x_k, backward substitution
But usually (from classes I have had), to implement …
-
```
Some older versions of ADDA (before the public release) had an option to used
single precision. But it was removed because CPU have been efficient with
double precision already at that time. The…