Efficient symbolic-numeric algorithms for structured constrained differential polynamial systems

结构化约束微分多项式系统的高效符号数值算法

• 批准号: 184166-2009
• 负责人: Reid, Greg
• 金额: $ 1.6万
• 依托单位: University of Western Ontario
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2015
• 资助国家: 加拿大
• 起止时间: 2015-01-01 至 2016-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=569703
• 关键词: Efficient; symbolic; numeric; algorithms; structured

Symbolic Computation is the study of algorithms and software systems to manipulate mathematical expressions. Until recently the algorithms have processed exact expressions and equations only. Driven by the needs of applications, in which data is approximate, the subject has grown to include symbolic-numeric computation for polynomial equations. This is part of a broad effort to combine the generality of exact symbolic computation with the realism and efficiency of numeric computation. Building on my previous results my proposal extends this subject further to efficient symbolic-numeric algorithms for approximate differential polynomial systems. Such systems express fundamental laws of science and applications have yielded ever more complicated systems involving, for example 100's of differential equations for the currents in complex circuits and the motions of components of medical robots. To analyze and solve such complicated models, computers are required at every stage: from formulation to solution. Differentiation of such systems can reveal hidden constraints which are crucial in their geometric and solution properties. The proposal is to create and analyze new algorithms for such systems which enable: the stable and efficient symbolic-numeric algorithmic determination of their constraints; and the computer exploitation of the resulting geometry in the analysis and solution process. Algorithms will also be developed for exploiting the structure of systems typically arising in applications. This builds on powerful results in differential geometry and differential algebra, combined with the new area Numerical Algebraic Geometry, that gives a numerically stable approach for the first time to the simpler subclass of approximate polynomial equations. Existing symbolic techniques can detect global constraint structure but are limited to exact systems; while existing numeric techniques for more realistic approximate systems detect local, but not global structure. The research focuses on symbolic-numeric algorithms for structured systems, including global structure.

符号计算是一门研究算法和软件系统来处理数学表达式的学科。直到最近，这些算法还只能处理精确表达式和方程。在数据近似的应用需求的驱动下，该学科已经发展到包括多项式方程的符号-数值计算。这是将精确符号计算的通用性与数值计算的现实性和效率相结合的广泛努力的一部分。