B David Saunders

Actually in NTL the usage in file names is lzz (wordsize ints) and ZZ (big ints). I'll move the file names on our related files to lower case and use...

I wholeheartedly endorse developing a robust and thorough random matrix generation for testing and benchmarking. Attached is a little essay of my ideas about the subject. A start on the...

Pushed fixes directly to master. Future work (will make separate issues/branches): 1. fix smith form binary (in particular, often second smallest invariant is garbage) 2. clean up toeplitz and hankel...

Nicely put. One way to communicate this is for solve() to put in the method object whether it found the matrix to be nonsingular or singular. The caller can check...

Nice! You might mention structured matrices. Perhaps the last two lines could be "blackbox algorithms for sparse, structured, and dense matrices' Incidentally, as we develop more eliminations for sparse matrices...

I like this. It sounds right to me. I have one doubt vis a vis automatic casting: It would meet my desire except that we have a custom of passing...

On reflection, I'd say the custom of passing matrices by reference is not a strong enough reason against the casting approach Clement suggests. The user experience will be identical and...

Do we have a prime (irreducible) generator for F[x] as well? ...I would use it. Deterministic and/or not. On Thu, Dec 21, 2017 at 11:59 AM, Clément Pernet wrote: >...

I agree that setEntry could generically have void return value. Supporting linbox functions that work with normal entry storage as well as packed and sliced entry storage schemes is valuable....

Just fyi, when i use the blackbox method in linbox/algorithms/frobenius-small.h I get usertime: 0.005487 x^13 x^9 x^7 x^5 x is that what it should be? On Mon, Sep 4, 2023...