Searcharxiv⌕ Search

arXiv subjects

Benjamin Stamm

Publications and source records attributed to Benjamin Stamm.

At least 19 recordsLinked to original sources

Model Order Reduction for Parametric Hermitian Eigenvalue Problems: Local High-Order Approximation with Taylor-Reduced Basis Method

This paper is concerned with the Taylor-reduced basis method (Taylor-RBM) for the efficient approximation of eigenspaces of large-scale parametric Hermitian matrices. The Taylor-RBM is a local model order reduction method, which constructs an approximation space by using the ranges of scaled derivatives of the spectral projector at a reference point in the parameter domain. For a prescribed order $n$, under local $\mathrm{C}^{n+1}$-regularity, we prove local convergence of orders $n+1$ and $2n+2$ for the eigenspace and the Ritz-value sum, respectively, and present a computationally efficient procedure for assembling the Taylor reduced basis space. Since this method is tightly connected to multivariate perturbation theory, we also analyze a projector approximation obtained from the finite Taylor polynomial of the eigenprojector and compare it with the Taylor-RBM.

math.NA↗

Model Order Reduction for Parametric Dissipative Quantum Systems

We consider reduced basis approximations of non-equilibrium steady states of parameter-dependent Lindbladians, whose ambient matrix space grows exponentially with system size. We give a unified structural view of the problem through its characterizations as an eigenvalue problem or as a trace-constrained source problem. Building on these characterizations, we propose a residual-driven reduced basis framework for both formulations. Under the assumption of a unique steady state, we derive residual-based state-error estimates, and establish (sub-)exponential convergence of the greedy algorithms under real-analytic parameter dependence of the problem data. Numerical experiments on boundary-driven Fermi--Hubbard and dissipative XYZ chains support the analysis and suggest that the trace-constrained greedy method offers the best overall balance of accuracy and computational cost.

math.NA↗

Coupled Cluster Amplitude Extrapolation in Geometry Optimization

In this work, we present an amplitude extrapolation ansatz for geometry optimization that uses calculations from previous steps to construct an initial guess for the quasi-Newton solver at each new geometry, significantly accelerating convergence of the coupled-cluster and Lambda solver alike. The ansatz incorporates a necessary amplitude transformation to mitigate discontinuities associated with orbital energy crossings at the Hartree-Fock level of theory, while remaining computational and memory efficient. The method is tested for a diverse set of medium-sized molecules to demonstrate a systematic and significant reduction in the number of coupled-cluster iterations compared to the conventional method.

physics.chem-ph↗

Energy-minimizing domain decomposition

We propose a novel domain decomposition framework based on energy minimization, applicable to a wide class of linear and nonlinear partial differential equations. This energy-minimizing domain decomposition (EMDD) method addresses problems whose solutions are minimizers of an energy functional, either unconstrained or constrained to a manifold, and thus covers source and eigenvalue problems in a single formulation. Besides introducing the general framework, we derive the algorithmic realization of the method for four classes of model problems, namely linear and nonlinear source and eigenvalue problems, and derive the computational complexity of the method. Numerical experiments demonstrate the robustness and efficiency of the method across all four model problems and show that it compares favourably against existing model-specific domain decomposition methods.

math.NA↗

Diagonalization of the Landau Hamiltonian with a Periodic Potential via a Galerkin Projection Method and Applications to Topological Band Properties

In this paper, we study the numerical computation of eigenfunctions of the Landau Hamiltonian with a periodic potential. We propose a spectral method using the eigenfunctions of the Landau operator that allows us to numerically compute the band structure for potentials of different strengths, including the well-studied weak and strong potentials, and additionally systems in the intermediate regime. We then apply the method to simulations across the full range of coupling constants from weak to strong coupling and present an analysis of the band structure as a function of the potential strength.

physics.comp-ph↗

CP2K: An electronic structure and molecular dynamics software package - Dynamics, Transport, and Spectroscopic Response

One of the distinguishing aspects of CP2K is its seamless integration of diverse structural and transition-state optimization techniques with advanced sampling approaches including Monte Carlo, molecular dynamics, and metadynamics, enabling the efficient exploration of complex potential- and free-energy landscapes, including rare events. These capabilities are combined with a broad hierarchy of energy and force evaluation methods, ranging from classical and machine-learned interaction potentials and mixed quantum-classical multiscale and semiempirical schemes, to highly accurate quantum-mechanical electronic-structure approaches. At the heart of the latter lies the Gaussian and plane-wave framework, along with its augmented all-electron generalization, which have been described in detail in our previous code review [T. D. Kühne et al., J. Chem. Phys. 152, 194103 (2020)]. Building on this foundation, the present work revisits the methods within CP2K that turn electronic structure into dynamics, transport, and spectroscopic response. Particular emphasis is placed on the coupling between static response calculations and nuclear motion: spectra may be evaluated at optimized structures, averaged over thermally sampled configurations, obtained from time-correlation functions along ab-initio or path integral molecular trajectories, or followed in real time together with electronic and nuclear dynamics. The same modular structure also enables equilibrium and biased transport simulations, from Kubo-type linear response to open-boundary approaches under external potentials, highlighting CP2K's unique capability to unify quantum chemistry with quantum and statistical mechanics within a versatile, holistic simulation environment.

physics.chem-ph↗

On the Regularity and Interpolation of Coupled Cluster Amplitudes in Canonical Orbital Basis

Arguably the most widely used approaches for obtaining highly accurate molecular ground-state energies are coupled cluster methods. Despite introducing two layers of approximation, a linear and a nonlinear one, coupled cluster methods remain computationally intensive, with the complexity scaling as $O(poly(N))$, where $N$ is the number of electrons. Moreover, this method must be applied over a large set of different nuclear coordinates in order to study certain chemical phenomena. Therefore, in this work, we investigate the regularity of single-reference coupled cluster amplitudes with respect to nuclear coordinate displacements, with the aim of enabling interpolation or extrapolation approaches that rely on only a limited number of reference geometries. We show that, in theory, under certain non-degeneracy assumptions on the Hartree-Fock level of theory, and the coupled cluster level of theory the amplitudes behave real analytic. Furthermore, we analyze the artifacts that arise in practical calculations that use canonical orbitals, which hinder this high degree of regularity, and suggest strategies to mitigate these issues. Finally, we validate our findings through numerical experiments by interpolating the amplitudes and comparing the performance of the interpolants with that of the exact amplitudes.

math.NA↗

Parallel athermal quasistatic deformation stepping of molecular systems

The athermal quasistatic deformation method provides an elegant solution to overcome the limitation of short time spans in molecular simulations. It provides overdamped conditions, allowing for the extraction of purely structural responses in the absence of thermal vibration. However, it requires computationally expensive sequences of affine deformation followed by minimization of the potential energy to incrementally find the path in the potential energy landscape that corresponds to the correct solution trajectory. Therefore, we propose an athermal parallel stepping scheme that significantly improves the computational time necessary to find the correct solution trajectory using a multi-thread approach. Our approach proposes stepping at two levels. Level I stepping provides a sequence of initial guesses at large increments by affine deformation of the system and land-marking anchor points on the potential energy landscape. Level II stepping performs a set of individual finely resolved athermal quasistatic deformation steps between the inherent structures of the initial level I guesses executed in parallel. The evaluated candidate trajectory is then verified by consecutively comparing the configuration of every last level II result with the corresponding inherent structure of the level I guesses at the same strain states. If the two configurations are not equivalent, the solution must be rejected and recalculated from this point. Rigorous numerical testing with $4,8,16$ and $32$ parallel threads and different values of hyper-parameters demonstrates that our method achieves computational average speed-ups of factors ranging from $2.02$ to $6.33$, while maintaining simulation accuracy, offering a powerful new tool for athermal molecular simulations.

physics.comp-ph↗

Certified Model Order Reduction for parametric Hermitian eigenproblems

This article deals with the efficient and certified numerical approximation of the smallest eigenvalue and the associated eigenspace of a large-scale parametric Hermitian matrix. For this aim, we rely on projection-based model order reduction (MOR), i.e., we approximate the large-scale problem by projecting it onto a suitable subspace and reducing it to one of a much smaller dimension. Such a subspace is constructed by means of weak greedy-type strategies. After detailing the connections with the reduced basis method for source problems, we introduce a novel error estimate for the approximation error related to the eigenspace associated with the smallest eigenvalue. Since the difference between the second smallest and the smallest eigenvalue, the so-called spectral gap, is crucial for the reliability of the error estimate, we propose efficiently computable upper and lower bounds for higher eigenvalues and for the spectral gap, which enable the assembly of a subspace for the MOR approximation of the spectral gap. Based on that, a second subspace is then generated for the MOR approximation of the eigenspace associated with the smallest eigenvalue. We also provide efficiently computable conditions to ensure that the multiplicity of the smallest eigenvalue is fully captured in the reduced space. This work is motivated by a specific application: the repeated identifications of the states with minimal energy, the so-called ground states, of parametric quantum spin system models.

math.NA↗

Gradient Flow Finite Element Discretisations with Energy-Based $hp$-Adaptivity for the Gross-Pitaevskii Equation with Angular Momentum

This article deals with the stationary Gross-Pitaevskii non-linear eigenvalue problem in the presence of a rotating magnetic field that is used to model macroscopic quantum effects such as Bose-Einstein condensates (BECs). In this regime, the ground-state wave-function can exhibit an a priori unknown number of quantum vortices at unknown locations, which necessitates the exploitation of adaptive numerical strategies. To this end, we consider the conforming finite element method in combination with a discrete Sobolev gradient descent, which is guided by the energy-topology of the problem, to address the nonlinearity. In addition, a key novelty of this work is an $hp$-adaptive strategy that is solely based on energy decay rather than a posteriori error estimators for the refinement process. Numerical results demonstrate that the $hp$-adaptive strategy is highly efficient in terms of accuracy to compute the ground-state wave function and energy for several test problems where we observe exponential convergence.

math.NA↗

Simulation of the magnetic Ginzburg-Landau equation via vortex tracking

This paper deals with the numerical simulation of the 2D magnetic time-dependent Ginzburg-Landau (TDGL) equations in the regime of small but finite (inverse) Ginzburg-Landau parameter $ε$ and constant (order $1$ in $ε$) applied magnetic field. In this regime, a well-known feature of the TDGL equation is the appearance of quantized vortices with core size of order $ε$. Moreover, in the singular limit $ε\searrow 0$, these vortices evolve according to an explicit ODE system. In this work, we first introduce a new numerical method for the numerical integration of this limiting ODE system, which requires to solve a linear second order PDE at each time step. We also provide a rigorous theoretical justification for this method that applies to a general class of 2D domains. We then develop and analyze a numerical strategy based on the finite-dimensional ODE system to efficiently simulate the infinite-dimensional TDGL equations in the presence of a constant external magnetic field and for small, but finite, $ε$. This method allows us to avoid resolving the $ε$-scale when solving the TDGL equations, where small values of $ε$ typically require very fine meshes and time steps. We provide numerical examples on a few test cases and justify the accuracy of the method with numerical investigations. We end the paper showing that, in the mixed flow case, the limiting ODE system is able to capture the crystallization process in which, for large times, the vortices arrange into a stable pattern.

math.NA↗

Grassmanian Interpolation of Low-Pass Graph Filters: Theory and Applications

Low-pass graph filters are fundamental for signal processing on graphs and other non-Euclidean domains. However, the computation of such filters for parametric graph families can be prohibitively expensive as computation of the corresponding low-frequency subspaces, requires the repeated solution of an eigenvalue problem. We suggest a novel algorithm of low-pass graph filter interpolation based on Riemannian interpolation in normal coordinates on the Grassmann manifold. We derive an error bound estimate for the subspace interpolation and suggest two possible applications for induced parametric graph families. First, we argue that the temporal evolution of the node features may be translated to the evolving graph topology via a similarity correction to adjust the homophily degree of the network. Second, we suggest a dot product graph family induced by a given static graph which allows to infer improved message passing scheme for node classification facilitated by the filter interpolation.

cs.LG↗

A multipoint perturbation formula for eigenvalue problems

Standard perturbation theory of eigenvalue problems consists of obtaining approximations of eigenmodes in the neighborhood of an operator where the corresponding eigenmode is known. Nevertheless, if the corresponding eigenmodes of several nearby operators are known, standard perturbation theory cannot simultaneously use all this knowledge to provide a better approximation. We derive a resolvent formula enabling such an approximation result, and provide numerical examples for which this method is more competitive than standard perturbation theory.

math-ph↗

Approximations of the Iterative Stockholder Analysis scheme using exponential basis functions

In this work, we introduce several approximations of the Iterative Stockholder Analysis (ISA) method based on exponential basis functions. These approximations are categorized into linear and non-linear models, referred to as LISA and NLIS, respectively. By particular choices of hyperparameters in the NLIS model, both LISA and the Minimal-Basis Iterative Stockholder (MBIS) method can be reproduced. Four LISA variants are constructed using systematically generated exponential basis functions derived from the NLIS model applied to atomic systems. The performance of these LISA variants and NLIS models is benchmarked on 15 small molecules, including neutral, anionic, and cationic species. To facilitate comparison, we propose several metrics designed to highlight differences between the methods. Our results demonstrate that LISA, employing Gaussian basis functions derived from the NLIS model on isolated atomic systems, achieves an optimal balance of computational accuracy, robustness, and efficiency, particularly in minimizing the objective function.

physics.chem-ph↗

On reduced basis methods for eigenvalue problems, and on its coupling with perturbation theory

In this article, we study eigenvalue problems associated to self-adjoint operators and their approximation obtained by subspace projection, as used in the reduced basis method for instance. We provide error bounds between the exact eigenmodes and the approximated ones and also consider degenerate cases in the analysis. When the operator depends on a parameter, we apply the bounds assuming that the reduced space contains the derivatives of the eigenfunction with respect to the parameter. Finally, we provide some numerical examples that reflect the analytical results.

math-ph↗

A symmetry-preserving and transferable representation for learning the Kohn-Sham density matrix

The Kohn-Sham (KS) density matrix is one of the most essential properties in KS density functional theory (DFT), from which many other physical properties of interest can be derived. In this work, we present a parameterized representation for learning the mapping from a molecular configuration to its corresponding density matrix using the Atomic Cluster Expansion (ACE) framework, which preserves the physical symmetries of the mapping, including isometric equivariance and Grassmannianity. Trained on several typical molecules, the proposed representation is shown to be systematically improvable with the increase of the model parameters and is transferable to molecules that are not part of and even more complex than those in the training set. The models generated by the proposed approach are illustrated as being able to generate reasonable predictions of the density matrix to either accelerate the DFT calculations or to provide approximations to some properties of the molecules.

physics.chem-ph↗

Fully guaranteed and computable error bounds on the energy for periodic Kohn-Sham equations with convex density functionals

In this article, we derive fully guaranteed error bounds for the energy of convex nonlinear mean-field models. These results apply in particular to Kohn-Sham equations with convex density functionals, which includes the reduced Hartree-Fock (rHF) model, as well as the Kohn-Sham model with exact exchange-density functional (which is unfortunately not explicit and therefore not usable in practice). We then decompose the obtained bounds into two parts, one depending on the chosen discretization and one depending on the number of iterations performed in the self-consistent algorithm used to solve the nonlinear eigenvalue problem, paving the way for adaptive refinement strategies. The accuracy of the bounds is demonstrated on a series of test cases, including a Silicon crystal and an Hydrogen Fluoride molecule simulated with the rHF model and discretized with planewaves. We also show that, although not anymore guaranteed, the error bounds remain very accurate for a Silicon crystal simulated with the Kohn-Sham model using nonconvex exchangecorrelation functionals of practical interest.

math.NA↗

Trace estimates for harmonic functions along circular arcs with applications to domain decomposition on overlapping disks

In this paper we derive several (and in many cases sharp) estimates for the $\mathrm{L}^2$-trace norm of harmonic functions along circular arcs. More precisely, we obtain geometry-dependent estimates on the norm, spectral radius, and numerical range of the Dirchlet-to-Dirichlet (DtD) operator sending data on the boundary of the disk to the restriction of its harmonic extension along circular arcs inside the disk. The estimates we derive here have applications in the convergence analysis of the Schwarz domain decomposition method for overlapping disks in two dimensions. In particular, they allow us to establish a rigorous convergence proof for the discrete parallel Schwarz method applied to the Conductor-like Screening Model (COSMO) from theoretical chemistry in the two-disk case, and to derive error estimates with respect to the discretization parameter, the number of Schwarz iterations, and the geometry of the domain. Our analysis addresses challenges beyond classical domain decomposition theory, especially the weak enforcement of boundary conditions.

math.AP↗