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 1,477 records · Page 82

Dual pricing algorithm in ISO markets

The challenge to create efficient market clearing prices in centralized day-ahead electricity markets arises from inherent non-convexities in unit commitment problems. When this aspect is ignored, marginal prices may result in economic losses to market participants who are part of the welfare maximizing solution. In this essay, we present an axiomatic approach to efficient prices and cost allocation for a revenue neutral and non-confiscatory day-ahead market. Current cost allocation practices do not adequately attribute costs based on transparent cost causation criteria. Instead we propose an ex post multi-part pricing scheme, which we refer to as the Dual Pricing Algorithm. Lastly, our approach can be incorporated into current dayahead markets without altering the market equilibrium.

97 MATHEMATICS AND COMPUTING↗

Application of Backward Differentiation Formulas to Neutron Kinetics Problems

The neutron kinetics equations belong to the class of stiff equations for numerical time integration schemes. In this work, the accuracy and speed of algorithms based on backward differentiation formulas (BDFs) are studied with regard to point and spatial neutron kinetics problems. Using a BDF algorithm with the automatic selection of time step and order, solutions to a number of model problems with both a positive and negative reactivity insertion are analyzed. Plots of numerical cost dependences on local and global errors are presented. The results indicate that algorithms based on BDFs are highly efficient and that their application to nuclear reactor simulation is justified.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Sparsity Prior Computed Tomography Reconstruction Using a Nonstandard Simultaneous X-ray Acquisition Model

In this article we systematically evaluate the performance of several state-of-the-art, sparsity prior computed tomography (CT) reconstruction algorithms, using a nonstandard simultaneous x-ray acquisition method. Sparsity prior is an efficient strategy in CT reconstruction, relying on iterative algorithms such as the algebraic reconstruction technique to produce a crude reconstruction, based on which sparse approximation is performed. The simultaneous x-ray acquisition model ensures rapid capture of x-rays; however, it captures a significantly fewer number of attenuation measurements, and the projections are nonuniform. We propose a weighted average filter in the reconstruction framework to ensure better quality reconstruction by minimizing the effect of nonuniform projections. The performance of the state-of-the-art algorithms is analyzed with and without weighted averaging before sparse approximation, in simulated and real environments. Experiments in the simulated environment are conducted with and without the presence of noise. From the results, it is evident that sparsity prior algorithms are capable of producing cross-sectional reconstruction using the simultaneous x-ray acquisition model, and better reconstruction quality is achievable with the incorporation of weighted averaging in the reconstruction framework.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Quadrature algorithms to the luminosity distance with a time-dependent dark energy model

In our previous work [1], we have proposed two methods for computing the luminosity distance d{sub L}{sup Λ} in ΛCDM model. In this paper, two effective quadrature algorithms, known as Romberg Integration and composite Gaussian Quadrature, are presented to calculate the luminosity distance d{sub L}{sup CPL} in the Chevallier-Polarski-Linder parametrization(CPL) model. By comparing both the efficiency and accuracy of the two algorithms, we find that the second is more promising. Moreover, we develop another strategy adapted for approximating d{sub L}{sup Λ} in flat ΛCDM universe. To some extent, our methods can make contributions to the recent numerical stimulation for the investigation of dark energy cosmology.

79 ASTRONOMY AND ASTROPHYSICS↗

An adaptive discontinuous Petrov-Galerkin method for the Grad-Shafranov equation

In this work, we propose and develop an arbitrary-order adaptive discontinuous Petrov--Galerkin (DPG) method for the nonlinear Grad--Shafranov equation. An ultraweak formulation of the DPG scheme for the equation is given based on a minimal residual method. The DPG scheme has the advantage of providing more accurate gradients compared to conventional finite element methods, which is desired for numerical solutions to the Grad--Shafranov equation. The numerical scheme is augmented with an adaptive mesh refinement approach, and a criterion based on the residual norm in the minimal residual method is developed to achieve dynamic refinement. Nonlinear solvers for the resulting system are explored and a Picard iteration with Anderson acceleration is found to be efficient to solve the system. Finally, the proposed algorithm is implemented in parallel on MFEM using a domain-decomposition approach, and our implementation is general, supporting arbitrary order of accuracy and general meshes. Furthermore, numerical results are presented to demonstrate the efficiency and accuracy of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗

Department of Energy/IDEA: More best-practices research

This article continues the overview of the U.S. Department of Energy and IDEA collaboration by highlighting additional case studies that demonstrate innovative engineering approaches in district energy systems. It focuses on how campuses are improving efficiency, integrating advanced technologies, and reducing energy use and emissions through data-driven strategies. The University of Cincinnati is featured for its highly efficient chilled water system, using advanced algorithms and upgraded “smart chillers” to optimize performance, reduce energy consumption, and lower costs. Wake Forest University emphasizes a data-informed modernization process, using system optimization and targeted building improvements to significantly boost efficiency and reduce overall energy use. Arizona Western College showcases creative solutions to extreme cooling demands, including system redesign, smart controls, and thermal storage to improve reliability and cut peak energy costs. Overall, the article demonstrates that combining innovative engineering, real-time data analysis, and system optimization can significantly enhance performance, reduce emissions, and deliver cost savings in district energy systems.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

ED-cPSD: Fast Phase-Size Distribution via Sequential Erosion-Dilation

The Erosion-Dilation continuous Phase-Size Distribution, ED-cPSD, is an application for calculating continuous pore and particle-size distribution from digital reconstructions and/or image-based structural data. It is based on the erosion-dilation continuous phase-size distribution method. A continuous size distribution is a measure of the probability density of finding a particle or pore of a certain size. These distributions are of interest in any field of study involving porous media, including but not limited to electrochemistry, petroleum engineering, geology, and food science. The algorithm behind the software provides a computationally efficient way to calculate phase-size distributions for large domains. For a 3D battery electrode reconstruction with 1.3 x 10 8 voxels, the particle size distribution is derived in under 2 min on a desktop, while also retaining flexibility and computational efficiency for HPC-scale multi-threading. The software can handle structures with over 10 9 voxels. The algorithm is roughly 280 times faster than a previous version on the same task.

Characterization↗

Adaptive variational simulation for open quantum systems

Emerging quantum hardware provides new possibilities for quantum simulation. While much of the research has focused on simulating closed quantum systems, the real-world quantum systems are mostly open. Therefore, it is essential to develop quantum algorithms that can effectively simulate open quantum systems. Here we present an adaptive variational quantum algorithm for simulating open quantum system dynamics described by the Lindblad equation. The algorithm is designed to build resource-efficient ansatze through the dynamical addition of operators by maintaining the simulation accuracy. We validate the effectiveness of our algorithm on both noiseless simulators and IBM quantum processors and observe good quantitative and qualitative agreement with the exact solution. We also investigate the scaling of the required resources with system size and accuracy and find polynomial behavior. Our results demonstrate that near-future quantum processors are capable of simulating open quantum systems.

97 MATHEMATICS AND COMPUTING↗

pnnl/lpNNPS4SPH

Low precision-based nearest neighboring particle searching algorithm.This work introduces a computationally efficient Nearest Neighbor Particles Searching (NNPS) algorithm tailored for the meshfree Smoothed Particle Hydrodynamics (SPH) method in large-deformation problems simulations. The innovation lies in the strategic use of low-precision float-point 16 (FP16) in NNPS for efficiency purpose.

Mao, Zirui↗

Next Generation Suspension Dynamics Algorithms

This research project has the objective to extend the range of application, improve the efficiency and conduct simulations with the Fast Lubrication Dynamics (FLD) algorithm for concentrated particle suspensions in a Newtonian fluid solvent. The research involves a combination of mathematical development, new computational algorithms, and application to processing flows of relevance in materials processing. The mathematical developments clarify the underlying theory, facilitate verification against classic monographs in the field and provide the framework for a novel parallel implementation optimized for an OpenMP shared memory environment. The project considered application to consolidation flows of major interest in high throughput materials processing and identified hitherto unforeseen challenges in the use of FLD in these applications. Extensions to the algorithm have been developed to improve its accuracy in these applications.

97 MATHEMATICS AND COMPUTING↗

Numerical Study of Collective Effects for Muon Beams

The study of Muon beam optics is crucial for future Neutrino Factory and Muon Collider facilities. At present, the GEANT4-based simulation tools for Muon beam tracking such as G4beamline and G4MICE only do single particle tracking without collective effects taken into account. However, it is known that collective interaction such as space charge and wakefields for muons (in matter or vacuum) are not ignorable. As the first step, space charge computation is implemented into muon tracking. The basic algorithm is particle-to-particle interaction through retarded electro-magnetic field. The momentum impulse due to collective effects is applied to every particle at each collective step, and the G4beamline main code is used for tracking. Comparisons to LANL Parmela are illustrated and analyzed. Optimizations of the algorithm are also underway to gain less computing time and more accuracy. Moreover, the idea of enhancing ionization cooling efficiency by utilizing the collective effect due to the polarized charges in matter appears to be possible, and preliminary estimates have been made.

43 PARTICLE ACCELERATORS↗

Extreme scale unstructured adaptive CFD for aerodynamic flow control

Understanding the flow of fluid, either liquid or gas, through and around solid bodies has challenged man since the dawn of scientific inquiry. Many of the great minds of science and mathematics have progressively built up a hierarchy of fluid models since fluid flow impacts our lives in so many fundamental ways - from the early days of flow of water in viaducts to cities, to today's flight of planes. This chapter is concerned with the computational modeling of turbulent flow around aerodynamic bodies such as planes and wind turbines. In this case, viscous effects near the solid bodies create very thin boundary layers that yield highly anisotropic (gradients normal to the surface may be 10 6 larger than gradients along the surface) solutions to the governing non-linear partial differential equations (PDE); the Navier-Stokes equations. Furthermore, turbulent flows develop extremely broad ranges of length and time scales motivating the use of discretization methods capable of employing adaptivity and implicit time integration. The combination of these features - non-linear, anisotropy, adaptivity, and implicit - dramatically raise the complexity of the discretization, posing large challenges to efficient scalable parallel implementation. However, through careful design, the more complex algorithms can provide great reductions in computational cost relative to simpler methods (e.g., Cartesian grids with explicit time integration) that are easier to mate efficiently to hardware. In this chapter, we not only describe our approach but we also address the fact that while complex algorithms may never be as efficient flop-for-flop as simple methods, in the important measure of science-per-core-hour, they can still win big by making complex features like adaptivity and implicit methods as efficient and scalable as possible.

42 ENGINEERING↗

Extreme Scale Unstructured Adaptive CFD: From Multiphase Flow to Aerodynamic Flow Control

Understanding the flow of fluid, either liquid or gas, through and around solid bodies has challenged man since the dawn of scientific inquiry. Many of the great minds of science and math have progressively built up a hierarchy of fluid models. This report is concerned with the computational modeling of turbulent flow around aerodynamic bodies such as planes and wind turbines. In this case, viscous effects near the solid bodies create very thin boundary layers that yield highly anisotropic (gradients normal to the surface may be 10^6 times larger than gradients along the surface) solutions to the governing non-linear partial differential equations (PDE); the Navier-Stokes equations. Furthermore, turbulent flows develop extremely broad ranges of length and time scales.This disparity motivates the use of discretization methods capable of employing adaptivity and implicit time integration. The combination of these features (non-linear, anisotropy, adaptivity, andimplicit) dramatically raise the complexity of the discretization, posing large challenges to efficient scalable parallel implementation. However, through careful design, the more complex algorithms can provide great reductions in computational cost relative to simpler methods (e.g., Cartesian grids with explicit time integration) that are easier to mate efficiently to hardware. In this report, we not only describe our approach but we also address the fact that while complex algorithms may never be as efficient flop-for-flop as simple methods, in the important measure of science-per-core-hour, they can still win big by making complex features like adaptivity and implicit methods as efficient and scalable as possible.

42 ENGINEERING↗

An implicit particle code with exact energy and charge conservation for electromagnetic studies of dense plasmas

A collisional particle code based on implicit energy- and charge-conserving methods is presented. A modified version of the particle-suppressed Jacobian-Free Newton-Krylov method that can enhance the solver efficiency is introduced. Mathematically, it is shown that this new approach can be viewed as a fixed-point iteration method for the particle positions. The model can exactly conserve global energy and local charge and can efficiently use time steps larger than the plasma period. In conclusion, the algorithm's ability to simulate dense plasmas accurately and efficiently is quantified by simulating the dynamic compression of a plasma slab via a magnetic piston in 1D planar geometry.

97 MATHEMATICS AND COMPUTING↗

Genetic Algorithms for Rapid Molecular Materials Screening

This project developed efficient methods for rapid computational screening of conjugated polymers and oligomers with optimal or near-optimal photovoltaic, dielectric, spintronic, and other unique electronic structure properties using genetic algorithms (GA). A key promise of organic materials is that using the incredible tailorability of synthetic organic chemistry enables experimental optimization of performance across multiple relevant properties (e.g., organic photovoltaics, organic lasers). The fundamental challenge is inverse design: how does one find the molecular or polymer structures with desired properties in the face of a near-infinite (e.g., >10 20 - 10 60 ) number of possible molecular structures, combined with time-consuming experiments or electronic structure calculations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

STRUCTURAL ANNOTATION OF EM IMAGES BY GRAPH CUT

Biological images have the potential to reveal complex signatures that may not be amenable to morphological modeling in terms of shape, location, texture, and color. An effective analytical method is to characterize the composition of a specimen based on user-defined patterns of texture and contrast formation. However, such a simple requirement demands an improved model for stability and robustness. Here, an interactive computational model is introduced for learning patterns of interest by example. The learned patterns bound an active contour model in which the traditional gradient descent optimization is replaced by the more efficient optimization of the graph cut methods. First, the energy function is defined according to the curve evolution. Next, a graph is constructed with weighted edges on the energy function and is optimized with the graph cut algorithm. As a result, the method combines the advantages of the level set method and graph cut algorithm, i.e.,"topological" invariance and computational efficiency. The technique is extended to the multi-phase segmentation problem; the method is validated on synthetic images and then applied to specimens imaged by transmission electron microscopy(TEM).

60 APPLIED LIFE SCIENCES↗

Simultaneous beam sampling and aperture shape optimization for SPORT

Purpose: Station parameter optimized radiation therapy (SPORT) was recently proposed to fully utilize the technical capability of emerging digital linear accelerators, in which the station parameters of a delivery system, such as aperture shape and weight, couch position/angle, gantry/collimator angle, can be optimized simultaneously. SPORT promises to deliver remarkable radiation dose distributions in an efficient manner, yet there exists no optimization algorithm for its implementation. The purpose of this work is to develop an algorithm to simultaneously optimize the beam sampling and aperture shapes. Methods: The authors build a mathematical model with the fundamental station point parameters as the decision variables. To solve the resulting large-scale optimization problem, the authors devise an effective algorithm by integrating three advanced optimization techniques: column generation, subgradient method, and pattern search. Column generation adds the most beneficial stations sequentially until the plan quality improvement saturates and provides a good starting point for the subsequent optimization. It also adds the new stations during the algorithm if beneficial. For each update resulted from column generation, the subgradient method improves the selected stations locally by reshaping the apertures and updating the beam angles toward a descent subgradient direction. The algorithm continues to improve the selected stations locally and globally by a pattern search algorithm to explore the part of search space not reachable by the subgradient method. By combining these three techniques together, all plausible combinations of station parameters are searched efficiently to yield the optimal solution. Results: A SPORT optimization framework with seamlessly integration of three complementary algorithms, column generation, subgradient method, and pattern search, was established. The proposed technique was applied to two previously treated clinical cases: a head and neck and a prostate case. It significantly improved the target conformality and at the same time critical structure sparing compared with conventional intensity modulated radiation therapy (IMRT). In the head and neck case, for example, the average PTV coverage D99% for two PTVs, cord and brainstem max doses, and right parotid gland mean dose were improved, respectively, by about 7%, 37%, 12%, and 16%. Conclusions: The proposed method automatically determines the number of the stations required to generate a satisfactory plan and optimizes simultaneously the involved station parameters, leading to improved quality of the resultant treatment plans as compared with the conventional IMRT plans.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Closed-Loop Error Learning Control for Uncertain Nonlinear Systems With Experimental Validation on a Mobile Robot

This article develops a closed-loop error learning control (CLELC) algorithm for feedback linearizable systems with experimental validation on a mobile robot. Traditional feedback and feedforward controllers are designed based on the nominal model by using the feedback linearization control (FLC) method. Then, an intelligent controller is designed based on the sliding mode learning algorithm that utilizes closed-loop error dynamics to learn the system behavior. The controllers are working in parallel, and the intelligent controller can gradually replace the feedback controller from the control of the system. In addition to the stability of the sliding mode learning algorithm, the closed-loop stability of an nth-order feedback linearizable system is proven. The simulation results demonstrate that the CLELC algorithm can improve control performance (e.g., smaller rise time, settling time, and overshoot) in the absence of uncertainties, and also provides robust control performance in the presence of uncertainties as compared to traditional FLC method. To test the efficiency and efficacy of the CLELC algorithm, the trajectory tracking problem of a tracked mobile robot is studied in real time. The experimental results demonstrate that the CLELC algorithm ensures highly accurate trajectory tracking performance than traditional FLC method.

97 MATHEMATICS AND COMPUTING↗