fzero runs out of iterations
4 ビュー (過去 30 日間)
古いコメントを表示
Hi,
Depending on where I start fzero searching, it either will, or will not find the zero that I know is there. If I start it closer, it finds it. Is there a way to just increase the number of tries it takes before giving up? It should be a well-behaved 4th order polynomial with 2 zeros. I'm willing to try something else more robust if needed. Haven't looked into fsolve yet....
Thanks!
Dave
0 件のコメント
回答 (2 件)
Roger Stafford
2016 年 6 月 21 日
You should try giving ‘fzero’ an x0 (estimate) value in the form of a two-element vector such that the function is of opposite signs at the two points of x0. That should be a guarantee of a fast convergence.
4 件のコメント
Torsten
2016 年 6 月 21 日
If it's a polynomial, why don't you use "roots" to find its zeros ?
Best wishes
Torsten.
John D'Errico
2016 年 6 月 21 日
It is claimed to be a polynomial. Use roots!
By the way, fzero will be far more robust than fsolve, because you should be supplying a bracket that bounds your root. fsolve is targeted at multidimensional problems.
But roots is better than any of these alternatives, if it is truly a polynomial.
3 件のコメント
John D'Errico
2016 年 6 月 21 日
編集済み: John D'Errico
2016 年 6 月 21 日
You want a more robust solution. Do the work and compute the coefficients. Roots will be seriously faster.
Or, use symbolic tools if you just want a solution and are not worried about it taking a bit more time. solve or vpasolve will give the solutions with no problems. Then you will not have any problems in computing the coefficients, since MATLAB will do all the work. It still will very possibly be faster than an iterative scheme that may or may not happily converge.
As for fighting for a symbolic license, use symbolic tools ONCE, upfront. I fail to see the problem here.
参考
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!