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 361 records · Page 20

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↗

Data-driven efficient network and surveillance-based immunization

Given a contact network and coarse-grained diagnostic information such as electronic Healthcare Reimbursement Claims (eHRC) data, can we develop efficient intervention policies from data to control an epidemic? Immunization is an important problem in multiple areas, especially epidemiology and public health. However, most existing studies rely on assuming prior epidemiological models to develop pre-emptive strategies, which may fail to adapt to the change in new epidemiological patterns and the availability of rich data such as eHRC. In practice, disease spread is usually complicated, hence assuming an underlying model may deviate from true spreading patterns, leading to possibly inaccurate interventions. Additionally, the abundance of health care surveillance data (such as eHRC) makes it possible to study data-driven strategies without too many restrictive assumptions. Therefore, such a data-driven intervention approach can help public-health experts take more practical decisions. In this work, we take into account propagation log and contact networks for controlling propagation. Furthermore, different from previous model-based approaches, our solutions are solely data driven in a sense that we develop immunization strategies directly from the network and eHRC without assuming classical epidemiological models. In particular, we formulate the novel and challenging data-driven immunization problem. To solve it, we first propose an efficient sampling approach to align surveillance data with contact networks, then develop an efficient algorithm with the provably approximate guarantee for immunization. Finally, we show the effectiveness and scalability of our methods via extensive experiments on multiple datasets, and conduct case studies on nation-wide real medical surveillance data.

60 APPLIED LIFE SCIENCES↗

Convergence of sum-up rounding schemes for cloaking problems governed by the Helmholtz equation

In this work, we consider the problem of designing a cloak for waves described by the Helmholtz equation from an integer programming point of view. The problem can be modeled as a PDE-constrained optimization problem with integer-valued control inputs that are distributed in the computational domain. A first-discretize-then-optimize approach results in a large-scale mixed-integer nonlinear program that is in general intractable because of the large number of integer variables that arise from the discretization of the domain. Instead, we propose an efficient algorithm that is able to approximate the local infima of the underlying nonconvex infinite-dimensional problem arbitrarily close without the need to solve the discretized finite-dimensional integer programs to optimality. We optimize only the continuous relaxations of the approximations for local minima and then apply the sum-up rounding methodology to obtain integer-valued controls. If the solutions of the discretized continuous relaxations converge to a local minimizer of the continuous relaxation, then the resulting discrete-valued control sequence converges weakly \(^*\) in \(L^\infty\) to the same local minimizer. These approximation properties follow under suitable refinements of the involved discretization grids. Our results use familiar concepts arising from the analytical properties of the underlying PDE and complement previous results, derived from a topology optimization point of view.

97 MATHEMATICS AND COMPUTING↗

Spatially dependent regularization parameter selection for total generalized variation-based image denoising

We propose a novel image denoising model based on the total generalized variation (TGV) regularization. In the model, a spatially dependent regularization parameter is utilized to adaptively fit the local image features, resulting in further exploitation of the denoising potential of the TGV regularization. The proposed model is formulated under a joint optimization framework, by which the estimations of the restored image and the regularization parameter are achieved simultaneously. Furthermore, the model is general purpose that can handle various types of noise occurring in image processing. An alternating minimization-based numerical scheme is especially developed, which leads to an efficient algorithmic solution to the nonconvex optimization problem. Numerical experiments are reported to illustrate the effectiveness of our model in terms of both peak signal-to-noise ratio and visual perception.

97 MATHEMATICS AND COMPUTING↗

A fast eigenvalue approach for solving the trust region subproblem with an additional linear inequality

In this paper, we study the extended trust region subproblem (eTRS) in which the trust region intersects the Euclidean ball with a single linear inequality constraint. By reformulating the Lagrangian dual of eTRS as a two-parameter linear eigenvalue problem, we state a necessary and sufficient condition for its strong duality in terms of an optimal solution of a linearly constrained bivariate concave maximization problem. This results in an efficient algorithm for solving eTRS of large size whenever the strong duality is detected. Finally, some numerical experiments are given to show the effectiveness of the proposed method.

97 MATHEMATICS AND COMPUTING↗

An analytical method as a preconditioning modeling for systems of linear equations

In this paper, we propose a simple and practical preconditioner based on the homotopy analysis method. Furthermore, using this modeling, we design an efficient algorithm to solve linear systems. Within the computational framework, convection–diffusion equation candidates are investigated and evaluated. Finally, computational comparisons of the standard methods against preconditioned methods based on experiments are presented which illustrate the merits of the simplicity, power, and effectiveness of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗

Effective construction of eigenvectors for a class of singular sparse matrices

Fundamental results and an efficient algorithm for constructing eigenvectors corresponding to non-zero eigenvalues of matrices with zero rows and/or columns are developed. The formulation is built on the relation between eigenvectors of such matrices and the eigenvectors of their submatrices after removing all zero rows and columns. While being easily utilized, the algorithm decreases the computation time needed for numerical eigenanalysis, and resolves potential numerical eigensolver instabilities.

97 MATHEMATICS AND COMPUTING↗

Applications of the worldline Monte Carlo formalism in quantum mechanics

Highlights: Universal approach to the numerical computation of the Euclidean path integral. Inspired by recent work in relativistic quantum field theory. Here adapted to non-relativistic quantum mechanics. Worked out for the computation of propagators and ground-state energies. Special smoothing procedure for singular potentials. -- Abstract: In recent years efficient algorithms have been developed for the numerical computation of relativistic single-particle path integrals in quantum field theory. Here, we adapt this “worldline Monte Carlo” approach to the standard problem of the numerical approximation of the non-relativistic path integral, resulting in a formalism whose characteristic feature is the fast, non-recursive generation of an ensemble of trajectories that is independent of the potential, and is thus universally applicable. The numerical implementation discretises the trajectories with respect to their time parametrisation but maintains a continuous spatial domain. In the case of singular potentials, the discretised action gets adapted to the singularity through a “smoothing” procedure. We show for a variety of examples (the harmonic oscillator in various dimensions, the modified Pöschl–Teller potential, delta-function potentials, the Coulomb and Yukawa potentials) that the method allows one to obtain fast and reliable estimates for the Euclidean propagator and use them in a certain time window suitable for extracting the ground state energy. Usually Monte Carlo calculations in quantum mechanics are performed using algorithms that involve a more specific adaptation to the potential, and we briefly compare our method with the most widely used such algorithms, which are of Metropolis type. As an aside, we apply it for studying the classical limit where nearly classical trajectories are expected to dominate in the path integral. We expect the advances made here to be useful also in the relativistic case.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A high-order discontinuous Galerkin method with unstructured space–time meshes for two-dimensional compressible flows on domains with large deformations

We introduce a high-order accurate space-time discontinuous Galerkin method for solving two-dimensional compressible flow problems on fully unstructured space-time meshes. The discretization is based on a nodal formulation, with appropriate numerical fluxes for the first and the second-order terms, respectively. The scheme is implicit, and we solve the resulting non-linear systems using a parallel Newton-Krylov solver. The meshes are produced by a mesh moving technique with element connectivity updates, and the corresponding space-time elements are produced directly based on these local operations. To obtain globally conforming tetrahedral meshes, we first derive the required conditions on a prism boundary mesh to allow for a valid local triangulation. Next, we present an efficient algorithm for finding a global mesh that satisfies these conditions. We additionally show how to add and remove mesh nodes, again using local constructs for the space-time mesh. Our approach is demonstrated on a number of test problems, showing the high-order accuracy for model problems, and the ability to solve flow problems on domains with complex large deformations.

97 MATHEMATICS AND COMPUTING↗

Efficient and robust phase-split computations in the internal energy, volume, and moles ( UVN ) space

Phase-split computations in an isolated system, which in general may be defined as one where the total internal energy (U), volume (V), and the number of moles (N = N 1 , N 2 ,..., N n ) of the components are fixed at some specified set of values, involves the determination of the temperature (T), pressure (P), plus the amount and composition of the various phases that constitute the system. A simpler, but analogous problem is one where T, P, and N are specified instead. In TPN space, one may first perform a stability analysis to determine whether the system is stable, meaning whether at equilibrium it will split up into multiple phases or remain in single phase. If the single-phase state is unstable, the stability analysis reliably provides a good set of initial guesses in the subsequent phase-split computations. In UVN space, however, we demonstrate that the stability analysis (which is the main subject of our earlier study [1]) may not in general provide good enough initial guesses; we offer alternative strategies for setting up good initial guesses. Furthermore, we show that a combination of successive substitution iteration (SSI) and Newton's method---two iterative methods that are prevalent in the literature in TPN space---facilitates a robust and efficient algorithm for phase-split computations in isolated systems. Finally, this combination has so far not been applied in UVN space.

02 PETROLEUM↗

CHARACTERIZATION OF DISCONTINUITIES IN HIGH-DIMENSIONAL STOCHASTIC PROBLEMS ON ADAPTIVE SPARSE GRIDS

In this paper we present a set of efficient algorithms for detection and identification of discontinuities in high dimensional space. The method is based on extension of polynomial annihilation for edge detection in low dimensions. Compared to the earlier work, the present method poses significant improvements for high dimensional problems. The core of the algorithms relies on adaptive refinement of sparse grids. It is demonstrated that in the commonly encountered cases where a discontinuity resides on a small subset of the dimensions, the present method becomes optimal , in the sense that the total number of points required for function evaluations depends linearly on the dimensionality of the space. The details of the algorithms will be presented and various numerical examples are utilized to demonstrate the efficacy of the method.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗