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 847 records · Page 47

An embedded variable step IMEX scheme for the incompressible Navier–Stokes equations

This report presents a series of implicit–explicit (IMEX) variable stepsize algorithms for the incompressible Navier–Stokes equations (NSE). Here, IMEX means the nonlinear term is treated fully explicitly while the remaining terms are treated implicitly. With the advent of new computer architectures there has been growing demand for low memory solvers of this type. The addition of time adaptivity improves the accuracy and greatly enhances the efficiency of the algorithm. We prove energy stability of an embedded first–second order IMEX pair. For the first order member of the pair, we prove stability for variable stepsizes, and analyze convergence. We believe this to be the first proof of this type for a variable stepsize IMEX scheme for the incompressible NSE. We then define and test a variable stepsize, variable order IMEX scheme using these methods. Our work contributes several firsts for IMEX NSE schemes, including an energy argument and error analysis of a two-step, variable stepsize method, and embedded error estimation for an IMEX multi-step method.

42 ENGINEERING↗

A digitally reconstructed radiograph algorithm calculated from first principles

Purpose: To develop an algorithm for computing realistic digitally reconstructed radiographs (DRRs) that match real cone-beam CT (CBCT) projections with no artificial adjustments. Methods: The authors used measured attenuation data from cone-beam CT projection radiographs of different materials to obtain a function to convert CT number to linear attenuation coefficient (LAC). The effects of scatter, beam hardening, and veiling glare were first removed from the attenuation data. Using this conversion function the authors calculated the line integral of LAC through a CT along rays connecting the radiation source and detector pixels with a ray-tracing algorithm, producing raw DRRs. The effects of scatter, beam hardening, and veiling glare were then included in the DRRs through postprocessing. Results: The authors compared actual CBCT projections to DRRs produced with all corrections (scatter, beam hardening, and veiling glare) and to uncorrected DRRs. Algorithm accuracy was assessed through visual comparison of projections and DRRs, pixel intensity comparisons, intensity histogram comparisons, and correlation plots of DRR-to-projection pixel intensities. In general, the fully corrected algorithm provided a small but nontrivial improvement in accuracy over the uncorrected algorithm. The authors also investigated both measurement- and computation-based methods for determining the beam hardening correction, and found the computation-based method to be superior, as it accounted for nonuniform bowtie filter thickness. The authors benchmarked the algorithm for speed and found that it produced DRRs in about 0.35 s for full detector and CT resolution at a ray step-size of 0.5 mm. Conclusions: The authors have demonstrated a DRR algorithm calculated from first principles that accounts for scatter, beam hardening, and veiling glare in order to produce accurate DRRs. The algorithm is computationally efficient, making it a good candidate for iterative CT reconstruction techniques that require a data fidelity term based on the matching of DRRs and projections.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Beyond Limber: efficient computation of angular power spectra for galaxy clustering and weak lensing

Angular two-point statistics of large-scale structure observables are important cosmological probes. To reach the high accuracy required by the statistical precision of future surveys, some of these statistics may need to be computed without the commonly employed Limber approximation; the exact computation however requires integration over Bessel functions, and a brute-force evaluation is slow to converge. Here, we present a new method based on our generalized FFTLog algorithm for the efficient computation of angular power spectra beyond the Limber approximation. The new method significantly simplifies the calculation and improves the numerical speed and stability. It is easily extended to handle integrals involving derivatives of Bessel functions, making it equally applicable to numerically more challenging cases such as contributions from redshift-space distortions and Doppler effects. We implement our method for galaxy clustering and galaxy-galaxy lensing power spectra. We find that using the Limber approximation for galaxy clustering in future analyses like LSST Year 1 and DES Year 6 may cause significant biases in cosmological parameters, indicating that going beyond the Limber approximation is necessary for these analyses.

weak gravitational lensing↗

An iterative stochastic ensemble method for parameter estimation of subsurface flow models

Parameter estimation for subsurface flow models is an essential step for maximizing the value of numerical simulations for future prediction and the development of effective control strategies. We propose the iterative stochastic ensemble method (ISEM) as a general method for parameter estimation based on stochastic estimation of gradients using an ensemble of directional derivatives. ISEM eliminates the need for adjoint coding and deals with the numerical simulator as a blackbox. The proposed method employs directional derivatives within a Gauss–Newton iteration. The update equation in ISEM resembles the update step in ensemble Kalman filter, however the inverse of the output covariance matrix in ISEM is regularized using standard truncated singular value decomposition or Tikhonov regularization. We also investigate the performance of a set of shrinkage based covariance estimators within ISEM. The proposed method is successfully applied on several nonlinear parameter estimation problems for subsurface flow models. The efficiency of the proposed algorithm is demonstrated by the small size of utilized ensembles and in terms of error convergence rates.

97 MATHEMATICS AND COMPUTING↗

Task 1.5 Genomic Shift and Drift Trends of Emerging Pathogens

The Lawrence Livermore National Laboratory (LLNL) Bioinformatics group has recently taken on a role in DTRA's Transformation Medical Technologies Initiative (TMTI). The high-level goal of TMTI is to accelerate the development of broad-spectrum countermeasures. To achieve those goals, TMTI has a near term need to conduct analyses of genomic shift and drift trends of emerging pathogens, with a focused eye on select agent pathogens, as well as antibiotic and virulence markers. Most emerging human pathogens are zoonotic viruses with a genome composed of RNA. The high mutation rate of the replication enzymes of RNA viruses contributes to sequence drift and provides one mechanism for these viruses to adapt to diverse hosts (interspecies transmission events) and cause new human and zoonotic diseases. Additionally, new viral pathogens frequently emerge due to genetic shift (recombination and segment reassortment) which allows for dramatic genotypic and phenotypic changes to occur rapidly. Bacterial pathogens also evolve via genetic drift and shift, although sequence drift generally occurs at a much slower rate for bacteria as compared to RNA viruses. However, genetic shift such as lateral gene transfer and inter- and intragenomic recombination enables bacteria to rapidly acquire new mechanisms of survival and antibiotic resistance. New technologies such as rapid whole genome sequencing of bacterial genomes, ultra-deep sequencing of RNA virus populations, metagenomic studies of environments rich in antibiotic resistance genes, and the use of microarrays for the detection and characterization of emerging pathogens provide mechanisms to address the challenges posed by the rapid emergence of pathogens. Bioinformatic algorithms that enable efficient analysis of the massive amounts of data generated by these technologies as well computational modeling of protein structures and evolutionary processes need to be developed to allow the technology to fulfill its potential.

59 BASIC BIOLOGICAL SCIENCES↗

Robust estimation of charge carrier diffusivity using transient photoluminescence microscopy

Transient microscopy has emerged as a powerful tool for imaging the diffusion of excitons and free charge carriers in optoelectronic materials. In many excitonic materials, extraction of diffusion coefficients can be simplified because of the linear relationship between signal intensity and local excited state population. However, in materials where transport is dominated by free charge carriers, extracting diffusivities accurately from multidimensional data is complicated by the nonlinear dependence of the measured signal on the local charge carrier density. To obtain accurate estimates of charge carrier diffusivity from transient microscopy data, statistically robust fitting algorithms coupled to efficient 3D numerical solvers that faithfully relate local carrier dynamics to raw experimental measurables are sometimes needed. Here, we provide a detailed numerical framework for modeling the spatiotemporal dynamics of free charge carriers in bulk semiconductors with significant solving speed reduction and for simulating the corresponding transient photoluminescence microscopy data. To demonstrate the utility of this approach, we apply a fitting algorithm using a Markov chain Monte Carlo sampler to experimental data on bulk CdS and methylammonium lead bromide (MAPbBr 3 ) crystals. Parameter analyses reveal that transient photoluminescence microscopy can be used to obtain robust estimates of charge carrier diffusivities in optoelectronic materials of interest, but that other experimental approaches should be used for obtaining carrier recombination constants. Additionally, simplifications can be made to the fitting model depending on the experimental conditions and material systems studied. Our open-source simulation code and fitting algorithm are made freely available to the scientific community.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Two-Stage Decomposition Approach for AC Optimal Power Flow

The alternating current optimal power flow (AC-OPF) problem is critical to power system operations and planning, but it is generally hard to solve due to its nonconvex and large-scale nature. Furthermore, this paper proposes a scalable decomposition approach in which the power network is decomposed into a master network and a number of subnetworks, where each network has its own AC-OPF subproblem. This formulates a two-stage optimization problem and requires only a small amount of communication between the master and subnetworks. The key contribution is a smoothing technique that renders the response of a subnetwork differentiable with respect to the input from the master problem, utilizing properties of the barrier problem formulation that naturally arises when subproblems are solved by a primal-dual interior-point algorithm. Consequently, existing efficient nonlinear programming solvers can be used for both the master problem and the subproblems. The advantage of this framework is that speedup can be obtained by processing the subnetworks in parallel, and it has convergence guarantees under reasonable assumptions. The formulation is readily extended to instances with stochastic subnetwork loads. Numerical results show favorable performance and illustrate the scalability of the algorithm which is able to solve instances with more than 11 million buses.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Identifying TeV Source Candidates among Fermi -LAT Unclassified Blazars

Blazars, in particular the subclass of high synchrotron peaked active galactic nuclei are among the main targets for the present generation of Imaging Atmospheric Cerenkov Telescopes (IACTs), and they will remain of great importance for very high-energy γ-ray science in the era of the Cerenkov Telescope Array (CTA). Observations by IACTs, which have relatively small fields of view (~few degrees), are limited by viewing conditions; therefore, it is important to select the most promising targets to increase the number of detections. The aim of this paper is to search for unclassified blazars among known γ-ray sources from the Fermi Large Area Telescope (LAT) third source catalog that are likely detectable with IACTs or CTA. We use an artificial neural network algorithm and updated analysis of Fermi-LAT data. We found 80 γ-ray source candidates, and for the highest-confidence candidates, we calculate their potential detectability with IACTs and CTA based on an extrapolation of their energy spectra. Follow-up observations of our source candidates could significantly increase the current TeV source population sample and ultimately confirm the efficiency of our algorithm to select TeV sources.

79 ASTRONOMY AND ASTROPHYSICS↗

Leverage Score Sampling for Parametric PDEs (Final Technical Report)

This final technical report summarizes the accomplishments of work performed under DOE Office of Science Award DE-SC0022266, which is titled “Leverage Score Sampling for Parametric PDEs”. The goal of the project was to extend methods from Randomized Numerical Linear Algebra (RandNLA) to tackle central computational challenges in model order reduction and uncertainty quantification (UQ) for parametric partial differential equations (PDEs). In particular, we sought to use importance sampling methods originally developed for RandNLA to develop sample efficient active learning algorithms for approximating high-dimensional scalar functions, e.g. by polynomials, Gaussian process models, and simple neural networks. Such methods can be immediately applied to developing surrogate models or to approximating quantity of interest (QoI) surfaces. In the context of PDEs, each sample used for learning equates to the solution of the differential equation for a particular set of parameters, so sample efficiency translates to improved computational efficiency for a variety of downstream tasks.

97 MATHEMATICS AND COMPUTING↗

Analysis of Community Detection Algorithms for Large Scale Cyber Networks

The aim of this project is to use existing community detection algorithms on an IP network dataset to create supernodes within the network. This study compares the performance of different algorithms on the network in terms of running time. The paper begins with an introduction to the concept of clustering and community detection followed by the research question that the team aimed to address. Further the paper describes the graph metrics that were considered in order to shortlist algorithms followed by a brief explanation of each algorithm with respect to the graph metric on which it is based. The next section in the paper describes the methodology used by the team in order to run the algorithms and determine which algorithm is most efficient with respect to running time. Finally, the last section of the paper includes the results obtained by the team and a conclusion based on those results as well as future work.

algorithms↗

A spectral scheme for Kohn–Sham density functional theory of clusters

Starting from the observation that one of the most successful methods for solving the Kohn–Sham equations for periodic systems – the plane-wave method – is a spectral method based on eigenfunction expansion, we formulate a spectral method designed towards solving the Kohn–Sham equations for clusters. This allows for efficient calculation of the electronic structure of clusters (and molecules) with high accuracy and systematic convergence properties without the need for any artificial periodicity. The basis functions in this method form a complete orthonormal set and are expressible in terms of spherical harmonics and spherical Bessel functions. Computation of the occupied eigenstates of the discretized Kohn–Sham Hamiltonian is carried out using a combination of preconditioned block eigensolvers and Chebyshev polynomial filter accelerated subspace iterations. Several algorithmic and computational aspects of the method, including computation of the electrostatics terms and parallelization are discussed. We have implemented these methods and algorithms into an efficient and reliable package called ClusterES (Cluster Electronic Structure). A variety of benchmark calculations employing local and non-local pseudopotentials are carried out using our package and the results are compared to the literature. Convergence properties of the basis set are discussed through numerical examples. Computations involving large systems that contain thousands of electrons are demonstrated to highlight the efficacy of our methodology. The use of our method to study clusters with arbitrary point group symmetries is briefly discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Robust volume calculations for Constructive Solid Geometry (CSG) components in Monte Carlo transport calculations

In this paper we consider a new generalized algorithm for the efficient calculation of component object volumes given their equivalent constructive solid geometry (CSG) definition. The new method relies on domain decomposition to recursively subdivide the original component into smaller pieces with volumes that can be computed analytically or stochastically, if needed. Unlike simpler brute-force approaches, the proposed decomposition scheme is guaranteed to be robust and accurate to within a user-defined tolerance. The new algorithm is also fully general and can handle any valid CSG component definition, without the need for additional input from the user. The new technique has been specifically optimized to calculate volumes of component definitions commonly found in models used for Monte Carlo particle transport simulations for criticality safety and reactor analysis applications. However, the algorithm can be easily extended to any application which uses CSG representations for component objects. The paper provides a complete description of the novel volume calculation algorithm, along with a discussion of the conjectured error bounds on volumes calculated within the method. In addition, numerical results comparing the new algorithm with a standard stochastic volume calculation algorithm are presented for a series of problems spanning a range of representative component sizes and complexities. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Applications of Deep Learning to physics workflows

Modern large-scale physics experiments create datasets with sizes and streaming rates that can exceed those from industry leaders such as Google Cloud and Netflix. Fully processing these datasets requires both sufficient compute power and efficient workflows. Recent advances in Machine Learning (ML) and Artificial Intelligence (AI) can either improve or replace existing domain-specific algorithms to increase workflow efficiency. Not only can these algorithms improve the physics performance of current algorithms, but they can often be executed more quickly, especially when run on coprocessors such as GPUs or FPGAs. In the winter of 2023, MIT hosted the Accelerating Physics with ML at MIT workshop, which brought together researchers from gravitational-wave physics, multi-messenger astrophysics, and particle physics to discuss and share current efforts to integrate ML tools into their workflows. The following white paper highlights examples of algorithms and computing frameworks discussed during this workshop and summarizes the expected computing needs for the immediate future of the involved fields.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Performance of τq-lepton reconstruction and identification in CMS

The performance of tau-lepton reconstruction and identification algorithms is studied using a data sample of proton-proton collisions at sqrt(s)=7 TeV, corresponding to an integrated luminosity of 36 inverse picobarns collected with the CMS detector at the LHC. The tau leptons that decay into one or three charged hadrons, zero or more short-lived neutral hadrons, and a neutrino are identified using final-state particles reconstructed in the CMS tracker and electromagnetic calorimeter. The reconstruction efficiency of the algorithms is measured using tau leptons produced in Z-boson decays. The tau-lepton misidentification rates for jets and electrons are determined.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A simple method for understanding the triangular growth patterns of transition metal dichalcogenide sheets

Triangular nanoflake growth patterns have been commonly observed in synthesis of transition metal dichalcogenide sheets and their hybrid structures. Triangular nanoflakes not only show exceptional properties, but also can serve as building blocks for two or three dimensional structures. In this study, taking the MoS{sub 2} system as a test case, we propose a Matrix method to understand the mechanism of such unique growth pattern. Nanoflakes with different edge types are mathematically described with configuration matrices, and the total formation energy is calculated as the sum of the edge formation energies and the chemical potentials of sulfur and molybdenum. Based on energetics, we find that three triangular patterns with the different edge configurations are energetically more favorable in different ranges of the chemical potential of sulfur, which are in good agreement with experimental observations. Our algorithm has high efficiency and can deal with nanoflakes in microns which are beyond the ability of ab-initio method. This study not only elucidates the mechanism of triangular nanoflake growth patterns in experiment, but also provides a clue to control the geometric configurations in synthesis.

36 MATERIALS SCIENCE↗

Automatic Beam Path Analysis of Laser Wakefield Particle Acceleration Data

Numerical simulations of laser wakefield particle accelerators play a key role in the understanding of the complex acceleration process and in the design of expensive experimental facilities. As the size and complexity of simulation output grows, an increasingly acute challenge is the practical need for computational techniques that aid in scientific knowledge discovery. To that end, we present a set of data-understanding algorithms that work in concert in a pipeline fashion to automatically locate and analyze high energy particle bunches undergoing acceleration in very large simulation datasets. These techniques work cooperatively by first identifying features of interest in individual timesteps, then integrating features across timesteps, and based on the information derived perform analysis of temporally dynamic features. This combination of techniques supports accurate detection of particle beams enabling a deeper level of scientific understanding of physical phenomena than hasbeen possible before. By combining efficient data analysis algorithms and state-of-the-art data management we enable high-performance analysis of extremely large particle datasets in 3D. We demonstrate the usefulness of our methods for a variety of 2D and 3D datasets and discuss the performance of our analysis pipeline.

43 PARTICLE ACCELERATORS↗

Application of automated iterative target detection for standoff hyperspectral imaging

The utility of hyperspectral imaging (HSI) has been well established for a wide array of applications but has generated a need for automated screening of high volumes of large HSI cubes. We report two important automated algorithms for more efficient standoff processing: atmospheric correction and target detection. The atmospheric correction method is based on a fast asymmetric least squares approach that is applied on a pixel-by-pixel basis. Here, the correction can be applied to entire images without manually identifying regions of interest and utilizes only in-scene information, no ancillary modeling of the atmosphere is required. An iterative target detection approach is also introduced which demonstrates faster speeds relative to moving window approaches. The target detection algorithm classifies each pixel as true target detections, near target detections, clutter, and no-calls. The algorithms were tested on forty images of twenty-two solid mineral targets placed at a 14-meter standoff distance allowing general observations on expected detection performance for a variety of minerals. In addition to identifying anomalous pixels, the inclusion of “no-calls” reduced the number of false detections significantly.

47 OTHER INSTRUMENTATION↗

Automatic Identification and Truncation of Boundary Outlets in Complex Imaging-Derived Biomedical Geometries

Fast and accurate reconstruction of imaging-derived geometries and subsequent quality mesh generation for biomedical computation are enabling technologies for both clinical and research simulations. Often, the transformation of image to mesh is the rate-limiting step, requiring arduous manual manipulations. A challenging part of this process is the introduction of computable, orthogonal boundary patches, namely the outlets, into treed structures, such as vasculature, arterial or airway trees. Herein, we present efficient and robust algorithms for automatically identifying and truncating the outlets for complex biomedical geometries. Our approach is based on a conceptual decomposition of objects into three different types of local structures, including tips, segments, and branches, where the tips determine the outlets. We define the tips by introducing a novel geometric concept called the average interior center of curvature (AICC), and identify those that are physically stable and numerically noise resistant through successive inflation and deflation tests. We compute well-defined orthogonal planes, which truncate the tips into outlets. The rims of the outlets are then connected into curves, and the outlets are then closed using Delaunay triangulation with the curves as the boundary constraints. Our approach is efficient, with near linear time complexity. We illustrate the effectiveness and robustness of our approach with a variety of complex lung and coronary artery geometries.

60 APPLIED LIFE SCIENCES↗