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,225 records · Page 68

Multiscale/Multiphysics Modeling of Biomass Thermochemical Processes

Computational problems in simulating biomass thermochemical processes involve coupling processes that span several orders of magnitude in space and time. Computational difficulties arise from the multitude of the problem governing equations, each typically applying over a narrow range of spatiotemporal scales, thus making it necessary to represent the processes as the result of the interaction of multiple physics modules, termed here as multiscale/multiphysics (MSMP) coupling. Predictive simulations for such processes require algorithms that can efficiently integrate the underlying MSMP methods across the scales in order to achieve prescribed accuracy and control the computational cost. In addition, MSMP algorithms must scale to one hundred thousand processors or more in order to effectively harness the new computational resources and accelerate the scientific advances. In this chapter, we discuss the state-of-the-art in modeling the macro-scale phenomena in a biomass pyrolysis reactor along with details of the shortcomings and prospects in improving predictability. We also introduce the various multiphysics modules needed to model thermochemical conversion at lower spatiotemporal scales. Furthermore, we illustrate the need for MSMP coupling for thermochemical processes in biomass and provide an overview of the wavelet-based coupling techniques we have developed recently. In particular, we provide details about the compound wavelet matrix (CWM) and the dynamic CWM (dCWM) methods and show they are highly efficient in transferring information among multiphysics models across multiple temporal and spatial scales. The algorithmic gain is in addition to the parallel spatial scalability from traditional domain decomposition methods. The CWM algorithms are serial in time and limited by the smallest-system time-scales. In order to relax this algorithmic constraint, we have recently coupled time parallel (TP) algorithms to CWM, thus yielding a novel approach termed tpCWM. We present preliminary results from the tpCWM technique, indicating that we can accelerate time-to-solution by 2 to 3-orders of magnitude even on 20-processors and this can potentially constitute a new paradigm for MSMP simulations. If such improvements in simulation capability can be generalized, the tpCWM approach can lead the way to predictive simulations of biomass thermochemical processes.

09 BIOMASS FUELS↗

A Model-Free No-arbitrage Price Bound for Variance Options

We suggest a numerical approximation for an optimization problem, motivated by its applications in finance to find the model-free no-arbitrage bound of variance options given the marginal distributions of the underlying asset. A first approximation restricts the computation to a bounded domain. Then we propose a gradient projection algorithm together with the finite difference scheme to solve the optimization problem. We prove the general convergence, and derive some convergence rate estimates. Finally, we give some numerical examples to test the efficiency of the algorithm.

97 MATHEMATICS AND COMPUTING↗

Improving the Numerical Stability of Fast Matrix Multiplication

Fast algorithms for matrix multiplication, namely those that perform asymptotically fewer scalar operations than the classical algorithm, have been considered primarily of theoretical interest. Apart from Strassen's original algorithm, few fast algorithms have been efficiently implemented or used in practical applications. However, there exist many practical alternatives to Strassen's algorithm with varying performance and numerical properties. Fast algorithms are known to be numerically stable, but because their error bounds are slightly weaker than the classical algorithm, they are not used even in cases where they provide a performance benefit. We argue in this study that the numerical sacrifice of fast algorithms, particularly for the typical use cases of practical algorithms, is not prohibitive, and we explore ways to improve the accuracy both theoretically and empirically. The numerical accuracy of fast matrix multiplication depends on properties of the algorithm and of the input matrices, and we consider both contributions independently. We generalize and tighten previous error analyses of fast algorithms and compare their properties. We discuss algorithmic techniques for improving the error guarantees from two perspectives: manipulating the algorithms, and reducing input anomalies by various forms of diagonal scaling. In conclusion, we benchmark performance and demonstrate our improved numerical accuracy.

97 MATHEMATICS AND COMPUTING↗

Parallel Methods on Large-Scale Structural Analysis and Physics Applications; Symposium, Hampton, VA, Feb. 5, 6, 1991, Selected Papers

Recent advances in parallel methods and algorithms integrated into large-scale codes are presented. Consideration is given to problem decomposition (substructuring), efficient matrix solution algorithms for shared memory architectures, dynamic and transient analysis algorithms for shared memory architectures, and algorithms for distributed and massively parallel architectures. Particular attention is given to partitioning of unstructured problems for parallel processing, parallel-vector computation for linear-structural analysis and nonlinear unconstraint optimization problems, a parallel-vector equation solver for unsymmetric matrices on supercomputers, parallel nonlinear finite element dynamic response, multigrid algorithms for solving structural mechanics problems on supercomputers, structural analysis on massively parallel computers, explicit finite element methods with contact-impact on SIMD computers, and the impact of mapping and sparsity on parallelized finite element method modules.

Storaasli, Olaf O.↗

PLATSIM: A Simulation and Analysis Package for Large-Order Flexible Systems

The software package PLATSIM provides efficient time and frequency domain analysis of large-order generic space platforms. PLATSIM can perform open-loop analysis or closed-loop analysis with linear or nonlinear control system models. PLATSIM exploits the particular form of sparsity of the plant matrices for very efficient linear and nonlinear time domain analysis, as well as frequency domain analysis. A new, original algorithm for the efficient computation of open-loop and closed-loop frequency response functions for large-order systems has been developed and is implemented within the package. Furthermore, a novel and efficient jitter analysis routine which determines jitter and stability values from time simulations in a very efficient manner has been developed and is incorporated in the PLATSIM package. In the time domain analysis, PLATSIM simulates the response of the space platform to disturbances and calculates the jitter and stability values from the response time histories. In the frequency domain analysis, PLATSIM calculates frequency response function matrices and provides the corresponding Bode plots. The PLATSIM software package is written in MATLAB script language. A graphical user interface is developed in the package to provide convenient access to its various features.

Maghami, Peiman G.↗

THE SDSS-III BARYON OSCILLATION SPECTROSCOPIC SURVEY: QUASAR TARGET SELECTION FOR DATA RELEASE NINE

The SDSS-III Baryon Oscillation Spectroscopic Survey (BOSS), a five-year spectroscopic survey of 10,000 deg{sup 2}, achieved first light in late 2009. One of the key goals of BOSS is to measure the signature of baryon acoustic oscillations (BAOs) in the distribution of Ly{alpha} absorption from the spectra of a sample of {approx}150,000 z > 2.2 quasars. Along with measuring the angular diameter distance at z Almost-Equal-To 2.5, BOSS will provide the first direct measurement of the expansion rate of the universe at z > 2. One of the biggest challenges in achieving this goal is an efficient target selection algorithm for quasars in the redshift range 2.2 < z < 3.5, where their colors tend to overlap those of the far more numerous stars. During the first year of the BOSS survey, quasar target selection (QTS) methods were developed and tested to meet the requirement of delivering at least 15 quasars deg{sup -2} in this redshift range, with a goal of 20 out of 40 targets deg{sup -2} allocated to the quasar survey. To achieve these surface densities, the magnitude limit of the quasar targets was set at g {<=} 22.0 or r {<=} 21.85. While detection of the BAO signature in the distribution of Ly{alpha} absorption in quasar spectra does not require a uniform target selection algorithm, many other astrophysical studies do. We have therefore defined a uniformly selected subsample of 20 targets deg{sup -2}, for which the selection efficiency is just over 50% ({approx}10 z > 2.20 quasars deg{sup -2}). This 'CORE' subsample will be fixed for Years Two through Five of the survey. For the remaining 20 targets deg{sup -2}, we will continue to develop improved selection techniques, including the use of additional data sets beyond the Sloan Digital Sky Survey (SDSS) imaging data. In this paper, we describe the evolution and implementation of the BOSS QTS algorithms during the first two years of BOSS operations (through 2011 July), in support of the science investigations based on these data, and we analyze the spectra obtained during the first year. During this year, 11,263 new z > 2.20 quasars were spectroscopically confirmed by BOSS, roughly double the number of previously known quasars with z > 2.20. Our current algorithms select an average of 15 z > 2.20 quasars deg{sup -2} from 40 targets deg{sup -2} using single-epoch SDSS imaging. Multi-epoch optical data and data at other wavelengths can further improve the efficiency and completeness of BOSS QTS.

79 ASTRONOMY AND ASTROPHYSICS↗

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↗

A study of the Nordsieck-type predictor-corrector methods

Predictor-corrector schemes are discussed for the numerical integration of initial value problems by computer. Descloux formulas, which are considered modified Nordsieck formulas are studied because of their desirable stability and truncation properties along with the standard Nordsieck formulas. The stability of Nordsieck and modified Nordsieck algorithms are computed, and the results are graphed. Test problems are included as examples for comparing the efficiency of the algorithms.

Eiserike, H. M.↗

Euler/Navier-Stokes calculations of transonic flow past fixed- and rotary-wing aircraft configurations

Computational fluid dynamics has an increasingly important role in the design and analysis of aircraft as computer hardware becomes faster and algorithms become more efficient. Progress is being made in two directions: more complex and realistic configurations are being treated and algorithms based on higher approximations to the complete Navier-Stokes equations are being developed. The literature indicates that linear panel methods can model detailed, realistic aircraft geometries in flow regimes where this approximation is valid. As algorithms including higher approximations to the Navier-Stokes equations are developed, computer resource requirements increase rapidly. Generation of suitable grids become more difficult and the number of grid points required to resolve flow features of interest increases. Recently, the development of large vector computers has enabled researchers to attempt more complex geometries with Euler and Navier-Stokes algorithms. The results of calculations for transonic flow about a typical transport and fighter wing-body configuration using thin layer Navier-Stokes equations are described along with flow about helicopter rotor blades using both Euler/Navier-Stokes equations.

Deese, J. E.↗

A Domain Decomposition Parallelization of the Fast Marching Method

In this paper, the first domain decomposition parallelization of the Fast Marching Method for level sets has been presented. Parallel speedup has been demonstrated in both the optimal and non-optimal domain decomposition case. The parallel performance of the proposed method is strongly dependent on load balancing separately the number of nodes on each side of the interface. A load imbalance of nodes on either side of the domain leads to an increase in communication and rollback operations. Furthermore, the amount of inter-domain communication can be reduced by aligning the inter-domain boundaries with the interface normal vectors. In the case of optimal load balancing and aligned inter-domain boundaries, the proposed parallel FMM algorithm is highly efficient, reaching efficiency factors of up to 0.98. Future work will focus on the extension of the proposed parallel algorithm to higher order accuracy. Also, to further enhance parallel performance, the coupling of the domain decomposition parallelization to the G(sub 0)-based parallelization will be investigated.

Herrmann, M.↗

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↗