Fast adaptive discontinuous basis sets for electronic structure

• URL: http://arxiv.org/abs/2510.21213v1
• Date: Fri, 24 Oct 2025 07:33:48 GMT
• Title: Fast adaptive discontinuous basis sets for electronic structure
• Authors: Yulong Pan, Michael Lindsey,
• Abstract summary: We develop a Galerkin framework for automatically constructing adaptive basis sets for electronic structure calculations.<n>By allowing combinations of element sets, we maintain favorable numerical conditioning and induce structured sparsity of integral solvers.<n>These basis sets naturally support adaptive multigrid preconditioning for the linear eigensolvers employed within the self-consistent field for Hartree-Fock and density functional theory.
• Score: 1.7188280334580195
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We develop a discontinuous Galerkin (DG) framework for automatically constructing adaptive basis sets for electronic structure calculations. By allowing basis functions to be discontinuous across element interfaces, our approach supports flexible combinations of atom-centered and polynomial basis sets, maintains favorable numerical conditioning, and induces structured sparsity of the one- and two-electron integrals, which we compute using specialised numerical integration strategies. We also introduce multigrid-preconditioned Poisson solvers that enable fast algorithms for both Hartree-Fock (HF) and density functional theory (DFT) calculations within our DG basis sets. Moreover, these basis sets naturally support adaptive multigrid preconditioning for the linear eigensolvers employed within the self-consistent field iteration for HF and DFT. Numerical experiments for HF and DFT demonstrate that our approach achieves chemical accuracy with modest basis sizes that compare favorably to the sizes of ordinary GTO basis sets achieving similar accuracy, while offering additional structured sparsity and improved computational scalability in the size-extensive limit. The framework thus provides a flexible route toward the construction of systematically improvable and structured adaptive basis sets for electronic structure theory.

Related papers

• Graph Neural Regularizers for PDE Inverse Problems [62.49743146797144]
  We present a framework for solving a broad class of ill-posed inverse problems governed by partial differential equations (PDEs)<n>The forward problem is numerically solved using the finite element method (FEM)<n>We employ physics-inspired graph neural networks as learned regularizers, providing a robust, interpretable, and generalizable alternative to standard approaches.
  arXiv  Detail & Related papers  (2025-10-23T21:43:25Z)
• Interpolative separable density fitting on adaptive real space grids [1.2138840417631505]
  We incorporate adaptive real space grids for potentially highly localized single-particle basis functions.<n>We find that the ISDF compression efficiency for the ERI tensor with highly localized basis sets is comparable to that for smoother basis sets compatible with uniform grids.<n>Our work establishes a pathway for scalable many-body electronic structure simulations with arbitrary smooth basis functions.
  arXiv  Detail & Related papers  (2025-10-09T01:42:49Z)
• Unlocking Symbol-Level Precoding Efficiency Through Tensor Equivariant Neural Network [84.22115118596741]
  We propose an end-to-end deep learning (DL) framework with low inference complexity for symbol-level precoding.<n>We show that the proposed framework captures substantial performance gains of optimal SLP, while achieving an approximately 80-times speedup over conventional methods.
  arXiv  Detail & Related papers  (2025-10-02T15:15:50Z)
• Structure-Preserving Digital Twins via Conditional Neural Whitney Forms [0.8796261172196743]
  We present a framework for constructing real-time digital twins based on structure-preserving reduced finite element models conditioned on a latent variable Z.<n>The approach uses conditional attention mechanisms to learn both a reduced finite element basis and a nonlinear conservation law.<n>The framework interfaces with conventional finite element machinery in a non-invasive manner, allowing treatment of complex geometries.
  arXiv  Detail & Related papers  (2025-08-09T13:26:44Z)
• AlphaFold Database Debiasing for Robust Inverse Folding [58.792020809180336]
  We introduce a Debiasing Structure AutoEncoder (DeSAE) that learns to reconstruct native-like conformations from intentionally corrupted backbone geometries.<n>At inference, applying DeSAE to AFDB structures produces debiased structures that significantly improve inverse folding performance.
  arXiv  Detail & Related papers  (2025-06-10T02:25:31Z)
• Accurate Ab-initio Neural-network Solutions to Large-Scale Electronic Structure Problems [52.19558333652367]
  We present finite-range embeddings (FiRE) for accurate large-scale ab-initio electronic structure calculations.<n>FiRE reduces the complexity of neural-network variational Monte Carlo (NN-VMC) by $sim ntextel$, the number of electrons.<n>We validate our method's accuracy on various challenging systems, including biochemical compounds and organometallic compounds.
  arXiv  Detail & Related papers  (2025-04-08T14:28:54Z)
• Fully numerical Hartree-Fock calculations for atoms and small molecules with quantics tensor trains [0.0]
  We present a fully numerical framework for the optimization of molecule-specific quantum chemical basis functions within the quantics tensor train format using a finite-difference scheme.<n>Our work offers a promising alternative to well-established HF-solvers and could pave the way to define highly accurate, fully numerical, molecule-adaptive basis sets.
  arXiv  Detail & Related papers  (2025-03-11T13:44:23Z)
• Fast and spectrally accurate construction of adaptive diagonal basis sets for electronic structure [2.2489531925874013]
  We combine the periodic sinc basis set with a curvilinear coordinate system for electronic structure calculations. We address two key challenges that arise while using basis sets obtained by such a coordinate transformation. The solution of both of these challenges enables mean-field calculations at a cost that is log-linear in the number of basis functions.
  arXiv  Detail & Related papers  (2024-07-08T17:48:40Z)
• D4FT: A Deep Learning Approach to Kohn-Sham Density Functional Theory [79.50644650795012]
  We propose a deep learning approach to solve Kohn-Sham Density Functional Theory (KS-DFT) We prove that such an approach has the same expressivity as the SCF method, yet reduces the computational complexity. In addition, we show that our approach enables us to explore more complex neural-based wave functions.
  arXiv  Detail & Related papers  (2023-03-01T10:38:10Z)
• Basis set generation and optimization in the NISQ era with Quiqbox.jl [2.909730313782505]
  We propose a framework for more customizable basis set generation and optimization. We have developed an open-source software package named Quiqbox'' in the Julia programming language.
  arXiv  Detail & Related papers  (2022-12-08T22:29:04Z)
• Efficient Micro-Structured Weight Unification and Pruning for Neural Network Compression [56.83861738731913]
  Deep Neural Network (DNN) models are essential for practical applications, especially for resource limited devices. Previous unstructured or structured weight pruning methods can hardly truly accelerate inference. We propose a generalized weight unification framework at a hardware compatible micro-structured level to achieve high amount of compression and acceleration.
  arXiv  Detail & Related papers  (2021-06-15T17:22:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.