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,513 records · Page 84

Noniterative estimation of a nonlinear parameter

An algorithm is described which solves the parameters X = (x1,x2,...,xm) and p in an approximation problem Ax nearly equal to y(p), where the parameter p occurs nonlinearly in y. Instead of linearization methods, which require an approximate value of p to be supplied as a priori information, and which may lead to the finding of local minima, the proposed algorithm finds the global minimum by permitting the use of series expansions of arbitrary order, exploiting an a priori knowledge that the addition of a particular function, corresponding to a new column in A, will not improve the goodness of the approximation.

Bergstroem, A.↗

A high-order time-parallel scheme for solving wave propagation problems via the direct construction of an approximate time-evolution operator

Our manuscript demonstrates a technique for efficiently solving the classical wave equation, the shallow water equations, and, more generally, equations of the form ∂u/∂t=Lu∂u/∂t=Lu, where LL is a skew-Hermitian differential operator. The idea is to explicitly construct an approximation to the time-evolution operator exp(τL)exp(τL) for a relatively large time-step ττ. Recently developed techniques for approximating oscillatory scalar functions by rational functions, and accelerated algorithms for computing functions of discretized differential operators are exploited. Principal advantages of the proposed method include: stability even for large time-steps, the possibility to parallelize in time over many characteristic wavelengths and large speed-ups over existing methods in situations where simulation over long times are required. Numerical examples involving the 2D rotating shallow water equations and the 2D wave equation in an inhomogenous medium are presented, and the method is compared to the 4th order Runge–Kutta (RK4) method and to the use of Chebyshev polynomials. The new method achieved high accuracy over long-time intervals, and with speeds that are orders of magnitude faster than both RK4 and the use of Chebyshev polynomials.

97 MATHEMATICS AND COMPUTING↗

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↗

Likelihood Analysis for Mega Pixel Maps

The derivation of cosmological parameters from astrophysical data sets routinely involves operations counts which scale as O(N(exp 3) where N is the number of data points. Currently planned missions, including MAP and Planck, will generate sky maps with N(sub d) = 10(exp 6) or more pixels. Simple "brute force" analysis, applied to such mega-pixel data, would require years of computing even on the fastest computers. We describe an algorithm which allows estimation of the likelihood function in the direct pixel basis. The algorithm uses a conjugate gradient approach to evaluate X2 and a geometric approximation to evaluate the determinant. Monte Carlo simulations provide a correction to the determinant, yielding an unbiased estimate of the likelihood surface in an arbitrary region surrounding the likelihood peak. The algorithm requires O(N(sub d)(exp 3/2) operations and O(Nd) storage for each likelihood evaluation, and allows for significant parallel computation.

Kogut, Alan J.↗

Efficient Neural Network Approaches for Conditional Optimal Transport with Applications in Bayesian Inference

In this work, we present two neural network approaches that approximate the solutions of static and dynamic conditional optimal transport (COT) problems. Both approaches enable conditional sampling and conditional density estimation, which are core tasks in Bayesian inference—particularly in the simulation-based (“likelihood-free”) setting. Our methods represent the target conditional distribution as a transformation of a tractable reference distribution. Obtaining such a transformation, chosen here to be an approximation of the COT map, is computationally challenging even in moderate dimensions. To improve scalability, our numerical algorithms use neural networks to parameterize candidate maps and further exploit the structure of the COT problem. Our static approach approximates the map as the gradient of a partially input convex neural network. It uses a novel numerical implementation to increase computational efficiency compared to state-of-the-art alternatives. Our dynamic approach approximates the conditional optimal transport via the flow map of a regularized neural ODE; compared to the static approach, it is slower to train but offers more modeling choices and can lead to faster sampling. We demonstrate both algorithms numerically, comparing them with competing state-of-the-art approaches, using benchmark datasets and simulation-based Bayesian inverse problems.

97 MATHEMATICS AND COMPUTING↗

Direct reconstruction of isolated XUV or soft x-ray attosecond pulses from high-harmonic generation streaking spectra

Characterization of an isolated attosecond pulse (IAP) in the extreme ultraviolet (XUV) or soft x-ray (SXR) region is essential for its applications. Here we propose to retrieve an IAP in the time domain directly through the modulation of high-harmonic generation (HHG) spectra in the presence of a time-delayed intense few-cycle infrared or mid-infrared laser. The retrieval algorithm is derived based on the strong-field approximation and an extended quantitative rescattering model. We show that both isolated XUV pulses with a narrow spectral bandwidth and isolated SXR pulses with a broad bandwidth can be well characterized through the HHG streaking spectra. Such an all-optical method for characterizing the IAP differs from the commonly used approach based on the streaked photoelectron spectra that would require electron spectrometers. We check the robustness of the retrieval method by changing the dressing laser or by adjusting the steps of time delay. We also show that the XUV pulse can be accurately retrieved by treating the HHG streaking spectra calculated from solving the time-dependent Schrödinger equation for single atoms as the ‘experimental’ data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Longwave 3D Benchmarks for Inhomogeneous Clouds and Comparisons with Approximate Methods

The purpose of this study is twofold: to (i) establish three-dimensional (3D) longwave radiative transfer benchmarks for inhomogeneous cloud fields and (ii) compare the results with three approximate, 1D methods. The benchmark results are calculated using a correlated-k three-dimensional Monte Carlo (3DMC) algorithm that is validated via comparisons to line-by-line calculations for simple atmospheres. The approximate methods include an independent column approximation (ICA) and two cloud-overlap schemes: maximum/random (MRO) and random (RO). Six inhomogeneous cloudy-sky test cases are used and encompass a wide range of domain sizes used by general circulation models. Domain-averaged fluxes and heating rates from these atmospheres show that the ICA is consistently more accurate than the cloud-overlap models with respect to the 3D benchmarks. For example, comparisons of model results for the Atlantic Trade Wind Experiment (ATEX), a marine boundary layer cumulus field, yield a maximum cloud-layer heating rate error of 15.73 K day -1 from using cloud-overlap models, whereas the ICA error is only 2.17 K day -1 . This paper presents results showing that these differences are attributed to the 3D effects of unresolved clouds and indicate that there is an inherent deficiency in the ability of 1D models to accurately calculate radiative quantities in these atmospheres.

54 ENVIRONMENTAL SCIENCES↗

Electronically nonadiabatic wave packet propagation using frozen Gaussian scattering

We present an approach, which allows to employ the adiabatic wave packet propagation technique and semiclassical theory to treat the nonadiabatic processes by using trajectory hopping. The approach developed generates a bunch of hopping trajectories and gives all additional information to incorporate the effect of nonadiabatic coupling into the wave packet dynamics. This provides an interface between a general adiabatic frozen Gaussian wave packet propagation method and the trajectory surface hopping technique. The basic idea suggested in [A. D. Kondorskiy and H. Nakamura, J. Chem. Phys. 120, 8937 (2004)] is revisited and complemented in the present work by the elaboration of efficient numerical algorithms. We combine our approach with the adiabatic Herman-Kluk frozen Gaussian approximation. The efficiency and accuracy of the resulting method is demonstrated by applying it to popular benchmark model systems including three Tully’s models and 24D model of pyrazine. It is shown that photoabsorption spectrum is successfully reproduced by using a few hundreds of trajectories. We employ the compact finite difference Hessian update scheme to consider feasibility of the ab initio “on-the-fly” simulations. It is found that this technique allows us to obtain the reliable final results using several Hessian matrix calculations per trajectory.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Accuracy Assessment of Aqua-MODIS Aerosol Optical Depth Over Coastal Regions: Importance of Quality Flag and Sea Surface Wind Speed

Coastal regions around the globe are a major source for anthropogenic aerosols in the atmosphere, but the underlying surface characteristics are not favorable for the Moderate Resolution Imaging Spectroradiometer (MODIS) algorithms designed for retrieval of aerosols over dark land or open-ocean surfaces. Using data collected from 62 coastal stations worldwide from the Aerosol Robotic Network (AERONET) from approximately 2002-2010, accuracy assessments are made for coastal aerosol optical depth (AOD) retrieved from MODIS aboard Aqua satellite. It is found that coastal AODs (at 550 nm) characterized respectively by the MODIS Dark Land (hereafter Land) surface algorithm, the Open-Ocean (hereafter Ocean) algorithm, and AERONET all exhibit a log-normal distribution. After filtering by quality flags, the MODIS AODs respectively retrieved from the Land and Ocean algorithms are highly correlated with AERONET (with R(sup 2) is approximately equal to 0.8), but only the Land algorithm AODs fall within the expected error envelope greater than 66% of the time. Furthermore, the MODIS AODs from the Land algorithm, Ocean algorithm, and combined Land and Ocean product show statistically significant discrepancies from their respective counterparts from AERONET in terms of mean, probability density function, and cumulative density function, which suggest a need for future improvement in retrieval algorithms. Without filtering with quality flag, the MODIS Land and Ocean AOD dataset can be degraded by 30-50% in terms of mean bias. Overall, the MODIS Ocean algorithm overestimates the AERONET coastal AOD by 0.021 for AOD less than 0.25 and underestimates it by 0.029 for AOD greater than 0.25. This dichotomy is shown to be related to the ocean surface wind speed and cloud contamination effects on the satellite aerosol retrieval. The Modern Era Retrospective-Analysis for Research and Applications (MERRA) reveals that wind speeds over the global coastal region 25 (with a mean and median value of 2.94 meters per second and 2.66 meters per second, respectively) are often slower than 6 meters per second assumed in the MODIS Ocean algorithm. As a result of high correlation (R(sup 2) greater than 0.98) between the bias in binned MODIS AOD and the corresponding binned wind speed over the coastal sea surface, an empirical scheme for correcting the bias of AOD retrieved from the MODIS Ocean algorithm is formulated and is shown to be effective over the majority of the coastal AERONET stations, and hence can be used in future analysis of AOD trend and MODIS AOD data assimilation.

Anderson, J. C.↗

Adiabatic Quantum Programming: Minor Embedding With Hard Faults

Adiabatic quantum programming defines the time-dependent mapping of a quantum algorithm into the hardware or logical fabric. An essential programming step is the embedding of problem-specific information into the logical fabric to define the quantum computational transformation. We present algorithms for embedding arbitrary instances of the adiabatic quantum optimization algorithm into a square lattice of specialized unit cells. Our methods are shown to be extensible in fabric growth, linear in time, and quadratic in logical footprint. In addition, we provide methods for accommodating hard faults in the logical fabric without invoking approximations to the original problem. These hard fault-tolerant embedding algorithms are expected to prove useful for benchmarking the adiabatic quantum optimization algorithm on existing quantum logical hardware. We illustrate this versatility through numerical studies of embeddabilty versus hard fault rates in square lattices of complete bipartite unit cells.

graph theory↗

Pulse-shape discrimination against low-energy Ar-39 beta decays in liquid argon with 4.5 tonne-years of DEAP-3600 data

The DEAP-3600 detector searches for the scintillation signal from dark matter particles scattering on a 3.3 tonne liquid argon target. The largest background comes from 39 Ar beta decays and is suppressed using pulse-shape discrimination (PSD). We use two types of PSD estimator: the prompt-fraction, which considers the fraction of the scintillation signal in a narrow and a wide time window around the event peak, and the log-likelihood-ratio, which compares the observed photon arrival times to a signal and a background model. We furthermore use two algorithms to determine the number of photons detected at a given time: (1) simply dividing the charge of each PMT pulse by the mean single-photoelectron charge, and (2) a likelihood analysis that considers the probability to detect a certain number of photons at a given time, based on a model for the scintillation pulse shape and for afterpulsing in the light detectors. The prompt-fraction performs approximately as well as the log-likelihood-ratio PSD algorithm if the photon detection times are not biased by detector effects. We explain this result using a model for the information carried by scintillation photons as a function of the time when they are detected.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Iterated Gauss-Seidel GMRES

The GMRES algorithm of Saad and Schultz [SIAM J. Sci. Stat. Comput., 7 (1986), pp. 856-869] is an iterative method for approximately solving linear systems Ax = b, with initial guess x0 and residual r0 = b Ax0. The algorithm employs the Arnoldi process to generate the Krylov basis vectors (the columns of Vk ). It is well known that this process can be viewed as a QR factorization of the matrix Bk = [r0, AVk] at each iteration. Despite an O (..epsilon..)..kappa.. (Bk ) loss of orthogonality, for unit roundoff ..epsilon..and condition number ..kappa.. , the modified Gram-Schmidt formulation was shown to be backward stable in the seminal paper by Paige et al. [SIAM J. Matrix Anal.Appl., 28 (2006), pp. 264-284]. We present an iterated Gauss-Seidel formulation of the GMRES algorithm (IGS-GMRES) based on the ideas of Ruhe [Linear Algebra Appl., 52 (1983), pp. 591-601] and Swirydowicz et al. [Numer. Linear Algebra Appl., 28 (2020), pp. 1-20]. IGS-GMRES maintains orthogonality to the level O (..epsilon..)..kappa.. (Bk ) or O (..epsilon..), depending on the choice of one or two iterations; for two Gauss-Seidel iterations, the computed Krylov basis vectors remain orthogonal to working accuracy and the smallest singular value of Vk remains close to one. The resulting GMRES method is thus backward stable. We show that IGS-GMRES can be implemented with only a single synchronization point per iteration, making it relevant to large-scale parallel computing environments. We also demonstrate that, unlike MGS-GMRES, in IGS-GMRES the relative Arnoldi residual corresponding to the computed approximate solution no longer stagnates above machine precision even for highly nonnormal systems.

Arnoldi-QR↗

Approximate factorization with source terms

A comparative evaluation is made of three methodologies with a view to that which offers the best approximate factorization error. While two of these methods are found to lead to more efficient algorithms in cases where factors which do not contain source terms can be diagonalized, the third method used generates the lowest approximate factorization error. This method may be preferred when the norms of source terms are large, and transient solutions are of interest.

Shih, T. I.-P.↗

Machine Learning, Markov Chain Monte Carlo, and Optimal Algorithms to Characterize the AdvACT Kilopixel Transition-Edge Sensor Arrays

Next-generation focal planes comprising dozens of kilopixel transition-edge sensor (TES) arrays require new methods to rapidly screen candidate arrays, evaluate array non-idealities in the field, identify outlier devices for removal, and optimize the array performance in the field. We demonstrate robust methods to estimate TES parameters (critical temperatures and thermal conductivity parameters) and their uncertainties using a custom Markov Chain Monte Carlo (MCMC) algorithm. We also constrain systematic effects in estimating the TES parameters from non-isothermal current-voltage curves (IVs) at approximately a ~3% level. Additionally, for the first time, we have applied Machine Learning (ML) algorithms to tune detector arrays and optimize their performance.

Maria Salatino↗

Optimal Control of Biomass Feedstock Processing System Under Uncertainty in Biomass Quality

Planning of biorefinery operations is complicated by the stochastic nature of physical and chemical characteristics of biomass feedstock, such as, moisture level and carbohydrate content. Biomass characteristics affect the performance of the equipment which feed the reactor and the efficiency of the conversion process in a biorefinery. We propose a stochastic optimization model to identify a blend of feedstocks, inventory levels, and operating conditions of equipment to ensure a continuous flowing of biomass to the reactor while meeting the requirements of the biochemical conversion process. We propose a sample average approximation (SAA) of the model, and develop an efficient algorithm to solve the SAA model. A feedstock preprocessing process consists of two-stage grinding and pelleting is used to develop a case study. Extensive numerical analysis are conducted which lead to a number of observations. Our main observation is that sequencing bales based on moisture level and carbohydrate content leads to robust solutions that improve processing time and processing rate of the reactor. We provide a number of managerial insights that facilitate the implementation of the model proposed. Note to Practitioners—This paper is motivated by the challenges faced in the bioenergy industry. The focus of this paper is on plants which use the biochemical conversion process to generate liquid fuels. It has been observed that variations in biomass characteristics, such as moisture content, cause variations in feeding of the system which lead to under-utilization of equipment. A requirement of biochemical conversion process is to maintain the carbohydrate content of biomass processed by the reactor, larger than a threshold. We propose a model that identifies the inventory levels and operating conditions of equipment to ensure a continuous flowing of biomass to the reactor. The goal is to improve equipment utilization while satisfying the requirements of the conversion process. The model is tested using real-life data. We found out that by sequencing bales based on moisture level and carbohydrate content, a plant can reduce variability in the system leading to improved system reliability, higher processing rates of the reactor, and higher throughput.

09 BIOMASS FUELS↗

Performance evaluation of fault tolerant systems represented by Markov models

A method to evaluate the performance of fault tolerant systems whose configuration can be represented by time-invariant, discrete-time, discrete-state Markov models is introduced. Each state is assumed to be associated with a constant qualitative measure of the system's performance. The method first computes the moments of the performance probability mass function (PMF) and then finds an approximating function that has the same moments. The form of this function is a maximum entropy solution of the moment matching problem. A simple algorithm for calculating the necessary moments is derived and a method for finding the approximate performance PMF is suggested. After some modification, the method is applied to an example, the Inertial Upper Stage navigation system.

Missana, Jean-Olivier A. A.↗

Semi-analytic treatment of nearly-singular Galerkin surface integrals

On utilizing piecewise linear test and interpolation functions over flat triangles, three semi-analytic techniques for evaluating nearly-singular surface integrals of potential theory are developed and investigated in the context of a three-dimensional Galerkin approximation. In all procedures, the inner surface integral is calculated exactly via recursive expressions defined over the edges of the integration triangle. In addition, the proposed methods respectively employ a Duffy transformation, sinh transformations, and polynomial transformations to weaken or smooth out near singularities, followed by a standard product Gauss-Legendre quadrature rule to compute the outer boundary integral. Numerical experiments and comparisons of the proposed approaches are included to provide more insight into the performance of these techniques. Computational tests have demonstrated that the algorithm based on a Duffy transformation is the most efficient and effective method for dealing with nearly-singular as well as well-separated integrals.

99 GENERAL AND MISCELLANEOUS↗

Fast marching methods for the continuous traveling salesman problem

We consider a problem in which we are given a domain, a cost function which depends on position at each point in the domain, and a subset of points ('cities') in the domain. The goal is to determine the cheapest closed path that visits each city in the domain once. This can be thought of as a version of the Traveling Salesman Problem, in which an underlying known metric determines the cost of moving through each point of the domain, but in which the actual shortest path between cities is unknown at the outset. We describe algorithms for both a heuristic and an optimal solution to this problem. The order of the heuristic algorithm is at worst case M * N logN, where M is the number of cities, and N the size of the computational mesh used to approximate the solutions to the shortest paths problems. The average runtime of the heuristic algorithm is linear in the number of cities and O(N log N) in the size N of the mesh.

97 MATHEMATICS AND COMPUTING↗