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 37 records · Page 2

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

Numerical analysis of spectral properties of coupled oscillator Schroedinger operators. I - Single and double well anharmonic oscillators

Several methods for computing many eigenvalues and eigenfunctions of a single anharmonic oscillator Schroedinger operator whose potential may have one or two minima are described. One of the methods requires the solution of an ill-conditioned generalized eigenvalue problem. This method has the virtue of using a bounded amount of work to achieve a given accuracy in both the single and double well regions. Rigorous bounds are given, and it is proved that the approximations converge faster than any inverse power of the size of the matrices needed to compute them. The results of computations for the g:phi(4):1 theory are presented. These results indicate that the methods actually converge exponentially fast.

Isaacson, D.↗

Dissociative recombination of O2(+), NO(+) and N2(+)

A new L(2) approach for the calculation of the threshold molecular capture width needed for the determination of DR cross sections was developed. The widths are calculated with Fermi's golden rule by substituting Rydberg orbitals for the free electron continuum coulomb orbital. It is shown that the calculated width converges exponentially as the effective principal quantum number of the Rydberg orbital increases. The threshold capture width is then easily obtained. Since atmospheric recombination involves very low energy electrons, the threshold capture widths are essential to the calculation of DR cross sections for the atmospheric species studied here. The approach described makes use of bound state computer codes already in use. A program that collects width matrix elements over CI wavefunctions for the initial and final states is described.

Guberman, S. L.↗

Simple robust control laws for robot manipulators. Part 1: Non-adaptive case

A new class of exponentially stabilizing control laws for joint level control of robot arms is introduced. It has been recently recognized that the nonlinear dynamics associated with robotic manipulators have certain inherent passivity properties. More specifically, the derivation of the robotic dynamic equations from the Hamilton's principle gives rise to natural Lyapunov functions for control design based on total energy considerations. Through a slight modification of the energy Lyapunov function and the use of a convenient lemma to handle third order terms in the Lyapunov function derivatives, closed loop exponential stability for both the set point and tracking control problem is demonstrated. The exponential convergence property also leads to robustness with respect to frictions, bounded modeling errors and instrument noise. In one new design, the nonlinear terms are decoupled from real-time measurements which completely removes the requirement for on-line computation of nonlinear terms in the controller implementation. In general, the new class of control laws offers alternatives to the more conventional computed torque method, providing tradeoffs between robustness, computation and convergence properties. Furthermore, these control laws have the unique feature that they can be adapted in a very simple fashion to achieve asymptotically stable adaptive control.

Wen, J. T.↗

Control of the errors of discretization and idealization in finite element analysis

Understanding of the basic principles which control errors of discretization in finite element analysis has increased very substantially since 1980. The main milestones were: (1) development of the theoretical basis of p-extensions (1981); (2) understanding of the proper interplay between mesh design and assignment of polynomial degree to elements. Practical realization of exponential convergence rates, independently of the smoothness of the exact solution (1984); and (3) industrial experience with the new finite element technology known as the p- or hp-version of the finite element method: General Dynamics reported thirty- to forty-fold savings in terms of human time and large savings in computer time (1986). Lockheed reported favorably on their evaluation of error estimation and quality control capabilities of the p-version in industrial settings (1987). The gains in our understanding of how to control the errors of discretization represent only half of the control necessary to ensure that a numerical model is in fact an accurate representation of the corresponding physical system. Control of the errors of idealization is equally important. A brief overview of the main ideas of how to ensure the quality and reliability of mathematical models of structural systems is presented.

Szabo, Barna A.↗

Numerical recovery of material parameters in Euler-Bernoulli beam models

A fully Sinc-Galerkin method for recovering the spatially varying stiffness parameter in fourth-order time-dependence problems with fixed and cantilever boundary conditions is presented. The forward problems are discretized with a sinc basis in both the spatial and temporal domains. This yields an approximation solution which converges exponentially and is valid on the infinite time interval. When the forward methods are applied to parameter recovery problems, the resulting inverse problems are ill-posed. Tikhonov regularization is applied and the resulting minimization problems are solved via a quasi-Newton/trust region algorithm. The L-curve method is used to determine an appropriate value of the regularization parameter. Numerical results which highlight the method are given for problems with both fixed and cantilever boundary conditions.

Smith, R. C.↗

A fully Galerkin method for the recovery of stiffness and damping parameters in Euler-Bernoulli beam models

A fully Sinc-Galerkin method for recovering the spatially varying stiffness and damping parameters in Euler-Bernoulli beam models is presented. The forward problems are discretized with a sinc basis in both the spatial and temporal domains thus yielding an approximate solution which converges exponentially and is valid on the infinite time interval. Hence the method avoids the time-stepping which is characteristic of many of the forward schemes which are used in parameter recovery algorithms. Tikhonov regularization is used to stabilize the resulting inverse problem, and the L-curve method for determining an appropriate value of the regularization parameter is briefly discussed. Numerical examples are given which demonstrate the applicability of the method for both individual and simultaneous recovery of the material parameters.

Smith, R. C.↗

Sinc-Galerkin estimation of diffusivity in parabolic problems

A fully Sinc-Galerkin method for the numerical recovery of spatially varying diffusion coefficients in linear partial differential equations is presented. Because the parameter recovery problems are inherently ill-posed, an output error criterion in conjunction with Tikhonov regularization is used to formulate them as infinite-dimensional minimization problems. The forward problems are discretized with a sinc basis in both the spatial and temporal domains thus yielding an approximate solution which displays an exponential convergence rate and is valid on the infinite time interval. The minimization problems are then solved via a quasi-Newton/trust region algorithm. The L-curve technique for determining an approximate value of the regularization parameter is briefly discussed, and numerical examples are given which show the applicability of the method both for problems with noise-free data as well as for those whose data contains white noise.

Smith, Ralph C.↗