Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithms.”

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 1,675 records · Page 93

Preliminary performance evaluation of P++ single event proton scattering algorithms on GPUS - 25688

A need has been realized for fast, accurate charged particle transport in a wide variety of domains. Utilizing hardware acceleration through GPUs now common in user desktops, speedups in simulation comparable to those found with HPC systems can be realized for a fraction of the price. Preliminary results on the P++ proton transport code developed by the Rensselaer Radiation Measurement and Dosimetry Group (RRMDG) are presented. The code has been validated for the 1 GeV to 1 MeV energy regime and is targeted to benefit application areas such as proton radiography, space radiation research, and clinical accelerator therapy. The code is notable for employing a single event, 'on the fly' cross section based transport algorithm rather than the traditional condensed history or step based method seen in many production Monte Carlo codes. Performance improvements for the P++ code have been introduced through MPI parallelization as well as a CUDA version of the transport algorithm capable of running on NVidia GPUs. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗

On the benefit of using both hand calculation methods and computer experiments algorithms to solve complex nuclear criticality safety problems - 14299

A companion paper shows the 'anomalies', and even the safety issues, that may be raised by the very usual problem of making safe a fissile mass inside a controlled geometry. These anomalies mainly come from the solving of such problems which belong to the mathematical family of 'robust inversion' including two inversion parameters (the fissile mass and the geometry) and one nuisance parameter (the moderation ratio of the fissile material). Since a 'brute force' method of resolution requires a lot of calculations and since a 'smart' method of resolution requires a lot of engineer time, it is tempting to solve these problems by a 'custom made' approach rather than to achieve a 'whole' resolution. The present paper shows how one can use a hand calculation method (derivation of the one-speed diffusion theory) to perform the whole resolution of such kind of problems with a minimum calculations and human efforts. The powerful capability of predicting the 'anomalies' highlighted in the companion paper is shown. Then the limitations of such a method are discussed: limitation in the geometry of the problem and bias in absolute values prediction. Finally, new algorithms of computer experiments design, dedicated to solve robust inversion problems and based on Kriging surrogates, are tested to solve these problems with limiting calculations and human efforts. The performance of these new algorithms may supplement the one-speed diffusion theory limitations. (authors)

42 ENGINEERING↗

A generalized vector-valued total variation algorithm

We propose a simple but flexible method for solving the generalized vector-valued TV (VTV) functional, which includes both the {ell}{sup 2}-VTV and {ell}{sup 1}-VTV regularizations as special cases, to address the problems of deconvolution and denoising of vector-valued (e.g. color) images with Gaussian or salt-andpepper noise. This algorithm is the vectorial extension of the Iteratively Reweighted Norm (IRN) algorithm [I] originally developed for scalar (grayscale) images. This method offers competitive computational performance for denoising and deconvolving vector-valued images corrupted with Gaussian ({ell}{sup 2}-VTV case) and salt-and-pepper noise ({ell}{sup 1}-VTV case).

99 GENERAL AND MISCELLANEOUS↗

Incremental Clustering Algorithm For Earth Science Data Mining

Remote sensing data plays a key role in understanding the complex geographic phenomena. Clustering is a useful tool in discovering interesting patterns and structures within the multivariate geospatial data. One of the key issues in clustering is the specication of appropriate number of clusters, which is not obvious in many practical situations. In this paper we provide an extension of G-means algorithm which automatically learns the number of clusters present in the data and avoids over estimation of the number of clusters. Experimental evaluation on simulated and remotely sensed image data shows the effectiveness of our algorithm.

58 GEOSCIENCES↗

Spatio-Temporal Signal Twice-Whitening Algorithms on the hx3100 Ultra-Low Power Multicore Processor

While modern signal detection theory fully accounts for spatially distributed sensors, exploiting these techniques for real-time sensing using large, underwater acoustic arrays requires advances in the spatio-temporal signal processing algorithms. In particular, the computational complexity of many spatio-temporal processing techniques is so large that conventional computer processors lack sufficient throughput to provide real-time processing of large spatio-temporal data sets. These limits are exacerbated when constraints, such as power consumption or footprint, reduce the available computational resources. In this report, we demonstrate an implementation of a signal twice-whitening algorithm that is better suited for processing spatio-temporal data in real time. We emphasize these advances by implementing data whitening on the Coherent Logix hx3100 processor, a programmable multicore processor intended for low-power and high-throughput signal processing. These results serve as an example of how the novel capabilities available from emerging multicore processor platforms can provide real-time, software-defined processing of large data sets acquired by spatially distributed sensing.

99 GENERAL AND MISCELLANEOUS↗

High-efficiency space-based software radio architectures & algorithms (a minimum size, weight, and power TeraOps processor)

Los Alamos has recently completed the latest in a series of Reconfigurable Software Radios, which incorporates several key innovations in both hardware design and algorithms. Due to our focus on satellite applications, each design must extract the best size, weight, and power performance possible from the ensemble of Commodity Off-the-Shelf (COTS) parts available at the time of design. In this case we have achieved 1 TeraOps/second signal processing on a 1920 Megabit/second datastream, while using only 53 Watts mains power, 5.5 kg, and 3 liters. This processing capability enables very advanced algorithms such as our wideband RF compression scheme to operate remotely, allowing network bandwidth constrained applications to deliver previously unattainable performance.

47 OTHER INSTRUMENTATION↗

A background correction algorithm for Van Allen Probes MagEIS electron flux measurements

We describe an automated computer algorithm designed to remove background contamination from the Van Allen Probes Magnetic Electron Ion Spectrometer (MagEIS) electron flux measurements. We provide a detailed description of the algorithm with illustrative examples from on-orbit data. We find two primary sources of background contamination in the MagEIS electron data: inner zone protons and bremsstrahlung X-rays generated by energetic electrons interacting with the spacecraft material. Bremsstrahlung X-rays primarily produce contamination in the lower energy MagEIS electron channels (~30–500 keV) and in regions of geospace where multi-M eV electrons are present. Inner zone protons produce contamination in all MagEIS energy channels at roughly L < 2.5. The background-corrected MagEIS electron data produce a more accurate measurement of the electron radiation belts, as most earlier measurements suffer from unquantifiable and uncorrectable contamination in this harsh region of the near-Earth space environment. These background-corrected data will also be useful for spacecraft engineering purposes, providing ground truth for the near-Earth electron environment and informing the next generation of spacecraft design models (e.g., AE9).

47 OTHER INSTRUMENTATION↗

A new algorithm for three‐dimensional joint inversion of body wave and surface wave data and its application to the Southern California plate boundary region

Abstract We introduce a new algorithm for joint inversion of body wave and surface wave data to get better 3‐D P wave ( V p ) and S wave ( V s ) velocity models by taking advantage of the complementary strengths of each data set. Our joint inversion algorithm uses a one‐step inversion of surface wave traveltime measurements at different periods for 3‐D V s and V p models without constructing the intermediate phase or group velocity maps. This allows a more straightforward modeling of surface wave traveltime data with the body wave arrival times. We take into consideration the sensitivity of surface wave data with respect to V p in addition to its large sensitivity to V s , which means both models are constrained by two different data types. The method is applied to determine 3‐D crustal V p and V s models using body wave and Rayleigh wave data in the Southern California plate boundary region, which has previously been studied with both double‐difference tomography method using body wave arrival times and ambient noise tomography method with Rayleigh and Love wave group velocity dispersion measurements. Our approach creates self‐consistent and unique models with no prominent gaps, with Rayleigh wave data resolving shallow and large‐scale features and body wave data constraining relatively deeper structures where their ray coverage is good. The velocity model from the joint inversion is consistent with local geological structures and produces better fits to observed seismic waveforms than the current Southern California Earthquake Center (SCEC) model.

Fang, Hongjian↗

Global optimization of multicomponent distillation configurations: 2. Enumeration based global minimization algorithm

We present a general Global Minimization Algorithm (GMA) to identify basic or thermally coupled distillation configurations that require the least vapor duty under minimum reflux conditions for separating any ideal or near-ideal multicomponent mixture into a desired number of product streams. In this algorithm, global optimality is guaranteed by modeling the system using Underwood equations and reformulating the resulting constraints to bilinear inequalities. The speed of convergence to the globally optimal solution is increased by using appropriate feasibility and optimality based variable-range reduction techniques and by developing valid inequalities. As a result, the GMA can be coupled with already developed techniques that enumerate basic and thermally coupled distillation configurations, to provide for the first time, a global optimization based rank-list of distillation configurations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An Efficient Algorithm for Mapping Imaging Data to 3D Unstructured Grids in Computational Biomechanics

Geometries for organ scale and multiscale simulations of organ function are now routinely derived from imaging data. However, medical images may also contain spatially heterogeneous information other than geometry that are relevant to such simulations either as initial conditions or in the form of model parameters. In this manuscript, we present an algorithm for the efficient and robust mapping of such data to imaging based unstructured polyhedral grids in parallel. We then illustrate the application of our mapping algorithm to three different mapping problems: 1) the mapping of MRI diffusion tensor data to an unstuctured ventricular grid; 2) the mapping of serial cyro-section histology data to an unstructured mouse brain grid; and 3) the mapping of CT-derived volumetric strain data to an unstructured multiscale lung grid. Execution times and parallel performance are reported for each case.

Einstein, Daniel R.↗

Simulation of unsteady blood flows in a patient-specific compliant pulmonary artery with a highly parallel monolithically coupled fluid-structure interaction algorithm

Computational fluid dynamics (CFD) is increasingly used to study blood flows in patient-specific arteries for understanding certain cardiovascular diseases. The techniques work quite well for relatively simple problems, but need improvements when the problems become harder in the case when (1) the geometry becomes complex (from a few branches to a full pulmonary artery), (2) the model becomes more complex (from fluid-only calculation to coupled fluid-structure interaction calculation), (3) both the fluid and wall models become highly nonlinear, and (4) the computer on which we run the simulation is a supercomputer with tens of thousands of processor cores. To push the limit of CFD in all four fronts, in this paper, we develop and study a highly parallel algorithm for solving a monolithically coupled fluid-structure system for the modeling of the interaction of the blood flow and the arterial wall. As a case study, we consider a patient-specific, full size pulmonary artery obtained from CT (Computed Tomography) images, with an artificially added layer of wall with a fixed thickness. The fluid is modeled with a system of incompressible Navier-Stokes equations and the wall is modeled by a geometrically nonlinear elasticity equation. As far as we know this is the first time the unsteady blood flow in a full pulmonary artery is simulated without assuming a rigid wall. We report the proposed numerical algorithm and software scale well beyond 10,000 processor cores on a supercomputer for solving the fluid-structure interaction problem discretized with a stabilized finite element method in space and an implicit scheme in time involving hundreds of millions of unknowns.

97 MATHEMATICS AND COMPUTING↗

Genetic algorithm based task reordering to improve the performance of batch scheduled massively parallel scientific applications

The growth in size of networked high performance computers along with novel accelerator-based node architectures has further emphasized the importance of communication efficiency in high performance computing. The world's largest high performance computers are usually operated as shared user facilities due to the costs of acquisition and operation. Applications are scheduled for execution in a shared environment and are placed on nodes that are not necessarily contiguous on the interconnect. Furthermore, the placement of tasks on the nodes allocated by the scheduler is sub-optimal, leading to performance loss and variability. Here, we investigate the impact of task placement on the performance of two massively parallel application codes on the Titan supercomputer, a turbulent combustion flow solver (S3D) and a molecular dynamics code (LAMMPS). Benchmark studies show a significant deviation from ideal weak scaling and variability in performance. The inter-task communication distance was determined to be one of the significant contributors to the performance degradation and variability. A genetic algorithm-based parallel optimization technique was used to optimize the task ordering. This technique provides an improved placement of the tasks on the nodes, taking into account the application's communication topology and the system interconnect topology. As a result, application benchmarks after task reordering through genetic algorithm show a significant improvement in performance and reduction in variability, therefore enabling the applications to achieve better time to solution and scalability on Titan during production.

97 MATHEMATICS AND COMPUTING↗

Algorithm to solve a chance-constrained network capacity design problem with stochastic demands and finite support

Here, we consider the problem of determining the capacity to assign to each arc in a given network, subject to uncertainty in the supply and/or demand of each node. This design problem underlies many real-world applications, such as the design of power transmission and telecommunications networks. We first consider the case where a set of supply/demand scenarios are provided, and we must determine the minimum-cost set of arc capacities such that a feasible flow exists for each scenario. We briefly review existing theoretical approaches to solving this problem and explore implementation strategies to reduce run times. With this as a foundation, our primary focus is on a chance-constrained version of the problem in which α% of the scenarios must be feasible under the chosen capacity, where α is a user-defined parameter and the specific scenarios to be satisfied are not predetermined. We describe an algorithm which utilizes a separation routine for identifying violated cut-sets which can solve the problem to optimality, and we present computational results. We also present a novel greedy algorithm, our primary contribution, which can be used to solve for a high quality heuristic solution. We present computational analysis to evaluate the performance of our proposed approaches.

97 MATHEMATICS AND COMPUTING↗

Avoiding Excess Computation in Asynchronous Evolutionary Algorithms

Asynchronous evolutionary algorithms are becoming increasingly popular as a means of making full use of many processors while solving computationally expensive search and optimization problems. These algorithms excel at keeping large clusters fully utilized, but may sometimes inefficiently sample an excess of fast-evaluating solutions at the expense of higher-quality, slow-evaluating ones. We introduce a steady-state parent selection strategy, SWEET (“Selection whilE EvaluaTing”), that sometimes selects individuals that are still being evaluated and allows them to reproduce early. This gives slow-evaluating individuals that have higher fitnesses an increased ability to multiply in the population. We find that SWEET appears effective in simulated take-over time analysis, but that its benefit is confined mostly to early in the run, and our preliminary study on an autonomous vehicle controller problem that involves tuning a spiking neural network proves inconclusive.

Scott, Eric↗

Soft functions for generic jet algorithms and observables at hadron colliders

Here, we introduce a method to compute one-loop soft functions for exclusive N - jet processes at hadron colliders, allowing for different definitions of the algorithm that determines the jet regions and of the measurements in those regions. In particular, we generalize the N -jettiness hemisphere decomposition of ref. [1] in a manner that separates the dependence on the jet boundary from the observables measured inside the jet and beam regions. Results are given for several factorizable jet definitions, including anti- k T , XCone, and other geometric partitionings. We calculate explicitly the soft functions for angularity measurements, including jet mass and jet broadening, in pp → L + 1 jet and explore the differences for various jet vetoes and algorithms. This includes a consistent treatment of rapidity divergences when applicable. We also compute analytic results for these soft functions in an expansion for a small jet radius R . We find that the small- R results, including corrections up to O(R 2 ), accurately capture the full behavior over a large range of R .

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Discrete Superconvergence Analysis for Quantum Magnus Algorithms of Unbounded Hamiltonian Simulation

Motivated by various applications, unbounded Hamiltonian simulation has recently garnered great attention. Quantum Magnus algorithms, designed to achieve commutator scaling for time-dependent Hamiltonian simulation, have been found to be particularly efficient for such applications. When applied to unbounded Hamiltonian simulation in the interaction picture, they exhibit an unexpected superconvergence phenomenon. However, existing proofs are limited to the spatially continuous setting and do not extend to discrete spatial discretizations. Here, in this work, we provide the first superconvergence estimate in the fully discrete setting with a finite number of spatial discretization points N, and show that it holds with an error constant uniform in N. The proof is based on the two-parameter symbol class, which, to our knowledge, is applied for the first time in algorithm analysis. The key idea is to establish a semiclassical framework by identifying two parameters through the discretization number and the time step size rescaled by the operator norm, such that the semiclassical uniformity guarantees the uniformity of both. This approach may have broader applications in numerical analysis beyond the specific context of this work.

Borns-Weil, Yonah [University of California, Berke↗

Enriched immersed finite element and isogeometric analysis: algorithms and data structures

Immersed finite element methods provide a convenient analysis framework for problems involving geometrically complex domains, such as those found in topology optimization and microstructures for engineered materials. However, their implementation remains a major challenge due to, among other things, the need to apply nontrivial stabilization schemes and generate custom quadrature rules. This article introduces the robust and computationally efficient algorithms and data structures comprising an immersed finite element preprocessing framework. The input to the preprocessor consists of a background mesh and one or more geometries defined on its domain. The output is structured into groups of elements with custom quadrature rules formatted such that common finite element assembly routines may be used without or with only minimal modifications. The key to the preprocessing framework is the construction of material topology information, concurrently with the generation of a quadrature rule, which is then used to perform enrichment and generate stabilization rules. While the algorithmic framework applies to a wide range of immersed finite element methods using different types of meshes, integration, and stabilization schemes, the preprocessor is presented within the context of the extended isogeometric analysis. This method utilizes a structured B-spline mesh, a generalized Heaviside enrichment strategy considering the material layout within individual basis functions’ supports, and face-oriented ghost stabilization. Using a set of examples, the effectiveness of the enrichment and stabilization strategies is demonstrated alongside the preprocessor’s robustness in geometric edge cases. Additionally, the performance and parallel scalability of the implementation are evaluated.

Computer implementation↗

An algorithm for continuum modeling of rocks with multiple embedded nonlinearly-compliant joints [Continuum modeling of elasto-plastic media with multiple embedded nonlinearly-compliant joints]

Here, we present a numerical method for modeling the mechanical effects of nonlinearly-compliant joints in elasto-plastic media. The method uses a series of strain-rate and stress update algorithms to determine joint closure, slip, and solid stress within computational cells containing multiple “embedded” joints. This work facilitates efficient modeling of nonlinear wave propagation in large spatial domains containing a large number of joints that affect bulk mechanical properties. We implement the method within the massively parallel Lagrangian code GEODYN-L and provide verification and examples. We highlight the ability of our algorithms to capture joint interactions and multiple weakness planes within individual computational cells, as well as its computational efficiency. We also discuss the motivation for developing the proposed technique: to simulate large-scale wave propagation during the Source Physics Experiments (SPE), a series of underground explosions conducted at the Nevada National Security Site (NNSS).

42 ENGINEERING↗