Timeline for Anyone knows the algorithm used by NullSpace function?
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 29, 2022 at 0:47 | comment | added | Daniel Lichtblau |
@DaveWasHere Offhand I don't know which of the two the Automatic will select. But if you want to force one or the other method then by all means set that option explicitly.
|
|
| Nov 28, 2022 at 19:44 | comment | added | DaveWasHere | @DanielLichtblau Thank you for the answer! So should I understand that in such complicated cases the option Automatic is to avoid? To me this makes more sense since we "help" Mathematica to make a choice causing it to "think less" in principle. | |
| Nov 28, 2022 at 17:55 | comment | added | Daniel Lichtblau |
@DaveWasHere I doubt any method would handle a matrix of that size unless the sparseness pattern made it exceptionally well behaved. But I'd pick OneStepRowReduction for this. (Except...sometimes DivisionFreeRowReduction performs better. Heuristics for this choice are not so easy to come by.)
|
|
| Nov 27, 2022 at 21:12 | comment | added | DaveWasHere | @DanielLichtblau Are you aware of which "Method" would be most suitable in dealing with a symbolic (5 variables), large (666x667) but sparse (<10%) matrix? And is there any literature available on the performance of these methods in various context? | |
| May 3, 2015 at 3:41 | history | edited | J. M.'s missing motivation♦ | CC BY-SA 3.0 |
edited tags
|
| Dec 13, 2014 at 1:10 | vote | accept | LCFactorization | ||
| Dec 13, 2014 at 1:05 | vote | accept | LCFactorization | ||
| Dec 13, 2014 at 1:07 | |||||
| Dec 11, 2014 at 22:10 | answer | added | ATAX | timeline score: 2 | |
| Dec 11, 2014 at 16:04 | review | Close votes | |||
| Dec 11, 2014 at 21:14 | |||||
| Dec 11, 2014 at 15:44 | comment | added | Daniel Lichtblau |
Depends on the type of matrix. For example if it is exact and numeric e.g. all integers, NullSpace will use some manner of Gaussian elimination and that will be faster than (exact) SVD. Absent some indication of matrix type and size though everything is just speculation.
|
|
| Dec 11, 2014 at 13:44 | history | asked | LCFactorization | CC BY-SA 3.0 |