-
I run multiple times the following test
```julia
# Symmetric generalized with singular B
let n = 10
k = 3
A = randn(n,n); A = A'A
B = randn(n,k); B = B*B'
@test sort(eigs(A, B…
-
Dear author,
I was trying to use runeems_sats and I have run into some issues. I am working with DArTseq data, using the silicoDArT which in essence is a dataset of microsatellites. In this speci…
-
@jlperla asked whether using `*` was appropriate. I think this argument shows that it's not just appropriate, but rather helpful. Let's start with iterative solvers for linear systems. Let `A` be a ma…
-
-
Try to show that the scattering matrices are positive definite.
First, show that the Mie coefficients al, bl differ in sign. This can be proven using the recurrence relations for PC and probably si…
-
If we can process the sigma matrix and identify cases where linking levels will not be possible (if not positive semi-definite?) then let's do that when they run it and so it is spit out when you run …
-
I have a relatively large symmetric eigenvalue problem (ca. 12000x12000) and want the first couple of eigenvectors and values:
```r
e
-
Currently a single tolerance (`tol` argument) is used, which is impractical, when using an iterative solver as a preconditioner. In that case it is desirable to set a relative tolerance to some not-so…
-
I stumbled across the following:
`eigs` and `eigs_sym` have trouble converging with the option `which = "SA"` and other values to get the smallest eigenvalues. After reading https://github.com/yixuan…
-
In GFA1, we are using CIGAR to describe overlaps between two segments. It was my idea initially, and I admit it is not a good one. @thegenemyers [proposed](https://github.com/thegenemyers/GFA-spec/blo…