Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Singularity”

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 685 records · Page 38

One-shot gas detection with transformer paired neural networks in Mako collected longwave infrared hyperspectral imagery

To date, careful data treatment workflows and statistical detectors are used to perform hyperspectral image (HSI) detection of any gas contained in a spectral library, which is often expanded with physics models to incorporate different spectral characteristics. In general, surrounding evidence or known gas-release parameters are used to provide confidence in or confirm detection capability, respectively. This makes quantifying detection performance difficult as it is nearly impossible to develop an absolute ground truth for gas target pixel presence in collected HSI. Consequently, developing and comparing new detection methods, especially machine learning (ML)-based methods, is susceptible to subjectivity in derived detection map quality. Here, in this work, we demonstrate the first use of transformer-based paired neural networks (PNNs) for one-shot gas target detection for multiple gases while providing quantitative classification and detection metrics for their use on labeled data. Terabytes of training data are generated from a database of long-wave infrared HSI obtained from historical Mako sensor campaigns over Los Angeles. By incorporating labels, singular signature representations, and a model development pipeline, we can tune and select PNNs to detect multiple gas targets that are not seen in training on a quantitative basis. We additionally assess our test set detections using interpretability techniques widely employed with ML-based predictors, but less common with detection methods relying on learned latent spaces.

Hyperspectral imaging↗

Reversible structural transformations in supercooled liquid water from 135 to 245 K

Water has many anomalous properties compared to “simple” liquids, and these anomalies are typically enhanced in supercooled water.1-3 While numerous models have been proposed, including the liquid-liquid critical point,4,5 the singularity-free scenario,6 and the stability limit conjecture,1 a molecular-level understanding remains elusive. The main difficulty in determining which, if any, of these models is correct is the limited amount of data in the relevant temperature and pressure ranges. For water at ambient pressures, which is the focus of this work, data is largely missing from 160 – 232 K (“No Man’s Land”) due to rapid crystallization.2,3 Whether rapid crystallization is just an experimental obstacle, or a fundamental problem signaling the inability of water to thermally equilibrate prior to crystallization is also a major unanswered question.5,7 Here, we investigate the structural transformations of transiently-heated, supercooled water with nanosecond time resolution using infrared vibrational spectroscopy. The experiments demonstrate three key results. First, water’s structure relaxes from its initial configuration to a “steady-state” configuration prior to the onset of crystallization over a wide temperature range. Second, water’s steady-state structure can be reproduced by a linear combination of two, temperature-independent structures that correspond to a “high-temperature liquid” and a “low-temperature liquid.” Third, the observed structural changes are reversible over the full temperature range. Taken together, these results show that supercooled water can equilibrate prior to crystallization for temperatures from the homogeneous nucleation temperature, TH ~232 K,3 down to the glass transition temperature (Tg ~ 136 K). Second, the results provide support for the hypothesis that supercooled water can be described as a mixture of two, structurally-distinct, interconvertible liquids from 135 K to 245 K.5,8-18

Kringle, Loni M.↗

Inhibited nonradiative decay at all exciton densities in monolayer semiconductors

Most optoelectronic devices operate at high photocarrier densities, where all semiconductors suffer from enhanced nonradiative recombination. Nonradiative processes proportionately reduce photoluminescence (PL) quantum yield (QY), a performance metric that directly dictates the maximum device efficiency. Although transition metal dichalcogenide (TMDC) monolayers exhibit near-unity PL QY at low exciton densities, nonradiative exciton-exciton annihilation (EEA) enhanced by van-Hove singularity (VHS) rapidly degrades their PL QY at high exciton densities and limits their utility in practical applications. Here, by applying small mechanical strain (less than 1%), we circumvented VHS resonance and markedly suppressed EEA in monolayer TMDCs, resulting in near-unity PL QY at all exciton densities despite the presence of a high native defect density. Our findings can enable light-emitting devices that retain high efficiency at all brightness levels.

36 MATERIALS SCIENCE↗

Isospin magnetism and spin-polarized superconductivity in Bernal bilayer graphene

In conventional superconductors, Cooper pairing occurs between electrons of opposite spin. We observe spin-polarized superconductivity in Bernal bilayer graphene when doped to a saddle-point van Hove singularity generated by a large applied perpendicular electric field. We observe a cascade of electrostatic gate-tuned transitions between electronic phases distinguished by their polarization within the isospin space defined by the combination of the spin and momentum-space valley degrees of freedom. Although all of these phases are metallic at zero magnetic field, we observe a transition to a superconducting state at finite magnetic field B ∥ ≈ 150 milliteslas applied parallel to the two-dimensional sheet. Superconductivity occurs near a symmetry-breaking transition and exists exclusively above the B ∥ limit expected of a paramagnetic superconductor with the observed transition critical temperature T C ≈ 30 millikelvins, consistent with a spin-triplet order parameter.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Asymmetric photoenzymatic incorporation of fluorinated motifs into olefins

Enzymes capable of assimilating fluorinated feedstocks are scarce. This situation poses a challenge for the biosynthesis of fluorinated compounds used in pharmaceuticals, agrochemicals, and materials. We developed a photoenzymatic hydrofluoroalkylation that integrates fluorinated motifs into olefins. The photoinduced promiscuity of flavin-dependent ene-reductases enables the generation of carbon-centered radicals from iodinated fluoroalkanes, which are directed by the photoenzyme to engage enantioselectively with olefins. This approach facilitates stereocontrol through interaction between a singular fluorinated unit and the enzyme, securing high enantioselectivity at β, γ, or δ positions of fluorinated groups through enzymatic hydrogen atom transfer—a process that is notably challenging with conventional chemocatalysis. Furthermore, this work advances enzymatic strategies for integrating fluorinated chemical feedstocks and opens avenues for asymmetric synthesis of fluorinated compounds.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Tracing Carbon Metabolism with Stable Isotope Metabolomics Reveals the Legacy of Diverse Carbon Sources in Soil

Tracking the metabolic activity of whole soil communities can improve our understanding of the transformation and fate of carbon in soils. For this work, we used stable isotope metabolomics to trace 13 C from nine labeled carbon sources into the water-soluble metabolite pool of an agricultural soil over time. Soil was amended with a mixture of all nine sources, with one source isotopically labeled in each treatment. We compared changes in the 13 C enrichment of metabolites with respect to carbon source and time over a 48-day incubation and contrasted differences between soluble sources (glucose, xylose, amino acids, etc.) and insoluble sources (cellulose and palmitic acid). Whole soil metabolite profiles varied singularly by time, while the composition of 13 C-labeled metabolites differed primarily by carbon source (R 2 = 0.68) rather than time (R 2 = 0.07), with source-specific differences persisting throughout incubations. The 13 C labeling of metabolites from insoluble carbon sources occurred slower than that from soluble sources but yielded a higher average atom percent (atom%) 13 C in metabolite markers of biomass (amino acids and nucleic acids). The 13 C enrichment of metabolite markers of biomass stabilized between 5 and 15 atom% 13 C by the end of incubations. Temporal patterns in the 13 C enrichment of tricarboxylic acid cycle intermediates, nucleobases (uracil and thymine), and by-products of DNA salvage (allantoin) closely tracked microbial activity. Our results demonstrate that metabolite production in soils is driven by the carbon source supplied to the community and that the fate of carbon in metabolites do not generally converge over time as a result of ongoing microbial processing and recycling.

59 BASIC BIOLOGICAL SCIENCES↗

Affine Approximation of Parametrized Kernels and Model Order Reduction for Nonlocal and Fractional Laplace Models

In this work, we consider parametrized problems driven by spatially nonlocal integral operators with parameter-dependent kernels. In particular, kernels with varying nonlocal interaction radius $\delta > 0$ and fractional Laplace kernels, parametrized by the fractional power $s\in(0,1)$, are studied. Furthermore, in order to provide an efficient and reliable approximation of the solution for different values of the parameters, we develop the reduced basis method as a parametric model order reduction approach. Major difficulties arise since the kernels are not affine in the parameters, singular, and discontinuous. Moreover, the spatial regularity of the solutions depends on the varying fractional power $s$. To address this, we derive regularity and differentiability results with respect to $\delta$ and $s$, which are of independent interest for other applications such as optimization and parameter identification. We then use these results to construct affine approximations of the kernels by local polynomials. Finally, we certify the method by providing reliable a posteriori error estimators, which account for all approximation errors, and support the theoretical findings by numerical experiments.

97 MATHEMATICS AND COMPUTING↗

Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations

Rank-revealing matrix decompositions provide an essential tool in spectral analysis of matrices, including the Singular Value Decomposition (SVD) and related low-rank approximation techniques. QR with Column Pivoting (QRCP) is usually suitable for these purposes, but it can be much slower than the unpivoted QR algorithm. For large matrices, the difference in performance is due to increased communication between the processor and slow memory, which QRCP needs in order to choose pivots during decomposition. Our main algorithm, Randomized QR with Column Pivoting (RQRCP), uses randomized projection to make pivot decisions from a much smaller sample matrix, which we can construct to reside in a faster level of memory than the original matrix. This technique may be understood as trading vastly reduced communication for a controlled increase in uncertainty during the decision process. Furthermore, for rank-revealing purposes, the selection mechanism in RQRCP produces results that are the same quality as the standard algorithm, but with performance near that of unpivoted QR (often an order of magnitude faster for large matrices). Additionally, we also propose two formulas that facilitate further performance improvements. The first efficiently updates sample matrices to avoid computing new randomized projections. The second avoids large trailing updates during the decomposition in truncated low-rank approximations. Our truncated version of RQRCP also provides a key initial step in our truncated SVD approximation, TUXV. These advances open up a new performance domain for large matrix factorizations that will support efficient problem-solving techniques for challenging applications in science, engineering, and data analysis.

97 MATHEMATICS AND COMPUTING↗

Iterated Gauss-Seidel GMRES

The GMRES algorithm of Saad and Schultz [SIAM J. Sci. Stat. Comput., 7 (1986), pp. 856-869] is an iterative method for approximately solving linear systems Ax = b, with initial guess x0 and residual r0 = b Ax0. The algorithm employs the Arnoldi process to generate the Krylov basis vectors (the columns of Vk ). It is well known that this process can be viewed as a QR factorization of the matrix Bk = [r0, AVk] at each iteration. Despite an O (..epsilon..)..kappa.. (Bk ) loss of orthogonality, for unit roundoff ..epsilon..and condition number ..kappa.. , the modified Gram-Schmidt formulation was shown to be backward stable in the seminal paper by Paige et al. [SIAM J. Matrix Anal.Appl., 28 (2006), pp. 264-284]. We present an iterated Gauss-Seidel formulation of the GMRES algorithm (IGS-GMRES) based on the ideas of Ruhe [Linear Algebra Appl., 52 (1983), pp. 591-601] and Swirydowicz et al. [Numer. Linear Algebra Appl., 28 (2020), pp. 1-20]. IGS-GMRES maintains orthogonality to the level O (..epsilon..)..kappa.. (Bk ) or O (..epsilon..), depending on the choice of one or two iterations; for two Gauss-Seidel iterations, the computed Krylov basis vectors remain orthogonal to working accuracy and the smallest singular value of Vk remains close to one. The resulting GMRES method is thus backward stable. We show that IGS-GMRES can be implemented with only a single synchronization point per iteration, making it relevant to large-scale parallel computing environments. We also demonstrate that, unlike MGS-GMRES, in IGS-GMRES the relative Arnoldi residual corresponding to the computed approximate solution no longer stagnates above machine precision even for highly nonnormal systems.

Arnoldi-QR↗

Parallel Randomized Tucker Decomposition Algorithms

The Tucker tensor decomposition is a natural extension of the singular value decomposition (SVD) to multiway data. Here, we propose to accelerate Tucker tensor decomposition algorithms by using randomization and parallelization. We present two algorithms that scale to large data and many processors, significantly reduce both computation and communication cost compared to previous deterministic and randomized approaches, and obtain nearly the same approximation errors. The key idea in our algorithms is to perform randomized sketches with Kronecker-structured random matrices, which reduces computation compared to unstructured matrices and can be implemented using a fundamental tensor computational kernel. We provide probabilistic error analysis of our algorithms and implement a new parallel algorithm for the structured randomized sketch. Our experimental results demonstrate that our combination of randomization and parallelization achieves accurate Tucker decompositions much faster than alternative approaches. We observe up to a 16X speedup over the fastest deterministic parallel implementation on 3D simulation data.

Tucker decompositions↗

Modifying the Asynchronous Jacobi Method for Data Corruption Resilience

Moving scientific computation from high-performance computing (HPC) and cloud computing (CC) environments to devices on the edge, i.e., physically near instruments of interest, has received tremendous interest in recent years. Such edge computing environments can operate on data in situ, offering enticing benefits over data aggregation to HPC and CC facilities that include avoiding costs of transmission, increased data privacy, and real-time data analysis. Because of the inherent unreliability of edge computing environments, new fault-tolerant approaches must be developed before the benefits of edge computing can be realized. Motivated by algorithm-based fault tolerance, a variant of the asynchronous Jacobi (ASJ) method is developed that achieves resilience to data corruption by rejecting solution approximations from neighbor devices according to a bound derived from convergence theory. Numerical results on a two-dimensional Poisson problem show that the new rejection criterion, along with a novel approximation to the shortest path length on which the criterion depends, restores convergence for the ASJ variant in the presence of certain types data corruption. Numerical results are obtained for when the singular values in the analytic bound are approximated. Additional linear systems are also explored, one with a more dense sparsity pattern and one that includes advection. All results indicate that successful resilience to data corruption depends on whether the bound tightens fast enough to reject corrupted data before the iteration evolution deviates significantly from that predicted by the convergence theory defining the bound. This observation generalizes to future work on algorithm-based fault tolerance for other asynchronous algorithms, including upcoming approaches that leverage Krylov subspaces.

97 MATHEMATICS AND COMPUTING↗

Laplace Transform–Based Quantum Eigenvalue Transformation via Linear Combination of Hamiltonian Simulation

Eigenvalue transformations, which include solving time-dependent differential equations as a special case, have a wide range of applications in scientific and engineering computation. While quantum algorithms for singular value transformations are well studied, eigenvalue transformations are distinct, especially for nonnormal matrices. Here, we propose an efficient quantum algorithm for performing a class of eigenvalue transformations that can be expressed as a certain type of matrix Laplace transformation. This allows us to significantly extend the recently developed linear combination of Hamiltonian simulation method [D. An, J.-P. Liu, and L. Lin, Phys. Rev. Lett., 131 (2023), 150603; D. An, A. M. Childs, and L. Lin, Commun. Math. Phys. 407, 19 (2026)] to represent a wider class of eigenvalue transformations, such as powers of the matrix inverse, 𝐴 −𝑘 , and the exponential of the matrix inverse, 𝑒 −𝐴 −1 . The latter can be interpreted as the solution of a mass-matrix differential equation of the form form 𝐴⁢𝑢′⁡⁡(𝑡) =−𝑢⁡(𝑡). We demonstrate that our eigenvalue transformation approach can solve this problem without explicitly inverting 𝐴, thereby reducing the computational complexity.

Laplace transform↗

A toolbox for $$q_{T}$$ and 0-jettiness subtractions at $$\hbox {N}^3\hbox {LO}$$

We derive the leading-power singular terms at three loops for both $q_T$ and 0-jettiness, $T_0$, for generic color-singlet processes. Our results provide the complete set of differential subtraction terms for $q_T$ and $T_0$ subtractions at N 3 LO, which are an important ingredient for matching N 3 LO calculations with parton showers. We obtain the full three-loop structure of the relevant beam and soft functions, which are necessary ingredients for the resummation of $q_T$ and $T_0$ at N 3 LL' and N 4 LL order, and which constitute important building blocks in other contexts as well. The nonlogarithmic boundary coefficients of the beam functions, which contribute to the integrated subtraction terms, are not yet fully known at three loops. By exploiting consistency relations between different factorization limits, we derive results for the $q_T$ and $T_0$ beam function coefficients at N 3 LO in the z→1 threshold limit, and we also estimate the size of the unknown terms beyond threshold.

Physics↗

Bound-preserving finite element approximations of the Keller–Segel equations

We report this paper aims to develop numerical approximations of the Keller–Segel equations that mimic at the discrete level the lower bounds and the energy law of the continuous problem. We solve these equations for two unknowns: the organism (or cell) density, which is a positive variable, and the chemoattractant density, which is a non-negative variable. We propose two algorithms, which combine a stabilized finite element method and a semi-implicit time integration. The stabilization consists of a nonlinear artificial diffusion that employs a graph-Laplacian operator and a shock detector that localizes local extrema. As a result, both algorithms turn out to be nonlinear and can generate cell and chemoattractant numerical densities fulfilling lower bounds. However, the first algorithm requires a suitable constraint between the space and time discrete parameters, whereas the second one does not. We design the latter to attain a discrete energy law on acute meshes. We report some numerical experiments to validate the theoretical results on blowup and nonblowup phenomena. In the blowup setting, we identify a locking phenomenon that relates the L ∞ (Ω)-norm to the L 1 (Ω)-norm limiting the growth of the singularity when supported on a macroelement.

97 MATHEMATICS AND COMPUTING↗

TuckerMPI: A Parallel C++/MPI Software Package for Large-scale Data Compression via the Tucker Tensor Decomposition

With this study, our goal is compression of massive-scale grid-structured data, such as the multi-terabyte output of a high-fidelity computational simulation. For such data sets, we have developed a new software package called TuckerMPI, a parallel C++/MPI software package for compressing distributed data. The approach is based on treating the data as a tensor, i.e., a multidimensional array, and computing its truncated Tucker decomposition, a higher-order analogue to the truncated singular value decomposition of a matrix. The result is a low-rank approximation of the original tensor-structured data. Compression efficiency is achieved by detecting latent global structure within the data, which we contrast to most compression methods that are focused on local structure. In this work, we describe TuckerMPI, our implementation of the truncated Tucker decomposition, including details of the data distribution and in-memory layouts, the parallel and serial implementations of the key kernels, and analysis of the storage, communication, and computational costs. We test the software on 4.5 and 6.7 terabyte data sets distributed across 100 s of nodes (1,000 s of MPI processes), achieving compression ratios between 100 and 200,000×, which equates to 99--99.999% compression (depending on the desired accuracy) in substantially less time than it would take to even read the same dataset from a parallel file system. Moreover, we show that our method also allows for reconstruction of partial or down-sampled data on a single node, without a parallel computer so long as the reconstructed portion is small enough to fit on a single machine, e.g., in the instance of reconstructing/visualizing a single down-sampled time step or computing summary statistics. The code is available at https://gitlab.com/tensors/TuckerMPI.

97 MATHEMATICS AND COMPUTING↗

Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning

We present an algorithmic framework for quantum-inspired classical algorithms on close-to-low-rank matrices, generalizing the series of results started by Tang’s breakthrough quantum-inspired algorithm for recommendation systems [STOC’19]. Motivated by quantum linear algebra algorithms and the quantum singular value transformation (SVT) framework of Gilyén et al. [STOC’19], we develop classical algorithms for SVT that run in time independent of input dimension, under suitable quantum-inspired sampling assumptions. Our results give compelling evidence that in the corresponding QRAM data structure input model, quantum SVT does not yield exponential quantum speedups. Since the quantum SVT framework generalizes essentially all known techniques for quantum linear algebra, our results, combined with sampling lemmas from previous work, suffice to generalize all prior results about dequantizing quantum machine learning algorithms. In particular, our classical SVT framework recovers and often improves the dequantization results on recommendation systems, principal component analysis, supervised clustering, support vector machines, low-rank regression, and semidefinite program solving. We also give additional dequantization results on low-rank Hamiltonian simulation and discriminant analysis. Our improvements come from identifying the key feature of the quantum-inspired input model that is at the core of all prior quantum-inspired results: ℓ 2 -norm sampling can approximate matrix products in time independent of their dimension. We reduce all our main results to this fact, making our exposition concise, self-contained, and intuitive.

Computer Science↗

Improved Water Sound Synthesis using Coupled Bubbles

We introduce a practical framework for synthesizing bubble-based water sounds that captures the rich inter-bubble coupling effects responsible for low-frequency acoustic emissions from bubble clouds. We propose coupled-bubble oscillator models with regularized singularities, and techniques to reduce the computational cost of time stepping with dense, time-varying mass matrices. Airborne acoustic emissions are estimated using finite-difference time-domain (FDTD) methods. We propose a simple, analytical surface-acceleration model, and a sample-and-hold GPU wavesolver that is simple and faster than prior CPU wavesolvers. Sound synthesis results are demonstrated using bubbly flows from incompressible, two-phase simulations, as well as procedurally generated examples using single-phase FLIP fluid animations. Our results demonstrate sound simulations with hundreds of thousands of bubbles, and perceptually significant frequency transformations with fuller low-frequency content.

Computer Science↗

FAIR Ecosystems for Science at Scale

High Performance Computing (HPC) centers provide resources to users who require greater scale to “get science done”. They deploy infrastructure with singular hardware architectures, cutting-edge software environments, and stricter security measures as compared with users’ own resources. As a result, users often create and configure digital artifacts in ways that are specialized for the unique infrastructure at a given HPC center. Each user of that center will face similar challenges as they develop specialized solutions to take full advantages of the center’s resources, potentially resulting in significant duplication of effort. Much duplicated effort could be avoided, however, if users of these centers found it easier to discover others’ solutions and artifacts as well as share their own. The FAIR principles address this problem by presenting guidelines focused around metadata practices to be implemented by vaguely defined “communities”; in practice, these tend to gather by domain (e.g. bioinformatics, geosciences, agriculture). Domain-based communities can unfortunately end up functioning as silos that tend both to inhibit sharing of solutions and best practices as well as to encourage fragile and unsustainable improvised solutions in the absence of best-practice guidance. We propose that these communities pursuing “science at scale” be nurtured both individually and collectively by HPC centers so that users can take advantage of shared challenges across disciplines and potentially across HPC centers. We describe an architecture based on the EOSC-Life FAIR Workflows Collaboratory, specialized for use with and inside HPC centers such as the Oak Ridge Leadership Computing Facility (OLCF), and we speculate on user incentives to encourage adoption. We note that a focus on FAIR workflow components rather than FAIR workflows is more likely to benefit the users of HPC centers.

Wilkinson, Sean [ORNL] (ORCID:0000000214437479)↗