Theoretical Research on Combinatorial Problems in Sparse Matrix Computations

该奖项为研究开发提供支持 计划在算法问题的组合问题， 大型稀疏对称正定方程组解 线性方程组。 主要目标是开发一个 解决感兴趣的问题的理论研究计划 到稀疏矩阵社区。 规划的基础 活动将是公开讨论和研讨会之间 算法社区的高级研究人员， 稀疏矩阵社区的从业者。 通过这些 调查人员将确定的问题的讨论 稀疏矩阵社区的兴趣，并把他们投在 理论术语。 此次合作将为 调查人员一个难得的机会，创造一个独特的和有用的 研究计划。

This award provides support for the development of a research plan on algorithmic issues of combinatorial problems in the solution of large sparse symmetric positive definite systems of linear equations. The primary goal is to develop a theoretical research program that addresses issues of interest to the sparse matrix community. Fundamental to the planning activities will be open discussions and seminars between senior researchers in the algorithms community and practitioners in the sparse matrix community. Through these discussions the investigator will determine problems of interest to the sparse matrix community and cast them in theoretical terms. This collaboration will afford the investigator a rare opportunity to create a unique and useful research program.