Timeline for The polynomial function changed to a set consisting of terms of polynomial function
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 7, 2023 at 17:21 | comment | added | Daniel Lichtblau |
@user688486 Since ListMin is an internal function, there's no good reason to add what amounts to syntactic sugar for the "max" counterpart. It would just be -Internal`ListMin[-list].
|
|
| Nov 7, 2023 at 15:20 | comment | added | user688486 |
@DanielLichtblau Thanks. But why isn't there an analogous ListMax functionality internally?
|
|
| Aug 3, 2017 at 16:00 | comment | added | Daniel Lichtblau |
Given a list of lists of real values, all of the same length, Internal`ListMin removes any that has all elements greater or equal to elements of another. In effect if finds minimal elements. If the notion of a "Pareto front" is familiar, it is useful for finding those elements that give such a front. Lower hull supporting set (not necessarily convex) might be another way to view it. (Whether these help one to understand the function depends on one's familiarity with them, I realize.)
|
|
| Aug 3, 2017 at 1:26 | comment | added | QuantumDot |
May I ask what Internal`ListMin does? Is it fair to say that it eliminates a subset of of rows so that the output matrix has MatrixRank equal to number of rows?
|
|
| Aug 2, 2017 at 18:39 | history | answered | Daniel Lichtblau | CC BY-SA 3.0 |