Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation algorithms”

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,027 records · Page 57

An Algorithm to Generate Deep-Layer Temperatures from Microwave Satellite Observations for the Purpose of Monitoring Climate Change

An algorithm for generating deep-layer mean temperatures from satellite-observed microwave observations is presented. Unlike traditional temperature retrieval methods, this algorithm does not require a first guess temperature of the ambient atmosphere. By eliminating the first guess a potentially systematic source of error has been removed. The algorithm is expected to yield long-term records that are suitable for detecting small changes in climate. The atmospheric contribution to the deep-layer mean temperature is given by the averaging kernel. The algorithm computes the coefficients that will best approximate a desired averaging kernel from a linear combination of the satellite radiometer's weighting functions. The coefficients are then applied to the measurements to yield the deep-layer mean temperature. Three constraints were used in deriving the algorithm: (1) the sum of the coefficients must be one, (2) the noise of the product is minimized, and (3) the shape of the approximated averaging kernel is well-behaved. Note that a trade-off between constraints 2 and 3 is unavoidable. The algorithm can also be used to combine measurements from a future sensor (i.e., the 20-channel Advanced Microwave Sounding Unit (AMSU)) to yield the same averaging kernel as that based on an earlier sensor (i.e., the 4-channel Microwave Sounding Unit (MSU)). This will allow a time series of deep-layer mean temperatures based on MSU measurements to be continued with AMSU measurements. The AMSU is expected to replace the MSU in 1996.

Goldberg, Mitchell D.↗

Kohn–Sham exchange-correlation potentials from second-order reduced density matrices

We describe a practical algorithm for constructing the Kohn–Sham exchange-correlation potential corresponding to a given second-order reduced density matrix. Unlike conventional Kohn–Sham inversion methods in which such potentials are extracted from ground-state electron densities, the proposed technique delivers unambiguous results in finite basis sets. The approach can also be used to separate approximately the exchange and correlation potentials for a many-electron system for which the reduced density matrix is known. The algorithm is implemented for configuration-interaction wave functions and its performance is illustrated with numerical examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

TH-E-BRE-02: A Forward Scattering Approximation to Dose Calculation Using the Linear Boltzmann Transport Equation

Purpose: To investigate the use of the linear Boltzmann transport equation as a dose calculation tool which can account for interface effects, while still having faster computation times than Monte Carlo methods. In particular, we introduce a forward scattering approximation, in hopes of improving calculation time without a significant hindrance to accuracy. Methods: Two coupled Boltzmann transport equations were constructed, one representing the fluence of photons within the medium, and the other, the fluence of electrons. We neglect the scattering term within the electron transport equation, resulting in an extreme forward scattering approximation to reduce computational complexity. These equations were then solved using a numerical technique for solving partial differential equations, known as a finite difference scheme, where the fluence at each discrete point in space is calculated based on the fluence at the previous point in the particle's path. Using this scheme, it is possible to develop a solution to the Boltzmann transport equations by beginning with boundary conditions and iterating across the entire medium. The fluence of electrons can then be used to find the dose at any point within the medium. Results: Comparisons with Monte Carlo simulations indicate that even simplistic techniques for solving the linear Boltzmann transport equation yield expected interface effects, which many popular dose calculation algorithms are not capable of predicting. Implementation of a forward scattering approximation does not appear to drastically reduce the accuracy of this algorithm. Conclusion: Optimized implementations of this algorithm have been shown to be very accurate when compared with Monte Carlo simulations, even in build up regions where many models fail. Use of a forward scattering approximation could potentially give a reasonably accurate dose distribution in a shorter amount of time for situations where a completely accurate dose distribution is not required, such as in certain optimization algorithms.

97 MATHEMATICS AND COMPUTING↗

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

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

97 MATHEMATICS AND COMPUTING↗

A deep-learning based raw waveform region-of-interest finder for the liquid argon time projection chamber

The liquid argon time projection chamber (LArTPC) detector technology has an excellent capability to measure properties of low-energy neutrinos produced by the sun and supernovae and to look for exotic physics at very low energies. In order to achieve those physics goals, it is crucial to identify and reconstruct signals in the waveforms recorded on each TPC wire. In this work, we report on a novel algorithm based on a one-dimensional convolutional neural network (CNN) to look for the region-of-interest (ROI) in raw waveforms. We test this algorithm using data from the ArgoNeuT experiment in conjunction with an improved noise mitigation procedure and a more realistic data-driven noise model for simulated events. This deep-learning ROI finder shows promising performance in extracting small signals and gives an efficiency approximately twice that of the traditional algorithm in the low energy region of ~0.03–0.1 MeV. This method offers great potential to explore low-energy physics using LArTPCs.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A reexamination of the radiative balance of the stratosphere

The radiative balance of the stratosphere is examined in the light of the possible sensitivity of tracers to small changes in the diabatic heating. A comprehensive radiative transfer algorithm is developed on the basis of accurate and efficient methods for use in coupled stratospheric models of chemistry, dynamics, and radiative transfer, and the individual components of the code are validated against available line-by-line calculations. Finally, the results of different approximations commonly employed in radiative transfer algorithms are compared, and their effects on tracer transport are evaluated using a 2D ozone model.

Olaguer, Eduardo P.↗

ROM-based Subset Selection Algorithm for Efficient Surrogate Modeling

This summary discusses a new methodology to support the construction of surrogate models for computationally expensive models with many input parameters and output responses. In realistic engineering calculations, such as thermal-hydraulics simulation, the cost of the simulation is typically expensive, especially when detailed models are employed to describe system behavior, thereby justifying the need for surrogate models. The cost of surrogate model construction is typically a function of the number of model parameters and the degree of model nonlinearity. For sufficiently complex models, the cost of constructing the surrogate model could be by itself overwhelmingly expensive, thereby diminishing its value. One key requirement of surrogate model construction is the ability to preselect the best parametric form to describe the model behavior over the expected range of parameter variations. This summary presents a new algorithm to help select the best approximation out of a template of functions using recent advances in reduced order modeling (ROM) techniques. The idea of selecting functions out of a template is typically referred to as subset selection in the statistical and applied mathematics community. Different from existing subset selection algorithms, we rely on ROM to help identify the most influential functions for the surrogate model. Previous work has shown that ROM can help reduce the effective dimensionality of the parameter space, which can help reduce the cost of surrogate model construction. In this summary, we adopt a different philosophy, where the fitting functions are treated as pseudo parameters and ROM is applied on the pseudo parameter space, with the result now being a ranked list of the pseudo parameters along with their contribution to the quality of the surrogate model fit. This approach allows the analyst to discard all terms that have negligible impact on the quantity of interest. A relap5 model is employed to demonstrate the application of the proposed methodology. (authors)

42 ENGINEERING↗

Sparse matrix transform for fast projection to reduced dimension

We investigate three algorithms that use the sparse matrix transform (SMT) to produce variance-maximizing linear projections to a lower-dimensional space. The SMT expresses the projection as a sequence of Givens rotations and this enables computationally efficient implementation of the projection operator. The baseline algorithm uses the SMT to directly approximate the optimal solution that is given by principal components analysis (PCA). A variant of the baseline begins with a standard SMT solution, but prunes the sequence of Givens rotations to only include those that contribute to the variance maximization. Finally, a simpler and faster third algorithm is introduced; this also estimates the projection operator with a sequence of Givens rotations, but in this case, the rotations are chosen to optimize a criterion that more directly expresses the dimension reduction criterion.

97 MATHEMATICS AND COMPUTING↗

Approximate Bisimulation-Based Reduction of Power System Dynamic Models

In this paper we propose approximate bisimulation relations and functions for reduction of power system dynamic models in differential- algebraic (descriptor) form. The full-size dynamic model is obtained by linearization of the nonlinear transient stability model. We generalize theoretical results on approximate bisimulation relations and bisimulation functions, originally derived for a class of constrained linear systems, to linear systems in descriptor form. An algorithm for transient stability assessment is proposed and used to determine whether the power system is able to maintain the synchronism after a large disturbance. Two benchmark power systems are used to illustrate the proposed algorithm and to evaluate the applicability of approximate bisimulation relations and bisimulation functions for reduction of the power system dynamic models.

Stankovic, AM↗

Total variation-based neutron computed tomography

We perform the neutron computed tomography reconstruction problem via an inverse problem formulation with a total variation penalty. In the case of highly under-resolved angular measurements, the total variation penalty suppresses high-frequency artifacts which appear in filtered back projections. Here, in order to efficiently compute solutions for this problem, we implement a variation of the split Bregman algorithm; due to the error-forgetting nature of the algorithm, the computational cost of updating can be significantly reduced via very inexact approximate linear solvers. We present the effectiveness of the algorithm in the significantly low-angular sampling case using synthetic test problems as well as data obtained from a high flux neutron source. Finally, the algorithm removes artifacts and can even roughly capture small features when an extremely low number of angles are used.

97 MATHEMATICS AND COMPUTING↗

Correcting for filter-based aerosol light absorption biases at the Atmospheric Radiation Measurement program's Southern Great Plains site using photoacoustic measurements and machine learning

Abstract. Measurement of light absorption of solar radiation by aerosols is vital for assessing direct aerosol radiative forcing, which affects local and global climate. Low-cost and easy-to-operate filter-based instruments, such as the Particle Soot Absorption Photometer (PSAP), that collect aerosols on a filter and measure light attenuation through the filter are widely used to infer aerosol light absorption. However, filter-based absorption measurements are subject to artifacts that are difficult to quantify. These artifacts are associated with the presence of the filter medium and the complex interactions between the filter fibers and accumulated aerosols. Various correction algorithms have been introduced to correct for the filter-based absorption coefficient measurements toward predicting the particle-phase absorption coefficient (Babs). However, the inability of these algorithms to incorporate into their formulations the complex matrix of influencing parameters such as particle asymmetry parameter, particle size, and particle penetration depth results in prediction of particle-phase absorption coefficients with relatively low accuracy. The analytical forms of corrections also suffer from a lack of universal applicability: different corrections are required for rural and urban sites across the world. In this study, we analyzed and compared 3 months of high-time-resolution ambient aerosol absorption data collected synchronously using a three-wavelength photoacoustic absorption spectrometer (PASS) and PSAP. Both instruments were operated on the same sampling inlet at the Department of Energy's Atmospheric Radiation Measurement program's Southern Great Plains (SGP) user facility in Oklahoma. We implemented the two most commonly used analytical correction algorithms, namely, Virkkula (2010) and the average of Virkkula (2010) and Ogren (2010)–Bond et al. (1999) as well as a random forest regression (RFR) machine learning algorithm to predict Babs values from the PSAP's filter-based measurements. The predicted Babs was compared against the reference Babs measured by the PASS. The RFR algorithm performed the best by yielding the lowest root mean square error of prediction. The algorithm was trained using input datasets from the PSAP (transmission and uncorrected absorption coefficient), a co-located nephelometer (scattering coefficients), and the Aerosol Chemical Speciation Monitor (mass concentration of non-refractory aerosol particles). A revised form of the Virkkula (2010) algorithm suitable for the SGP site has been proposed; however, its performance yields approximately 2-fold errors when compared to the RFR algorithm. To generalize the accuracy and applicability of our proposed RFR algorithm, we trained and tested it on a dataset of laboratory measurements of combustion aerosols. Input variables to the algorithm included the aerosol number size distribution from the Scanning Mobility Particle Sizer, absorption coefficients from the filter-based Tricolor Absorption Photometer, and scattering coefficients from a multiwavelength nephelometer. The RFR algorithm predicted Babs values within 5 % of the reference Babs measured by the multiwavelength PASS during the laboratory experiments. Thus, we show that machine learning approaches offer a promising path to correct for biases in long-term filter-based absorption datasets and accurately quantify their variability and trends needed for robust radiative forcing determination.

54 ENVIRONMENTAL SCIENCES↗

First-principles calculation of the configurational energy density of states for a solid-state ion conductor with a variant of the Wang and Landau algorithm

In this work, a variant of the Wang and Landau algorithm for calculation of the configurational energy density of states is proposed. The algorithm was developed for the purpose of using first-principles simulations, such as density functional theory, to calculate the partition function of disordered sublattices in crystal materials. The expensive calculations of first-principles methods make a parallel algorithm necessary for a practical computation of the configurational energy density of states within a supercell approximation of a solid-state material. The algorithm developed in this work is tested with the two-dimensional (2d) Ising model to bench mark the algorithm and to help provide insight for implementation to a materials science application. Tests with the 2d Ising model revealed that the algorithm has good performance compared to the original Wang and Landau algorithm and the 1/$\textit{t}$ algorithm, in particular the short iteration performance. Further, a proof of convergence is presented within an adiabatic assumption, and the analysis is able to correctly predict the time dependence of the modification factor to the density of states. The algorithm was then applied to the lithium and lanthanum sublattice of the solid-state lithium ion conductor Li 0.5 La 0.5 TiO 3 . This was done to help understand the disordered nature of the lithium and lanthanum. The results find, overall, that the algorithm performs very well for the 2d Ising model and that the results for Li 0.5 La 0.5 TiO 3 are consistent with experiment while providing additional insight into the lithium and lanthanum ordering in the material. The primary result is that the lithium and lanthanum become more mixed between layers along the c axis for increasing temperature. In part, the simulation of the disordered Li 0.5 La 0.5 TiO 3 system serves as a benchmark for what size systems are currently and in the near future practical to calculate with density functional theory methods.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

PHISICS: New Features and Advancements

The PHISICS (Parallel and Highly Innovative Simulation for INL Code System) software is under an intensive development at INL. In the last months new features have been added and improvements of the previously existing one performed. The modular approach has created a friendly development environment that allows a quick expansion of the capabilities. In the last months a little amount of work has been dedicated to the improvement of the spherical harmonics based nodal transport solver while the implementation of a solver based on the self adjoint formulation of the discrete ordinate is in the test phase on structured mesh. PHISICS now include a depletion solver with the option to use two different algorithms for the solution of the Bateman equation: the Taylor development of the exponential matrix and the Chebyshev Rational Approximation Method. The coupling with RELAP5 is also available at least in the steady state search mode. The coupling between RELAP5 and PHISICS can also take advantage of the new cross section interpolation module so that the coupling could be performed using an arbitrary number of energy groups.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Smoothing-Based Relative Navigation and Coded Aperture Imaging

This project will develop an efficient smoothing software for incremental estimation of the relative poses and velocities between multiple, small spacecraft in a formation, and a small, long range depth sensor based on coded aperture imaging that is capable of identifying other spacecraft in the formation. The smoothing algorithm will obtain the maximum a posteriori estimate of the relative poses between the spacecraft by using all available sensor information in the spacecraft formation.This algorithm will be portable between different satellite platforms that possess different sensor suites and computational capabilities, and will be adaptable in the case that one or more satellites in the formation become inoperable. It will obtain a solution that will approach an exact solution, as opposed to one with linearization approximation that is typical of filtering algorithms. Thus, the algorithms developed and demonstrated as part of this program will enhance the applicability of small spacecraft to multi-platform operations, such as precisely aligned constellations and fractionated satellite systems.

Relative positioning↗

Explicit inclusion of electronic correlation effects in molecular dynamics

Here, we design a quantum molecular dynamics method for strongly correlated electron metals. The strong electronic correlation effects are treated within a real-space version of the Gutzwiller variational approximation (GA), which is suitable for the inhomogeneity inherent in the process of quantum molecular dynamics (MD) simulations. We also propose an efficient algorithm based on the second-moment approximation to the electronic density of states for the search of the optimal variation parameters, from which the renormalized interatomic MD potentials are fully determined. By considering a minimal one-correlated-orbital Anderson model with parameterized spatial dependence of tight-binding hopping integrals, this fast GA-MD method is benchmarked with that using exact diagonalization to solve the GA variational parameters. The efficiency and accuracy are illustrated. We have demonstrated the effect of temperature coupled with electronic correlation on structural properties simulated with MD. This method will open up an unprecedented opportunity enabling large-scale quantum MD simulations of strongly correlated electronic materials.

36 MATERIALS SCIENCE↗

Development and Evaluation of Algorithms to Improve Small- and Medium-Size Commercial Building Operations

Small- and medium-sized (<100,000 sf) commercial buildings (SMBs) represent over 95% of the U.S. commercial building stock and consume over 60% of total site energy consumption. Many of these buildings use rudimentary controls that are mostly manual, with limited scheduling capability, no monitoring or failure management. Therefore, many of these buildings are operated inefficiently and consume excess energy. SMBs typically utilize packaged rooftop units (RTUs) that are controlled by an individual thermostat. There is increased urgency to improve the operating efficiency of existing commercial building stock in the U.S. for many reasons, chief among them is to mitigate the climate change impacts. Studies have shown that managing set points and schedules of the RTUs will result in up to 20% energy and cost savings. Another problem associated with RTUs is short-cycling, where an RTU goes through ON and OFF cycles too frequently. Excessive cycling can lead to excessive wear and lead to premature failure of the compressor or its components. The short cycling can result in a significantly decreased average efficiency (up to 10%), even if there are no physical failures in the equipment. Also, SMBs use a time-of-day scheduling is to start the RTUs before the building will be occupied and shut it off when unoccupied. Ensuring correct use of the zone set points and eliminating frequent cycling of RTUs thereby leading to persistent building operations can significantly increase the operational efficiency of the SMBs. A growing trend is to use low-cost control infrastructure that can enable scalable and cost-effective intelligent building operations. The work reported in this report describes three algorithms for detecting the zone set point temperature, RTU cycling rate and occupancy schedule detection that can be deployed on the low-cost infrastructure. These algorithms only require the zone temperature data for detection. The algorithms have been tested and validated using field data from a number of RTUs from six buildings in different climate locations. Overall, the algorithms were successful in detecting the set points and ON/OFF cycles accurately using the peak detection technique and occupancy schedule using symbolic aggregate approximation technique. The report describes the three algorithms, results from testing the algorithms using field data, how the algorithms can be used to improve SMBs efficiency, and presents related conclusions.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Application of the Parareal Algorithm for Acoustic Wave Propagation

We present an application of the parareal algorithm to solve wave propagation problems in the time domain. The parareal algorithm is based on a decomposition of the integration time interval in time slices. It involves a serial prediction step based on a coarse approximation, and a correction step (computed in parallel) based on a fine approximation within each time slice. In our case, the spatial discretization is based on a spectral element approximation which allows flexible and accurate wave simulations in complex geological media. Fully explicit time advancing schemes are classically used for both coarse and fine solvers.In a first stage, we solve the 1D acoustic wave equation in an homogeneous medium in order to test stability and convergence properties of the parareal algorithm. We confirmed the stability problems outlined by Bal and Farhat et al. for hyperbolic problems. These stability issues are mitigated by a time-discontinuous Galerkin discretization of the coarse solver. It may also involve a coarser spatial discretization (hp-refinement) which helps to preserve stability and allows more significant computer savings. Besides, we explore the contribution of elastodynamic homogenization to build consistent coarse grid solvers. Extension to 2D/3D realistic geological media is an ongoing work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Investigation of plasmon relaxation mechanisms using nonadiabatic molecular dynamics

Hot carriers generated from the decay of plasmon excitation can be harvested to drive a wide range of physical or chemical processes. However, their generation efficiency is limited by the concomitant phonon-induced relaxation processes by which the energy in excited carriers is transformed into heat. However, simulations of dynamics of nanoscale clusters are challenging due to the computational complexity involved. Here, in this paper, we adopt our newly developed Trajectory Surface Hopping (TSH) nonadiabatic molecular dynamics algorithm to simulate plasmon relaxation in Au 20 clusters, taking the atomistic details into account. The electronic properties are treated within the Linear Response Time-Dependent Tight-binding Density Functional Theory (LR-TDDFTB) framework. The relaxation of plasmon due to coupling to phonon modes in Au 20 beyond the Born–Oppenheimer approximation is described by the TSH algorithm. The numerically efficient LR-TDDFTB method allows us to address a dense manifold of excited states to ensure the inclusion of plasmon excitation. Starting from the photoexcited plasmon states in Au 20 cluster, we find that the time constant for relaxation from plasmon excited states to the lowest excited states is about 2.7 ps, mainly resulting from a stepwise decay process caused by low-frequency phonons of the Au 20 cluster. Furthermore, our simulations show that the lifetime of the phonon-induced plasmon dephasing process is ~10.4 fs and that such a swift process can be attributed to the strong nonadiabatic effect in small clusters. Our simulations demonstrate a detailed description of the dynamic processes in nanoclusters, including plasmon excitation, hot carrier generation from plasmon excitation dephasing, and the subsequent phonon-induced relaxation process.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗