Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithmic efficiency”

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 217 records · Page 12

The Mobius domain wall fermion algorithm

We present a review of the properties of generalized domain wall Fermions, based on a (real) Möbius transformation on the Wilson overlap kernel, discussing their algorithmic efficiency, the degree of explicit chiral violations measured by the residual mass (m res ) and the Ward–Takahashi identities. The Möbius class interpolates between Shamir’s domain wall operator and Boriçi’s domain wall implementation of Neuberger’s overlap operator without increasing the number of Dirac applications per conjugate gradient iteration. A new scaling parameter (α) reduces chiral violations at finite fifth dimension (L s ) but yields exactly the same overlap action in the limit L s → ∞ . Through the use of 4d Red/Black preconditioning and optimal tuning for the scaling α(L s ), we show that chiral symmetry violations are typically reduced by an order of magnitude at fixed Ls . Here, we argue that the residual mass for a tuned Möbius algorithm with α = O(1/L s γ ) for γ < 1 will eventually fall asymptotically as m res = O(1/L s 1+γ ) in the case of a 5D Hamiltonian with out a spectral gap.

97 MATHEMATICS AND COMPUTING↗

Numerically exact generalized Green's function cluster expansions for electron-phonon problems

We generalize the family of approximate momentum average methods to formulate a numerically exact, convergent hierarchy of equations whose solution provides an efficient algorithm to compute the Green's function of a particle dressed by bosons suitable in the entire parameter regime. We use this approach to extract ground-state properties and spectral functions. Our approximation-free framework, dubbed the generalized Green's function cluster expansion (GGCE), allows access to exact numerical results in the extreme adiabatic limit, where many standard methods struggle or completely fail. We showcase the performance of the method, specializing three important models of charge-boson coupling in solids and molecular complexes: the molecular Holstein model, which describes coupling between charge density and local distortions, the Peierls model, which describes modulation of charge hopping due to intersite distortions, and a more complex Holstein + Peierls system with couplings to two different phonon modes, paradigmatic of charge-lattice interactions in organic crystals. Furthermore, the GGCE serves as an efficient approach that can be systematically extended to different physical scenarios, thus providing a tool to model the frequency dependence of dressed particles in realistic settings.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Algorithms for Diffractive Microscopy (Final Report)

The phenomenal coherence and brightness of x-ray free-electron laser light sources, such as the LCLS at SLAC, have the potential of revolutionizing the investigation of structure and dynamics in the nano-domain. However, this potential will go unrealized without a similar revolution in the way the data are analyzed. While it is true that the ambitious design parameters of the LCLS have been achieved, the prospects of realizing the most publicized goal of this instrument — the imaging of individual bio-particles — remains daunting. Even with 10 12 photons per x-ray pulse, the feebleness of the scattering process represents a fundamental limit that no amount of engineering ingenuity can overcome. Large bio-molecules will scatter on the order of only 10 3 photons per pulse into a detector with 106 pixels; the diffraction “images” will be virtually indistinguishable from noise. Averaging such noisy signals over many pulses is not possible because the particle orientation cannot be controlled. Each noisy laser snapshot is thus confounded by the unknown viewpoint of the particle. Given the heavy DOE investment in LCLS and the profound technical challenges facing single-particle imaging, the final two years of this project have concentrated on this effort. We are happy to report that we succeeded in developing an extremely efficient algorithm that can reconstruct the shapes of particles at even the extremes of noise expected in future LCLS experiments with single bio-particles. Since this is the most important outcome of this project, the major part of this report documents this accomplishment. The theoretical techniques that were developed for the single-particle imaging project have proved useful in other imaging problems that are described at the end of the report.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Efficient computation of N -point correlation functions in D dimensions

We present efficient algorithms for computing the N-point correlation functions (NPCFs) of random fields in arbitrary D-dimensional homogeneous and isotropic spaces. Such statistics appear throughout the physical sciences and provide a natural tool to describe stochastic processes. Typically, algorithms for computing the NPCF components have $\mathscr O$(n N ) complexity (for a dataset containing n particles); their application is thus computationally infeasible unless N is small. By projecting the statistic onto a suitably defined angular basis, we show that the estimators can be written in a separable form, with complexity $\mathscr O$(n 2 ) or $\mathscr O$(n g log n g ) if evaluated using a Fast Fourier Transform on a grid of size n g . Our decomposition is built upon the D-dimensional hyperspherical harmonics; these form a complete basis on the (D – 1) sphere and are intrinsically related to angular momentum operators. Concatenation of (N – 1) such harmonics gives states of definite combined angular momentum, forming a natural separable basis for the NPCF. As N and D grow, the number of basis components quickly becomes large, providing a practical limitation to this (and all other) approaches: However, the dimensionality is greatly reduced in the presence of symmetries; for example, isotropic correlation functions require only states of zero combined angular momentum. We provide a Julia package implementing our estimators and show how they can be applied to a variety of scenarios within cosmology and fluid dynamics. The efficiency of such estimators will allow higher-order correlators to become a standard tool in the analysis of random fields.

97 MATHEMATICS AND COMPUTING↗

Data-Driven Strategies for Accelerated Materials Design

The ongoing revolution of the natural sciences by the advent of machine learning and artificial intelligence sparked significant interest in the material science community in recent years. The intrinsically high dimensionality of the space of realizable materials makes traditional approaches ineffective for large-scale explorations. Modern data science and machine learning tools developed for increasingly complicated problems are an attractive alternative. An imminent climate catastrophe calls for a clean energy transformation by overhauling current technologies within only several years of possible action available. Tackling this crisis requires the development of new materials at an unprecedented pace and scale. For example, organic photovoltaics have the potential to replace existing silicon-based materials to a large extent and open up new fields of application. In recent years, organic light-emitting diodes have emerged as state-of-the-art technology for digital screens and portable devices and are enabling new applications with flexible displays. Reticular frameworks allow the atom-precise synthesis of nanomaterials and promise to revolutionize the field by the potential to realize multifunctional nanoparticles with applications from gas storage, gas separation, and electrochemical energy storage to nanomedicine. In the recent decade, significant advances in all these fields have been facilitated by the comprehensive application of simulation and machine learning for property prediction, property optimization, and chemical space exploration enabled by considerable advances in computing power and algorithmic efficiency. In this Account, we review the most recent contributions of our group in this thriving field of machine learning for material science. We start with a summary of the most important material classes our group has been involved in, focusing on small molecules as organic electronic materials and crystalline materials. Specifically, we highlight the data-driven approaches we employed to speed up discovery and derive material design strategies. Subsequently, our focus lies on the data-driven methodologies our group has developed and employed, elaborating on high-throughput virtual screening, inverse molecular design, Bayesian optimization, and supervised learning. We discuss the general ideas, their working principles, and their use cases with examples of successful implementations in data-driven material discovery and design efforts. Furthermore, we elaborate on potential pitfalls and remaining challenges of these methods. Finally, we provide a brief outlook for the field as we foresee increasing adaptation and implementation of large scale data-driven approaches in material discovery and design campaigns.

36 MATERIALS SCIENCE↗

Factorization Machine‐Based Active Learning for Functional Materials Design with Optimal Initial Data

The optimization of functional materials is important to enhance their properties, but their complex geometries pose great challenges to optimization. Data-driven algorithms efficiently navigate such complex design spaces by learning relationships between material structures and performance metrics to discover high-performance functional materials. Surrogate-based active learning, continually improving its surrogate model by iteratively including high-quality data points, has emerged as a cost-effective data-driven approach. Furthermore, it can be coupled with quantum computing to enhance optimization processes, especially when paired with a special form of surrogate model (i.e., quadratic unconstrained binary optimization), formulated by factorization machine (FM). However, current practices often overlook the variability in design space sizes when determining the initial data size for optimization. In this work, we investigate the optimal initial data sizes required for efficient convergence across various design space sizes. By employing averaged piecewise linear regression, we identify initiation points where convergence begins, highlighting the crucial role of employing adequate initial data in achieving efficient optimization. These results contribute to the efficient optimization of functional materials by ensuring faster convergence and reducing computational costs in FM-based active learning.

active learning↗

Computing rank‐revealing factorizations of matrices stored out‐of‐core

This paper describes efficient algorithms for computing rank-revealing factorizations of matrices that are too large to fit in main memory (RAM), and must instead be stored on slow external memory devices such as disks (out-of-core or out-of-memory). Traditional algorithms for computing rank-revealing factorizations (such as the column pivoted QR factorization and the singular value decomposition) are very communication intensive as they require many vector-vector and matrix-vector operations, which become prohibitively expensive when data is not in RAM. Randomization allows to reformulate new methods so that large contiguous blocks of the matrix are processed in bulk. The paper describes two distinct methods. The first is a blocked version of column pivoted Householder QR, organized as a “left-looking” method to minimize the number of the expensive write operations. The second method results employs a UTV factorization. It is organized as an algorithm-by-blocks to overlap computations and I/O operations. As it incorporates power iterations, it is much better at revealing the numerical rank. Numerical experiments on several computers demonstrate that the new algorithms are almost as fast when processing data stored on slow memory devices as traditional algorithms are for data stored in RAM.

97 MATHEMATICS AND COMPUTING↗

The evaluation of spin-density matrices within the graphically contracted function method.

An efficient algorithm is presented to compute spin-density matrices from wave functions expanded in a basis of graphically contracted functions (GCF). The GCFs are based on the graphical unitary group approach (GUGA), which is a 'spin-free' formulation of the electronic wave function. The spin-density matrix elements are computed from one-particle and two-particle charge-density matrix elements. The recursive algorithm allows the spin-density matrix to be computed with O(N{sub 2}{sup GCF}{omega}n{sup 2}) total effort where N{sub GCF} is the dimension of the GCF basis and n is the dimension of the orbital basis. The scale factor {omega} depends on the number of electrons N and ranges from O(N{sup 0}) to O(N{sup 2}) depending on the complexity of the underlying Shavitt graph. Because the 'spin-free' GCF formulation eliminates the need to expand the wave function in a spin-dependent Slater determinant basis, it is possible to treat wave functions with large numbers of electrons and orbitals. Timings are given for wave functions that correspond to determinantal expansions over 10{sup 200} in length. The implementation is applicable to arbitrary spin states and to both ground and excited electronic states.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Soft bootstrap and supersymmetry

The soft bootstrap is an on-shell method to constrain the landscape of effective field theories (EFTs) of massless particles via the consistency of the low-energy S-matrix. Given assumptions on the on-shell data (particle spectra, linear symmetries, and low-energy theorems), the soft bootstrap is an efficient algorithm for determining the possible consistency of an EFT with those properties. The implementation of the soft bootstrap uses the recently discovered method of soft subtracted recursion. We derive a precise criterion for the validity of these recursion relations and show that they fail exactly when the assumed symmetries can be trivially realized by independent operators in the effective action. We use this to show that the possible pure (real and complex) scalar, fermion, and vector exceptional EFTs are highly constrained. Next, we prove how the soft behavior of states in a supermultiplet must be related and illustrate the results in extended supergravity. We demonstrate the power of the soft bootstrap in two applications. First, for the \( \mathcal{N} \) = 1 and \( \mathcal{N} \) = 2 C P 1 nonlinear sigma models, we show that on-shell constructibility establishes the emergence of accidental IR symmetries. This includes a new on-shell perspective on the interplay between \( \mathcal{N} \) = 2 supersymmetry, low-energy theorems, and electromagnetic duality. We also show that \( \mathcal{N} \) = 2 supersymmetry requires 3-point interactions with the photon that make the soft behavior of the scalar O (1) instead of vanishing, despite the underlying symmetric coset. Second, we study Galileon theories, including aspects of supersymmetrization, the possibility of a vector-scalar Galileon EFT, and the existence of higher-derivative corrections preserving the enhanced special Galileon symmetry. The latter is addressed both by soft bootstrap and by application of double-copy/KLT relations applied to higher-derivative corrections of chiral perturbation theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Machine learning and algebraic approaches towards complete matter spectra in 4d F-theory

Motivated by engineering vector-like (Higgs) pairs in the spectrum of 4d F-theory compactifications, we combine machine learning and algebraic geometry techniques to analyze line bundle cohomologies on families of holomorphic curves. To quantify jumps of these cohomologies, we first generate 1.8 million pairs of line bundles and curves embedded in dP 3 , for which we compute the cohomologies. A white-box machine learning approach trained on this data provides intuition for jumps due to curve splittings, which we use to construct additional vector-like Higgs-pairs in an F-Theory toy model. We also find that, in order to explain quantitatively the full dataset, further tools from algebraic geometry, in particular Brill-Noether theory, are required. Using these ingredients, we introduce a diagrammatic way to express cohomology jumps across the parameter space of each family of matter curves, which reflects a stratification of the F-theory complex structure moduli space in terms of the vector-like spectrum. Furthermore, these insights provide an algorithmically efficient way to estimate the possible cohomology dimensions across the entire parameter space.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multiplets of superconformal symmetry in diverse dimensions

We systematically analyze the operator content of unitary superconformal multiplets in d ≥ 3 spacetime dimensions. We present a simple, general, and efficient algorithm that generates all of these multiplets by correctly eliminating possible null states. The algorithm is conjectural, but passes a vast web of consistency checks. We apply it to tabulate a large variety of superconformal multiplets. In particular, we classify and construct all multiplets that contain conserved currents or free fields, which play an important role in superconformal field theories (SCFTs). Some currents that are allowed in conformal field theories cannot be embedded in superconformal multiplets, and hence they are absent in SCFTs. We use the structure of superconformal stress tensor multiplets to show that SCFTs with more than 16 Poincaré supercharges cannot arise in d ≥ 4, even when the corresponding superconformal algebras exist. We also show that such theories do arise in d = 3, but are necessarily free.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A physical basis for cosmological correlators from cuts

Significant progress has been made in our understanding of the analytic structure of FRW wavefunction coefficients, facilitated by the development of efficient algorithms to derive the differential equations they satisfy. Moreover, recent findings indicate that the twisted cohomology of the associated hyperplane arrangement defining FRW integrals overestimates the number of integrals required to define differential equations for the wave-function coefficient. We demonstrate that the associated dual cohomology is automatically organized in a way that is ideal for understanding and exploiting the cut/residue structure of FRW integrals. Utilizing this understanding, we develop a systematic approach to organize compatible sequential residues, which dictates the physical subspace of FRW integrals for any n -site, ℓ-loop graph. In particular, the physical subspace of tree-level FRW wavefunction coefficients is populated by differential forms associated to cuts/residues that factorize the integrand of the wavefunction coefficient into only flat space amplitudes. After demonstrating the validity of our construction using intersection theory, we develop simple graphical rules for cut tubings that enumerate the space of physical cuts and, consequently, differential forms without any calculation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Energy flow polynomials: a complete linear basis for jet substructure

We introduce the energy flow polynomials: a complete set of jet substructure observables which form a discrete linear basis for all infrared- and collinear-safe observables. Energy flow polynomials are multiparticle energy correlators with specific angular structures that are a direct consequence of infrared and collinear safety. We establish a powerful graph-theoretic representation of the energy flow polynomials which allows us to design efficient algorithms for their computation. Many common jet observables are exact linear combinations of energy flow polynomials, and we demonstrate the linear spanning nature of the energy flow basis by performing regression for several common jet observables. Using linear classification with energy flow polynomials, we achieve excellent performance on three representative jet tagging problems: quark/gluon discrimination, boosted W tagging, and boosted top tagging. Lastly, the energy flow basis provides a systematic framework for complete investigations of jet substructure using linear methods.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

MadGraph 5 : Going Beyond

MadGraph 5 is the new version of the MadGraph matrix element generator, written in the Python programming language. It implements a number of new, efficient algorithms that provide improved performance and functionality in all aspects of the program. It features a new user interface, several new output formats including C++ process libraries for Pythia 8, and full compatibility with FeynRules for new physics models implementation, allowing for event generation for any model that can be written in the form of a Lagrangian. MadGraph 5 builds on the same philosophy as the previous versions, and its design allows it to be used as a collaborative platform where theoretical, phenomenological and simulation projects can be developed and then distributed to the high-energy community. We describe the ideas and the most important developments of the code and illustrate its capabilities through a few simple phenomenological examples.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Conformal bootstrap deformations

We explore the space of extremal functionals in the conformal bootstrap. By recasting the bootstrap problem as a set of non-linear equations parameterized by the CFT data, we find an efficient algorithm for converging to the extremal solution corresponding to the boundary of allowed regions in the parameter space of CFTs. Furthermore, by deforming these solutions, we demonstrate that certain solutions corresponding to known theories are continuously connected. Employing these methods, we will explore the space of non-unitary CFTs in the context of modular as well as correlation function bootstrap. In two dimensions, we show that the extremal solution corresponding to the Ising model is connected to that of the Yang-Lee minimal model. By deforming this solution to three dimensions, we provide evidence that the CFT data obtained in this way is compatible with the E-expansion for a non-unitary theory

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The discriminant power of bubble wall velocities: gravitational waves and electroweak baryogenesis

A precise determination of the bubble wall velocity v$_{w}$ is crucial for making accurate predictions of the baryon asymmetry and gravitational wave (GW) signals in models of electroweak baryogenesis (EWBG). Working in the local thermal equilibrium approximation, we exploit entropy conservation to present efficient algorithms for computing v$_{w}$, significantly streamlining the calculation. We then explore the parameter dependencies of v$_{w}$, focusing on two sample models capable of enabling a strong first-order electroweak phase transition: a ℤ$_{2}$-symmetric singlet extension of the SM, and a model for baryogenesis with CP violation in the dark sector. We study correlations among v$_{w}$ and the two common measures of phase transition strength, α$_{n}$ and v$_{n}$/T$_{n}$. Interestingly, we find a relatively model-insensitive relationship between v$_{n}$/T$_{n}$ and α$_{n}$. We also observe an upper bound on α$_{n}$ for the deflagration/hybrid wall profiles naturally compatible with EWBG, the exact value for which varies between models, significantly impacting the strength of the GW signals. In summary, our work provides a framework for exploring the feasibility of EWBG models in light of future GW signals.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Spinor representations for fields with any spin: Lorentz tensor basis for operators and covariant multipole decomposition

This paper discusses a framework to parametrize and decompose operator matrix elements for particles with higher spin (j > 1/2) using chiral representations of the Lorentz group, i.e. the (j, 0) and (0, j) representations and their parity-invariant direct sum. Unlike traditional approaches that require imposing constraints to eliminate spurious degrees of freedom, these chiral representations contain exactly the 2j + 1 components needed to describe a spin-j particle. The central objects in the construction are the t-tensors, which are generalizations of the Pauli four-vector σ μ for higher spin. For the generalized spinors of these representations, we demonstrate how the algebra of the t-tensors allows to formulate a generalization of the Dirac matrix basis for any spin. For on-shell bilinears, we show that a set consisting exclusively of covariant multipoles of order 0 ≤ m ≤ 2j forms a complete basis. We provide explicit expressions for all bilinears of the generalized Dirac matrix basis, which are valid for any spin value. As a byproduct of our derivations we present an efficient algorithm to compute the t-tensor matrix elements. The formalism presented here paves the way to use a more unified approach to analyze the non-perturbative QCD structure of hadrons and nuclei across different spin values, with clear physical interpretation of the resulting distributions as covariant multipoles.

Angular momentum of light↗

Simulation and Estimation of Extreme Quantiles and Extreme Probabilities

Let X be a random vector with distribution {mu} on Double-Struck-Capital-R {sup d} and {Phi} be a mapping from Double-Struck-Capital-R {sup d} to Double-Struck-Capital-R . That mapping acts as a black box, e.g., the result from some computer experiments for which no analytical expression is available. This paper presents an efficient algorithm to estimate a tail probability given a quantile or a quantile given a tail probability. The algorithm improves upon existing multilevel splitting methods and can be analyzed using Poisson process tools that lead to exact description of the distribution of the estimated probabilities and quantiles. The performance of the algorithm is demonstrated in a problem related to digital watermarking.

97 MATHEMATICS AND COMPUTING↗