-
This is a followup on https://github.com/JuliaLang/julia/pull/26391. As @KlausC points out, it is currently not possible to multiply `Q*R` for `QRSparseQ` (in the tall case). For the dense QR factoriz…
-
We had some discussions about specifying and validating data structure invariants, so I'll list them here:
### Matrix formats
* All formats: values contain no NaN or Inf values
* All sparse forma…
-
Is there any particular reason the interface for `Tensor` requires `A
-
With the new advanced ODE solving tutorial, one thing that has become more clear is that we need to think about how we're doing some of the linear solver pieces.
- the preconditioners really need …
-
blackbox/permutation.h
matrix/ BlasPermutation & MatrixPermutation
Is MatrixPermutation then same as blackbox/permutation.h ?
-
It would be convenient for stdlib to have a function for computing the determinant of a square matrix. The cases of symmetric positive definite (SPD) (use Cholesky decomposition) and a general matrix …
-
So often the AbstractPDMat restriction on MvNormal and other Multivariate distributions causes pain.
Discussed in slack with @timholy and @andreasnoack that i had a problem creating a Positive Defin…
-
Code handling interactions between special matrix types (such as `Diagonal`), between annotation types (such as `LowerTriangular`), and between special matrix and annotation types exists distributed t…
-
RELATED TO: #314
In #257, I catch cholesky failures and use a combination of the SVD and QR factorizations to handle numerically SPSD matrices smoothly. This is probably overkill but performance was…
-
MWE:
```julia
using CUDA, SparseArrays, LinearAlgebra
CUDA.allowscalar(false)
W = CUDA.CUSPARSE.CuSparseMatrixCSR(sprand(100,100,0.1))
```
Now if you factorize you get CPU fallbacks:
```j…