Search arXivSearch

arXiv subjects

Toby Isaac

Publications and source records attributed to Toby Isaac.

4 recordsLinked to original sources

AI Assistants to Enhance and Exploit the PETSc Knowledge Base

Generative AI, especially through large language models (LLMs), is transforming how technical knowledge can be accessed, reused, and extended. PETSc, a widely used numerical library for high-performance scientific computing, has accumulated a rich but fragmented knowledge base over its three decades of development, spanning source code, documentation, mailing lists, GitLab issues, Discord conversations, technical papers, and more. Much of this knowledge remains informal and inaccessible to users and new developers. To activate and utilize this knowledge base more effectively, the PETSc team has begun building an LLM-powered system that combines PETSc content with custom LLM tools -- including retrieval-augmented generation (RAG), reranking algorithms, and chatbots -- to assist users, support developers, and propose updates to formal documentation. This paper presents initial experiences designing and evaluating these tools, focusing on system architecture, using RAG and reranking for PETSc-specific information, evaluation methodologies for various LLMs and embedding models, and user interface design. Leveraging the Argonne Leadership Computing Facility resources, we analyze how LLM responses can enhance the development and use of numerical software, with an initial focus on scalable Krylov solvers. Our goal is to establish an extensible framework for knowledge-centered AI in scientific software, enabling scalable support, enriched documentation, and enhanced workflows for research and development. We conclude by outlining directions for expanding this system into a robust, evolving platform that advances software ecosystems to accelerate scientific discovery.

cs.AI

PETSc/TAO Developments for GPU-Based Early Exascale Systems

The Portable Extensible Toolkit for Scientific Computation (PETSc) library provides scalable solvers for nonlinear time-dependent differential and algebraic equations and for numerical optimization via the Toolkit for Advanced Optimization (TAO). PETSc is used in dozens of scientific fields and is an important building block for many simulation codes. During the U.S. Department of Energy's Exascale Computing Project, the PETSc team has made substantial efforts to enable efficient utilization of the massive fine-grain parallelism present within exascale compute nodes and to enable performance portability across exascale architectures. We recap some of the challenges that designers of numerical libraries face in such an endeavor, and then discuss the many developments we have made, which include the addition of new GPU backends, features supporting efficient on-device matrix assembly, better support for asynchronicity and GPU kernel concurrency, and new communication infrastructure. We evaluate the performance of these developments on some pre-exascale systems as well the early exascale systems Frontier and Aurora, using compute kernel, communication layer, solver, and mini-application benchmark studies, and then close with a few observations drawn from our experiences on the tension between portable performance and other goals of numerical libraries.

cs.MS

A note on the standard diffusion curve of TAP analysis

The standard diffusion curve used in models of TAP reactors, as it is usually defined, is numerically unstable for small values. We use a functional equation satisfied by the curve to define a numerically stable way of computing it for all values.

cs.MS

Unifying the geometric decompositions of full and trimmed polynomial spaces in finite element exterior calculus

Arnold, Falk, & Winther, in "Finite element exterior calculus, homological techniques, and applications" (2006), show how to geometrically decompose the full and trimmed polynomial spaces on simplicial elements into direct sums of trace-free subspaces and in "Geometric decompositions and local bases for finite element differential forms" (2009) the same authors give direct constructions of extension operators for the same spaces. The two families -- full and trimmed -- are treated separately, using differently defined isomorphisms between each and the other's trace-free subspaces and mutually incompatible extension operators. This work describes a single operator $\mathring{\star}_T$ that unifies the two isomorphisms and also defines a weighted-$L^2$ norm appropriate for defining well-conditioned basis functions and dual-basis functionals for geometric decomposition. This work also describes a single extension operator $\dot{E}_{\sigma,T}$ that implements geometric decompositions of all differential forms as well as for the full and trimmed polynomial spaces separately.

math.NA