Sparsity, complexity and practicality in symbolic mathematical computation

符号数学计算的稀疏性、复杂性和实用性

• 批准号: 155376-2008
• 负责人: Giesbrecht, Mark
• 金额: $ 2.33万
• 依托单位: University of Waterloo
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2012
• 资助国家: 加拿大
• 起止时间: 2012-01-01 至 2013-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=503447
• 关键词: Sparsity; complexity; practicality; symbolic; mathematical

This proposal describes a comprehensive program of research into the design, analysis and implementation of algorithms for foundational problems in symbolic mathematical computation. These are the algorithms that make commercial mathematical software like Maple and Mathematica run. They allow us to manipulate and solve large and complex sets of equations exactly, even when some quantities are unknown and left as variables.

本提案描述了符号数学计算中基本问题的算法设计、分析和实现的综合研究计划。这些算法使Maple和Mathematica等商业数学软件得以运行。它们使我们能够精确地处理和解决大量复杂的方程组，甚至当一些未知量作为变量时也是如此。