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 253 records · Page 14

Computing Bounds on Resource Levels for Flexible Plans

A new algorithm efficiently computes the tightest exact bound on the levels of resources induced by a flexible activity plan (see figure). Tightness of bounds is extremely important for computations involved in planning because tight bounds can save potentially exponential amounts of search (through early backtracking and detection of solutions), relative to looser bounds. The bound computed by the new algorithm, denoted the resource-level envelope, constitutes the measure of maximum and minimum consumption of resources at any time for all fixed-time schedules in the flexible plan. At each time, the envelope guarantees that there are two fixed-time instantiations one that produces the minimum level and one that produces the maximum level. Therefore, the resource-level envelope is the tightest possible resource-level bound for a flexible plan because any tighter bound would exclude the contribution of at least one fixed-time schedule. If the resource- level envelope can be computed efficiently, one could substitute looser bounds that are currently used in the inner cores of constraint-posting scheduling algorithms, with the potential for great improvements in performance. What is needed to reduce the cost of computation is an algorithm, the measure of complexity of which is no greater than a low-degree polynomial in N (where N is the number of activities). The new algorithm satisfies this need. In this algorithm, the computation of resource-level envelopes is based on a novel combination of (1) the theory of shortest paths in the temporal-constraint network for the flexible plan and (2) the theory of maximum flows for a flow network derived from the temporal and resource constraints. The measure of asymptotic complexity of the algorithm is O(N O(maxflow(N)), where O(x) denotes an amount of computing time or a number of arithmetic operations proportional to a number of the order of x and O(maxflow(N)) is the measure of complexity (and thus of cost) of a maximumflow algorithm applied to an auxiliary flow network of 2N nodes. The algorithm is believed to be efficient in practice; experimental analysis shows the practical cost of maxflow to be as low as O(N1.5). The algorithm could be enhanced following at least two approaches. In the first approach, incremental subalgorithms for the computation of the envelope could be developed. By use of temporal scanning of the events in the temporal network, it may be possible to significantly reduce the size of the networks on which it is necessary to run the maximum-flow subalgorithm, thereby significantly reducing the time required for envelope calculation. In the second approach, the practical effectiveness of resource envelopes in the inner loops of search algorithms could be tested for multi-capacity resource scheduling. This testing would include inner-loop backtracking and termination tests and variable and value-ordering heuristics that exploit the properties of resource envelopes more directly.

Muscvettola, Nicola↗

Improving reproducibility in synchrotron tomography using implementation-adapted filters

For reconstructing large tomographic datasets fast, filtered backprojection-type or Fourier-based algorithms are still the method of choice, as they have been for decades. These robust and computationally efficient algorithms have been integrated in a broad range of software packages. The continuous mathematical formulas used for image reconstruction in such algorithms are unambiguous. However, variations in discretization and interpolation result in quantitative differences between reconstructed images, and corresponding segmentations, obtained from different software. This hinders reproducibility of experimental results, making it difficult to ensure that results and conclusions from experiments can be reproduced at different facilities or using different software. In this paper, a way to reduce such differences by optimizing the filter used in analytical algorithms is proposed. These filters can be computed using a wrapper routine around a black-box implementation of a reconstruction algorithm, and lead to quantitatively similar reconstructions. Use cases for this approach are demonstrated by computing implementation-adapted filters for several open-source implementations and applying them to simulated phantoms and real-world data acquired at the synchrotron. Our contribution to a reproducible reconstruction step forms a building block towards a fully reproducible synchrotron tomography data processing pipeline.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

An advanced algorithm for construction of Integral Transport Matrix Method operators using accumulation of single cell coupling factors

The Integral Transport Matrix Method (ITMM) has been shown to be an effective method for solving the neutron transport equation in large domains on massively parallel architectures. In the limit of very large number of processors, the speed of the algorithm, and its suitability for unstructured meshes, i.e. other than an ordered Cartesian grid, is limited by the construction of four matrix operators required for obtaining the solution in each sub-domain. The existing algorithm used for construction of these matrix operators, termed the differential mesh sweep, is computationally expensive and was developed for a structured grid. This work proposes the use of a new algorithm for construction of these operators based on the construction of a single, fundamental matrix representing the transport of a particle along every possible path throughout the sub-domain mesh. Each of the operators is constructed by multiplying an element of this fundamental matrix by two factors dependent only upon the operator being constructed and on properties of the emitting and incident cells. The ITMM matrix operator construction time for the new algorithm is demonstrated to be shorter than the existing algorithm in all tested cases with both isotropic and anisotropic scattering considered. While also being a more efficient algorithm on a structured Cartesian grid, the new algorithm is promising in its geometric robustness and potential for being applied to an unstructured mesh, with the ultimate goal of application to an unstructured tetrahedral mesh on a massively parallel architecture. (authors)

97 MATHEMATICS AND COMPUTING↗

Petascale solvers for anisotropic PDEs in atmospheric modelling on GPU clusters

Memory bound applications such as solvers for large sparse systems of equations remain a challenge for GPUs. Fast solvers should be based on numerically efficient algorithms and implemented such that global memory access is minimised. To solve systems with trillions ( O ( 10 12 ) ) unknowns the code has to make efficient use of several million individual processor cores on large GPU clusters. We describe the multi-GPU implementation of two algorithmically optimal iterative solvers for anisotropic PDEs which are encountered in (semi-) implicit time stepping procedures in atmospheric modelling. In this application the condition number is large but independent of the grid resolution and both methods are asymptotically optimal, albeit with different absolute performance. In particular, an important constant in the discretisation is the CFL number; only the multigrid solver is robust to changes in this constant. We parallelise the solvers and adapt them to the specific features of GPU architectures, paying particular attention to efficient global memory access. We achieve a performance of up to 0.78 PFLOPs when solving an equation with 0.55 · 10 12 unknowns on 16384 GPUs; this corresponds to about 3% of the theoretical peak performance of the machine and we use more than 40% of the peak memory bandwidth with a Conjugate Gradient (CG) solver. Although the other solver, a geometric multigrid algorithm, has a slightly worse performance in terms of FLOPs per second, overall it is faster as it needs less iterations to converge; the multigrid algorithm can solve a linear PDE with half a trillion unknowns in about one second.

Computer Science↗

Digital processing considerations for extraction of ocean wave image spectra from raw synthetic aperture radar data

The digital processing requirements of several algorithms for extracting the spectrum of a detected synthetic aperture radar (SAR) image from the raw SAR data are described and compared. The most efficient algorithms for image spectrum extraction from raw SAR data appear to be those containing an intermediate image formation step. It is shown that a recently developed compact formulation of the image spectrum in terms of the raw data is computationally inefficient when evaluated directly, in comparison with the classical method where matched-filter image formation is an intermediate result. It is also shown that a proposed indirect procedure for digitally implementing the same compact formulation is somewhat more efficient than the classical matched-filtering approach. However, this indirect procedure includes the image formation process as part of the total algorithm. Indeed, the computational savings afforded by the indirect implementation are identical to those obtained in SAR image formation processing when the matched-filtering algorithm is replaced by the well-known 'dechirp-Fourier transform' technique. Furthermore, corrections to account for slant-to-ground range conversion, spherical earth, etc., are often best implemented in the image domain, making intermediate image formation a valuable processing feature.

Lahaie, I. J.↗

Free-Vibration Analysis of Structures

Improved numerical procedure more than twice as fast as previous methods. Unified numerical algorithm efficiently solves free-vibration problems of stationary or spinning structures with or without viscous or structural damping. Algorithm used to solve static problems involving multiple loads and to solve quadratic matrix eigenvalue problems associated with finite-dynamic-element structural discretization.

Gupta, K. K.↗

Studying Turbulence Using Numerical Simulation Databases: Proceedings of the Summer Program - No. 7

The Seventh Summer Program of the Center for Turbulence Research took place in the four-week period, July 5 to July 31, 1998. This was the largest CTR Summer Program to date, involving thirty-six participants from the U. S. and nine other countries. Thirty-one Stanford and NASA-Ames staff members facilitated and contributed to most of the Summer projects. A new feature, and perhaps a preview of the future programs, was that many of the projects were executed on non-NASA computers. These included supercomputers located in Europe as well as those operated by the Departments of Defense and Energy in the United States. In addition, several simulation programs developed by the visiting participants at their home institutions were used. Another new feature was the prevalence of lap-top personal computers which were used by several participants to carry out some of the work that in the past were performed on desk-top workstations. We expect these trends to continue as computing power is enhanced and as more researchers (many of whom CTR alumni) use numerical simulations to study turbulent flows. CTR's main role continues to be in providing a forum for the study of turbulence for engineering analysis and in facilitating intellectual exchange among the leading researchers in the field. Once again the combustion group was the largest. Turbulent combustion has enjoyed remarkable progress in using simulations to address increasingly complex and practically more relevant questions. The combustion group's studies included such challenging topics as fuel evaporation, soot chemistry, and thermonuclear reactions. The latter study was one of three projects related to the Department of Energy's ASCI Program (www.llnl.gov/asci); the other two (rocket propulsion and fire safety) were carried out in the turbulence modeling group. The flow control and acoustics group demonstrated a successful application of the so-called evolution algorithms which actually led to a previously unknown forcing strategy for jets yielding increased spreading rate. A very efficient algorithm for flow in complex geometries with moving boundaries based on the immersed boundary forcing technique was tested with very encouraging results. Also a new strategy for the destruction of aircraft trailing vortices was introduced and tested. The Reynolds Averaged Modeling (RANS) group demonstrated that the elliptic relaxation concept for RANS calculations is also applicable to transonic flows with shocks; however, prediction of laminar/turbulent transition remains an important pacing item. A large fraction of the LES effort was devoted to the development and testing of a new algorithmic procedure (as opposed to phenomenological model) for subgrid scale modeling based on regularized de-filtering of the flow variables. This appears to be a very promising approach, and a significant effort is currently underway to assess its robustness in high Reynolds number flows and in conjunction with numerical methods for complex flows. As part of the Summer Program two review tutorials were given on Turbulent structures in hydrocarbon pool fires (Sheldon Tieszen), and Turbulent combustion modeling: from RANS to LES via DNS (Luc Vervisch); and two seminars entitled Assessment of turbulence models for engineering applications (Paul Durbin) and Subgrid-scale modeling for non-premixed, turbulent reacting flows (James Riley) were presented. A number of colleagues from universities, government agencies, and industry attended the final presentations of the participants on July 31 and participated in the discussions. There are twenty-six papers in this volume grouped in five areas. Each group is preceded with an overview by its coordinator.

Source record↗

Space station dynamics, attitude control and momentum management

The Space Station Attitude Control System software test-bed provides a rigorous environment for the design, development and functional verification of GN and C algorithms and software. The approach taken for the simulation of the vehicle dynamics and environmental models using a computationally efficient algorithm is discussed. The simulation includes capabilities for docking/berthing dynamics, prescribed motion dynamics associated with the Mobile Remote Manipulator System (MRMS) and microgravity disturbances. The vehicle dynamics module interfaces with the test-bed through the central Communicator facility which is in turn driven by the Station Control Simulator (SCS) Executive. The Communicator addresses issues such as the interface between the discrete flight software and the continuous vehicle dynamics, and multi-programming aspects such as the complex flow of control in real-time programs. Combined with the flight software and redundancy management modules, the facility provides a flexible, user-oriented simulation platform.

Sunkel, John W.↗

Stability and convergence analysis of the quasi-dynamics method for the initial pebble packing

The simulation for the pebble flow recirculation within Pebble Bed Reactors (PBRs) requires an efficient algorithm to generate an initial overlap-free pebble configuration within the reactor core. In the previous work, a dynamics-based approach, the Quasi-Dynamics Method (QDM), has been proposed to generate densely distributed pebbles in PBRs with cylindrical and annular core geometries. However, the stability and the efficiency of the QDM were not fully addressed. In this work, the algorithm is reformulated with two control parameters and the impact of these parameters on the algorithm performance is investigated. Firstly, the theoretical analysis for a 1-D packing system is conducted and the range of the parameter in which the algorithm is convergent is estimated. Then, this estimation is verified numerically for a 3-D packing system. Finally, the algorithm is applied to modeling the PBR fuel loading configuration and the convergence performance at different packing fractions is presented. Results show that the QDM is efficient in packing pebbles within the realistic range of the packing fraction in PBRs, and it is capable in handling cylindrical geometry with packing fractions up to 63.5%. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Portable Data-Parallel Surface Reconstruction on a Uniform Rectilinear Grid

With the increasing heterogeneity and on-node parallelism of high-performance computing hardware, a major challenge is to develop portable and efficient algorithms and software. In this work, we present our implementation of a portable code to perform surface reconstruction using NVIDIA's Thrust library. Surface reconstruction is a technique commonly used in volume tracking methods for simulations of multimaterial flow with interfaces. Here, we have designed a 3D mesh data structure that is easily mapped to the 1D vectors used by Thrust and at the same time is simple to use and uses familiar data structure terminology (such as cells, faces, vertices, and edges). With this new data structure in place, we have implemented a piecewise linear interface reconstruction algorithm in 3 dimensions that effectively exploits the symmetry present in a uniform rectilinear computational cell. Finally, we report performance results, which show that a single implementation of these algorithms can be compiled to multiple backends (specifically, multi-core CPUs, NVIDIA GPUs, and Intel Xeon Phi processors), making efficient use of the available parallelism on each. We also compare performance of our implementation to a legacy FORTRAN implementation in Message Passing Interface (MPI) and show performance parity on single and multi-core CPU and achieved good parallel speed-ups on GPU. In conclusion, our research demonstrates the advantage of performance portability of the underlying data-parallel programming model.

97 MATHEMATICS AND COMPUTING↗

SWAMP+: multiple subsequence alignment using associative massive parallelism

A new parallel algorithm SWAMP+ incorporates the Smith-Waterman sequence alignment on an associative parallel model known as ASC. It is a highly sensitive parallel approach that expands traditional pairwise sequence alignment. This is the first parallel algorithm to provide multiple non-overlapping, non-intersecting subsequence alignments with the accuracy of Smith-Waterman. The efficient algorithm provides multiple alignments similar to BLAST while creating a better workflow for the end users. The parallel portions of the code run in O(m+n) time using m processors. When m = n, the algorithmic analysis becomes O(n) with a coefficient of two, yielding a linear speedup. Implementation of the algorithm on the SIMD ClearSpeed CSX620 confirms this theoretical linear speedup with real timings.

99 GENERAL AND MISCELLANEOUS↗

Extracting and Interpreting Electrochemical Impedance Spectra (EIS) from Physics-Based Models of Lithium-Ion Batteries

This paper implements a highly efficient algorithm to extract electrochemical impedance spectra (EIS) from physics-based battery models (e.g., a P2D model). The mathematical approach is different from how EIS is practiced experimentally. Experimentally, the voltage (current) is harmonically perturbed over a wide range of frequencies and the amplitude and phase shift of the corresponding current (voltage) is measured. The experimental approach can be implemented in simulation software, but is computationally expensive. The approach here is to determine locally linear state-space models from the full physical model. The four Jacobian matrices that are the basis of the state-space models can be derived by numerical differentiation of the physical model. The EIS is then extracted from the state-space model using computationally efficient matrix-manipulation techniques. The algorithm can evaluate the full EIS at an instant in time during a transient, independent of whether the battery is in a stationary state. The approach is also able to separate the full-cell impedance to evaluate partial EIS, such as for a battery anode alone. Although such partial EIS is difficult to measure experimentally, the partial EIS provides valuable insights in interpreting the full-cell EIS.

25 ENERGY STORAGE↗

Data-Driven Prediction and Optimization of Energy Use for Transit Fleets of Electric and ICE Vehicles

Due to the high upfront cost of electric vehicles, many public transit agencies can afford only mixed fleets of internal combustion and electric vehicles. Optimizing the operation of such mixed fleets is challenging because it requires accurate trip-level predictions of electricity and fuel use as well as efficient algorithms for assigning vehicles to transit routes. We present a novel framework for the data-driven prediction of trip-level energy use for mixed-vehicle transit fleets and for the optimization of vehicle assignments, which we evaluate using data collected from the bus fleet of CARTA, the public transit agency of Chattanooga, TN. We first introduce a data collection, storage, and processing framework for system-level and high-frequency vehicle-level transit data, including domain-specific data cleansing methods. We train and evaluate machine learning models for energy prediction, demonstrating that deep neural networks attain the highest accuracy. Based on these predictions, we formulate the problem of minimizing energy use through assigning vehicles to fixed-route transit trips. We propose an optimal integer program as well as efficient heuristic and meta-heuristic algorithms, demonstrating the scalability and performance of these algorithms numerically using the transit network of CARTA.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Fast Near-Optimal Heterogeneous Task Allocation via Flow Decomposition

Multi-robot systems are uniquely well-suited to perform complex tasks such as patrolling and tracking, infor- mation gathering, and pick-up and delivery problems, offering significantly higher performance than single-robot systems. A fundamental building block in most multi-robot systems is dynamic task allocation: assigning robots to tasks (e.g., patrolling an area, or servicing a transportation request) as they appear based on the robots’ states to maximize reward. In many practical situations, the allocation must account for potentially heteroge- neous capabilities (e.g., availability of appropriate sensors or actuators) to ensure the feasibility of execution, and exploit predictive information concerning the likelihood of future tasks to promote a higher reward over a long time horizon. To this end, we present an efficient algorithm for predictive heterogeneous task- allocation achieving an approximation factor of at least 1/2 of the optimal reward. Our approach demonstrates that the problem can be decomposed into several homogeneous subproblems that can be solved efficiently using min-cost flow. Through simulation experiments, we show that our algorithm is faster by several orders of magnitude than a MILP-based approach.

Pavone, Marco↗

Algorithms for changing the step size

Approximately ten different ways for changing the step size used by multistep methods are enumerated, and their good and bad features are compared. More efficient algorithms are given for the difference formulations of a frequently used halving and doubling process, and a cure for the instability inherent in this halving process is proposed.

Krogh, F. T.↗

Transport Aircraft Wing Camber Control: A Periodic Perturbation Approach

The possibilities of camber control are underscored by the relatively recent introduction of fly-by-wire technology in modem transport aircraft. To date, however, the issue of the algorithm for in-flight adaptive camber optimization has not been properly addressed. As such, the development of a robust and efficient algorithm to adjust, in flight, the aircraft control surfaces configuration is in order. This paper explores the applicability a periodic perturbation optimizing technique to this problem. The method is based on a direct measurement of the performance and, as such, it also includes the engines' contributions to the overall performance optimization. The actual performance improvement comes, thus, from the integrated effects of airframe and engine. The algorithm is demonstrated on a B720 flight simulator at NASA/Dryden Simulation Laboratory.

Espana, Martin↗

Distributed and communication-efficient solutions to linear equations with special sparse structure

In this paper we report two distributed and communication-efficient algorithms based on the multi-agent system are proposed to solve a system of linear equations with the Laplacian sparse system matrix. One algorithm is based on the gradient descent method in optimization. In this algorithm, the agents only share partial information instead of all of their collective state vectors to save significant communication. The other algorithm is obtained by approximating Newton’s method for a faster convergence rate. Although it requires twice as much communication as the first one, it is still communication-efficient given the low dimension of the information shared among agents. The convergence at a linear rate is proved for both algorithms, and a comprehensive comparison of their convergence rate, communication burden, and computation costs is also performed. The proposed algorithms can be applied to various systems to solve those problems that can be modeled as a system of linear equations with a Laplacian sparse system matrix. Simulation results with the electric power system illustrate their effectiveness.

42 ENGINEERING↗

Implicit, nonswitching, vector-oriented algorithm for steady transonic flow

A rapid computation of a sequence of transonic flow solutions has to be performed in many areas of aerodynamic technology. The employment of low-cost vector array processors makes the conduction of such calculations economically feasible. However, for a full utilization of the new hardware, the developed algorithms must take advantage of the special characteristics of the vector array processor. The present investigation has the objective to develop an efficient algorithm for solving transonic flow problems governed by mixed partial differential equations on an array processor.

Lottati, I.↗