Project Grant 2203618

Award Date 3/1/22
Completion Date 2/28/25
Dollars Obligated $450K
Federal Grant Program
47.070
Assistance Type
Project Grant
Place of Performance
College Station, TX 77843, USA
Similar Awards
This $600,000 Project Grant award from the National Science Foundation (NSF) Division of Computing and Communication Foundations supports research on algorithms and limitations for matrix multiplication. The goal is to develop the fastest methods for computers to multiply large matrices, which is a fundamental mathematical operation with wide-ranging applications in science, technology, and beyond. The grant will fund research to pinpoint the theoretical limits of matrix multiplication...
This $299,999 National Science Foundation (NSF) grant under the Computer and Information Science and Engineering (CFDA 47.070) program supports research at the University of Massachusetts (UMass) on the query complexity of linear algebra algorithms. The project aims to develop new, query-efficient algorithms for solving key matrix problems and prove unconditional lower bounds on the number of queries required. The research will focus on two query models: entrywise matrix queries and...
This $300,000 project grant award from the National Science Foundation's (NSF) Computer and Information Science and Engineering (CISE) program (CFDA 47.070) supports research on the query complexity of linear algebra problems. The overarching goal is to develop more efficient algorithms for solving core matrix problems, such as systems of linear equations and eigenvalue computations, which have widespread applications across machine learning, scientific computing, and engineering. The research...
This Project Grant award from the National Science Foundation Division of Mathematical Sciences, under the CFDA program Mathematical and Physical Sciences (47.049), provides $165,000.00 over 3 years from August 1, 2023 to July 31, 2026 to Texas A&M University for research in commutative algebra, algebraic geometry, and algebraic combinatorics. The primary focus of the research is using combinatorial models to understand affine varieties and the algebro-geometric significance of these models....
This $571,919 Project Grant award to the Massachusetts Institute of Technology (MIT) is funded by the National Science Foundation's (NSF) Computer and Information Science and Engineering (CISE) program (CFDA 47.070). The goal of this 3-year project is to leverage algorithms and computer science knowledge to prove new complexity lower bounds, which will help elucidate the limits and possibilities of computing. The research aims to establish mathematical connections between algorithms and lower...
This three-year project grant from the National Science Foundation's (NSF) Mathematical and Physical Sciences program (CFDA 47.049) provides $303,805 to Texas A&M University to apply methods from combinatorial algebraic geometry to problems in spectral theory from mathematical physics. Specifically, the principal investigator (PI) will use algebraic geometry to study the spectrum of discrete periodic operators, an area with many open questions. The PI will also work to classify Galois groups...
The National Science Foundation Division of Mathematical Sciences awarded a $578,199 Project Grant to the University of Texas at Austin for collaborative research related to matroids, graphs, and algebraic geometry from July 1, 2021 to June 30, 2024. The award supports research under the Mathematical and Physical Sciences program (CFDA 47.049), which aims to promote progress in these fields and strengthen the nation's scientific enterprise through increasing knowledge and enhancing understanding...
This $900,000 project grant from the National Science Foundation's Computer and Information Science and Engineering program (CFDA 47.070) will fund research at Virginia Polytechnic Institute & State University to develop a comprehensive framework for efficient, scalable, and performance-portable tensor applications. The five-year award beginning July 2022 aims to address challenges in sustaining improved computing performance and developer productivity as hardware customization increases due...
The National Science Foundation (NSF) Division of Mathematical Sciences awarded a $322,730 Project Grant to the University of Texas at Austin from September 1, 2023 to August 31, 2026. The grant is funded under NSF's Mathematical and Physical Sciences Program (CFDA 47.049) and aims to develop techniques for assessing the accuracy of randomized algorithms used to solve fundamental linear algebraic equations in computational science. The project will focus on improving the speed and robustness...
This $300,000 Project Grant from the National Science Foundation Division of Mathematical Sciences, under the Mathematical and Physical Sciences program (CFDA 47.049), will support further research into the algebra, geometry, and combinatorics of matroids at Georgia Tech Research Corporation from October 1, 2022 to September 30, 2025. The Principal Investigator and collaborators will prove new results about matroid representations, including representations of 3-connected matroids and quaternary...

This three-year Project Grant from the National Science Foundation's $450,000 Computer and Information Science and Engineering program will support research at Texas A&M University to advance the theoretical foundations of matrix multiplication. The researchers will investigate both improving the known algorithms for matrix multiplication and proving tighter theoretical lower bounds on computational complexity. To address algorithmic efficiency, they will apply representation theory and algebraic geometry techniques to discover new auxiliary tensors not subject to current utility limitations. Regarding computational limits, the researchers will introduce tools from modern algebraic geometry like deformation theory to significantly strengthen lower bounding of border rank for tensors and potentially prove super-linear lower bounds. If successful, this work could yield new matrix multiplication algorithms and provide the first nontrivial lower bounds on the fundamental matrix multiplication exponent. The results will enrich both theoretical computer science and pure mathematics.

Generated 1/6/24, 3:56 PM