日本語
 
Help Privacy Policy ポリシー/免責事項
  詳細検索ブラウズ

アイテム詳細


公開

学術論文

Deciding Hopf bifurcations by quantifier elimination in a software-component architecture

MPS-Authors
/persons/resource/persons44379

El Kahoui,  M'hammed
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
There are no locators available
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
フルテキスト (公開)
公開されているフルテキストはありません
付随資料 (公開)
There is no public supplementary material available
引用

El Kahoui, M. (2000). Deciding Hopf bifurcations by quantifier elimination in a software-component architecture. Journal of Symbolic Computation, 30(2), 161-179. Retrieved from http://www.sciencedirect.com/science?_ob=IssueURL&_tockey=%23TOC%236927%232000%23999699997%23294181%23FLP%23Volume_30,_Issue_2,_Pages_129-237_(August_2000)&_auth=y&view=c&_acct=C000004638&_version=1&_urlVersion=0&_userid=43521&md5=eed1fda034ba5a240f50d550d711ee9c.


引用: https://hdl.handle.net/11858/00-001M-0000-000F-339C-D
要旨
In this paper we give a semi-algebraic description of Hopf bifurcation fixed points for a given parameterized polynomial vector field. The description is carried out by use of the Hurwitz determinants, and produces a first-order formula which is transformed into a quantifier free formula by use of usual quantifier elimination algorithms. We apply techniques from the theory of sub-resultant sequences and of Gr¨obner bases to come up with efficient reductions, which lead to quantifier elimination questions that can often be handled by existing quantifier elimination packages. We could implement the algorithms for the conditions on Hopf bifurcations by combining the computer algebra system Maple with packages for quantifier elimination using a Java based component architecture recently developed by the second author. In addition to some textbook examples we applied our software system to an example discussed in a recent research paper.