-
Let A = (a_{ij}) be an m x n (m
-
This could be pretty useful. In Base, `exp(z::Matrix{BigFloat})` doesn't exist but we could support it with some minor modifications of the rational algorithms
```julia
julia> using LinearAlgebra
…
-
```
LUdecompositionFF and det_bareis (determinant using bareis algorithms) are very useful functions when the matrices are full of symbols. However, the current implementations do not do a good job of…
-
`Could not compute eigenvalues for Matrix([[40, 10, 20, 15/11, sqrt(5)], [10, 80, 40, 22, 11/35], [20, 40, 10, 35, 0], [5/2, 1, 2, 1, 3*sqrt(7)/7], [32/11, sqrt(7)/3, 1, 1, 1]]). if you see this error…
-
On MacOS X, the latest phcpack available from github clone compiles fine with make -f makefile_mac phc (with corrections and proper local directories in the makefile) into the Objects directory
Unf…
-
I discovered by chance that there are two completely different code paths for `GcdOp` on univariate polynomials. One is triggered if you just give two polynomials; the other if you also specify the po…
-
Purportedly, `LinearCode` supports making codes over finite rings. The documentation states only that the ring needs to support "various methods" such as matrices over the ring has a `rank` function…
-
When I implemented polynomial factoring in 2016, the following were the times:
Poly | NTL | Magma | Flint-1.6 | New
-------|------------|-----------------|--…
-
```julia
using SpeedyWeather
function SpeedyTransforms.transform_simple!( # SPECTRAL TO GRID
grids::FullGaussianArray, # gridded output
specs::LowerTriangularArray, …
-
Hi,
I'm working on extending the (univariate) PMP to the multivariate setting, hopefully with SDPB as solver. A lot stays similar, the most important change is that you need more blocks per constrai…