-
With reference to [0.5 Linear Algebra documentation](https://docs.julialang.org/en/release-0.5/stdlib/linalg/),
"pivoting is on by default" but it does not appear that is true. For the record, I do n…
-
The arguments should not be `AbstractMatrix` types, since that implies access to the elements. The argument should be untyped ("duck-typed"), and work for any type `T` supporting `*(A::T, v::Abstrac…
-
With the work on Nullable types in https://github.com/Microsoft/TypeScript/pull/7140, we would like to field some user input on the current design proposal.
First some background:
## `null` and `unde…
-
I can feed np.linalg.cholesky a symmetric, positive-definite, reasonably conditioned matrix (Sigma_true below) and numpy returns an error message: matrix is not positive definite... Any ideas, folks…
srmcc updated
7 years ago
-
In order to economize resources for **defined positive symmetric matrices** the Cholesky decomposition is demanded.
"The Cholesky decomposition always exists and is unique — provided the matrix is …
-
Hi all
I'm trying to use this package, and below is my experiments
```julia
using IterativeSolvers
julia> A = rand(10,10);
julia> b = rand(10);
julia> x = cg(A,b)[1];
julia> A*x-b
10…
-
Also found by Dakshina Ilangovan:
The documentation of `SchurMatrix` states this:
```
* Given a non-singular matrix @p A (often positive definite) and a positive
* semi-definite matrix @p C as wel…
-
Matrices I could implement (which could also be useful to implement graphs). Note that these type of matrices may derive from a common and more generic matrix data structure.
- [Adjacency matrix](h…
-
I have a program where I compute a cholesky decomposition of a correlation matrix.
Sometimes, the correlation matrix is empty (when there is no data). In this case, np.linalg.cholesky reports an error…
-
Hi,
I'm looking to solve a linear system which is algebraically similar to the Stokes problem, in the sense that I have a matrix in the following block form:
```
[ A B ]
[ B^T 0 ]
```
…