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 739 records · Page 41

A Study of Clustering Techniques and Hierarchical Matrix Formats for Kernel Ridge Regression

We present memory-efficient and scalable algorithms for kernel methods used in machine learning. Using hierarchical matrix approximations for the kernel matrix the memory requirements, the number of floating point operations, and the execution time are drastically reduced compared to standard dense linear algebra routines. We consider both the general H matrix hierarchical format as well as Hierarchically Semi-Separable (HSS) matrices. Furthermore, we investigate the impact of several preprocessing and clustering techniques on the hierarchical matrix compression. Effective clustering of the input leads to a ten-fold increase in efficiency of the compression. The algorithms are implemented using the STRUMPACK solver library. These results confirm that - with correct tuning of the hyperparameters - classification using kernel ridge regression with the compressed matrix does not lose prediction accuracy compared to the exact - not compressed - kernel matrix and that our approach can be extended to O(1M) datasets, for which computation with the full kernel matrix becomes prohibitively expensive. We present numerical experiments in a distributed memory environment up to 1,024 processors of the NERSC's Cori supercomputer using well-known datasets to the machine learning community that range from dimension 8 up to 784.

97 MATHEMATICS AND COMPUTING↗

The Accelerator Neutrino Neutron InteractionExperiment: Design, Construction and Preparationfor First Physics

This thesis covers work performed for the Accelerator Neutrino Neutron Interaction Experiment (ANNIE) between 2015 and 2020. ANNIE is a beamline neutrino experiment located at the Fermi National Accelerator Laboratory in Chicago. Its primary physics goals are the measurement of neutrino interaction cross-sections on oxygen, and a measurement of the multiplicity of final state neutrons from these interactions, both as functions of final state kinematics. In order to achieve these goals ANNIE will be pioneering the use of Large Area Picosecond Photodetectors and the use of gadolinium doping to enhance neutron visibility in a water Cherenkov detector. Over the time period of this thesis the ANNIE detector was constructed, an initial 'Phase I' background run was completed, the detector was decommissioned and then substantially upgraded in preparation for the main 'Phase II' physics run. At the time of writing ANNIE is being re-commissioned, with Phase II data taking anticipated to begin in 2021. During this time I spent 21/2 years on-site contributing to almost all aspects of hardware work, while performing software development for the simulation and analysis frameworks. As my first software task I developed Monte Carlo simulations of the detector response, based on the WCSim framework. While thismore » framework provided a starting point for the tank simulation significant modifications were required to implement the complete ANNIE detector system. This included a rewrite of the geometry, along with modifications to the photosensor definitions, hit collections, digitization, triggering, input and output interfaces, etc. To take advantage of improved modelling of neutrons in Geant4.10 the physics lists were also reimplemented in the new version format. As part of this work I determined performance metrics based on the output files, calculating kinematic acceptance, detector efficiency and expected event rates. My contributions on reconstruction focused primarily on the MRD, for which I implemented two track reconstruction algorithms, specialised for high and low energy muons. The high energy algorithm achieves >90% efficiency for tracks with at least 8 hits, and is robust against dead paddles and unrelated hits. The low energy algorithm performs a search in combination with tank information to provide sensitivity down to a single MRD hit. Early data handling work for the Phase I background run included writing the code for handling TDC hits and performing studies on neutron detection without the requirement of multi-hit coincidence. As the collaboration moved to a new framework for the Phase II analysis I performed a substantial amount of work to develop the codebase, implementing tools to perform tasks such as file IO, data parsing, waveform processing, event building, timestamp alignment, time clustering, hit residual calculation, event visualisation etc. I helped develop the python API for integrating multi-language tools, and ported the framework into a Singularity container to provide a self-contained environment that…« less

43 PARTICLE ACCELERATORS↗

Dualities in Persistent (Co)Homology

We consider sequences of absolute and relative homology and cohomology groups that arise naturally for a filtered cell complex. We establishalgebraic relationships between their persistence modules, and show that they contain equivalent information. We explain how one can use the existingalgorithm for persistent homology to process any of the four modules, and relate it to a recently introduced persistent cohomology algorithm. Wepresent experimental evidence for the practical efficiency of the latter algorithm.

01 COAL, LIGNITE, AND PEAT↗

Gradient-Based Multi-Area Distribution System State Estimation

The increasing distributed and renewable energy resources and controllable devices in distribution systems make fast distribution system state estimation (DSSE) crucial in system monitoring and control. We consider a large multi-phase distribution system and formulate DSSE as a weighted least squares (WLS) problem. We divide the large distribution system into smaller areas of subtree structure, and by jointly exploring the linearized power flow model and the network topology, we propose a gradient-based multi-area algorithm to exactly and efficiently solve the WLS problem. The proposed algorithm enables distributed and parallel computation of the state estimation problem without compromising any performance. Numerical results on a 4,521-node test feeder show that the designed algorithm features fast convergence and accurate estimation results. Comparison with traditional Gauss-Newton method shows that the proposed method has much better performance in distribution systems with a limited amount of reliable measurement. The real-time implementation of the algorithm tracks time-varying system states with high accuracy.

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

Efficient Reliability Analysis using Generalized Multifidelity Modeling and Explainable Active Learning

To assess the reliability of critical technologies like nuclear plants and infrastructure systems and improve the robustness of design, engineers have to quantify the uncertainties surrounding the system behavior accurately. However, the complexity of the problem can make standard reliability analysis algorithms prohibitively expensive, primarily due to the high computational cost of estimating the system response at each iteration. This cost can be greatly reduced by using multi-fidelity modeling and machine learning to build a surrogate model to replace the expensive response function. We propose a general and robust method for building surrogates from multiple Low Fidelity (LF) models coupled with machine learning to retain accuracy. Our framework first constructs “Corrected Low Fidelity models” (CLFs) by coupling a High Fidelity (HF) model inferred Gaussian Process correction term with each of the LF models. It then uses the correction terms to assign model probabilities to each of these CLFs in an explainable way before using them to assemble the final surrogate. No assumptions are made about the type of the LF models or their correlation with the HF model. The proposed surrogate modeling framework is used within the subset simulation algorithm (a variance-reduced MCMC-based reliability analysis algorithm) for enhanced efficiency. Additionally, an active learning step is added to the algorithm to adaptively decide when the surrogate is not sufficiently accurate, at which point the HF model is called and used to refine the surrogate. Through a frame buckling example, our method is shown to be highly efficient at reducing the expensive HF model calls while accurately estimating the failure probability.

97 MATHEMATICS AND COMPUTING↗

Controlled transitions between cupolets of chaotic systems

We present an efficient control scheme that stabilizes the unstable periodic orbits of a chaotic system. The resulting orbits are known as cupolets and collectively provide an important skeleton for the dynamical system. Cupolets exhibit the interesting property that a given sequence of controls will uniquely identify a cupolet, regardless of the system's initial state. This makes it possible to transition between cupolets, and thus unstable periodic orbits, simply by switching control sequences. We demonstrate that although these transitions require minimal controls, they may also involve significant chaotic transients unless carefully controlled. As a result, we present an effective technique that relies on Dijkstra's shortest path algorithm from algebraic graph theory to minimize the transients and also to induce certainty into the control of nonlinear systems, effectively providing an efficient algorithm for the steering and targeting of chaotic systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Application of a Metal Artifact Reduction Algorithm for C-Arm Cone-Beam CT: Impact on Image Quality and Diagnostic Confidence for Bronchial Artery Embolization

Objective: The objective of this study was to evaluate the potential benefit of a dedicated cone-beam-CT streak metal artifact removal technique (SMART) in terms of both image quality and diagnostic confidence in patients undergoing bronchial artery embolization. Methods: A total of 17 patients were included in this retrospective study. The SMART algorithm was applied to images containing streak artifacts generated by a radiopaque intra-arterial catheter tip. Quantitative evaluation of artifact severity was performed via measurement of the Hounsfield units along a closed loop surrounding the catheter tip and was conducted in the frequency domain following the application of the discrete Fourier transform to the measured data. A high proportion of power in the low frequencies of the resulting spectrum indicated a high level of streak artifacts. Qualitative evaluation of diagnostic confidence was performed using a 4-point Likert scale. Results: Both quantitative and qualitative evaluation demonstrated a significant reduction in artifact severity using the SMART algorithm. Quantitative evaluation demonstrated a mean artifact reduction of 22.5% using SMART compared to non-SMART images (p < 0.001). Qualitative evaluation demonstrated the greatest artifact reduction at the inner and outer aortic curvature, as well as immediately surrounding the tip of the catheter. In 6 of 17 cases, the use of the SMART algorithm yielded additional clinical information, increasing mean diagnostic confidence from 3.17 to 3.78 (p < 0.001). Conclusion: The SMART algorithm allows for efficient reduction of metal artifacts introduced by radiopaque catheter tips during cone-beam CT. Using this algorithm, diagnostic images of the aortic arch were significantly improved both quantitatively and qualitatively, yielding clinically relevant levels of enhanced diagnostic confidence. These results demonstrate that the SMART algorithm improves diagnostic and clinical characterization of the course of bronchial arteries on CBCT images, potentially improving the accuracy and clinical efficacy of bronchial artery embolization. Level of Evidence: 3.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Movable geometry and eigenvalue search capability in the MC21 Monte Carlo code

A description of a robust and flexible movable geometry implementation in the Monte Carlo code MC21 is described along with a search algorithm that can be used in conjunction with the movable geometry capability to perform eigenvalue searches based on the position of some geometric component. The natural use of the combined movement and search capability is searching to critical through variation of control rod (or control drum) position. The movable geometry discussion provides the mathematical framework for moving surfaces in the MC21 combinatorial solid geometry description. A discussion of the interface between the movable geometry system and the user is also described, particularly the ability to create a hierarchy of movable groups. Combined with the hierarchical geometry description in MC21 the movable group framework provides a very powerful system for inline geometry modification. The eigenvalue search algorithm implemented in MC21 is also described. The foundations of this algorithm are a regula falsi search though several considerations are made in an effort to increase the efficiency of the algorithm for use with Monte Carlo. Specifically, criteria are developed to determine after each batch whether the Monte Carlo calculation should be continued, the search iteration can be rejected, or the search iteration has converged. These criteria seek to minimize the amount of time spent per iteration. Results for the regula falsi method are shown, illustrating that the method as implemented is indeed convergent and that the optimizations made ultimately reduce the total computational expense. (authors)

97 MATHEMATICS AND COMPUTING↗

Perspectives on Polyolefin Catalysis in Microfluidics for High-Throughput Screening: A Minireview

Polyolefins are the largest produced plastics in the world which traditionally employ continuous stirred tank reactors and fluidized bed reactors for commercial production. The operating condition, reaction kinetics, and molecular interactions inside the reactor strongly affect the polyolefin properties, which require stringent process control in conventional procedures. Understanding the catalytic pathway, behavior of polymer particles and effect of reactor conditions are essential for designing specific polymer properties, namely the molecular weight, chain length, polydispersity, etc. Microfluidics can play a significant role in designing polymers tailored to the user needs. Smaller channel dimensions help obtain uniform reaction conditions over the length of the microfluidic reactor in a controlled environment. With real-time monitoring techniques in microfluidics, even single particle growth of polymer can be studied to understand the parameters affecting the polymer properties. High throughput microfluidics can help catalyst screening in a short duration with less consumption of reagents generating less waste. When supplemented with efficient machine learning algorithms, automated high throughput microfluidics has the potential to rapidly optimize the process and develop new knowledge even with a limited data set. When trained on data sets generated using microfluidic experiments that are designed efficiently with working knowledge of the process, machine learning algorithms can provide the relationship between the multivariable parameters space and polymer properties, which is not possible with the traditional statistical methods and interpolation techniques. Here, the rise in the utilization of microfluidics, with the advancement of machine learning algorithms, for polyolefin catalysis, highlights the importance of microfluidics for catalyst discovery, parameter optimization, and understanding reaction pathway for producing polymers with specific properties for specialized applications.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Scalable domain decomposition solvers for stochastic PDEs in high performance computing

Stochastic spectral finite element models of practical engineering systems may involve solutions of linear systems or linearized systems for non-linear problems with billions of unknowns. For stochastic modeling, it is therefore essential to design robust, parallel and scalable algorithms that can efficiently utilize high-performance computing to tackle such large-scale systems. Domain decomposition based iterative solvers can handle such systems. And though these algorithms exhibit excellent scalabilities, significant algorithmic and implementational challenges exist to extend them to solve extreme-scale stochastic systems using emerging computing platforms. Intrusive polynomial chaos expansion based domain decomposition algorithms are extended here to concurrently handle high resolution in both spatial and stochastic domains using an in-house implementation. Sparse iterative solvers with efficient preconditioners are employed to solve the resulting global and subdomain level local systems through multi-level iterative solvers. We also use parallel sparse matrix–vector operations to reduce the floating-point operations and memory requirements. Numerical and parallel scalabilities of these algorithms are presented for the diffusion equation having spatially varying diffusion coefficient modeled by a non-Gaussian stochastic process. Scalability of the solvers with respect to the number of random variables is also investigated.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Fifth-kind orthonormal Chebyshev polynomial solutions for fractional differential equations

The principal aim of the current paper is to present and analyze two new spectral algorithms for solving some types of linear and nonlinear fractional-order differential equations. The proposed algorithms are obtained by utilizing a certain kind of shifted Chebyshev polynomials called the shifted fifth-kind Chebyshev polynomials as basis functions along with the application of a modified spectral tau method. The class of fifth-kind Chebyshev polynomials is a special class of a basic class of symmetric orthogonal polynomials which are constructed with the aid of the extended Sturm–Liouville theorem for symmetric functions. An investigation for the convergence and error analysis of the proposed Chebyshev expansion is performed. For this purpose, a new connection formulae between Chebyshev polynomials of the first and fifth kinds are derived. The obtained numerical results ascertain that our two proposed algorithms are applicable, efficient and accurate.

97 MATHEMATICS AND COMPUTING↗

Neutronic/Thermalhydraulic Coupling Technigues for Sodium Cooled Fast Reactor Simulations

The objective of this project was to test new coupling algorithms and enable efficient and scalable multi-physics simulations of advanced nuclear reactors, with considerations regarding the implementation of such algorithms in massively parallel environments. Numerical tests were carried out to verify the proposed approach and the examples included some reactor transients. The project was directly related to the Sodium Fast Reactor program element of the Generation IV Nuclear Energy Systems Initiative and the Advanced Fuel cycle Initiative, and, supported the requirement of high-fidelity simulation as a mean of achieving the goals of the presidential Global Nuclear Energy Partnership (GNEP) vision.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Solving the Hele–Shaw flow using the Harrow–Hassidim–Lloyd algorithm on superconducting devices: A study of efficiency and challenges

The development of quantum processors for practical fluid flow problems is a promising yet distant goal. Recent advances in quantum linear solvers have highlighted their potential for classical fluid dynamics. In this study, we evaluate the Harrow–Hassidim–Lloyd (HHL) quantum linear systems algorithm (QLSA) for solving the idealized Hele–Shaw flow. Our focus is on the accuracy and computational cost of the HHL solver, which we find to be sensitive to the condition number, scaling exponentially with problem size. This emphasizes the need for preconditioning to enhance the practical use of QLSAs in fluid flow applications. Moreover, we perform shots-based simulations on quantum simulators and test the HHL solver on superconducting quantum devices, where noise, large circuit depths, and gate errors limit performance. Error suppression and mitigation techniques improve accuracy, suggesting that such fluid flow problems can benchmark noise mitigation efforts. Finally, our findings provide a foundation for future, more complex application of QLSAs in fluid flow simulations.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Scaling adaptive quantum simulation algorithms via operator pool tiling

Adaptive variational quantum simulation algorithms use information from a quantum computer to dynamically create optimal trial wave functions for a given problem Hamiltonian. A key ingredient in these algorithms is a predefined operator pool from which trial wave functions are constructed. Finding suitable pools is critical for the efficiency of the algorithm as the problem size increases. Here, we present a technique called operator pool tiling that facilitates the construction of problem-tailored pools for arbitrarily large problem instances. By first performing an Adaptive Derivative-Assembled Problem-Tailored Ansatz Variational Quantum Eigensolver (ADAPT-VQE) calculation on a smaller instance of the problem using a large, but computationally inefficient, operator pool, we extract the most relevant operators and use them to design more efficient pools for larger instances. We demonstrate the method here on strongly correlated quantum spin models in one and two dimensions, finding that ADAPT automatically finds a highly effective ansatz for these systems. Given that many problems, such as those arising in condensed matter physics, have a naturally repeating lattice structure, we expect the pool tiling method to be a widely applicable technique apt for such systems. Published by the American Physical Society 2024

Van Dyke, John S. (ORCID:0000000167815480)↗

New approach for absolute fluence distribution calculations in Monte Carlo simulations of light propagation in turbid media

A novel way to attain three dimensional fluence rate maps from Monte-Carlo simulations of photon propagation is presented in this work. The propagation of light in a turbid medium is described by the radiative transfer equation and formulated in terms of radiance. For many applications, particularly in biomedical optics, the fluence rate is a more useful quantity and directly derived from the radiance by integrating over all directions. Contrary to the usual way which calculates the fluence rate from absorbed photon power, the fluence rate in this work is directly calculated from the photon packet trajectory. The voxel based algorithm works in arbitrary geometries and material distributions. It is shown that the new algorithm is more efficient and also works in materials with a low or even zero absorption coefficient. The capabilities of the new algorithm are demonstrated on a curved layered structure, where a non-scattering, non-absorbing layer is sandwiched between two highly scattering layers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Object-constrained meshless deformable algorithm for high speed 3D nonrigid registration between CT and CBCT

Purpose: High-speed nonrigid registration between the planning CT and the treatment CBCT data is critical for real time image guided radiotherapy (IGRT) to improve the dose distribution and to reduce the toxicity to adjacent organs. The authors propose a new fully automatic 3D registration framework that integrates object-based global and seed constraints with the grayscale-based ''demons'' algorithm. Methods: Clinical objects were segmented on the planning CT images and were utilized as meshless deformable models during the nonrigid registration process. The meshless models reinforced a global constraint in addition to the grayscale difference between CT and CBCT in order to maintain the shape and the volume of geometrically complex 3D objects during the registration. To expedite the registration process, the framework was stratified into hierarchies, and the authors used a frequency domain formulation to diffuse the displacement between the reference and the target in each hierarchy. Also during the registration of pelvis images, they replaced the air region inside the rectum with estimated pixel values from the surrounding rectal wall and introduced an additional seed constraint to robustly track and match the seeds implanted into the prostate. The proposed registration framework and algorithm were evaluated on 15 real prostate cancer patients. For each patient, prostate gland, seminal vesicle, bladder, and rectum were first segmented by a radiation oncologist on planning CT images for radiotherapy planning purpose. The same radiation oncologist also manually delineated the tumor volumes and critical anatomical structures in the corresponding CBCT images acquired at treatment. These delineated structures on the CBCT were only used as the ground truth for the quantitative validation, while structures on the planning CT were used both as the input to the registration method and the ground truth in validation. By registering the planning CT to the CBCT, a displacement map was generated. Segmented volumes in the CT images deformed using the displacement field were compared against the manual segmentations in the CBCT images to quantitatively measure the convergence of the shape and the volume. Other image features were also used to evaluate the overall performance of the registration. Results: The algorithm was able to complete the segmentation and registration process within 1 min, and the superimposed clinical objects achieved a volumetric similarity measure of over 90% between the reference and the registered data. Validation results also showed that the proposed registration could accurately trace the deformation inside the target volume with average errors of less than 1 mm. The method had a solid performance in registering the simulated images with up to 20 Hounsfield unit white noise added. Also, the side by side comparison with the original demons algorithm demonstrated its improved registration performance over the local pixel-based registration approaches. Conclusions: Given the strength and efficiency of the algorithm, the proposed method has significant clinical potential to accelerate and to improve the CBCT delineation and targets tracking in online IGRT applications.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A variant nonmonotone smoothing algorithm with improved numerical results for large-scale LWCPs

This paper considers the linear weighted complementarity problem (denoted by LWCP) introduced by Potra (SIAM J Optim 22:1634–1654, 2012). Based on two weighted smoothing functions, we propose a new nonmonotone smoothing algorithm for solving the LWCP and establish its global and local quadratic convergence without the strict complementarity assumption. Compared to existing nonmonotone smoothing algorithms, the proposed algorithm solves the linear system only approximately which can save the computation work when one solves large-scale LWCPs. Moreover, the nonmonotone line search technique adopted in this paper includes the usual monotone line search and some existing nonmonotone line searches as special cases. Numerical results show that our algorithm is considerably efficient for solving large-scale LWCPs.

97 MATHEMATICS AND COMPUTING↗

High-Level Synthesis of Irregular Applications: A Case Study on Influence Maximization

The Influence Maximization problem is the problem of identifying a small cohort of actors from a broader population that, when initially activated in a diffusion process, are expected to result in a large number of activations in the population. While the problem is known to be NP-hard, several approximation algorithms have been devised by leveraging its submodular structure. While these algorithms are theoretically efficient, they are computationally very expensive in practice. This work advances the current state-of-the-art parallelization scheme for the IMM algorithm by devising the adoption of custom hardware accelerators implemented on FPGAs by leveraging High Level Synthesis from OpenCL. We study the performance of our proposed approach by exploring optimizations tailored at improving the parallel efficiency of the accelerators and highlight their effects and limitations in accelerating complex graph analytic applications. Our experimental evaluation shows that FPGA acceleration can improve the performance of the LT diffusion model up to 1.72x for the entire application and up to 2.90x for its most important kernel with respect to a CPU only parallel execution. The FPGA acceleration of the LT model shows also a 1.54x reduction in energy consumption when compared to a parallel CPU only run.

Neff, Reece W.↗