Search NASA⌕ Search

SEARCH · Search NASA

Results for “exponential convergence”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Tensor Network Space-Time Spectral Collocation Method for Time-Dependent Convection-Diffusion-Reaction Equations

Emerging tensor network techniques for solutions of partial differential equations (PDEs), known for their ability to break the curse of dimensionality, deliver new mathematical methods for ultra-fast numerical solutions of high-dimensional problems. Here, we introduce a Tensor Train (TT) Chebyshev spectral collocation method, in both space and time, for the solution of the time-dependent convection-diffusion-reaction (CDR) equation with inhomogeneous boundary conditions, in Cartesian geometry. Previous methods for numerical solution of time-dependent PDEs often used finite difference for time, and a spectral scheme for the spatial dimensions, which led to a slow linear convergence. Spectral collocation space-time methods show exponential convergence; however, for realistic problems they need to solve large four-dimensional systems. We overcome this difficulty by using a TT approach, as its complexity only grows linearly with the number of dimensions. We show that our TT space-time Chebyshev spectral collocation method converges exponentially, when the solution of the CDR is smooth, and demonstrate that it leads to a very high compression of linear operators from terabytes to kilobytes in TT-format, and a speedup of tens of thousands of times when compared to a full-grid space-time spectral method. These advantages allow us to obtain the solutions at much higher resolutions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Convergence analysis for a nonlocal gradient descent method via directional Gaussian smoothing

We analyze the convergence of a nonlocal gradient descent method for minimizing a class of high-dimensional non-convex functions, where a directional Gaussian smoothing (DGS) is proposed to define the nonlocal gradient (also referred to as the DGS gradient). The method was first proposed in [Zhang et al., Enabling long-range exploration in minimization of multimodal functions, UAI 2021], in which multiple numerical experiments showed that replacing the traditional local gradient with the DGS gradient can help the optimizers escape local minima more easily and significantly improve their performance. However, a rigorous theory for the efficiency of the method on nonconvex landscape is lacking. In this work, we investigate the scenario where the objective function is composed of a convex function, perturbed by deterministic oscillating noise. We provide a convergence theory under which the iterates exponentially converge to a tightened neighborhood of the solution, whose size is characterized by the noise wavelength. Here, we also establish a correlation between the optimal values of the Gaussian smoothing radius and the noise wavelength, thus justifying the advantage of using moderate or large smoothing radii with the method. Furthermore, if the noise level decays to zero when approaching the global minimum, we prove that DGS-based optimization converges to the exact global minimum with linear rates, similarly to standard gradient-based methods in optimizing convex functions. Several numerical experiments are provided to confirm our theory and illustrate the superiority of the approach over those based on the local gradient.

Tran, Hoang [Oak Ridge National Laboratory (ORNL),↗
DOE OSTI2020

Fibonacci fast convergence for neutrino oscillations in matter

Understanding neutrino oscillations in matter requires a non-trivial diagonalization of the Hamiltonian. As the exact solution is very complicated, many approximation schemes have been pursued. Here we show that one scheme, systematically applying rotations to change to a better basis, converges exponentially fast wherein the rate of convergence follows the Fibonacci sequence. We find that the convergence rate of this procedure depends very sensitively on the initial choices of the rotations as well as the mechanism of selecting the pivots. We then apply this scheme for neutrino oscillations in matter and discover that the optimal convergence rate is found using the following simple strategy: first apply the vacuum (2-3) rotation and then use the largest off-diagonal element as the pivot for each of the following rotations. The Fibonacci convergence rate presented here may be extendable to systems beyond neutrino oscillations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

The virtual element method for linear elastodynamics models: Design, analysis, and implementation

We design the conforming virtual element method for the numerical simulation of two dimensional time-dependent elastodynamics problems. We investigate the performance of the method both theoretically and numerically. We prove the stability and the convergence of the semi-discrete approximation in the energy norm and derive optimal error estimates. We also show the convergence in the L 2 norm. The performance of the virtual element method is assessed on a set of different computational meshes, including non-convex cells up to order four in the h-refinement setting. Exponential convergence is also experimentally seen in the p-refinement setting.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

The arbitrary‐order virtual element method for linear elastodynamics models: convergence, stability and dispersion‐dissipation analysis

Abstract We design the conforming virtual element method for the numerical approximation of the two‐dimensional elastodynamics problem. We prove stability and convergence of the semidiscrete approximation and derive optimal error estimates under h ‐ and p ‐refinement in both the energy and the L 2 norms. The performance of the proposed virtual element method is assessed on a set of different computational meshes, including nonconvex cells up to order four in the h ‐refinement setting. Exponential convergence is also experimentally observed under p ‐refinement. Finally, we present a dispersion‐dissipation analysis for both the semidiscrete and fully discrete schemes, showing that polygonal meshes behave as classical simplicial/quadrilateral grids in terms of dispersion‐dissipation properties.

Antonietti, Paola F.↗
DOE OSTI2020

The arbitrary-order virtual element method for linear elastodynamics models. Convergence, stability and dispersion-dissipation analysis.

We design the conforming virtual element method for the numerical approximation of the two dimensional elastodynamics problem. We prove stability and convergence of the semi-discrete approximation and derive optimal error estimates under $\textit{h}$-refinement in both the energy and the $L^2$ norms, and optimal error estimates under $\textit{p}$-refinement in the energy norm. The performance of the proposed virtual element method is assessed on a set of different computational meshes, including non-convex cells up to order four in the h-refinement setting. Exponential convergence is also experimentally observed under p-refinement. Finally, we present a dispersion-dissipation analysis for both the semi-discrete and fully-discrete schemes, showing that polygonal meshes behave as classical simplicial/quadrilateral grids in terms of dispersion-dissipation properties.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Scalable Circuits for Preparing Ground States on Digital Quantum Computers: The Schwinger Model Vacuum on 100 Qubits

The vacuum of the lattice Schwinger model is prepared on up to 100 qubits of IBM’s Eagle-processor quantum computers. A new algorithm to prepare the ground state of a gapped translationally invariant system on a quantum computer is presented, which we call “scalable circuits ADAPT-VQE” (SC-ADAPT-VQE). This algorithm uses the exponential decay of correlations between distant regions of the ground state, together with ADAPT-VQE, to construct quantum circuits for state preparation that can be scaled to arbitrarily large systems. These scalable circuits can be determined with use of classical computers, avoiding the challenging task of optimizing parameterized circuits on a quantum computer. SC-ADAPT-VQE is applied to the Schwinger model, and is shown to be systematically improvable, with an accuracy that converges exponentially with circuit depth. Both the structure of the circuits and the deviations of prepared wave functions are found to become independent of the number of spatial sites, L . This allows a controlled extrapolation of the circuits, determined with use of small or modest-sized systems, to arbitrarily large L . The circuits for the Schwinger model are determined on lattices up to L = 14 (28 qubits) with the Qiskit classical simulator, and are subsequently scaled up to prepare the L = 50 (100 qubits) vacuum on IBM’s 127-superconducting-qubit quantum computers ibm_brisbane and ibm_cusco. After introduction of an improved error-mitigation technique, which we call “operator decoherence renormalization”, the chiral condensate and charge-charge correlators obtained from the quantum computers are found to be in good agreement with classical matrix product state simulations. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

High-Accuracy Mesh-Free Quadrature for Trimmed Parametric Surfaces and Volumes

This work presents a high-accuracy, mesh-free, generalized Stokes theorem-based numerical quadrature scheme for integrating functions over trimmed parametric surfaces and volumes. The algorithm relies on two fundamental steps: (1) We iteratively reduce the dimensionality of integration using the generalized Stokes theorem to line integrals over trimming curves, and (2) we employ numerical antidifferentiation in the generalized Stokes theorem using high-order quadrature rules. Additionally, the scheme achieves exponential convergence up to trimming curve approximation error and has applications to computation of geometric moments, immersogeometric analysis, conservative field transfer between high-order curvilinear meshes, and initialization of multi-material simulations. We compare the quadrature scheme to commonly-used quadrature schemes in the literature and show that our scheme is much more efficient in terms of number of quadrature points used. We provide an open-source implementation of the scheme in MATLAB as part of QuaHOG, a software package for Quadrature of High-Order Geometries.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

The DESC stellarator code suite. Part 1. Quick and accurate equilibria computations

Three-dimensional equilibrium codes are vital for stellarator design and operation, and high-accuracy equilibria are also necessary for stability studies. This paper details comparisons of two three-dimensional equilibrium codes: VMEC, which uses a steepest-descent algorithm to reach a minimum-energy plasma state, and DESC, which minimizes the magnetohydrodynamic (MHD) force error in real space directly. Accuracy as measured by satisfaction of MHD force balance is presented for each code, along with the computation time. It is shown that DESC is able to achieve more accurate solutions, especially near axis. The importance of higher-accuracy equilibria is shown in DESC's better agreement of stability metrics with asymptotic formulae. DESC's global Fourier–Zernike basis also yields solutions with analytic derivatives explicitly everywhere in the plasma volume, provides improved accuracy in the radial direction versus conventional finite differences and allows for exponential convergence. Further, DESC can compute a solution with the same accuracy as VMEC in order-of-magnitude less time.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

Systematically localizable operators for quantum simulations of quantum field theories

Correlations and measures of entanglement in ground-state wave functions of relativistic quantum field theories are spatially localized over length scales set by the mass of the field. We utilize this localization to design digital quantum circuits for preparing the ground states of lattice scalar quantum field theories. Controlled rotations that are exponentially localized in their position-space extent are found to provide exponentially convergent wave function fidelity. These angles scale with the correlation between sites and the classical two-point correlation function, as opposed to the more localized mutual information or the hyperlocalized (1×1)-site negativity. We anticipate that further investigations will uncover quantum circuit designs with controlled rotations dictated by the measures of entanglement. This work is expected to impact quantum simulations of systems of importance to nuclear physics, high-energy physics, and basic energy sciences research.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Truncation effects in the charge representation of the O(2) model

The O(2) model in Euclidean space-time is the zero-gauge-coupling limit of the compact scalar quantum electrodynamics. In this work, we obtain a dual representation of it called the charge representation. We study the quantum phase transition in the charge representation with a truncation to “spin $\textit{S}$," where the quantum numbers have an absolute value less than or equal to $\textit{S}$. The charge representation preserves the gapless-to-gapped phase transition even for the smallest spin truncation $\textit{S}$ = 1. The phase transition for $\textit{S}$ = 1 is an infinite-order Gaussian transition with the same critical exponents $\textit{δ}$ and $\textit{η}$ as the Berezinskii-Kosterlitz-Thouless (BKT) transition, while there are true BKT transitions for $\textit{S}$ ≥ 2 . The essential singularity in the correlation length for $\textit{S}$ = 1 is different from that for $\textit{S}$ ≥ 2 . The exponential convergence of the phase-transition point is studied in both Lagrangian and Hamiltonian formulations. We discuss the effects of replacing the truncated $\hat{U}^±$ = exp ($± i\hat{θ}$) operators by the spin ladder operators $\hat{S}^±$ in the Hamiltonian. The marginal operators vanish at the Gaussian transition point for $\textit{S}$ = 1, which allows us to extract the $\textit{η}$ exponent with high accuracy.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Tunable-fidelity wave functions for the ab initio description of scattering and reactions

Here, the no-core shell model (NCSM) is an ab initio method that solves the nuclear many-body problem by expanding the many-particle wave function into a (typically) harmonic oscillator basis and minimizing the energy to obtain the expansion coefficients. Extensions of the NCSM, such as its coupling with microscopic-cluster basis states, further allow for an ab initio treatment of light-ion nuclear reactions of interest for both astrophysics and nuclear technology applications. A downside of the method is the exponential scaling of the basis size with increasing number of nucleons and excitation quanta, which limits its applicability to mass A ≲ 16 nuclei, except for variants where the basis is further down-selected via some truncation scheme. We consider a basis selection method for the NCSM that was first introduced in the context of the large-scale shell model and captures the essential degrees of freedom of the nuclear wave function leading to a favorable complexity scaling for calculations and enabling ab initio reaction calculations in sd-shell nuclei. The particle configurations within the NCSM basis are ordered based on their contribution to the first moment of the Hamiltonian matrix that results from the projection onto the many-body basis. The truncation scheme then consists in retaining only the lowest-first-moment configurations, which typically contain only few many-body basis states (Slater determinants). As the energy threshold above which configurations are disregarded is increased, the size of the basis becomes an almost-continuous variable, allowing for tunable fidelity in the obtained wave functions. The resulting wave functions can then be used directly in ab initio reaction calculations. We present calculations for 7 Li and n + 12 C scattering using nucleon-nucleon interactions derived from chiral effective field theory and softened using the similarity renormalization group method. The obtained energy levels invariably demonstrate exponential convergence with the size of the basis, and we find improved convergence in scattering calculations. To demonstrate the possibilities enabled by the approach, we also present a first calculation for the scattering of neutrons from 24 Mg. The method presented in this work appears promising for future studies of nuclei with mass A > 16, opening multiple future research directions impacting both nuclear astrophysics and nuclear technology applications.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Quantum simulations of hadron dynamics in the Schwinger model using 112 qubits

Hadron wave packets are prepared and time evolved in the Schwinger model using 112 qubits of IBM’s 133-qubit Heron quantum computer ibm_torino. The initialization of the hadron wave packet is performed in two steps. First, the vacuum is prepared across the whole lattice using the recently developed SC-ADAPT-VQE algorithm and workflow. SC-ADAPT-VQE is then extended to the preparation of localized states, and used to establish a hadron wave packet on top of the vacuum. This is done by adaptively constructing low-depth circuits that maximize the overlap with an adiabatically prepared hadron wave packet. Due to the localized nature of the wavepacket, these circuits can be determined on a sequence of small lattices using classical computers, and then robustly scaled to prepare wave packets on large lattices for simulations using quantum computers. Time evolution is implemented with a second-order Trotterization. To reduce both the required qubit connectivity and circuit depth, an approximate quasilocal interaction is introduced. This approximation is made possible by the emergence of confinement at long distances, and converges exponentially with increasing distance of the interactions. Using multiple error-mitigation strategies, up to 14 Trotter steps of time evolution are performed, employing 13,858 two-qubit gates (with a CNOT depth of 370). The propagation of hadrons is clearly identified, with results that compare favorably with Matrix Product State simulations. Finally, prospects for a near-term quantum advantage in simulations of hadron scattering are discussed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Counterdiabatic Driving with Performance Guarantees

Counterdiabatic (CD) driving has the potential to speed up adiabatic quantum state preparation by suppressing unwanted excitations. However, existing approaches either require intractable classical computations or are based on approximations that do not have performance guarantees. We propose and analyze a nonvariational, system-agnostic CD expansion method and analytically show that it converges exponentially quickly in the expansion order. In finite systems, the required resources scale inversely with the spectral gap, which we argue is asymptotically optimal. To extend our method to the thermodynamic limit and suppress errors stemming from high-frequency transitions, we leverage finite-time adiabatic protocols. In particular, we show that a time determined by the quantum speed limit is sufficient to prepare the desired ground state, without the need to optimize the adiabatic trajectory. Numerical tests of our method on the quantum Ising chain show that our method can outperform state-of-the-art variational CD approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

A Trajectory-Driven Algorithm for Differentiating SRB Measures on Unstable Manifolds

Sinai-Ruelle-Bowen (SRB) measures are limiting stationary distributions describing the statistical behavior of chaotic dynamical systems. Directional derivatives of SRB measure densities conditioned on unstable manifolds are critical in the sensitivity analysis of hyperbolic chaos. These derivatives, known as the SRB density gradients, are by-products of the regularization of Lebesgue integrals appearing in the original linear response expression. In this paper, we propose a novel trajectory- driven algorithm for computing the SRB density gradient defined for systems with high-dimensional unstable manifolds. We apply the concept of measure preservation together with the chain rule on smooth manifolds. Due to the recursive one-step nature of our derivations, the proposed procedure is memory-efficient and can be naturally integrated with existing Monte Carlo schemes widely used in computational chaotic dynamics. Here, we numerically show the exponential convergence of our scheme, analyze the computational cost, and present its use in the context of Monte Carlo integration.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Space-Split Algorithm for Sensitivity Analysis of Discrete Chaotic Systems With Multidimensional Unstable Manifolds

Accurate approximations of the change of a system's output and its statistics with respect to the input are highly desired in computational dynamics. Ruelle's linear response theory provides breakthrough mathematical machinery for computing the linear response of chaotic dynamical systems. In this paper, we propose an algorithm for sensitivity analysis of discrete chaos with an arbitrary number of positive Lyapunov exponents. We combine the concept of perturbation space-splitting, which regularizes Ruelle's original expression, together with measure-based parameterization of the expanding subspace. We use these tools to rigorously derive trajectory-following recursive relations that converge exponentially fast, and construct a memory-efficient Monte Carlo scheme for derivatives of the output statistics. Thanks to the regularization and lack of simplifying assumptions on the system's behavior, our method is immune to the common problems of other popular methods such as the exploding tangent solutions and unphysical shadowing directions. Here, we provide a ready-to-use algorithm, analyze its complexity, and demonstrate several numerical examples of sensitivity computation using physically-inspired low-dimensional systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A Low-Rank QTT-based Finite Element Method for Elasticity Problems

We present an efficient and robust numerical algorithm for solving the linear elasticity problem that combines the Quantized Tensor Train format and a domain partitioning strategy. This approach makes it possible to solve the linear elasticity problem on a computational domain that is more general than a square. By integrating Z-ordering and subdomain concatenation, our method substantially decreases memory usage and achieves a notable reduction in rank compared to established Finite Element implementations like the FEniCS platform. This efficiency is maintained while still guaranteeing exponential convergence with respect to the number of degrees of freedom. This performance gain, however, requires a fundamental rethinking of how core finite element operations are implemented. This includes changes to mesh discretization, node and degree of freedom ordering, stiffness matrix and internal nodal force assembly, and the execution of algebraic matrix-vector operations. In this work, we discuss all these aspects in detail and assess the method’s performance in the numerical approximation of three representative test cases.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Magnitude and timescale of liquid water path adjustments to cloud droplet number concentration perturbations for nocturnal non-precipitating marine stratocumulus

Cloud liquid water path (L) adjusts to perturbations in cloud droplet number concentration (N) over time. We explore the magnitude and timescale of this adjustment in nocturnal non-precipitating marine stratocumuli using large eddy simulations of baseline conditions and aerosol seeding experiments for 22 meteorological conditions. The results confirm that the L adjustment (δL) slope (k) is more negative for simulation pairs with relatively low N and less negative for high N. Overall, k is unlikely to be lower than −0.4 within 24 h of seeding start, meaning the L adjustment is unlikely to fully offset the brightening due to the Twomey effect. After seeding, the δL becomes increasingly negative, which can be characterized by an exponential convergence. This evolution is governed by a short timescale around 5 h and lasts for around 8–12 h. It is driven by the feedback between entrainment, L, and boundary layer (BL) turbulence. Other processes, including radiation, surface fluxes, and subsidence, respond to the seeding weakly. This short timescale is insensitive to the amount of seeding, making the evolution of δL and some other deviations similar for different seeding amounts after appropriate scaling. The timescale of k evolution is closely related to the δL timescale and hence also short, while it could also be affected by the δN evolution. The results are most relevant to conditions where seeding is applied to a large area of marine stratocumulus in well-mixed and overcast BL where shear is not a primary source of turbulence.

54 ENVIRONMENTAL SCIENCES↗