Timeline for Explicit and fast error bounds for polynomial approximation
Current License: CC BY-SA 4.0
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 4, 2023 at 15:40 | history | edited | Peter O. | CC BY-SA 4.0 |
update error bounds
|
| Aug 6, 2022 at 22:47 | history | edited | Peter O. | CC BY-SA 4.0 |
added 31 characters in body
|
| Aug 6, 2022 at 15:30 | history | edited | Peter O. | CC BY-SA 4.0 |
The Ck norm definition matters a great deal.
|
| Aug 1, 2022 at 13:10 | history | edited | Peter O. | CC BY-SA 4.0 |
Edit result on moments
|
| Jul 28, 2022 at 11:45 | history | edited | Peter O. | CC BY-SA 4.0 |
correction
|
| Jul 28, 2022 at 7:06 | history | edited | Peter O. | CC BY-SA 4.0 |
correction
|
| Jul 28, 2022 at 4:16 | history | edited | Peter O. | CC BY-SA 4.0 |
add bound for C3 functions
|
| Jul 27, 2022 at 3:30 | history | edited | Peter O. | CC BY-SA 4.0 |
added 450 characters in body
|
| Jul 27, 2022 at 1:04 | history | edited | Peter O. | CC BY-SA 4.0 |
added 496 characters in body
|
| Jul 25, 2022 at 15:02 | history | edited | Peter O. | CC BY-SA 4.0 |
added 127 characters in body
|
| Jul 25, 2022 at 13:04 | history | edited | Peter O. | CC BY-SA 4.0 |
added 505 characters in body
|
| Jul 25, 2022 at 11:39 | history | edited | Peter O. | CC BY-SA 4.0 |
Edit code and discussion on moments. No restatement as proposition yet.
|
| Jul 25, 2022 at 9:46 | comment | added | user44143 | Can you state any of these bounds as self-contained propositions, that can be understood without having to read the whole question or the whole answer? | |
| Jul 25, 2022 at 7:30 | history | edited | Peter O. | CC BY-SA 4.0 |
edited body
|
| Jul 25, 2022 at 6:56 | history | edited | Peter O. | CC BY-SA 4.0 |
added 3 characters in body
|
| Jul 25, 2022 at 6:48 | history | answered | Peter O. | CC BY-SA 4.0 |