Timeline for Find parameters that minimize the distance between two curves in terms of the infinite norm
Current License: CC BY-SA 3.0
12 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jul 21, 2016 at 8:45 | history | edited | J. M.'s missing motivation♦ | CC BY-SA 3.0 |
added 19 characters in body
|
Nov 16, 2015 at 9:28 | vote | accept | Kass | ||
Nov 15, 2015 at 13:56 | comment | added | Silvia |
In case you want to minimize the relative error, there is a built-in function for this: MiniMaxApproximation .
|
|
Nov 13, 2015 at 21:56 | comment | added | Kass | Thanks to Anton for spotting the mistake! However the comment of MarcoB remains valid too -- I was also getting the warnings of "failure to converge to a solution" (independently of plotting mistake, of course). | |
Nov 13, 2015 at 19:23 | comment | added | user484 | Belisarius is correct, the optimal quadratic fit is the constant zero function, whose infinity-norm distance from $v(x)$ is 1. For a function $f(x)$ to have distance less than that, it would have to be negative at $x=0$, positive at $x=1/2$, negative at $x=\sqrt3/2$, and positive at $x=1$ (because those are the extrema of $v(x)$ on $[0,1]$: i.sstatic.net/zLP5g.png). This is impossible if $f(x)$ is quadratic. | |
Nov 13, 2015 at 19:02 | answer | added | george2079 | timeline score: 4 | |
Nov 13, 2015 at 18:10 | answer | added | Anton Antonov | timeline score: 1 | |
Nov 13, 2015 at 17:59 | comment | added | Anton Antonov |
There is a mistake in the plotting command. It should be f[y,a,b,c] not f[a,b,c,y] .
|
|
Nov 13, 2015 at 15:37 | history | edited | MarcoB | CC BY-SA 3.0 |
small cleanup; edited tags
|
Nov 13, 2015 at 15:25 | answer | added | Dr. belisarius | timeline score: 9 | |
Nov 13, 2015 at 15:13 | comment | added | MarcoB |
I tried running your code and I get a lot of warnings because NMinimize failed to converge to a solution. Do you not get the same?
|
|
Nov 13, 2015 at 14:34 | history | asked | Kass | CC BY-SA 3.0 |