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,585 records · Page 88

Spherical Harmonic-based Random Fields Based on Real Particle 3D Data: Improved Numerical Algorithm and Quantitative Comparison to Real Particles

Many parameters affect the cyclone efficiency, and these parameters can have different effects in different flow regimes. Therefore the maximum-efficiency cyclone length is a function of the specific geometry and operating conditions in use. In this study, we obtained a relationship describing the minimum particle diameter or maximum cyclone efficiency by using a theoretical approach based on cyclone geometry and fluid properties. We have compared the empirical predictions with corresponding literature data and observed good agreement. The results address the importance of fluid properties. Inlet and vortex finder cross-sections, cone-apex diameter, inlet Reynolds number and surface roughness are found to be the other important parameters affecting cyclone height. The surface friction coefficient, on the other hand, is difficult to employ in the calculations.We developed a theoretical approach to find the maximum-efficiency heights for cyclones with tangential inlet and we suggested a relation for this height as a function of cyclone geometry and operating parameters. In order to generalize use of the relation, two dimensionless parameters, namely for geometric and operational variables, we defined and results were presented in graphical form such that one can calculate and enter the values of these dimensionless parameters and then can find the maximum efficiency height of his own specific cyclone.

99 GENERAL AND MISCELLANEOUS↗

SIMULTANEOUS MULTI-BAND DETECTION OF LOW SURFACE BRIGHTNESS GALAXIES WITH MARKOVIAN MODELING

We present to the astronomical community an algorithm for the detection of low surface brightness (LSB) galaxies in images, called MARSIAA (MARkovian Software for Image Analysis in Astronomy), which is based on multi-scale Markovian modeling. MARSIAA can be applied simultaneously to different bands. It segments an image into a user-defined number of classes, according to their surface brightness and surroundings-typically, one or two classes contain the LSB structures. We have developed an algorithm, called DetectLSB, which allows the efficient identification of LSB galaxies from among the candidate sources selected by MARSIAA. The application of the method to two and three bands simultaneously was tested on simulated images. Based on our tests, we are confident that we can detect LSB galaxies down to a central surface brightness level of only 1.5 times the standard deviation from the mean pixel value in the image background. To assess the robustness of our method, the method was applied to a set of 18 B- and I-band images (covering 1.3 deg{sup 2} in total) of the Virgo Cluster to which Sabatini et al. previously applied a matched-filter dwarf LSB galaxy search algorithm. We have detected all 20 objects from the Sabatini et al. catalog which we could classify by eye as bona fide LSB galaxies. Our method has also detected four additional Virgo Cluster LSB galaxy candidates undetected by Sabatini et al. To further assess the completeness of the results of our method, both MARSIAA, SExtractor, and DetectLSB were applied to search for (1) mock Virgo LSB galaxies inserted into a set of deep Next Generation Virgo Survey (NGVS) gri-band subimages and (2) Virgo LSB galaxies identified by eye in a full set of NGVS square degree gri images. MARSIAA/DetectLSB recovered {approx}20% more mock LSB galaxies and {approx}40% more LSB galaxies identified by eye than SExtractor/DetectLSB. With a 90% fraction of false positives from an entirely unsupervised pipeline, a completeness of 90% is reached for sources with r{sub e} > 3'' at a mean surface brightness level of {mu}{sub g} = 27.7 mag arcsec{sup -2} and a central surface brightness of {mu}{sup 0}{sub g} = 26.7 mag arcsec{sup -2}. About 10% of the false positives are artifacts, the rest being background galaxies. We have found our proposed Markovian LSB galaxy detection method to be complementary to the application of matched filters and an optimized use of SExtractor, and to have the following advantages: it is scale free, can be applied simultaneously to several bands, and is well adapted for crowded regions on the sky.

79 ASTRONOMY AND ASTROPHYSICS↗

Accelerated optimization and automated discovery with covariance matrix adaptation for experimental quantum control

Optimization of quantum systems by closed-loop adaptive pulse shaping offers a rich domain for the development and application of specialized evolutionary algorithms. Derandomized evolution strategies (DESs) are presented here as a robust class of optimizers for experimental quantum control. The combination of stochastic and quasi-local search embodied by these algorithms is especially amenable to the inherent topology of quantum control landscapes. Implementation of DES in the laboratory results in efficiency gains of up to {approx}9 times that of the standard genetic algorithm, and thus is a promising tool for optimization of unstable or fragile systems. The statistical learning upon which these algorithms are predicated also provide the means for obtaining a control problem's Hessian matrix with no additional experimental overhead. The forced optimal covariance adaptive learning (FOCAL) method is introduced to enable retrieval of the Hessian matrix, which can reveal information about the landscape's local structure and dynamic mechanism. Exploitation of such algorithms in quantum control experiments should enhance their efficiency and provide additional fundamental insights.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Model-Based Investigation of Multi-Fault Interactions and Performance Degradation in Residential Heat Pump Systems

Faults in heat pump systems can significantly degrade performance, reduce efficiency, and accelerate component wear, leading to higher operating costs and maintenance demands. While numerous studies have investigated the impact of individual faults, the interactions between multiple concurrent faults remain insufficiently understood, despite their common occurrence in real-world operation. This study conducts a comprehensive simulation analysis of multiple simultaneous faults in a vapor compression heat pump using a validated heat pump design model (HPDM) tool. Detailed component-level modeling methods are implemented to examine performance sensitivity under combinations of refrigerant flow and heat exchanger faults. The results reveal complex fault interactions that can mask or amplify system deviations, challenging conventional diagnostic approaches. Findings from this work provide meaningful insights for the development of more robust fault detection and diagnosis algorithms, supporting improved reliability and energy efficiency in next-generation heat pump technologies.

Hu, Yifeng [ORNL] (ORCID:0000000242875185)↗

Monte Carlo solution methods in a moment-based scale-bridging algorithm for thermal radiative transfer problems: Comparison with Fleck and Cummings

We have developed a moment-based scale-bridging algorithm for thermal radiative transfer problems. The algorithm takes the form of well-known nonlinear-diffusion acceleration which utilizes a low-order (LO) continuum problem to accelerate the solution of a high-order (HO) kinetic problem. The coupled nonlinear equations that form the LO problem are efficiently solved using a preconditioned Jacobian-free Newton-Krylov method. This work demonstrates the applicability of the scale-bridging algorithm with a Monte Carlo HO solver and reports the computational efficiency of the algorithm in comparison to the well-known Fleck-Cummings algorithm. (authors)

97 MATHEMATICS AND COMPUTING↗

Marker ReDistancing/Level Set Method for High-Fidelity Implicit Interface Tracking

A hybrid of the Front-Tracking (FT) and the Level-Set (LS) methods is introduced, combining advantages and removing drawbacks of both methods. The kinematics of the interface is treated in a Lagrangian (FT) manner, by tracking markers placed at the interface. The markers are not connected – instead, the interface topology is resolved in an Eulerian (LS) framework, by wrapping a signed distance function around Lagrangian markers each time the markers move. For accuracy and efficiency, we have developed a high-order “anchoring” algorithm and an implicit PDE-based re-distancing. We have demonstrated that the method is 3rd-order accurate in space, near the markers, and therefore 1st-order convergent in curvature; in contrast to traditional PDE-based re-initialization algorithms, which tend to slightly relocate the zero Level Set and can be shown to be non-convergent in curvature. The implicit pseudo-time discretization of the re-distancing equation is implemented within the Jacobian-Free Newton Krylov (JFNK) framework combined with ILU(k) preconditioning. We have demonstrated that the steady-state solutions in pseudo-time can be achieved very efficiently, with iterations (CFL ), in contrast to the explicit re-distancing which requires 100s of iterations with CFL . The most cost-effective algorithm is found to be a hybrid of explicit and implicit discretizations, in which we apply first 10-15 iterations with explicit discretization (to bring the initial guess to the ball of convergence for the Newton’s method) and then finishing with 2-3 implicit steps, bringing the re-distancing equation to a complete steady-state. The eigenscopy of the JFNK-ILU(k) demonstrates the efficiency of the ILU(k) preconditioner, which effectively cluster eigenvalues of the otherwise extremely ill-conditioned Jacobian matrices, thereby enabling the Krylov (GMRES) method to converge with iterations, with only a few levels of ILU fill-ins. Importantly, due to the Level Set localization, the bandwidth of the Jacobian matrix is nearly constant, and the ILU preconditioning scales as , which implies efficiency and good scalability of the overall algorithm. The numerical examples include the well-established tests for interface kinematics under translational, rotational and tearing/stretching motion. We have shown that the mass conservation is not an issue anymore, as demonstrated using the Rider&Kothe’s time-reversed tests with extreme deformation. We are able to stretch interface structures to the under-resolved/subgrid (on the chosen Eulerian mesh) scales, and recover them back without any change in shape/loss of mass.

99 GENERAL AND MISCELLANEOUS↗

Spoofing Cross-Entropy Measure in Boson Sampling

Cross-entropy (XE) measure is a widely used benchmark to demonstrate quantum computational advantage from sampling problems, such as random circuit sampling using superconducting qubits and boson sampling (BS). We present a heuristic classical algorithm that attains a better XE than the current BS experiments in a verifiable regime and is likely to attain a better XE score than the near-future BS experiments in a reasonable running time. The key idea behind the algorithm is that there exist distributions that correlate with the ideal BS probability distribution and that can be efficiently computed. The correlation and the computability of the distribution enable us to postselect heavy outcomes of the ideal probability distribution without computing the ideal probability, which essentially leads to a large XE. Our method scores a better XE than the recent Gaussian BS experiments when implemented at intermediate, verifiable system sizes. Much like current state-of-the-art experiments, we cannot verify that our spoofer works for quantum-advantage-size systems. However, we demonstrate that our approach works for much larger system sizes in fermion sampling, where we can efficiently compute output probabilities. Finally, we provide analytic evidence that the classical algorithm is likely to spoof noisy BS efficiently.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Efficient Estimation of Pauli Observables by Derandomization

In this work, we consider the problem of jointly estimating expectation values of many Pauli observables, a crucial subroutine in variational quantum algorithms. Starting with randomized measurements, we propose an efficient derandomization procedure that iteratively replaces random single-qubit measurements by fixed Pauli measurements; the resulting deterministic measurement procedure is guaranteed to perform at least as well as the randomized one. In particular, for estimating any L low-weight Pauli observables, a deterministic measurement on only of order log(L) copies of a quantum state suffices. In some cases, for example, when some of the Pauli observables have high weight, the derandomized procedure is substantially better than the randomized one. Specifically, numerical experiments highlight the advantages of our derandomized protocol over various previous methods for estimating the ground-state energies of small molecules.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Modeling the Echelle Spectra Continuum with Alpha Shapes and Local Regression Fitting

Continuum normalization of echelle spectra is an important data analysis step that is difficult to automate. Polynomial fitting requires a reasonably high-order model to follow the steep slope of the blaze function. However, in the presence of deep spectral lines, a high-order polynomial fit can result in ripples in the normalized continuum that increase errors in spectral analysis. Here, we present two algorithms for flattening the spectrum continuum. The Alpha-shape Fitting to Spectrum algorithm is completely data driven, using an alpha shape to obtain an initial estimate of the blaze function. The Alpha-shape and Lab Source Fitting to Spectrum algorithm incorporates a continuum constraint from a laboratory source reference spectrum for the blaze function estimation. These algorithms are tested on a simulated spectrum, where we demonstrate improved normalization compared to polynomial regression for continuum fitting. We show an additional application, using the algorithms for mitigation of spatially correlated quantum efficiency variations and fringing in the charge-coupled device detector of the EXtreme PREcision Spectrometer.

79 ASTRONOMY AND ASTROPHYSICS↗

Cosmological parameters from CMB maps without likelihood approximation

We propose an efficient Bayesian Markov chain Monte Carlo (MCMC) algorithm for estimating cosmological parameters from cosmic microwave background (CMB) data without the use of likelihood approximations. It builds on a previously developed Gibbs sampling framework that allows for exploration of the joint CMB sky signal and power spectrum posterior, P(s,C{sub ℓ}|d), and addresses a long-standing problem of efficient parameter estimation simultaneously in regimes of high and low signal-to-noise ratio. To achieve this, our new algorithm introduces a joint Markov chain move in which both the signal map and power spectrum are synchronously modified, by rescaling the map according to the proposed power spectrum before evaluating the Metropolis–Hastings accept probability. Such a move was already introduced by Jewell et al., who used it to explore low signal-to-noise posteriors. However, they also found that the same algorithm is inefficient in the high signal-to-noise regime, since a brute-force rescaling operation does not account for phase information. This problem is mitigated in the new algorithm by subtracting the Wiener filter mean field from the proposed map prior to rescaling, leaving high signal-to-noise information invariant in the joint step, and effectively only rescaling the low signal-to-noise component. To explore the full posterior, the new joint move is then interleaved with a standard conditional Gibbs move for the sky map. We apply our new algorithm to simplified simulations for which we can evaluate the exact posterior to study both its accuracy and its performance, and find good agreement with the exact posterior; marginal means agree to ≲0.006σ and standard deviations to better than ∼3%. The Markov chain correlation length is of the same order of magnitude as those obtained by other standard samplers in the field.

79 ASTRONOMY AND ASTROPHYSICS↗

A conservative discontinuous-Galerkin-in-time (DGiT) multirate time integration framework for interface-coupled problems with applications to solid–solid interaction and air–sea models

In this paper we extend the DGiT multirate framework, developed in Connors and Sockwell (2022) for scalar transmission problems, to a solid–solid interaction (SSI) problem involving two coupled elastic solids and a coupled air–sea model with the rotating, thermal shallow water equations. In so doing we aim to demonstrate the broad applicability of the mathematical theory and governing principles established in Connors and Sockwell (2022) to coupled problems characterized by subproblems evolving at different temporal scales. Further, multirate time integration algorithms employing different time steps, optimized for the dynamics of each subproblem, can significantly improve simulation efficiency for such coupled problems. However, development of multirate algorithms is a highly non-trivial task due to the coupling, which can impact accuracy, stability or other desired properties such as preservation of system invariants. DGiT provides a general template for multirate time integration that can achieve these properties. To elucidate the manner in which DGiT accomplishes this task, we fully detail each step in the application of the framework to the SSI and air–sea coupled problems. Numerical examples illustrate key properties of the resulting multirate schemes for both problems.

42 ENGINEERING↗

Certified dual-corrected radiation patterns of phased antenna arrays by offline–online order reduction of finite-element models

This paper presents a fast numerical method for computing certified far-field patterns of phased antenna arrays over broad frequency bands as well as wide ranges of steering and look angles. The proposed scheme combines finite-element analysis, dual-corrected model-order reduction, and empirical interpolation. To assure the reliability of the results, improved a posteriori error bounds for the radiated power and directive gain are derived. Both the reduced-order model and the error-bounds algorithm feature offline–online decomposition. A real-world example is provided to demonstrate the efficiency and accuracy of the suggested approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A survey of numerical linear algebra methods utilizing mixed-precision arithmetic

The efficient utilization of mixed-precision numerical linear algebra algorithms can offer attractive acceleration to scientific computing applications. Especially with the hardware integration of low-precision special-function units designed for machine learning applications, the traditional numerical algorithms community urgently needs to reconsider the floating point formats used in the distinct operations to efficiently leverage the available compute power. In this study, we provide a comprehensive survey of mixed-precision numerical linear algebra routines, including the underlying concepts, theoretical background, and experimental results for both dense and sparse linear algebra problems.

97 MATHEMATICS AND COMPUTING↗

PRISMS-Plasticity: An open-source crystal plasticity finite element software

An open-source parallel 3-D crystal plasticity finite element (CPFE) software package PRISMS-Plasticity is presented here as a part of PRISMS integrated framework. A highly efficient rate-independent crystal plasticity algorithm is implemented along with developing its algorithmic tangent modulus. Additionally, a twin activation mechanism is incorporated into the framework based on an integration point sensitive scheme. The integration of the software as a part of the PRISMS framework is demonstrated. To do so, the integration of the PRISMS-Plasticity software with experimental characterization techniques such as electron backscatter diffraction (EBSD) and synchrotron X-ray diffraction using available open source software packages of DREAM.3D and Neper is elaborated. The integration of the PRISMS-Plasticity software with the information repository of Materials Commons is also presented. The parallel performance of the software is characterized which demonstrates that it scales well for large problems running on hundreds of processors. Various examples of polycrystalline metals with face-centered cubic (FCC), body-centered cubic (BCC), and hexagonal close-packed (HCP) crystals structures are presented to show the capability of the software to efficiently solve crystal plasticity boundary value problems, in addition to integration with preprocessing and postprocessing tools. PRISMS-Plasticity is an important activity within the broader PRISMS Center and future enhancements to PRISMS-Plasticity are planned and will be described.

36 MATERIALS SCIENCE↗

Efficient Aho-Corasick String Matching on Emerging Multicore Architectures

String matching algorithms are critical to several scientific fields. Beside text processing and databases, emerging applications such as DNA protein sequence analysis, data mining, information security software, antivirus, ma- chine learning, all exploit string matching algorithms [3]. All these applica- tions usually process large quantity of textual data, require high performance and/or predictable execution times. Among all the string matching algorithms, one of the most studied, especially for text processing and security applica- tions, is the Aho-Corasick algorithm. 1 2 Book title goes here Aho-Corasick is an exact, multi-pattern string matching algorithm which performs the search in a time linearly proportional to the length of the input text independently from pattern set size. However, depending on the imple- mentation, when the number of patterns increase, the memory occupation may raise drastically. In turn, this can lead to significant variability in the performance, due to the memory access times and the caching effects. This is a significant concern for many mission critical applications and modern high performance architectures. For example, security applications such as Network Intrusion Detection Systems (NIDS), must be able to scan network traffic against very large dictionaries in real time. Modern Ethernet links reach up to 10 Gbps, and malicious threats are already well over 1 million, and expo- nentially growing [28]. When performing the search, a NIDS should not slow down the network, or let network packets pass unchecked. Nevertheless, on the current state-of-the-art cache based processors, there may be a large per- formance variability when dealing with big dictionaries and inputs that have different frequencies of matching patterns. In particular, when few patterns are matched and they are all in the cache, the procedure is fast. Instead, when they are not in the cache, often because many patterns are matched and the caches are continuously thrashed, they should be retrieved from the system memory and the procedure is slowed down by the increased latency. Efficient implementations of string matching algorithms have been the fo- cus of several works, targeting Field Programmable Gate Arrays [4, 25, 15, 5], highly multi-threaded solutions like the Cray XMT [34], multicore proces- sors [19] or heterogeneous processors like the Cell Broadband Engine [35, 22]. Recently, several researchers have also started to investigate the use Graphic Processing Units (GPUs) for string matching algorithms in security applica- tions [20, 10, 32, 33]. Most of these approaches mainly focus on reaching high peak performance, or try to optimize the memory occupation, rather than looking at performance stability. However, hardware solutions supports only small dictionary sizes due to lack of memory and are difficult to customize, while platforms such as the Cell/B.E. are very complex to program.

Tumeo, Antonino↗

Efficient reactive Brownian dynamics

We develop a Split Reactive Brownian Dynamics (SRBD) algorithm for particle simulations of reaction-diffusion systems based on the Doi or volume reactivity model, in which pairs of particles react with a specified Poisson rate if they are closer than a chosen reactive distance. In our Doi model, we ensure that the microscopic reaction rules for various association and dissociation reactions are consistent with detailed balance (time reversibility) at thermodynamic equilibrium. The SRBD algorithm uses Strang splitting in time to separate reaction and diffusion and solves both the diffusion-only and reaction-only subproblems exactly, even at high packing densities. To efficiently process reactions without uncontrolled approximations, SRBD employs an event-driven algorithm that processes reactions in a time-ordered sequence over the duration of the time step. A grid of cells with size larger than all of the reactive distances is used to schedule and process the reactions, but unlike traditional grid-based methods such as reaction-diffusion master equation algorithms, the results of SRBD are statistically independent of the size of the grid used to accelerate the processing of reactions. We use the SRBD algorithm to compute the effective macroscopic reaction rate for both reaction-limited and diffusion-limited irreversible association in three dimensions and compare to existing theoretical predictions at low and moderate densities. We also study long-time tails in the time correlation functions for reversible association at thermodynamic equilibrium and compare to recent theoretical predictions. Finally, we compare different particle and continuum methods on a model exhibiting a Turing-like instability and pattern formation. Our studies reinforce the common finding that microscopic mechanisms and correlations matter for diffusion-limited systems, making continuum and even mesoscopic modeling of such systems difficult or impossible. We also find that for models in which particles diffuse off lattice, such as the Doi model, reactions lead to a spurious enhancement of the effective diffusion coefficients.

97 MATHEMATICS AND COMPUTING↗

Measurement of joint kinematics using a conventional clinical single-perspective flat-panel radiography system

Purpose: The ability to accurately measure joint kinematics is an important tool in studying both normal joint function and pathologies associated with injury and disease. The purpose of this study is to evaluate the efficacy, accuracy, precision, and clinical safety of measuring 3D joint motion using a conventional flat-panel radiography system prior to its application in an in vivo study. Methods: An automated, image-based tracking algorithm was implemented to measure the three-dimensional pose of a sparse object from a two-dimensional radiographic projection. The algorithm was tested to determine its efficiency and failure rate, defined as the number of image frames where automated tracking failed, or required user intervention. The accuracy and precision of measuring three-dimensional motion were assessed using a robotic controlled, tibiofemoral knee phantom programmed to mimic a subject with a total knee replacement performing a stair ascent activity. Accuracy was assessed by comparing the measurements of the single-plane radiographic tracking technique to those of an optical tracking system, and quantified by the measurement discrepancy between the two systems using the Bland-Altman technique. Precision was assessed through a series of repeated measurements of the tibiofemoral kinematics, and was quantified using the across-trial deviations of the repeated kinematic measurements. The safety of the imaging procedure was assessed by measuring the effective dose of ionizing radiation associated with the x-ray exposures, and analyzing its relative risk to a human subject. Results: The automated tracking algorithm displayed a failure rate of 2% and achieved an average computational throughput of 8 image frames/s. Mean differences between the radiographic and optical measurements for translations and rotations were less than 0.08 mm and 0.07 Degree-Sign in-plane, and 0.24 mm and 0.6 Degree-Sign out-of-plane. The repeatability of kinematics measurements performed using the radiographic tracking technique was better than {+-}0.09 mm and 0.12 Degree-Sign in-plane, and {+-}0.70 mm and {+-}0.07 Degree-Sign out-of-plane. The effective dose associated with the imaging protocol used was 15 {mu}Sv for 10 s of radiographic cine acquisition. Conclusions: This study demonstrates the ability to accurately measure knee-joint kinematics using a single-plane radiographic measurement technique. The measurement technique can be easily implemented at most clinical centers equipped with a modern-day radiographic x-ray system. The dose of ionizing radiation associated with the image acquisition represents a minimal risk to any subjects undergoing the examination.

60 APPLIED LIFE SCIENCES↗