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.