Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Bounds”

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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Non-Hermitian Quantum Mechanics Approach for Extracting and Emulating Continuum Physics Based on Bound-State-like Calculations

Here, this Letter introduces a unified emulation framework for studying continuum physics in finite quantum systems. Using a reduced basis method, we construct powerful emulators for the inhomogeneous Schrödinger equation that operate in a combined parameter space of complex energy (𝐸) and other inputs (𝜽). Within the space, the emulators simultaneously perform analytical continuation in 𝐸—extracting continuum physics from numerically simpler bound-state-like calculations—and interpolate this entire process across 𝜽. This yields a small, non-Hermitian system whose properties (e.g., resonances and scattering observables) can be rapidly predicted for any 𝜽. Crucially, the complex-𝐸 emulation provides a pathway to compute continuum observables for complex systems where advanced bound-state methods exist but direct continuum calculations are yet to be developed, while the 𝜽 emulation enables rapid parameter-space exploration and can be adapted to accelerate other existing continuum calculations. Demonstrations with two- and three-body systems highlight the method’s effectiveness and suggest its connection to (near-)optimal rational approximation. This Letter presents the key results, with further details reserved for a companion paper.

ab initio calculations↗
DOE OSTI2025

Continuum-electron interferometry for enhancement of photoelectron circular dichroism and measurement of bound, free, and mixed contributions to chiral response

We develop photoelectron interferometry based on laser-assisted extreme ultraviolet ionization for flexible and robust control of photoelectron circular dichroism in randomly oriented chiral molecules. A comb of XUV photons ionizes a sample of chiral molecules in the presence of a time-delayed infrared or visible laser pulse promoting interferences between components of the XUV-ionized photoelectron wave packet. In striking contrast to multicolor phase control schemes relying on pulse shaping techniques, the magnitude of the resulting chiral signal is here controlled by the time delay between the XUV and laser pulses. Furthermore, we show that the relative polarization configurations of the XUV and IR fields allow for disentangling the contributions of bound and continuum states to the chiral response. Our proposal provides a simple, robust, and versatile tool for the control of photoelectron circular dichroism and experimentally feasible protocol for probing the individual contributions of bound and continuum states to the photoelectron circular dichroism in a time-resolved manner.

atomic and molecular processes in external fields↗
DOE OSTI2025

First-principles computations of the Stark shift of a defect-bound exciton: The case of the T center in silicon

The T center in silicon has recently drawn a lot of attention for its potential in quantum information science. The sensitivity of the zero-phonon line (ZPL) to electrical field was recently investigated by a combination of different experimental methods but there are still few first principles studies on the Stark shift of the T center. Dealing with the defect-bound exciton nature of the excited state is particularly challenging using density functional theory because of the large spatial delocalization associated with the wavefunction. Here, in this work, we tackle this issue by performing a convergence study over the supercell size. We obtain an exciton binding energy of 28.5 meV, in good agreement with experimental results. We then calculate the Stark shift through the dipole moment change of the ZPL transition of the T center using the modern theory of polarization formalism and find a modest linear coefficient of Δ⁢𝜇=0.79⁢D along X and Δ⁢𝜇=0.03⁢𝐷 along Y. We discuss our results in light of the recent experimental measurements of the Stark shift. Our analysis suggests that bound-exciton defects could be particularly sensitive to local field effect as a result of their large spatial extent.

color centers↗
DOE OSTI2025

Applications of the modified Hulthén-Kohn method for bound and scattering states

We adapt the Hulthén–Kohn method suggested by Efros [Phys. Rev. C 99, 034620 (2019)] for calculating various observables in the continuum and discrete spectrum using two-body interactions in single- and coupled channel systems. We explore the convergence of phase shifts and wave functions as well as the location of S-matrix poles which enables obtaining both resonance and bound state parameters. We find that employing a harmonic oscillator basis, together with an interaction smoothing scheme introduced by Gyarmati et al. [Nucl. Phys. A 326, 119 (1979)], and adopting approximate bound-state solutions for the short-range components of basis wave functions lead to good convergence even with restricted oscillator quanta accessible for modern no-core shell model codes. The adapted Efros method will facilitate ab initio many-body nuclear structure applications.

Nuclear reactions↗
DOE OSTI2024

Scalar bounded-from-below conditions from Bayesian active learning

We present a procedure leveraging Bayesian deep active learning to rapidly produce highly accurate approximate bounded-from-below conditions for arbitrary renormalizable scalar potentials, in the form of a neural network which may be saved and exported for use in arbitrary parameter space scans. We explore the performance of our procedure on three different scalar potentials with either highly nontrivial or unknown symbolic bounded-from-below conditions (the most general two-Higgs doublet model, the three-Higgs doublet model, and a version of the Georgi-Machacek model without custodial symmetry). We find that we can produce fast and highly accurate binary classifiers for all three potentials. Furthermore, for the potentials for which no known symbolic necessary and sufficient conditions on boundedness-from-below exist, our classifiers substantially outperform some common approximate analytical methods, such as producing tractable sufficient but not necessary conditions or evaluating boundedness-from-below conditions for scenarios in which only a subset of the theory’s fields achieve vacuum expectation values. Our methodology can be readily adapted to any renormalizable scalar field theory. For the community’s use, we have developed a package, BFBrain, which allows for the rapid implementation of our analysis procedure on user-specified scalar potentials with a high degree of customizability. Published by the American Physical Society 2024

Astronomy & Astrophysics↗
DOE OSTI2020

Topology-Bounded Superfluid Weight in Twisted Bilayer Graphene

While regular flat bands are good for enhancing the density of states and hence the gap, they are detrimental to the superfluid weight. We show that the predicted nontrivial topology of the two lowest flat bands of twisted bilayer graphene (TBLG) plays an important role in the enhancement of the superfluid weight and hence of superconductivity. We derive the superfluid weight (phase stiffness) of the TBLG superconducting flat bands with a uniform pairing, and show that it can be expressed as an integral of the Fubini-Study metric of the flat bands. This mirrors results already obtained for nonzero Chern number bands even though the TBLG flat bands have zero Chern number. We further show that the metric integral is lower bounded by the topological $C_{2z}T$ Wilson loop winding number of TBLG flat bands, which renders that the superfluid weight is also bounded by this topological index. In contrast, trivial flat bands have a zero superfluid weight. The superfluid weight is crucial in determining the Berezinskii-Kosterlitz-Thouless transition temperature of the superconductor. Based on the transition temperature measured in TBLG experiments, we estimate the topological contribution of the superfluid weight in TBLG.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

Charged-Particle Bound States in Periodic Boxes

We consider the binding energy of a two-body system with a repulsive Coulomb interaction in a finite periodic volume. We define the finite-volume Coulomb potential as the usual Coulomb potential, except that the distance is defined the shortest separation between the two bodies in the periodic volume. We investigate this problem in one and three-dimensional periodic boxes and derive the asymptotic behavior of the volume dependence for bound states with zero angular momentum in terms of Whittaker functions. We benchmark our results against numerical calculations and show how the method can be used to extract asymptotic normalization coefficients for charged-particle bound states. Furthermore, the results we derive here have immediate applications for calculations of atomic nuclei in finite periodic volumes for the case where the leading finite-volume correction is associated with two charged clusters.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Shallow Bound States and Hints for Broad Resonances with Quark Content b ¯ c ¯ u d in B − D ¯ and B * − D ¯ Scattering from Lattice QCD

We present the first determination of the energy dependence of the B − D ¯ and B * − D ¯ isospin-0, S -wave scattering amplitudes both below and above the thresholds using lattice QCD, which allows us to investigate rigorously whether mixed bottom-charm b ¯ c ¯ u d tetraquarks exist as bound states or resonances. The scattering phase shifts are obtained using Lüscher’s method from the energy spectra in two different volumes. To ensure that no relevant energy level is missed, we use large, symmetric 7 × 7 and 8 × 8 correlation matrices that include, at both source and sink, B ( * ) − D ¯ scattering operators with the lowest three or four possible back-to-back momenta in addition to local b ¯ c ¯ u d operators. We fit the energy dependence of the extracted scattering phase shifts using effective-range expansions. We observe sharp peaks in the B ( * ) − D ¯ scattering rates close to the thresholds, which are associated with shallow bound states, either genuine or virtual, a few MeV or less below the B ( * ) − D ¯ thresholds. In addition, we find hints for resonances with masses of order 100 MeV above the thresholds and decay widths of order 200 MeV. Published by the American Physical Society 2024

Alexandrou, Constantia↗
DOE OSTI2025

Lower bounds on entanglement entropy without twin copy

We discuss the possibility of estimating experimentally the von Neumann entanglement entropy S A v N of a symmetric bipartite quantum system A B by using the basic measurement counts (bitstrings) for a single copy of a prepared state. Using exact diagonalization and analog simulations performed with the publicly available QuEra facilities for chains and ladders of Rydberg atoms, we calculate the Shannon entropy S A B X associated with the bitstrings of adiabatically prepared ground states and the reduced entropies S A X and S B X obtained from the marginal probabilities in A and B . We then calculate the classical mutual information I A B X = S A X + S B X − S A B X , which is a lower bound on S A v N . We show that for a broad range of lattice spacing and detuning, I A B X is typically 20% below S A v N in regions where S A v N is large and a less close bound in regions where S A v N is low. We argue that this use of the easily available bitstrings provides a robust and efficient way to explore empirically the phase diagram of qubit-based quantum simulators and identify critical regions. Published by the American Physical Society 2025

Meurice, Yannick (ORCID:0000000209959694)↗
DOE OSTI2022

Tight Bounds on the Convergence of Noisy Random Circuits to the Uniform Distribution

We study the properties of output distributions of noisy random circuits. We obtain upper and lower bounds on the expected distance of the output distribution from the “useless” uniform distribution. These bounds are tight with respect to the dependence on circuit depth. Our proof techniques also allow us to make statements about the presence or absence of anticoncentration for both noisy and noiseless circuits. We uncover a number of interesting consequences for hardness proofs of sampling schemes that aim to show a quantum computational advantage over classical computation. Specifically, we discuss recent barrier results for depth-agnostic and/or noise-agnostic proof techniques. We show that in certain depth regimes, noise-agnostic proof techniques might still work in order to prove an often-conjectured claim in the literature on quantum computational advantage, contrary to what has been thought prior to this work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Crystal structure of vancomycin bound to the resistance determinant D -alanine- D -serine

Vancomycin is a glycopeptide antibiotic that for decades has been a mainstay of treatment for persistent bacterial infections. However, the spread of antibiotic resistance threatens its continued utility. In particular, vancomycin-resistant enterococci (VRE) have become a pressing clinical challenge. Vancomycin acts by binding and sequestering the intermediate Lipid II in cell-wall biosynthesis, specifically recognizing a D-alanine-D-alanine dipeptide motif within the Lipid II molecule. VRE achieve resistance by remodeling this motif to either D-alanine-D-lactate or D-alanine-D-serine; the former substitution essentially abolishes recognition by vancomycin of Lipid II, whereas the latter reduces the affinity of the antibiotic by roughly one order of magnitude. The complex of vancomycin bound to D-alanine-D-serine has been crystallized, and its 1.20 Å X-ray crystal structure is presented here. This structure reveals that the D-alanine-D-serine ligand is bound in essentially the same position and same pose as the native D-alanine-D-alanine ligand. The serine-containing ligand appears to be slightly too large to be comfortably accommodated in this way, suggesting one possible contribution to the reduced binding affinity. In addition, two flexible hydroxyl groups – one from the serine side chain of the ligand, and the other from a glucose sugar on the antibiotic – are locked into single conformations in the complex, which is likely to contribute an unfavorable entropic component to the recognition of the serine-containing ligand.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Optimizing Error-Bounded Lossy Compression for Scientific Data on GPUs

Error-bounded lossy compression is a critical technique for significantly reducing scientific data volumes. With ever-emerging heterogeneous high-performance computing (HPC) architecture, GPU-accelerated error-bounded compressors (such as CUSZ and cuZFP) have been developed. However, they suffer from either low performance or low compression ratios. To this end, we propose CUSZ+ to target both high compression ratios and throughputs. We identify that data sparsity and data smoothness are key factors for high compression throughputs. Our key contributions in this work are fourfold: (1) We propose an efficient compression workflow to adaptively perform run-length encoding and/or variable-length encoding. (2) We derive Lorenzo reconstruction in decompression as multidimensional partial-sum computation and propose a fine-grained Lorenzo reconstruction algorithm for GPU architectures. (3) We carefully optimize each of CUSZ kernels by leveraging state-of-the-art CUDA parallel primitives. (4) We evaluate CUSZ+ using seven real-world HPC application datasets on V100 and A100 GPUs. Experiments show CUSZ+ improves the compression throughputs and ratios by up to 18.4x and 5.3x, respectively, over CUSZ on the tested datasets.

Tian, Jiannan↗
DOE OSTI2022

Bounds on Optimal Revisit Times in Persistent Monitoring Missions With a Distinct and Remote Service Station</strong

We report persistent monitoring missions require an up-to-date knowledge of the changing state of the underlying environment. Unmannned aerial vehicles (UAVs) can be gainfully employed to continually visit a set of targets representing tasks (and locations) in the environment and collect data therein for long time periods. The enduring nature of these missions requires the UAV to be regularly recharged at a service station. In this article, we consider the case in which the service station is not colocated with any of the targets. An efficient monitoring requires the revisit time, defined as the maximum of the time elapsed between successive revisits to targets, to be minimized. Here, we consider the problem of determining UAV routes that lead to the minimum revisit time. The problem is NP-hard, and its computational difficulty increases with the fuel capacity of the UAV. We develop an algorithm to construct near-optimal solutions to the problem quickly when the fuel capacity exceeds a threshold. We also develop lower bounds to the optimal revisit time and use these bounds to demonstrate (through numerical simulations) that the constructed solutions are, on an average, at most 0.01% away from the optimum.

42 ENGINEERING↗
DOE OSTI2025

A new upper bound for the growth factor in Gaussian elimination with complete pivoting

Abstract The growth factor in Gaussian elimination measures how large the entries of an LU factorization can be relative to the entries of the original matrix. It is a key parameter in error estimates, and one of the most fundamental topics in numerical analysis. We produce an upper bound of for the growth factor in Gaussian elimination with complete pivoting — the first improvement upon Wilkinson's original 1961 bound of .

Bisain, Ankit [Department of Mathematics Massachus↗
DOE OSTI2022

An Analysis of the Novel Fluorocycline TP-6076 Bound to Both the Ribosome and Multidrug Efflux Pump AdeJ from Acinetobacter baumannii

Antibiotic resistance among bacterial pathogens continues to pose a serious global health threat. Multidrug-resistant (MDR) strains of the Gram-negative organism Acinetobacter baumannii utilize a number of resistance determinants to evade current antibiotics. One of the major resistance mechanisms employed by these pathogens is the use of multidrug efflux pumps. These pumps extrude xenobiotics directly out of bacterial cells, resulting in treatment failures when common antibiotics are administered. Here, the structure of the novel tetracycline antibiotic TP-6076, bound to both the Acinetobacter drug efflux pump AdeJ and the ribosome from Acinetobacter baumannii, using single-particle cryo-electron microscopy (cryo-EM), is elucidated. In this work, the structure of the AdeJ–TP-6076 complex is solved, and we show that AdeJ utilizes a network of hydrophobic interactions to recognize this fluorocycline. Concomitant with this, we elucidate three structures of TP-6076 bound to the A. baumannii ribosome and determine that its binding is stabilized largely by electrostatic interactions. We then compare the differences in binding modes between TP-6076 and the related tetracycline antibiotic eravacycline in both targets. These differences suggest that modifications to the tetracycline core may be able to alter AdeJ binding while maintaining interactions with the ribosome. Together, this work highlights how different mechanisms are used to stabilize the binding of tetracycline-based compounds to unique bacterial targets and provides guidance for the future clinical development of tetracycline antibiotics.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints

Here, we propose an algorithm for solving bound-constrained mathematical programs with complementarity constraints on the variables. Each iteration of the algorithm involves solving a linear program with complementarity constraints in order to obtain an estimate of the active set. The algorithm enforces descent on the objective function to promote global convergence to B-stationary points. We provide a convergence analysis and preliminary numerical results on a range of test problems. We also study the effect of fixing the active constraints in a bound-constrained quadratic program that can be solved on each iteration in order to obtain fast convergence.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Lower bound for the neutrino magnetic moment from kick velocities induced at the birth of neutron stars

We show that the neutrino chirality flip, which can take place in the core of a neutron star at birth, is an efficient process to allow neutrinos to anisotropically escape, thus providing a to induce the neutron star kick velocities. The process is not subject to the no-go theorem since although the flip from left- to right-handed neutrinos happens at equilibrium, the reverse process does not take place given that right-handed neutrinos do not interact with matter and therefore detailed balance is lost. For simplicity, we model the neutron star core as being made of strange quark matter. We find that the process is efficient when the neutrino magnetic moment is not smaller than [Formula: see text], where [Formula: see text] is the Bohr magneton. When this lower bound is combined with the most stringent upper bound, which uses the luminosity data obtained from the analysis of SN 1987A, our results set a range for the neutrino magnetic moment given by [Formula: see text]. The obtained kick velocities for natal conditions are consistent with the observed ones and span the correct range of radii for typical magnetic field intensities.

Physics↗
DOE OSTI2023

Parallel Memory-Independent Communication Bounds for SYRK

In this paper, we focus on the parallel communication cost of multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK). SYRK requires half the computation of general matrix multiplication because of the symmetry of the output matrix. Recent work (Beaumont et al., SPAA '22) has demonstrated that the sequential I/O complexity of SYRK is also a constant factor smaller than that of general matrix multiplication. Inspired by this progress, we establish memory-independent parallel communication lower bounds for SYRK with smaller constants than general matrix multiplication, and we show that these constants are tight by presenting communication-optimal algorithms. The crux of the lower bound proof relies on extending a key geometric inequality to symmetric computations and analytically solving a constrained nonlinear optimization problem. Here, the optimal algorithms use a triangular blocking scheme for parallel distribution of the symmetric output matrix and corresponding computation.

Communication costs↗