-
Hi @msmdev , I have a large, reducible matrix with 5 recurrent and a number of transient states. I run GPCCA on it, both with method `brandts` as well as `krylov_schur`. In both cases, I get the follo…
-
Hi @yixuan,
I'm trying to understand the Lanczos method, mostly via Golub & Van Loan's [Matrix Computations](https://books.google.com/books?id=5U-l8U3P-VUC&lpg=PP1&ots=7-HCRjYMan&dq=matrix%20compu…
-
Hello,
I am attempting to run compute_lineage_drivers(), but no matter what value I set for "lineages" I keep getting a value error.:
```
File "", line 421, in combined_kernel_analysis
File …
-
```julia
julia> using JET
julia> using LinearAlgebra
julia> @report_opt log(UpperTriangular(rand(4,4)))
# [some lines redacted for brevity]
│┌ log_quasitriu(A0::UpperTriangular{Float64, Matri…
-
### Describe your issue.
For a 3x3 matrix A I want to find its **sorted real** Schur form T ((quasi-)upper-triangular matrix) and the corresponding unitary Schur transformation matrix Z. I want th…
-
Hi,
I think it could be great to introduce the support for eigenvalue solvers. I noticed that the implicit restarted method has already been passed. The modern faster method should be the Krylov-Sc…
-
It seems like the code for non-normal matrices requires the matrix to be non-singular. Am I missing something? If not, is there any plans to support non-singular matrices in the near future?
-
I was trying to port some code to Rust that required computing the [pseudo-inverse](https://en.wikipedia.org/wiki/Moore%E2%80%93Penrose_pseudoinverse) of a matrix and had to realize that **rulinalg** …
-
Can we add an option for calculating the transformation matrix/change of basis matrix? That is, the matrix that maps the generators of the ideal to the Gröbner basis (see for example [Oscar.jl](https:…
-
Rulinalg has implementations of a number of decompositions. Currently these are returned as `Result`, where `tuple` is a tuple of `Matrix`. This is in itself useful, as it gives the user easy access t…