Timeline for Finding minimax approximation of a permutation equivariant polynomial
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 15, 2022 at 22:38 | comment | added | Igor Khavkine | @SeewooLee Right, sorry, I read over that part of the question too fast. I've added some remarks about how to reduce the equivariant case to the invariant one. | |
| Dec 15, 2022 at 22:37 | history | edited | Igor Khavkine | CC BY-SA 4.0 |
added 1613 characters in body
|
| Dec 15, 2022 at 20:04 | comment | added | Seewoo Lee | Thanks! Although my original question was about permutation equivariant polynomials, not permutation invariant (I give a wrong example as max/min, and it should be argmax/argmin), but in my case it can be reduced to invariant case so it is helpful. I'd try to search more on the algorithms to find Chebyshev approximations. | |
| Dec 15, 2022 at 16:42 | history | edited | Igor Khavkine | CC BY-SA 4.0 |
edited body
|
| Dec 15, 2022 at 12:26 | history | answered | Igor Khavkine | CC BY-SA 4.0 |