How to tell matlab to, instead of throwing an error message, give me a Boolean (e.g., 0 means I get error) when I try to use Horner command

2 次查看（过去 30 天）
Mohammad Shojaei Arani
评论： Rik 2021-12-24
Hello friends,
In my code I need to know beforehand whether matlab can calculate Horner representation for my polynomial. Sometimes. it is not possible to find Horner representations in matlab due to depth limit of 32 for the nested paranthethis. In such cases I get the error message:
Error using symengine
Error: Nesting of {, [, and ( cannot exceed a depth of 32.
Error in symengine
Error in sym/matlabFunction (line 190)
g = symengine('makeFhandle',varnames,body);
Instead, I really need matlab to inform me whther Horner representation is possible or not. The reason is that I need to calculate Horner representation for many polynomials. So, I need to write a matlab function where the input is a polynomial and I would like the output to be the Honer representation if this is possible or the same polynomial whenever Horner representation is not possible (no error message).
Finally, I hope you know a way to ask matlab to consider a nested polynomials for a depth bigger than 32 (I hope this is possible as I really need this).
Thanks a lot in advance and I look forward to hearing from you soon!
Babak

请先登录，再回答此问题。

采纳的回答

the cyclist
the cyclist 2021-10-19
You could use a try-catch routine to catch the error.

更多回答（1 个）

Steven Lord
Steven Lord 2021-11-13
Rather than explicitly type out a 32nd degree polynomial, why not use a for loop? Start with your accumulator containing the value of the highest coefficient. For each following coefficient multiply the accumulator by x then add that coefficient. This has an added benefit of not needing to be modified if you later on want to evaluate a 33rd degree polynomial, or a 34th degree, or .... It's also one of the approaches the polyval function in MATLAB uses.
  2 个评论
Mohammad Shojaei Arani
Mohammad Shojaei Arani 2021-11-16
Thanks Steven,
Well, you are suggesting to implement the Horner scheme by myself. That is fine and doable but I am
not sure if using a for-loop is the most efficient way to do so. Imagine, I have an extremely long polynomial
and want to use the for-loop, then who knows how much time it takes. And, imagine that I need to do this millions of times. I gess that matlab does it rather differently and I am not an expert on these things.
I find it very strange that matlab has limitations for this not so complex problem.
Rik
Rik 2021-12-24
Ran in:
Given that you can provide x as an array, the only way I see performance issues popping up is if you have millions of polynomials, or polynomials with millions of terms.
In the latter case I doubt there would be much point in calculating both ends of the polynomial: either the high powers grow so large that the small powers dont matter (for abs(x)>1), or the high powers will become so small that they are hardly more than noise (for abs(x)<1).
0.1^1000,2^1000
ans = 0
ans = 1.0715e+301

请先登录，再进行评论。

类别

在 Help Center 和 File Exchange 中查找有关 Polynomials 的更多信息

标签

产品

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by