Penalty Function Based Critical Point Approach to Compute Real Witness Solution Points of Polynomial Systems

4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a critical point method based on a penalty function for finding certain solution (witness) points on real solutions components of general real polynomial systems. Unlike other existing numerical methods, the new method does not require the input polynomial system to have pure dimension or satisfy certain regularity conditions. This method has two stages. In the first stage it finds approximate solution points of the input system such that there is at least one real point on each connected solution component. In the second stage it refines the points by a homotopy continuation or traditional Newton iteration. The singularities of the original system are removed by embedding it in a higher dimensional space. In this paper we also analyze the convergence rate and give an error analysis of the method. Experimental results are also given and shown to be in close agreement with the theory.

Cite

CITATION STYLE

APA

Wu, W., Chen, C., & Reid, G. (2017). Penalty Function Based Critical Point Approach to Compute Real Witness Solution Points of Polynomial Systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10490 LNCS, pp. 377–391). Springer Verlag. https://doi.org/10.1007/978-3-319-66320-3_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free