Information

Grand challenges in computational mathematics and numerical/symbolic computing: An NSF view

Michael Foster (NSF), Lenore Mullin (NSF), Eun Park (NSF)

Optimizing software to keep up with Moore's Law requires Grand Challenges for algorithm, language, and library developers. Is it possible to identify algorithms and data structures pervasive across scientific disciplines with deterministic properties? Can we design and build algebraically closed numeric and symbolic programming languages such that optimal designs can be verified both semantically and operationally? Cyber-enabled Discovery and Innovation (CDI), a multi-million dollar initiative at NSF, aims to explore radically new concepts, theories, and tools at the intersection of computational and physical worlds to address these issues. This talk will ask questions and pose answers to the community that will create Grand Challenges for Computational Mathematics.