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 325 records · Page 18

Performant implementation of the atomic cluster expansion

The atomic cluster expansion is a general polynomial expansion of the atomic energy in multi-atom basis functions. Here we implement the atomic cluster expansion in the performant C++ code PACE that is suitable for use in large scale atomistic simulations. We briefly review the atomic cluster expansion and give detailed expressions for energies and forces as well as efficient algorithms for their evaluation. We demonstrate that the atomic cluster expansion as implemented in PACE shifts a previously established Pareto front for machine learning interatomic potentials towards faster and more accurate calculations. Moreover, general purpose parameterizations are presented for copper and silicon and evaluated in detail. We show that the new Cu and Si potentials significantly improve on the best available potentials for highly accurate large-scale atomistic simulations.

74 ATOMIC AND MOLECULAR PHYSICS↗

A Higher Order, Stable Partitioned Scheme for Fluid-Structure Interaction Problems

Although still a very active area of research with many open questions, there exist highly-accurate and efficient algorithms for numerically estimating solutions to the equations of fluid motion. Similarly, great strides have been made in numerically modeling the motion of solids. However, there exist many practical applications where one must solve both fluid and structure in tandem. There is a gap in the literature for high order unconditionally stable partitioned algorithms for problems of this type. We investigate a new partitioned scheme which shows promise in filling this gap. We use a finite-element-based model with an added mass approach on problems coupling the Euler beam equation with the incompressible Navier-Stokes equations.

97 MATHEMATICS AND COMPUTING↗

An Iterative Approach for Solving the SCOPF Problem Applying LP, SOCP, and NLP Subproblems

We propose to develop efficient algorithms and software for the SCOPF problem. We will employ an iterative approach that will: a) use linear subproblems and other active set filtering techniques to identify the most important contingencies and drastically reduce the SCOPF model size; b) solve SOCP relaxations of the reduced SCOPF to converge to the neighborhood of the global optimal solution and establish a lower bound on the solution, and; c) use a non-convex, nonlinear interior-point solver, Artelys Knitro, to converge quickly to the optimal solution. To identify the most effective approach, we will experiment with several techniques to identify the tradeoffs between contingency subproblem complexity and fast solvability.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Reference guide to WPP version 2.0

WPP is a computer program for simulating seismic wave propagation on parallel machines. WPP solves the governing equations in second order formulation using a node-based finite difference approach. The basic numerical method is described in [9]. WPP implements substantial capabilities for 3-D seismic modeling, with a free surface condition on the top boundary, non-reflecting far-field boundary conditions on the other boundaries, point force and point moment tensor source terms with many predefined time dependencies, fully 3-D heterogeneous material model specification, output of synthetic seismograms in the SAC [4] format, output of GMT [11] scripts for laying out simulation information on a map, and output of 2-D slices of (derived quantites of) the solution field as well as the material model. Version 2.0 of WPP allows the free surface boundary condition to be imposed on a curved topography. For this purpose a curvilinear mesh is used near the free surface, extending into the computational domain down to a user specified level. The elastic wave equations and the free surface boundary conditions are discretized on the curvilinear mesh using the energy conserving technique described in [2]. A curvilinear mesh generator is built into WPP and the curvilinear mesh is automatically generated from the topography. Below the curvilinear grid, the elastic wave equation is discretized on Cartesian meshes, which leads to a more computationally efficient algorithm. In version 2.0 of WPP, Cartesian local mesh refinement can be used to make the computational mesh finer near the free surface, where more resolution often is needed to resolve short wave lenghts in the solution, for example in sedimentary basins. The mesh refinement is performed in the vertical direction and each Cartesian grid is constructed from user specified refinement levels. In this approach, the grid size in all three spatial directions is doubled across each mesh refinement interface, leading to substantial savings in memory and computational effort. The energy conserving mesh refinement coupling method described in [10] is used to handle the hanging nodes along the refinement interface. The examples subdirectory of the WPP source distribution contains several examples and validation tests. Many Matlab/octave scripts are provided in the tools directory.

58 GEOSCIENCES↗

Infinite quantum signal processing

Quantum signal processing (QSP) represents a real scalar polynomial of degree d using a product of unitary matrices of size 2 × 2 , parameterized by ( d + 1 ) real numbers called the phase factors. This innovative representation of polynomials has a wide range of applications in quantum computation. When the polynomial of interest is obtained by truncating an infinite polynomial series, a natural question is whether the phase factors have a well defined limit as the degree d → ∞ . While the phase factors are generally not unique, we find that there exists a consistent choice of parameterization so that the limit is well defined in the ℓ 1 space. This generalization of QSP, called the infinite quantum signal processing, can be used to represent a large class of non-polynomial functions. Our analysis reveals a surprising connection between the regularity of the target function and the decay properties of the phase factors. Our analysis also inspires a very simple and efficient algorithm to approximately compute the phase factors in the ℓ 1 space. The algorithm uses only double precision arithmetic operations, and provably converges when the ℓ 1 norm of the Chebyshev coefficients of the target function is upper bounded by a constant that is independent of d . This is also the first numerically stable algorithm for finding phase factors with provable performance guarantees in the limit d → ∞ .

Dong, Yulong [Department of Mathematics, Universit↗

DEIMoS: An Open-Source Tool for Processing High-Dimensional Mass Spectrometry Data

We present DEIMoS: Data Extraction for Integrated Multidimensional Spectrometry, a Python application programming interface and command-line tool for high-dimensional mass spectrometry data analysis workflows, offering ease of development and access to efficient algorithmic implementations. Functionality includes feature detection, feature alignment, collision cross section calibration, isotope detection, and MS/MS spectral deconvolution, with the output comprising detected features aligned across study samples and characterized by mass, CCS, tandem mass spectra, and isotopic signature. Notably, DEIMoS operates on N-dimensional data, largely agnostic to acquisition instrumentation: algorithm implementations utilize all dimensions simultaneously to (i) offer greater separation between features, improving detection sensitivity, (ii) increase alignment/feature matching confidence among datasets, and (iii) mitigate convolution artifacts in tandem mass spectra. We demonstrate DEIMoS with LC-IMS-MS/MS data, demonstrating the advantages of a multidimensional approach in each data processing step.

Colby, Sean M↗

Quantitative Scanning Laue Diffraction Microscopy: Application to the Study of 3D Printed Nickel-Based Superalloys

Progress in computing speed and algorithm efficiency together with advances in area detector and X-ray optics technologies have transformed the technique of synchrotron radiation-based scanning Laue X-ray microdiffraction. It has now evolved into a near real-time quantitative imaging tool for material structure and deformation at the micrometer and nanometer scales. We will review the achievements of this technique at the Advanced Light Source (Berkeley, CA, USA), and demonstrate its application in the thorough microstructural investigations of laser-assisted 3D printed nickel-based superalloys.

36 MATERIALS SCIENCE↗

Use of polarimetric radar measurements to constrain simulated convective cell evolution: a pilot study with Lagrangian tracking

Abstract. To probe the potential value of a radar-driven field campaign to constrain simulation of isolated convection subject to a strong aerosol perturbation, convective cells observed by the operational KHGX weather radar in the vicinity of Houston, Texas, are examined individually and statistically. Cells observed in a single case study of onshore flow conditions during July 2013 are first examined and compared with cells in a regional model simulation. Observed and simulated cells are objectively identified and tracked from observed or calculated positive specific differential phase ( K DP ) above the melting level, which is related to the presence of supercooled liquid water. Several observed and simulated cells are subjectively selected for further examination. Below the melting level, we compare sequential cross sections of retrieved and simulated raindrop size distribution parameters. Above the melting level, we examine time series of K DP and radar differential reflectivity ( Z DR ) statistics from observations and calculated from simulated supercooled rain properties, alongside simulated vertical wind and supercooled rain mixing ratio statistics. Results indicate that the operational weather radar measurements offer multiple constraints on the properties of simulated convective cells, with substantial value added from derived K DP and retrieved rain properties. The value of collocated three-dimensional lightning mapping array measurements, which are relatively rare in the continental US, supports the choice of Houston as a suitable location for future field studies to improve the simulation and understanding of convective updraft physics. However, rapid evolution of cells between routine volume scans motivates consideration of adaptive scan strategies or radar imaging technologies to amend operational weather radar capabilities. A 3-year climatology of isolated cell tracks, prepared using a more efficient algorithm, yields additional relevant information. Isolated cells are found within the KHGX domain on roughly 40 % of days year-round, with greatest concentration in the northwest quadrant, but roughly 5-fold more cells occur during June through September. During this enhanced occurrence period, the cells initiate following a strong diurnal cycle that peaks in the early afternoon, typically follow a south-to-north flow, and dissipate within 1 h, consistent with the case study examples. Statistics indicate that ~  150 isolated cells initiate and dissipate within 70 km of the KHGX radar during the enhanced occurrence period annually, and roughly 10 times as many within 200 km, suitable for multi-instrument Lagrangian observation strategies. In addition to ancillary meteorological and aerosol measurements, robust vertical wind speed retrievals would add substantial value to a radar-driven field campaign.

54 ENVIRONMENTAL SCIENCES↗

Vulnerability analysis for complex networks using aggressive abstraction.

Large, complex networks are ubiquitous in nature and society, and there is great interest in developing rigorous, scalable methods for identifying and characterizing their vulnerabilities. This paper presents an approach for analyzing the dynamics of complex networks in which the network of interest is first abstracted to a much simpler, but mathematically equivalent, representation, the required analysis is performed on the abstraction, and analytic conclusions are then mapped back to the original network and interpreted there. We begin by identifying a broad and important class of complex networks which admit vulnerability-preserving, finite state abstractions, and develop efficient algorithms for computing these abstractions. We then propose a vulnerability analysis methodology which combines these finite state abstractions with formal analytics from theoretical computer science to yield a comprehensive vulnerability analysis process for networks of realworld scale and complexity. The potential of the proposed approach is illustrated with a case study involving a realistic electric power grid model and also with brief discussions of biological and social network examples.

99 GENERAL AND MISCELLANEOUS↗

Linearized Functional Minimization for Inverse Modeling

Heterogeneous aquifers typically consist of multiple lithofacies, whose spatial arrangement significantly affects flow and transport. The estimation of these lithofacies is complicated by the scarcity of data and by the lack of a clear correlation between identifiable geologic indicators and attributes. We introduce a new inverse-modeling approach to estimate both the spatial extent of hydrofacies and their properties from sparse measurements of hydraulic conductivity and hydraulic head. Our approach is to minimize a functional defined on the vectors of values of hydraulic conductivity and hydraulic head fields defined on regular grids at a user-determined resolution. This functional is constructed to (i) enforce the relationship between conductivity and heads provided by the groundwater flow equation, (ii) penalize deviations of the reconstructed fields from measurements where they are available, and (iii) penalize reconstructed fields that are not piece-wise smooth. We develop an iterative solver for this functional that exploits a local linearization of the mapping from conductivity to head. This approach provides a computationally efficient algorithm that rapidly converges to a solution. A series of numerical experiments demonstrates the robustness of our approach.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Constrained Graph Optimization: Interdiction and Preservation Problems

The maximum flow, shortest path, and maximum matching problems are a set of basic graph problems that are critical in theoretical computer science and applications. Constrained graph optimization, a variation of these basic graph problems involving modification of the underlying graph, is equally important but sometimes significantly harder. In particular, one can explore these optimization problems with additional cost constraints. In the preservation case, the optimizer has a budget to preserve vertices or edges of a graph, preventing them from being deleted. The optimizer wants to find the best set of preserved edges/vertices in which the cost constraints are satisfied and the basic graph problems are optimized. For example, in shortest path preservation, the optimizer wants to find a set of edges/vertices within which the shortest path between two predetermined points is smallest. In interdiction problems, one deletes vertices or edges from the graph with a particular cost in order to impede the basic graph problems as much as possible (for example, delete edges/vertices to maximize the shortest path between two predetermined vertices). Applications of preservation problems include optimal road maintenance, power grid maintenance, and job scheduling, while interdiction problems are related to drug trafficking prevention, network stability assessment, and counterterrorism. Computational hardness results are presented, along with heuristic methods for approximating solutions to the matching interdiction problem. Also, efficient algorithms are presented for special cases of graphs, including on planar graphs. The graphs in many of the listed applications are planar, so these algorithms have important practical implications.

97 MATHEMATICS AND COMPUTING↗

Fast Mix Table Construction for Material Discretization

An effective hybrid Monte Carlo--deterministic implementation typically requires the approximation of a continuous geometry description with a discretized piecewise-constant material field. The inherent geometry discretization error can be reduced somewhat by using material mixing, where multiple materials inside a discrete mesh voxel are homogenized. Material mixing requires the construction of a ``mix table,'' which stores the volume fractions in every mixture so that multiple voxels with similar compositions can reference the same mixture. Mix table construction is a potentially expensive serial operation for large problems with many materials and voxels. We formulate an efficient algorithm to construct a sparse mix table in $O(\text{number of voxels}\times \log \text{number of mixtures})$ time. The new algorithm is implemented in ADVANTG and used to discretize continuous geometries onto a structured Cartesian grid. When applied to an end-of-life MCNP model of the High Flux Isotope Reactor with 270 distinct materials, the new method improves the material mixing time by a factor of 100 compared to a naive mix table implementation.

Johnson, Seth R↗

Advance Resource Provisioning in Bulk Data Scheduling

Today?s scientific and business applications generate mas- sive data sets that need to be transferred to remote sites for sharing, processing, and long term storage. Because of increasing data volumes and enhancement in current net- work technology that provide on-demand high-speed data access between collaborating institutions, data handling and scheduling problems have reached a new scale. In this paper, we present a new data scheduling model with ad- vance resource provisioning, in which data movement operations are defined with earliest start and latest comple- tion times. We analyze time-dependent resource assign- ment problem, and propose a new methodology to improve the current systems by allowing researchers and higher-level meta-schedulers to use data-placement as-a-service, so they can plan ahead and submit transfer requests in advance. In general, scheduling with time and resource conflicts is NP-hard. We introduce an efficient algorithm to organize multiple requests on the fly, while satisfying users? time and resource constraints. We successfully tested our algorithm in a simple benchmark simulator that we have developed, and demonstrated its performance with initial test results.

97 MATHEMATICS AND COMPUTING↗

Context-dependent piano music transcription with convolutional sparse coding

The present disclosure presents a novel approach to automatic transcription of piano music in a context-dependent setting. Embodiments described herein may employ an efficient algorithm for convolutional sparse coding to approximate a music waveform as a summation of piano note waveforms convolved with associated temporal activations. The piano note waveforms may be pre-recorded for a particular piano that is to be transcribed and may optionally be pre-recorded in the specific environment where the piano performance is to be performed. During transcription, the note waveforms may be fixed and associated temporal activations may be estimated and post-processed to obtain the pitch and onset transcription. Experiments have shown that embodiments of the disclosure significantly outperform state-of-the-art music transcription methods trained in the same context-dependent setting, in both transcription accuracy and time precision, in various scenarios including synthetic, anechoic, noisy, and reverberant environments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Matrix Completion Using Alternating Minimization for Distribution System State Estimation: Preprint

This paper examines the problem of state estimation in power distribution systems under low-observability conditions. The recently proposed constrained matrix completion method which combines the standard matrix completion method and power flow constraints has been shown to be effective in estimating voltage phasors under low-observability conditions using single-snapshot information. However, the method requires solving a semidefinite programming (SDP) problem, which becomes computationally infeasible for large systems and if multiple-snapshot (time-series) information is used. This paper proposes an efficient algorithm to solve the constrained matrix completion problem with time-series data. This algorithm is based on reformulating the matrix completion problem as a bilinear (non-convex) optimization problem, and applying the alternating minimization algorithm to solve this problem. This paper proves the summable convergence of the proposed algorithm, and demonstrates its efficacy and scalability via IEEE 123-bus system and a real utility feeder system. This paper also explores the value of adding more data from the history in terms of computation time and estimation accuracy.

41 EE - Solar Energy Technologies Office (EE-4S)↗

Towards an understanding of complex chemical systems: A scalable molecular simulation approach

Energy production and security are among the major challenges facing the nation. Technological breakthroughs must occur for production, storage, and use of energy with performance levels far beyond what is now possible. Only with these breakthroughs will we be able to ensure energy independence, environmental sustainability, and continued economic opportunities. To accomplish our goals will require us to have the ability to design and control matter at the molecular level of electrons and nuclei. Through quantum mechanics we can understand the chemical, electrical, and physical properties of materials. Computational chemistry allows us to examine questions that are not possible or are very difficult to examine in the laboratory. Only with the ability to carry out the computations required for the explicit treatment of quantum mechanics can we hope to pave the way for highly efficient energy technologies needed for the future. Increasingly powerful computational capabilities allows for increasing sophisticated analyses. Scientists at the Pacific Northwest National Laboratory and the University of Zurich are conducting research and developing state-of-the-art molecular simulation tools, combined with increasingly powerful supercomputers, to enable a greater understanding and manipulation of complex chemical processes. Researchers are applying efficient algorithms to obtain the dynamics of atoms and nuclei interacting under the laws of quantum mechanics to develop a new understanding of chemical reactions in solutions and at interfaces, especially as they relate to hydrogen storage and catalysis. The insights gained from these calculations will enable technological advances capable of addressing the U.S. Department of Energy’s (DOE) energy mission and keeping the US at the forefront of technology development.

Mundy, Christopher J.↗

Fast mix table construction for material discretization

An effective hybrid Monte Carlo-deterministic implementation typically requires the approximation of a continuous geometry description with a discretized piecewise-constant material field. The inherent geometry discretization error can be reduced somewhat by using material mixing, where multiple materials inside a discrete mesh voxel are homogenized. Material mixing requires the construction of a 'mix table,' which stores the volume fractions in every mixture so that multiple voxels with similar compositions can reference the same mixture. Mix table construction is a potentially expensive serial operation for large problems with many materials and voxels. We formulate an efficient algorithm to construct a sparse mix table in O(number of voxels x log number of mixtures) time. The new algorithm is implemented in ADVANTG and used to discretize continuous geometries onto a structured Cartesian grid. When applied to an end-of-life MCNP model of the High Flux Isotope Reactor with 270 distinct materials, the new method improves the material mixing time by a factor of 100 compared to a naive mix table implementation. (authors)

97 MATHEMATICS AND COMPUTING↗

An efficient, partitioned ensemble algorithm for simulating ensembles of evolutionary MHD flows at low magnetic Reynolds number

Studying the propagation of uncertainties in a nonlinear dynamical system usually involves generating a set of samples in the stochastic parameter space and then repeated simulations with different sampled parameters. The main difficulty faced in the process is the excessive computational cost. In this paper, we present an efficient, partitioned ensemble algorithm to determine multiple realizations of a reduced Magnetohydrodynamics (MHD) system, which models MHD flows at low magnetic Reynolds number. The algorithm decouples the fully coupled problem into two smaller subphysics problems, which reduces the size of the linear systems that to be solved and allows the use of optimized codes for each subphysics problem. Moreover, the resulting coefficient matrices are the same for all realizations at each time step, which allows faster computation of all realizations and significant savings in computational cost. We prove this algorithm is first order accurate and long time stable under a time step condition. Numerical examples are provided to verify the theoretical results and demonstrate the efficiency of the algorithm.

Jiang, Nan↗