Abstract
We propose a method for computing the position of all level lines of a real polynomial in the real plane. To do this, it is necessary to compute its critical points and critical curves, and then to compute critical values of the polynomial (there are finite number of them). Now finite number of critical levels and one representative of noncritical level corresponding to a value between two neighboring critical ones enough to compute. We propose a scheme for computing level lines based on polynomial computer algebra algorithms: Gröbner bases, primary ideal decomposition. Software for these computations are pointed out. Nontrivial examples are considered.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
