mirror of
https://github.com/kalmarek/PropertyT.jl.git
synced 2024-11-19 07:20:28 +01:00
Marek Kaluba
58f0ccb141
IntervalMatrices use Rump algorithm to matrix multiplication This brings time to Qint'*Qint down to ~40s which is 5-8 × slower than Q'*Q (for size n=2^13). The naive version is ~100 × slower than Q'*Q even for n = 2^10. |
||
---|---|---|
.. | ||
actions | ||
certify.jl | ||
constraint_matrix.jl | ||
gradings.jl | ||
PropertyT.jl | ||
reconstruct.jl | ||
roots.jl | ||
solve.jl | ||
sos_sdps.jl | ||
sqadjop.jl |