Linear underestimator
-
In this paper we propose two algorithms based on branch and bound method and reduced interval techniques to compute all real zeros of a polynomial. Quadratic bounding functions are proposed which are better than the well known linear underestimator. Experimental result shows the efficiency of the two algorithms when facing ill-conditionned polynomials.
17p vinguyentuongdanh 19-12-2018 13 0 Download
-
.\lodern linguistic theory attributes surface complexity to interacting snbsystems of constraints. ["or instance, the I D LP gr,'unmar formalism separates constraints on immediate dominance from those on linear order. 5hieber's (t983) I D / I . P parsing algorithm shows how to use ID and LP constraints directly in language processing, without expandiqg them into an intcrmrdiate "object g a m m a r . " However, Shieber's purported O(:,Gi 2 .n ~) runtime bound underestimates the tlillicnlty of I D / L P parsing. I D / L P parsing is actually NP-complete, anti the worst-case runtime of...
6p bungio_1 03-05-2013 32 1 Download