DPDaniel Peterseim

Daniel Peterseim

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Daniel Peterseim has a total of 99 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Quantum Sampling and Moment Estimation for Transformed Gaussian Random Fields

    by Matthias Deiml, Daniel Peterseim

    We present a quantum algorithm for efficiently sampling transformed Gaussian random fields in [Formula: see text]-dimensional domains, based on an enhanced version of the classical moving average method. Pointwise transformations enforcing boundedness are essential for using Gaussian random fields in quantum computation and arise naturally, for example, in modeling coefficient fields representing microstructures in partial differential equations. Generating this microstructure from its few statistical parameters directly on the quantum device bypasses the input bottleneck. Our method enables an efficient quantum representation of the resulting random field and prepares a quantum state that approximates it to accuracy [Formula: see text] in time [Formula: see text]. Combined with amplitude estimation and a quantum pseudorandom number generator, this leads to algorithms for estimating linear and nonlinear observables, including mixed and higher-order moments, with total complexity [Formula: see text]. We illustrate the theoretical findings through numerical experiments on simulated quantum hardware.

  • Metric-Driven Numerical Methods

    by Patrick Henning, Laura Huynh, Daniel Peterseim

  • Hierarchical Superlocalized Orthogonal Decomposition Method

    by José C. Garay, Hannah Mohr, Daniel Peterseim, Christoph Zimmer

    We present the construction of a sparse-compressed operator that approximates the solution operator of elliptic PDEs with rough coefficients. To derive the compressed operator, we construct a hierarchical basis of an approximate-solution space, with superlocalized basis functions that are quasi-orthogonal across hierarchy levels with respect to the inner product induced by the energy norm. The superlocalization is achieved through a novel variant of the superlocalized orthogonal decomposition method that is built on corrections of basis functions arising from the localized orthogonal decomposition method. The hierarchical basis not only induces a sparse compression of the solution space but also enables an orthogonal multiresolution decomposition of the approximate-solution operator, decoupling scales and solution contributions of each level of the hierarchy. With this decomposition, the solution of the PDE reduces to the solution of a set of independent linear systems with mesh-independent condition numbers (one system per level) that can be computed simultaneously. We present an accuracy study of the compressed solution operator as well as numerical results illustrating our theoretical findings and beyond, revealing that desired optimal error rates with well-behaved superlocalized basis functions can still be attained even in the challenging case of coefficients with high-contrast channels.

  • Open Access

    Positivity preserving finite element method for the Gross–Pitaevskii ground state: discrete uniqueness and global convergence

    by Moritz Hauck, Yizhou Liang, Daniel Peterseim

    We propose a positivity preserving finite element discretization for the nonlinear Gross–Pitaevskii eigenvalue problem. The method employs mass lumping techniques, which allow to transfer the uniqueness up to sign and positivity properties of the continuous ground state to the discrete setting. We further prove that every non-negative discrete excited state up to sign coincides with the discrete ground state. This allows one to identify the limit of fully discretized gradient flows, which are typically used to compute the discrete ground state, and thereby establish their global convergence. Furthermore, we perform a rigorous a priori error analysis of the proposed non-standard finite element discretization, showing optimal orders of convergence for all unknowns. Numerical experiments illustrate the theoretical results of this paper.


  • Open Access

    Neural Network Localized Orthogonal Decomposition for Numerical Homogenization of Diffusion Operators with Random Coefficients

    by Fabian Kröpfl, Daniel Peterseim, Elisabeth Ullmann

    This paper presents a neural network--enhanced surrogate modeling approach for diffusion problems with spatially varying random field coefficients. The method builds on numerical homogenization, which compresses fine-scale coefficients into coarse-scale surrogates without requiring periodicity. To overcome computational bottlenecks, we train a neural network to map fine-scale coefficient samples to effective coarse-scale information, enabling the construction of accurate surrogates at the target resolution. This framework allows for the fast and efficient compression of new coefficient realizations, thereby ensuring reliable coarse models and supporting scalable computations for large ensembles of random coefficients. We demonstrate the efficacy of our approach through systematic numerical experiments for two classes of coefficients, emphasizing the influence of coefficient contrast: (i) lognormal diffusion coefficients, a standard model for uncertain subsurface structures in geophysics, and (ii) hierarchical Gaussian random fields with random correlation lengths.

  • Open Access

    Neural Network Acceleration of Iterative Methods for Nonlinear Schrödinger Eigenvalue Problems

    by Daniel Peterseim, Jan-F. Pietschmann, Jonas Püschel, Kilian Ruess

    We present a novel approach to accelerate iterative methods to solve nonlinear Schrödinger eigenvalue problems using neural networks. Nonlinear eigenvector problems are fundamental in quantum mechanics and other fields, yet conventional solvers often suffer from slow convergence in extreme parameter regimes, as exemplified by the rotating Bose- Einstein condensate (BEC) problem. Our method uses a neural network to predict and refine solution trajectories, leveraging knowledge from previous simulations to improve convergence speed and accuracy. Numerical experiments demonstrate significant speed-up over classical solvers, highlighting both the strengths and limitations of the approach.

  • Riemannian optimization methods for ground states of multicomponent Bose–Einstein condensates

    by Robert Altmann, Martin Hermann, Daniel Peterseim, Tatjana Stykel

    This paper addresses the computation of ground states of multicomponent Bose–Einstein condensates, defined as the global minimizer of an energy functional on an infinite-dimensional generalised oblique manifold. We establish the existence of the ground state, prove its uniqueness up to scaling and characterize it as the solution to a coupled nonlinear eigenvector problem. By equipping the manifold with several Riemannian metrics, we introduce a suite of Riemannian gradient descent and Riemannian Newton methods. Metrics that incorporate first- or second-order information about the energy are particularly advantageous, effectively preconditioning the resulting methods. For a Riemannian gradient descent method with an energy-adaptive metric, we provide a qualitative global and quantitative local convergence analysis, confirming its reliability and robustness with respect to the choice of the spatial discretization. Numerical experiments highlight the computational efficiency of both the Riemannian gradient descent and Newton methods.


  • Open Access

    Energy-Adaptive Riemannian Conjugate Gradient Method for Density Functional Theory

    by Daniel Peterseim, Jonas Püschel, Tatjana Stykel

    This paper presents a novel Riemannian conjugate gradient method for the Kohn-Sham energy minimization problem in density functional theory (DFT), with a focus on non-metallic crystal systems. We introduce an energy-adaptive metric that preconditions the Kohn-Sham model, significantly enhancing optimization efficiency. Additionally, a carefully designed shift strategy and several algorithmic improvements make the implementation comparable in performance to highly optimized self-consistent field iterations. The energy-adaptive Riemannian conjugate gradient method has a sound mathematical foundation, including stability and convergence, offering a reliable and efficient alternative for DFT-based electronic structure calculations in computational chemistry.