-
Currently the Levenberg-Marquardt routine in MINPACK calls a "home-brewed" QR factorization derived from LINPACK:
https://github.com/jacobwilliams/minpack/blob/b4e671d1692b6f9eb048ba920e97f8a4eda19…
-
Julia version: 1.9.3 - installed via released package from Julia website (I tried older versions and I got same error)
OS: Linux 6.5.2 (with zen kernel)
Arch: x86
Glibc version: 2.38
Output:
```…
-
## Execution primitives
- [ ] Provide a Phylanx 'context' in users create variables. This should make execution easier to manage for end users.
- [ ] Determine if contexts should be managed withou…
-
@lambday
@karlnapf
It can be good for large scale GP.
paper:
http://arxiv.org/abs/1403.6015
code:
https://github.com/sivaramambikasaran/HODLR
-
### Is your feature request related to a problem? Please describe.
`scipy.sparse.kronsum(A, B)` defines the Kronecker sum as $I_n \otimes A + B \otimes I_m$. Unfortunately, this is the reverse of the…
-
https://arxiv.org/abs/2006.16236
-
Implement one or more forms of the matrix normal distribution. The general distribution is of the form
```
matrix_normal(matrix[N, P] y | matrix[N, P] mu, cov_matrix[N, N] SigmaRow, cov_matrix[P,…
-
I tested Tacho (fine grained task cholesky code) using the Kokkos cuda task dag capability. With help from @crtrott , we can profile the performance of the task dag.
With a enough number of concur…
-
Hi! My team and I stumbled upon this package and have found it really useful in our current project. Unfortunately though, we're having trouble getting it to play nicely with much of the DAE ecosystem…
-
This issue lists functionalities and feature requests for `BlockSparseArray`.
```julia
using LinearAlgebra
using NDTensors.BlockSparseArrays: BlockSparseArray
a = BlockSparseArray{Float64}([2,…