Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computational 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 865 records · Page 48

Using automatic differentiation in sensitivity analysis of nuclear simulatoin models.

Sensitivity analysis is an important tool in the study of nuclear systems. In our recent work, we introduced a hybrid method that combines sampling techniques with first-order sensitivity analysis to approximate the effects of uncertainty in parameters of a nuclear reactor simulation model. For elementary examples, the approach offers a substantial advantage (in precision, computational efficiency, or both) over classical methods of uncertainty quantification.

97 MATHEMATICS AND COMPUTING↗

Second-order adjoint sensitivity analysis methodology (2ND-ASAM) for computing exactly and efficiently first- and second-order sensitivities in large-scale systems - 14356

This work presents the second-order adjoint sensitivity analysis methodology (2.-ASAM) for computing exactly and efficiently the second-order functional derivatives ('sensitivities') of system responses to the system's model parameters. For a physical system comprising N{sub α} parameters and N{sub r} responses, forward methods require a total of at least (N{sup 2}{sub α}/2+3N{sub α}/2) large-scale computations for obtaining all of the first- and second-order sensitivities, for all N{sub r} system responses. On the other hand, for one functional-type system response, the 2.-ASAM requires one large-scale computation using the first-level adjoint sensitivity system (1.-LASS) for obtaining all of the first-order sensitivities, followed by at most (2N{sub α}+1) large-scale computations using the second-level adjoint sensitivity systems (2.-LASS) for obtaining all of the second-order sensitivities. The second-order sensitivities contribute decisively to causing asymmetries in the response distribution, since they are the leading contributors to the third-order response correlations (skewness). They also cause the 'expected value of the response' to differ from the 'computed nominal value of the response'. The implementation of the 2.-ASAM requires very little additional effort beyond the construction of the adjoint sensitivity system needed for computing the first-order sensitivities. Only the sources on the right-sides of the diffusion (differential) operator needed to be modified; the left-side of the differential equations (and hence the 'solver' in large-scale practical applications) remain unchanged. The application of the 2.-ASAM is illustrated on a benchmark heat conduction/convection problem, which makes transparent the underlying mathematical derivations. For this illustrative problem, 4 'large-scale' adjoint computations suffice for computing exactly all of the 6 first- and 21 distinct second-order derivatives. The 2.-ASAM presented in this work should enable the hitherto very difficult, if not intractable, exact computation of all of the second-order response sensitivities for large-systems involving many parameters, which is expected to affect significantly other fields that need efficiently computed second-order response sensitivities, such as optimization, data assimilation/adjustment, model calibration, and predictive modeling. (author)

42 ENGINEERING↗

HDSense: An efficient method for ranking observable sensitivity

Identifying which observables most effectively constrain model parameters can be computationally prohibitive when considering full likelihoods of many correlated observables. This is especially important for, e.g., hadronization models, where high precision is required to interpret the results of collider experiments. We introduce the High-Dimensional Sensitivity (HDSense) score, a computationally efficient metric for ranking observable sets using only one-dimensional histograms. Derived by profiling over unknown correlations in the Fisher information framework, the score balances total information content against redundancy between observables. We apply HDSense to rank a set observables in terms of their constraining power with respect to five parameters of the Lund string model of hadronization implemented in Pythia using simulated leptonic collider events at the $Z$ pole. Validation against machine-learning--based full-likelihood approximations demonstrates that HDSense successfully identifies near-optimal observable subsets. The framework naturally handles data from multiple experiments with different acceptances and incorporates detector effects. While demonstrated on hadronization models, the methodology applies broadly to generic parameter estimation problems where correlations are unknown or difficult to model.

Assi, Benoît [Cincinnati U.] (ORCID:00000003092433↗

ALL TRANSIENTS, ALL THE TIME: REAL-TIME RADIO TRANSIENT DETECTION WITH INTERFEROMETRIC CLOSURE QUANTITIES

We demonstrate a new technique for detecting radio transients based on interferometric closure quantities. The technique uses the bispectrum, the product of visibilities around a closed loop of baselines of an interferometer. The bispectrum is calibration independent, resistant to interference, and computationally efficient, so it can be built into correlators for real-time transient detection. Our technique could find celestial transients anywhere in the field of view and localize them to arcsecond precision. At the Karl G. Jansky Very Large Array (VLA), such a system would have a high survey speed and a 5{sigma} sensitivity of 38 mJy on 10 ms timescales with 1 GHz of bandwidth. The ability to localize dispersed millisecond pulses to arcsecond precision in large volumes of interferometer data has several unique science applications. Localizing individual pulses from Galactic pulsars will help find X-ray counterparts that define their physical properties, while finding host galaxies of extragalactic transients will measure the electron density of the intergalactic medium with a single dispersed pulse. Exoplanets and active stars have distinct millisecond variability that can be used to identify them and probe their magnetospheres. We use millisecond timescale visibilities from the Allen Telescope Array and VLA to show that the bispectrum can detect dispersed pulses and reject local interference. The computational and data efficiency of the bispectrum will help find transients on a range of timescales with next-generation radio interferometers.

79 ASTRONOMY AND ASTROPHYSICS↗

Generalized radial-return mapping algorithm for anisotropic von Mises plasticity framed in material eigenspace

A computationally efficient integration algorithm for anisotropic plasticity is proposed, which is identified as a generalization of the radial-return mapping algorithm to anisotropy. The algorithm is based upon formulation within the eigenspace of a material anisotropy tensor associated with anisotropic quadratic von Mises (J 2 ) plasticity (also called Hill plasticity), for which it is shown to ensure that the flow rule remains associative, ie, the normality condition is satisfied. Extension of the algorithm to include anisotropic elasticity (anisotropic elastoplasticity) is further provided, made possible by the identification of a certain fourth-order material tensor dependent on both the elastic and plastic anisotropy. The derivation of the fully elastoplastically anisotropic algorithm involves further complexity, but the resulting algorithm is shown to closely resemble the purely plastically anisotropic one once the appropriate eigenspace is identified. The proposed generalized radial-return algorithm is compared to a classical closest-point projection algorithm, for which it is shown to provide considerable advantage in computational cost. In conclusion, the efficiency, accuracy, and robustness of the algorithm are demonstrated through various illustrative test cases and in the finite element simulation of Taylor impact tests on tantalum.

36 MATERIALS SCIENCE↗

Comparing Server Energy Use and Efficiency Using Small Sample Sizes

This report documents a demonstration that compared the energy consumption and efficiency of a limited sample size of server-type IT equipment from different manufacturers by measuring power at the server power supply power cords. The results are specific to the equipment and methods used. However, it is hoped that those responsible for IT equipment selection can used the methods described to choose models that optimize energy use efficiency. The demonstration was conducted in a data center at Lawrence Berkeley National Laboratory in Berkeley, California. It was performed with five servers of similar mechanical and electronic specifications; three from Intel and one each from Dell and Supermicro. Server IT equipment is constructed using commodity components, server manufacturer-designed assemblies, and control systems. Server compute efficiency is constrained by the commodity component specifications and integration requirements. The design freedom, outside of the commodity component constraints, provides room for the manufacturer to offer a product with competitive efficiency that meets market needs at a compelling price. A goal of the demonstration was to compare and quantify the server efficiency for three different brands. The efficiency is defined as the average compute rate (computations per unit of time) divided by the average energy consumption rate. The research team used an industry standard benchmark software package to provide a repeatable software load to obtain the compute rate and provide a variety of power consumption levels. Energy use when the servers were in an idle state (not providing computing work) were also measured. At high server compute loads, all brands, using the same key components (processors and memory), had similar results; therefore, from these results, it could not be concluded that one brand is more efficient than the other brands. The test results show that the power consumption variability caused by the key components as a group is similar to all other components as a group. However, some differences were observed. The Supermicro server used 27 percent more power at idle compared to the other brands. The Intel server had a power supply control feature called cold redundancy, and the data suggest that cold redundancy can provide energy savings at low power levels. Test and evaluation methods that might be used by others having limited resources for IT equipment evaluation are explained in the report.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Faster spectral density calculation using energy moments

Abstract Accurate predictions of inclusive scattering cross sections in the linear response regime require efficient and controllable methods to calculate the spectral density in a strongly-correlated many-body system. In this work we reformulate the recently proposed Gaussian Integral Transform technique in terms of Fourier moments of the system Hamiltonian which can be computed efficiently on a quantum computer. One of the main advantages of this framework is that it allows for an important reduction of the computational cost by exploiting previous knowledge about the energy moments of the spectral density. For a simple model of medium mass nucleus like $$^{40}$$ 40 Ca and target energy resolution of 1 MeV we find an expected speed-up of $$\approx 125$$ ≈ 125 times for the calculation of the giant dipole response and of $$\approx 50$$ ≈ 50 times for the simulation of quasi-elastic electron scattering at typical momentum transfers.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A Generalized Framework for Auto-tuning Stencil Computations

This work introduces a generalized framework for automatically tuning stencil computations to achieve superior performance on a broad range of multicore architectures. Stencil (nearest-neighbor) based kernels constitute the core of many important scientific applications involving block-structured grids. Auto-tuning systems search over optimization strategies to find the combination of tunable parameters that maximizes computational efficiency for a given algorithmic kernel. Although the auto-tuning strategy has been successfully applied to libraries, generalized stencil kernels are not amenable to packaging as libraries. Studied kernels in this work include both memory-bound kernels as well as a computation-bound bilateral filtering kernel. We introduce a generalized stencil auto-tuning framework that takes a straightforward Fortran expression of a stencil kernel and automatically generates tuned implementations of the kernel in C or Fortran to achieve performance portability across diverse computer architectures.

97 MATHEMATICS AND COMPUTING↗

An implementation analysis of the linear discontinuous finite element method

This paper provides an implementation analysis of the linear discontinuous finite element method (LD-FEM) that spans the space of (l, x, y, z). A practical implementation of LD includes 1) selecting a computationally efficient algorithm to solve the 4 x 4 matrix system Ax = b that describes the angular flux in a mesh element, and 2) choosing how to store the data used to construct the matrix A and the vector b to either reduce memory consumption or increase computational speed. To analyze the first of these, three algorithms were selected to solve the 4 x 4 matrix equation: Cramer's rule, a streamlined implementation of Gaussian elimination, and LAPACK's Gaussian elimination subroutine dgesv. The results indicate that Cramer's rule and the streamlined Gaussian elimination algorithm perform nearly equivalently and outperform LAPACK's implementation of Gaussian elimination by a factor of 2. To analyze the second implementation detail, three formulations of the discretized LD-FEM equations were provided for implementation in a transport solver: 1) a low-memory formulation, which relies heavily on 'on-the-fly' calculations and less on the storage of pre-computed data, 2) a high-memory formulation, which pre-computes much of the data used to construct A and b, and 3) a reduced-memory formulation, which lies between the low - and high-memory formulations. These three formulations were assessed in the Jaguar transport solver based on relative memory footprint and computational speed for increasing mesh size and quadrature order. The results indicated that the memory savings of the low-memory formulation were not sufficient to warrant its implementation. The high-memory formulation resulted in a significant speed advantage over the reduced-memory option (10-50%), but also resulted in a proportional increase in memory consumption (5-45%) for increasing quadrature order and mesh count; therefore, the practitioner should weigh the system memory constraints against any required runtime constraints to determine which option is more suitable for his or her specific applications. (authors)

97 MATHEMATICS AND COMPUTING↗

Efficient simulation of low-temperature physics in one-dimensional gapless systems

Here, we discuss the computational efficiency of the finite-temperature simulation with minimally entangled typical thermal states (METTS). To argue that METTS can be efficiently represented as matrix product states, we present an analytic upper bound for the average entanglement Rényi entropy of METTS for a Rényi index 0 < q ≤ 1. In particular, for one-dimensional (1D) gapless systems described by conformal field theories, the upper bound scales as O⁡(cN 0 ⁢log⁡β) where c is the central charge and N is the system size. Furthermore, we numerically find that the average Rényi entropy exhibits a universal behavior characterized by the central charge and is roughly given by half of the analytic upper bound. Based on these results, we show that METTS can provide a speedup compared to employing the purification method to analyze thermal equilibrium states at low temperatures in 1D gapless systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Four-Dimensional Finite-Orbit-Width Fokker-Planck Code with Sources, for Neoclassical/Anomalous Transport Simulation of Ion and Electron (Final Technical Report)

Within the US Department of Energy/Office of Fusion Energy magnetic fusion research program, there is an important whole-plasma-modeling need for a radio-frequency/neutral-beam-injection (RF/NBI) transport-oriented finite-difference Fokker-Planck (FP) code with combined capabilities for 4D (2R2V) geometry near the fusion plasma periphery, and computationally less demanding 3D (1R2V) bounce-averaged capabilities for plasma in the core of fusion devices. Demonstration of proof-of-principle achievement of this goal has been carried out in research carried out under Phase I of the SBIR award. Two DOE-sponsored codes, the CQL3D bounce-average Fokker-Planck code in which CompX has specialized, and the COGENT 4D, plasma edge-oriented Fokker-Planck code which has been constructed by Lawrence Livermore National Laboratory and Lawrence Berkeley Laboratory scientists, where coupled. Coupling was achieved by using CQL3D calculated velocity distributions including an energetic tail resulting from NBI, as boundary conditions for the COGENT code over the two-dimensional velocity space on a spatial interface (flux) surface at a given radius near the plasma periphery. The finite-orbit-width fast ions from the CQL3D distributions penetrated into the peripheral plasma modeled by the COGENT code. This combined code demonstrates the feasibility of the proposed 3D/4D code. By combining these codes, the greatest computational efficiency is achieved subject to present modeling needs in toroidally symmetric magnetic fusion devices. The more efficient 3D code can be used in its regions of applicability, coupled to the more computationally demanding 4D code in higher collisionality edge plasma regions where that extended capability is necessary for accurate representation of the plasma. More efficient code leads to greater use and utility of the model. An ancillary aim of the project is to make the combined 3D/4D code user friendly. Achievement of full-coupling of these two Fokker-Planck codes will advance computational modeling of plasma devices important to the USDOE magnetic fusion energy program, in particular the DIII-D tokamak at General Atomics, San Diego, the NSTX spherical tokamak at Princeton, New Jersey, and the MST reversed-field-pinch Madison, Wisconsin. The validation studies of the code against the experiments will improve understanding of physics important for magnetic fusion, and will increase our design capabilities for achieving the goals of the International Tokamak Experimental Reactor (ITER) project in which the US is a participant and which seeks to demonstrate at least a factor of five in fusion power production divided by input power.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Integrating subsystem embedding subalgebras and coupled cluster Green’s function: a theoretical foundation for quantum embedding in excitation manifold

Here, in this study, we introduce a novel approach to coupled-cluster Green's function (CCGF) embedding by seamlessly integrating conventional CCGF theory with the state-of-the-art sub-system embedding sub-algebras coupled cluster (SES-CC) formalism. This integration focuses primarily on delineating the characteristics of the sub-system and the corresponding segments of the Green's function, defined explicitly by active orbitals. Crucially, our work involves the adaptation of the SES-CC paradigm, addressing the left eigenvalue problem through a distinct form of Hamiltonian similarity transformation. This advancement not only facilitates a comprehensive representation of the interaction between the embedded sub-system and its surrounding environment but also paves the way for the quantum mechanical description of multiple embedded domains, particularly by employing the emergent quantum flow algorithms. Our theoretical underpinnings further set the stage for a generalization to multiple embedded sub-systems. This expansion holds significant promise for the exploration and application of non-equilibrium quantum systems, enhancing the understanding of system–environment interactions. In doing so, the research underscores the potential of SES-CC embedding within the realm of quantum computations and multi-scale simulations, promising a good balance between accuracy and computational efficiency.

97 MATHEMATICS AND COMPUTING↗

Scalable metagenomic taxonomy classification using a reference genome database

Motivation: Deep metagenomic sequencing of biological samples has the potential to recover otherwise difficult-to-detect microorganisms and accurately characterize biological samples with limited prior knowledge of sample contents. Existing metagenomic taxonomic classification algorithms, however, do not scale well to analyze large metagenomic datasets, and balancing classification accuracy with computational efficiency presents a fundamental challenge. Results: A method is presented to shift computational costs to an offline computation by creating a taxonomy/genome index that supports scalable metagenomic classification. Scalable performance is demonstrated on real and simulated data to show accurate classification in the presence of novel organisms on samples that include viruses, prokaryotes, fungi and protists. Taxonomic classification of the previously published 150 giga-base Tyrolean Iceman dataset was found to take520 h on a single node 40 core large memory machine and provide new insights on the metagenomic contents of the sample.

59 BASIC BIOLOGICAL SCIENCES↗

The delta envelope: A technique for dose distribution comparison

The {gamma} index is a tool that compares a dose distribution with a reference distribution by combining dose-difference and distance-to-agreement criteria. It has been widely used for ten years despite its high computational cost. This cost is due to both a search process for each reference point and the necessity to remove overestimations caused by the discrete nature of dose grids. The method proposed in this paper is much faster since it avoids both these problems. It consists in computing the {delta} envelope formed by the {gamma} ellipsoids around the points of the reference distribution. This {delta} envelope provides dose-difference tolerances that are then used to create new indices, called the {delta} indices, that provide useful information to interpret the deviations. Applied to both 1D and 2D test cases and compared to the {gamma} index, the {delta} indices proved to be very accurate and intuitive. Their computational efficiency was evaluated on a 3D case: the {delta} envelope can be computed in 8 s on a 250x250x50 grid. Moreover it can be precomputed if the reference dose is known in advance. Then the {delta} indices are obtained in less than 2 s.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Frequency analysis of uncertain structures using imprecise probability

Two new methods for finite element based frequency analysis of a structure with uncertainty are developed. An imprecise probability formulation based on enveloping p-boxes is used to quantify the uncertainty present in the mechanical characteristics of the structure. For each element, independent variations are considered. Using the two developed methods, P-box Frequency Analysis (PFA) and Interval Monte-Carlo Frequency Analysis (IMFA), sharp bounds on natural circular frequencies at different probability levels are obtained. These methods establish a framework for handling incomplete information in structural dynamics. Numerical example problems are presented that illustrate the capabilities of the new methods along with discussions on their computational efficiency.

97 MATHEMATICS AND COMPUTING↗

A Provably Accurate Randomized Sampling Algorithm for Logistic Regression

In statistics and machine learning, logistic regression is a widely-used supervised learning technique primarily employed for binary classification tasks. When the number of observations greatly exceeds the number of predictor variables, we present a simple, randomized sampling-based algorithm for logistic regression problem that guarantees high-quality approximations to both the estimated probabilities and the overall discrepancy of the model. Our analysis builds upon two simple structural conditions that boil down to randomized matrix multiplication, a fundamental and well-understood primitive of randomized numerical linear algebra. We analyze the properties of estimated probabilities of logistic regression when leverage scores are used to sample observations, and prove that accurate approximations can be achieved with a sample whose size is much smaller than the total number of observations. To further validate our theoretical findings, we conduct comprehensive empirical evaluations. Overall, our work sheds light on the potential of using randomized sampling approaches to efficiently approximate the estimated probabilities in logistic regression, offering a practical and computationally efficient solution for large-scale datasets.

Chowdhury, Agniva↗