Computational Methods in Numerical Algebraic Geometry

数值代数几何的计算方法

• 批准号: 1114336
• 负责人: Jonathan Hauenstein
• 金额: $ 9.4万
• 依托单位: Texas A&M Research Foundation
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2011
• 资助国家: 美国
• 起止时间: 2011-09-01 至 2012-10-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1114336&HistoricalAwards=false
• 关键词: Computational; Methods; Numerical; Algebraic; Geometry; Computational; Methods; Numerical; Algebraic; Geometry

This project aims to contribute to numerical algebraic geometry by developing and implementing new algorithms used to solve polynomial systems arising in many applications. One goal is the development of an algorithm for solving large-scale structured polynomial systems which naturally arise in computing overconstrained mechanisms as well as computing real and singular points on algebraic sets. This algorithm will utilize the regeneration method, developed by Hauenstein, Sommese, and Wampler, which computes the solutions of a polynomial system by building from the solutions of smaller polynomial systems. Regeneration together with the exploitation of structure will allow one to solve many naturally occurring polynomial systems which are beyond the reach of current methods. Another goal is the training of one or more undergraduate students in this area. The students will also help with the development of some of the algorithms and testing of the software developed by this proposal. Additionally, as a group, we will apply the newly developed algorithms to new problems arising from applications.Polynomial systems naturally arise in many areas of science, engineering, economics, and biology with their solutions, for example, describing the design of specialized robots, equilibria of chemical reactions and economic models, and describing the stability of tumors. The real solutions to these polynomial systems are often of particular interest to researchers as they often describe the physically meaningful solutions, e.g., a constructible robot. The new algorithms and software developed will allow a broad range of scientists, engineers, and economists who encounter polynomial systems to compute physically meaningful solutions to systems which are beyond the reach of current solving techniques. Additionally, the students involved in this project will gain knowledge and research experience in the mathematical sciences.

该项目旨在通过开发和实施用于解决许多应用中出现的多项式系统的新算法来为数值代数的几何形状做出贡献。 一个目标是开发用于求解大规模结构化多项式系统的算法，该算法在计算过度约束机制以及计算代数集中的真实和奇异点时自然出现。 该算法将利用由Hauenstein，Sommese和Wampler开发的再生方法，该方法通过从较小的多项式系统的溶液中构建来计算多项式系统的解决方案。 再生以及对结构的开发将使人们可以解决许多自然发生的多项式系统，这些系统超出了当前方法的范围。 另一个目标是培训该领域的一名或多名本科生。学生还将帮助开发一些算法和该提案开发的软件的测试。 此外，作为一个小组，我们将将新开发的算法应用于应用程序引起的新问题。多个物种系统自然在许多科学，工程，经济学和生物学领域都会及其解决方案，例如，描述了专业机器人的设计，化学反应和经济模型的平衡，并描述了Tumors的稳定性。 这些多项式系统的真实解决方案通常对研究人员特别感兴趣，因为它们通常描述了物理上有意义的解决方案，例如可构造的机器人。 开发的新算法和软件将允许遇到多项式系统的广泛科学家，工程师和经济学家，以对当前求解技术无法触及的系统计算物理有意义的解决方案。此外，参与该项目的学生将获得数学科学的知识和研究经验。