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 973 records · Page 54

An efficient method for energy levels calculation using full symmetry and exact kinetic energy operator: Tetrahedral molecules

A simultaneous use of the full molecular symmetry and of an exact kinetic energy operator (KEO) is of key importance for accurate predictions of vibrational levels at a high energy range from a potential energy surface (PES). An efficient method that permits a fast convergence of variational calculations would allow iterative optimization of the PES parameters using experimental data. In this work, we propose such a method applied to tetrahedral AB{sub 4} molecules for which a use of high symmetry is crucial for vibrational calculations. A symmetry-adapted contracted angular basis set for six redundant angles is introduced. Simple formulas using this basis set for explicit calculation of the angular matrix elements of KEO and PES are reported. The symmetric form (six redundant angles) of vibrational KEO without the sin(q){sup −2} type singularity is derived. The efficient recursive algorithm based on the tensorial formalism is used for the calculation of vibrational matrix elements. A good basis set convergence for the calculations of vibrational levels of the CH{sub 4} molecule is demonstrated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multi-reference approach to the calculation of photoelectron spectra including spin-orbit coupling

X-ray photoelectron spectra provide a wealth of information on the electronic structure. The extraction of molecular details requires adequate theoretical methods, which in case of transition metal complexes has to account for effects due to the multi-configurational and spin-mixed nature of the many-electron wave function. Here, the restricted active space self-consistent field method including spin-orbit coupling is used to cope with this challenge and to calculate valence- and core-level photoelectron spectra. The intensities are estimated within the frameworks of the Dyson orbital formalism and the sudden approximation. Thereby, we utilize an efficient computational algorithm that is based on a biorthonormal basis transformation. The approach is applied to the valence photoionization of the gas phase water molecule and to the core ionization spectrum of the [Fe(H{sub 2}O){sub 6}]{sup 2+} complex. The results show good agreement with the experimental data obtained in this work, whereas the sudden approximation demonstrates distinct deviations from experiments.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Automatic derivation of many-body theories based on general Fermi vacua

This paper describes Wick&D, an implementation of the algebra of second-quantized operators normal ordered with respect to general correlated references and the corresponding Wick theorem [D. Mukherjee, Chem. Phys. Lett. 274, 561 (1997) and W. Kutzelnigg and D. Mukherjee, J. Chem. Phys. 107, 432 (1997)]. Wick&D employs a compact representation of operators and a backtracking algorithm to efficiently evaluate Wick contractions. Since Wick&D can handle both fully and partially contracted terms, it can be applied to both projective and Fock-space many-body formalisms. To demonstrate the usefulness of Wick&D, here we use it to evaluate the single-reference coupled cluster equations up to octuple excitations and report an automated derivation and implementation of the second-order driven similarity renormalization group multireference perturbation theory.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Advanced data analysis in inertial confinement fusion and high energy density physics

Bayesian analysis enables flexible and rigorous definition of statistical model assumptions with well-characterized propagation of uncertainties and resulting inferences for single-shot, repeated, or even cross-platform data. This approach has a strong history of application to a variety of problems in physical sciences ranging from inference of particle mass from multi-source high-energy particle data to analysis of black-hole characteristics from gravitational wave observations. The recent adoption of Bayesian statistics for analysis and design of high-energy density physics (HEDP) and inertial confinement fusion (ICF) experiments has provided invaluable gains in expert understanding and experiment performance. In this Review, we discuss the basic theory and practical application of the Bayesian statistics framework. We highlight a variety of studies from the HEDP and ICF literature, demonstrating the power of this technique. Due to the computational complexity of multi-physics models needed to analyze HEDP and ICF experiments, Bayesian inference is often not computationally tractable. Two sections are devoted to a review of statistical approximations, efficient inference algorithms, and data-driven methods, such as deep-learning and dimensionality reduction, which play a significant role in enabling use of the Bayesian framework. We provide additional discussion of various applications of Bayesian and machine learning methods that appear to be sparse in the HEDP and ICF literature constituting possible next steps for the community. We conclude by highlighting community needs, the resolution of which will improve trust in data-driven methods that have proven critical for accelerating the design and discovery cycle in many application areas.

47 OTHER INSTRUMENTATION↗

Massively parallel GPU enabled third-order cluster perturbation excitation energies for cost-effective large scale excitation energy calculations

We present here a massively parallel implementation of the recently developed CPS(D-3) excitation energy model that is based on cluster perturbation theory. The new algorithm extends the one developed in Baudin et al. [J. Chem. Phys., 150, 134110 (2019)] to leverage multiple nodes and utilize graphical processing units for the acceleration of heavy tensor contractions. Furthermore, we show that the extended algorithm scales efficiently with increasing amounts of computational resources and that the developed code enables CPS(D-3) excitation energy calculations on large molecular systems with a low time-to-solution. More specifically, calculations on systems with over 100 atoms and 1000 basis functions are possible in a few hours of wall clock time. This establishes CPS(D-3) excitation energies as a computationally efficient alternative to those obtained from the coupled-cluster singles and doubles model.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗

Versatile stochastic model for predictive KMC simulation of fcc metal nanostructure evolution with realistic kinetics

Stochastic lattice-gas models provide the natural framework for analysis of the surface diffusion-mediated evolution of crystalline metal nanostructures on the appropriate time scale (often 10 1 –10 4 s) and length scale. Model behavior can be precisely assessed by kinetic Monte Carlo simulation, typically incorporating a rejection-free algorithm to efficiently handle the broad range of Arrhenius rates for hopping of surface atoms. The model should realistically prescribe these rates, or the associated barriers, for a diversity of local surface environments. However, commonly used generic choices for barriers fail, even qualitatively, to simultaneously describe diffusion for different low-index facets, for terrace vs step edge diffusion, etc. We introduce an alternative Unconventional Interaction–Conventional Interaction formalism to prescribe these barriers, which, even with few parameters, can realistically capture most aspects of behavior. Here, the model is illustrated for single-component fcc metal systems, mainly for the case of Ag. It is quite versatile and can be applied to describe both the post-deposition evolution of 2D nanostructures in homoepitaxial thin films (e.g., reshaping and coalescence of 2D islands) and the post-synthesis evolution of 3D nanocrystals (e.g., reshaping of nanocrystals synthesized with various faceted non-equilibrium shapes back to 3D equilibrium Wulff shapes).

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Fluctuating hydrodynamics and the Rayleigh–Plateau instability

The Rayleigh–Plateau instability occurs when surface tension makes a fluid column become unstable to small perturbations. At nanometer scales, thermal fluctuations are comparable to interfacial energy densities. Consequently, at these scales, thermal fluctuations play a significant role in the dynamics of the instability. These microscopic effects have previously been investigated numerically using particle-based simulations, such as molecular dynamics (MD), and stochastic partial differential equation–based hydrodynamic models, such as stochastic lubrication theory. In this paper, we present an incompressible fluctuating hydrodynamics model with a diffuse-interface formulation for binary fluid mixtures designed for the study of stochastic interfacial phenomena. An efficient numerical algorithm is outlined and validated in numerical simulations of stable equilibrium interfaces. We present results from simulations of the Rayleigh–Plateau instability for long cylinders pinching into droplets for Ohnesorge numbers of Oh = 0.5 and 5.0. Both stochastic and perturbed deterministic simulations are analyzed and ensemble results show significant differences in the temporal evolution of the minimum radius near pinching. Short cylinders, with lengths less than their circumference, were also investigated. As previously observed in MD simulations, we find that thermal fluctuations cause these to pinch in cases where a perturbed cylinder would be stable deterministically. Finally, we show that the fluctuating hydrodynamics model can be applied to study a broader range of surface tension–driven phenomena.

97 MATHEMATICS AND COMPUTING↗

The all configuration mean energy multiconfiguration self-consistent-field method. I. Equal configuration weights

The All Configuration Mean Energy (ACME) conditions are a special case of state averaging for Multiconfigurational Self-Consistent-Field (MCSCF) orbital optimisation. The method is formulated using the Graphical Unitary Group Approach (GUGA) in which the Configuration State Function (CSF) basis is represented as walks within a Shavitt graph. This graphical formulation leads to efficient recursive algorithms for the energy and reduced density matrices (RDM) that are independent of the CSF dimension and that scale only as O(n2) where n is the number of occupied orbitals. The Hamiltonian matrix diagonalization step is obviated and the CSF expansion coefficients are neither referenced nor required. This allows MCSCF orbital optimisation to be performed for essentially unlimited numbers of active orbitals and arbitrarily large CSF expansions. The discussion includes various types of CSF expansion spaces, the partitioning of the essential and redundant orbital optimisation parameters, the computation of the spin-density, and the formulation of state-specific analytic gradients and nonadiabatic coupling for high-level electronic structure methods that use the ACME MCSCF orbitals.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Mixing state evolution of agglomerating particles in an aerosol chamber: Comparison of measurements and particle-resolved simulations

This article introduces a validation study of the stochastic particle-resolved aerosol model PartMC with experimental data from an aerosol chamber experiment. For the experiment, a scanning mobility particle sizer and a single-particle soot photometer were used to monitor the aerosol mixing state evolution of two initially externally-mixed aerosol populations of ammonium sulfate and black carbon particles undergoing agglomeration. We applied an efficient optimization algorithm (ProSRS) to determine several unconstrained simulation parameters and were able to successfully reproduce number concentrations and size distributions of mixed particles that formed by agglomeration. The PartMC modeling method in conjunction with the optimization procedure provides a tool for detailed comparisons of chamber experiments and modeling, where aerosol mixing state is the focus of investigation.

54 ENVIRONMENTAL SCIENCES↗

Efficient numerical methods to solve sparse linear equations with application to PageRank

Over the last two decades, the PageRank problem has received increased interest from the academic community as an efficient tool to estimate web-page importance in information retrieval. Despite numerous developments, the design of efficient optimization algorithms for the PageRank problem is still a challenge. Here, we propose three new algorithms with a linear time complexity for solving the problem over a bounded-degree graph. The idea behind them is to set up the PageRank as a convex minimization problem over a unit simplex, and then solve it using iterative methods with small iteration complexity. Our theoretical results are supported by an extensive empirical justification using real-world and simulated data.

97 MATHEMATICS AND COMPUTING↗

One-dimensional phase retrieval: Regularization, box relaxation and uniqueness

Recovering a signal from its Fourier magnitude is referred to as phase retrieval, which occurs in different fields of engineering and applied physics. This paper gives a new characterization of the phase retrieval problem. Particularly useful is the analysis revealing that the common gradient-based regularization does not restrict the set of solutions to a smaller set. Specifically focusing on binary signals, we show that a box relaxation is equivalent to the binary constraint for Fourier-types of phase retrieval. Here, we further prove that binary signals can be recovered uniquely up to trivial ambiguities under certain conditions. Finally, we use the characterization theorem to develop an efficient denoising algorithm.

97 MATHEMATICS AND COMPUTING↗

Numerical calculation of dynamical friction in electron cooling systems, including magnetic field perturbations and finite time effects

The orders-of-magnitude higher luminosities required by future electron-ion collider concepts require a dissipative force to counteract the numerous factors acting to gradually increase the phase space volume of relativistic ion beams. High-energy electron cooling systems could provide the necessary dissipation via dynamical friction, but will have to be designed for new parameter regimes. It is expected that magnetic field errors, finite interaction time and other effects will reduce the dynamical friction and hence increase the cooling time, so improved understanding of the underlying dynamics is important. We present a generalized form of the classical field-free friction force equation, which conveniently captures some of these effects. Previous work (Bell et al 2008 J. Comput. Phys. 227 8714) shows both numerical and conceptual subtleties associated with undersampling of strong collisions, and we present a rigorous mathematical treatment of such difficulties, based on the use of a modified Pareto distribution for the electron-ion impact parameters. We also present a very efficient numerical algorithm for calculating the dynamical friction on a single ion in the field free case. For the case of arbitrary magnetic field errors, we present numerical simulation results, showing agreement with our generalized friction force formula.

43 PARTICLE ACCELERATORS↗

Learning linear optical circuits with coherent states

We analyze the energy and training data requirements for supervised learning of an M-mode linear optical circuit by minimizing an empirical risk defined solely from the action of the circuit on coherent states. When the linear optical circuit acts non-trivially only on k < M unknown modes (i.e. a linear optical k-junta), we provide an energy-efficient, adaptive algorithm that identifies the junta set and learns the circuit. We compare two schemes for allocating a total energy, E, to the learning algorithm. In the first scheme, each of the T random training coherent states has energy E/T. In the second scheme, a single random MT-mode coherent state with energy E is partitioned into T training coherent states. The latter scheme exhibits a polynomial advantage in training data size sufficient for convergence of the empirical risk to the full risk due to concentration of measure on the $(2MT-1)$-sphere. Specifically, generalization bounds for both schemes are proven, which indicate that for ε-approximation of the full risk by the empirical risk with high probability, $O(E^{2/3}M^{2/3}/\epsilon^{2/3})$ training states are sufficient for the first scheme and $O(E^{1/3}M^{1/3}/\epsilon^{2/3})$ training states are sufficient for the second scheme.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Temporal network alignment via GoT-WAVE

Abstract Motivation Network alignment (NA) finds conserved regions between two networks. NA methods optimize node conservation (NC) and edge conservation. Dynamic graphlet degree vectors are a state-of-the-art dynamic NC measure, used within the fastest and most accurate NA method for temporal networks: DynaWAVE. Here, we use graphlet-orbit transitions (GoTs), a different graphlet-based measure of temporal node similarity, as a new dynamic NC measure within DynaWAVE, resulting in GoT-WAVE. Results On synthetic networks, GoT-WAVE improves DynaWAVE’s accuracy by 30% and speed by 64%. On real networks, when optimizing only dynamic NC, the methods are complementary. Furthermore, only GoT-WAVE supports directed edges. Hence, GoT-WAVE is a promising new temporal NA algorithm, which efficiently optimizes dynamic NC. We provide a user-friendly user interface and source code for GoT-WAVE. Availability and implementation http://www.dcc.fc.up.pt/got-wave/ Supplementary information Supplementary data are available at Bioinformatics online.

Aparício, David↗

Phase-weighted slant stacking for surface wave dispersion measurement

SUMMARY Surface wave retrieval from ambient noise records using seismic interferometry techniques has been widely used for multiscale shear wave velocity (Vs) imaging. One key step during Vs imaging is the generation of dispersion spectra and the extraction of a reliable dispersion curve from the retrieved surface waves. However, the sparse array geometry usually affects the ability for high-frequency (>1 Hz) seismic signals’ acquisition. Dispersion measurements are degraded by array response due to sparse sampling and often present smeared dispersion spectra with sidelobe artefacts. Previous studies usually focus on interferograms’ domain (e.g. cross-correlation function) and attempt to enhance coherent signals before dispersion measurement. We propose an alternative technique to explicitly deblur dispersion spectra through use of a phase-weighted slant-stacking algorithm. Numerical examples demonstrate the strength of the proposed technique to attenuate array responses as well as incoherent noise. Three different field examples prove the flexibility and superiority of the proposed technique: the first data set consists of ambient noise records acquired using a nodal seismometer array; the second data set utilizes distributed acoustic sensing (DAS) and a marine fibre-optic cable to acquire a similar ambient noise data set; the last data set is a vibrator-based active-source surface wave data. The enhanced dispersion measurements provide cleaner and higher-resolution spectra without distortions which will assist both human interpreters as well as ML algorithms in efficiently picking curves for subsequent Vs inversion.

58 GEOSCIENCES↗

Umbrella sampling: a powerful method to sample tails of distributions

We present the umbrella sampling (US) technique and show that it can be used to sample extremely low-probability areas of the posterior distribution that may be required in statistical analyses of data. In this approach sampling of the target likelihood is split into sampling of multiple biased likelihoods confined within individual umbrella windows. We show that the US algorithm is efficient and highly parallel and that it can be easily used with other existing Markov Chain Monte Carlo (MCMC) samplers. The method allows the user to capitalize on their intuition and define umbrella windows and increase sampling accuracy along specific directions in the parameter space. Alternatively, one can define umbrella windows using an approach similar to parallel tempering. We provide a public code that implements US as a standalone PYTHON package. We present a number of tests illustrating the power of the US method in sampling low-probability areas of the posterior and show that this ability allows a considerably more robust sampling of multimodal distributions compared to standard sampling methods. We also present an application of the method in a real world example of deriving cosmological constraints using the supernova type Ia data. We show that US can sample the posterior accurately down to the approximate to 15 sigma credible region in the Omega(m) - Omega(Lambda) plane, while for the same computational effort the affine-invariant MCMC sampling implemented in the emcee code samples the posterior reliably only to approximate to 3 sigma.

cosmology: cosmological parameters↗

Generalized measure of quantum Fisher information

Here, we present a lower bound on the quantum Fisher information (QFI) which is efficiently computable on near-term quantum devices. This bound itself is of interest, as we show that it satisfies the canonical criteria of a QFI measure. Specifically, it is essentially a QFI measure for subnormalized states, and hence it generalizes the standard QFI in this sense. Our bound employs the generalized fidelity applied to a truncated state, which is constructed via the m largest eigenvalues and their corresponding eigenvectors of the probe quantum state ρ θ . Focusing on unitary families of exact states, we analyze the properties of our proposed lower bound, and demonstrate its utility for efficiently estimating the QFI.

97 MATHEMATICS AND COMPUTING↗