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 703 records · Page 39

An Improved Discrete Least-Squares/Reduced-Basis Method for Parameterized Elliptic PDEs

It is shown that the computational efficiency of the discrete least-squares (DLS) approximation of solutions of stochastic elliptic PDEs is improved by incorporating a reduced-basis method into the DLS framework. In particular, we consider stochastic elliptic PDEs with an affine dependence on the random variable. The goal is to recover the entire solution map from the parameter space to the finite element space. To this end, first, a reduced-basis solution using a weak greedy algorithm is constructed, then a DLS approximation is determined by evaluating the reduced-basis approximation instead of the full finite element approximation. The main advantage of the new approach is that one only need apply the DLS operator to the coefficients of the reduced-basis expansion, resulting in huge savings in both the storage of the DLS coefficients and the online cost of evaluating the DLS approximation. In addition, the recently developed quasi-optimal polynomial space is also adopted in the new approach, resulting in superior convergence rates for a wider class of problems than previous analyzed. Numerical experiments are provided that illustrate the theoretical results.

97 MATHEMATICS AND COMPUTING↗

Quantum Reinforcement Learning for Volt-VAR Control in Power Distribution Systems

Volt-VAR control (VVC) is crucial in active distribution networks for optimizing voltage profiles and minimizing network losses. While traditional deep reinforcement learning (DRL) algorithms exhibit promise for VVC, they often require extensive computational resources to handle such a high-dimensional problem. As a potential solution, quantum reinforcement learning (QRL) algorithms integrate the computational capabilities of quantum computing into the DRL framework. However, existing QRL algorithms struggle with complex VVC problems due to the limitations of current quantum hardware. To bridge this gap, this paper proposes an innovative QRL algorithm featuring an end-to-end architecture that integrates a classical autoencoder, variational quantum circuits (VQCs), and classical post-processing layers. This design efficiently compresses high-dimensional grid states, enabling VQCs to leverage quantum advantages while producing multiple control device outputs tailored for VVC tasks. Numerical studies on three representative distribution systems verify the effectiveness and scalability of the proposed QRL algorithm, and demonstrate its enhanced performance over classical approaches with only approximately 1% of the parameters. Additionally, the robustness of our developed algorithm is validated through noisy quantum environments.

97 MATHEMATICS AND COMPUTING↗

A Fresh Math Perspective Opens New Possibilities for Computational Chemistry

By reformulating the TDDFT problem as a matrix function approximation, making use of a special transformation and taking advantage of the underlying symmetry with respect to a non-Euclidean metric, Yang and his colleagues were able to apply the Lanczos algorithm and a Kernal Polynomial Method (KPM) to approximate the absorption spectrum of several molecules. Both of these algorithms require relatively low-memory compared to non-symmetrical alternatives, which is the key to the computational savings.

Vu, Linda↗

Quantum mixed state compiling

The task of learning a quantum circuit to prepare a given mixed state is a fundamental quantum subroutine. We present a variational quantum algorithm (VQA) to learn mixed states which is suitable for near-term hardware. Our algorithm represents a generalization of previous VQAs that aimed at learning preparation circuits for pure states. We consider two different ansätze for compiling the target state; the first is based on learning a purification of the state and the second on representing it as a convex combination of pure states. In both cases, the resources required to store and manipulate the compiled state grow with the rank of the approximation. Thus, by learning a lower rank approximation of the target state, our algorithm provides a means of compressing a state for more efficient processing. As a byproduct of our algorithm, one effectively learns the principal components of the target state, and hence our algorithm further provides a new method for principal component analysis. We investigate the efficacy of our algorithm through extensive numerical implementations, showing that typical random states and thermal states of many body systems may be learnt this way. Additionally, we demonstrate on quantum hardware how our algorithm can be used to study hardware noise-induced states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Surface hopping, transition state theory, and decoherence. II. Thermal rate constants and detailed balance

We investigate a simple approach to compute a non-adiabatic thermal rate constant using the fewest switches surface hopping (FSSH) dynamics. We study the effects of both decoherence (using our augmented-FSSH (A-FSSH) algorithm) and forbidden hops over a large range of parameters, including high and low friction regimes, and weak and strong electronic coupling regimes. Furthermore, when possible, we benchmark our results against exact hierarchy equations of motion results, where we usually find a maximum error of roughly a factor of two (at reasonably large temperatures). In agreement with Hammes-Schiffer and Tully, we find that a merger of transition state theory and surface hopping can be both accurate and efficient when performed correctly. We further show that detailed balance is followed approximately by A-FSSH dynamics.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An adaptive ANOVA-based PCKF for high-dimensional nonlinear inverse modeling

The probabilistic collocation-based Kalman filter (PCKF) is a recently developed approach for solving inverse problems. It resembles the ensemble Kalman filter (EnKF) in every aspect—except that it represents and propagates model uncertainty by polynomial chaos expansion (PCE) instead of an ensemble of model realizations. Previous studies have shown PCKF is a more efficient alternative to EnKF for many data assimilation problems. However, the accuracy and efficiency of PCKF depends on an appropriate truncation of the PCE series. Having more polynomial chaos basis functions in the expansion helps to capture uncertainty more accurately but increases computational cost. Selection of basis functions is particularly important for high-dimensional stochastic problems because the number of polynomial chaos basis functions required to represent model uncertainty grows dramatically as the number of input parameters (random dimensions) increases. In classic PCKF algorithms, the PCE basis functions are pre-set based on users' experience. Also, for sequential data assimilation problems, the basis functions kept in PCE expression remain unchanged in different Kalman filter loops, which could limit the accuracy and computational efficiency of classic PCKF algorithms. To address this issue, we present a new algorithm that adaptively selects PCE basis functions for different problems and automatically adjusts the number of basis functions in different Kalman filter loops. The algorithm is based on adaptive functional ANOVA (analysis of variance) decomposition, which approximates a high-dimensional function with the summation of a set of low-dimensional functions. Thus, instead of expanding the original model into PCE, we implement the PCE expansion on these low-dimensional functions, which is much less costly. We also propose a new adaptive criterion for ANOVA that is more suited for solving inverse problems. The new algorithm was tested with different examples and demonstrated great effectiveness in comparison with non-adaptive PCKF and EnKF algorithms.

97 MATHEMATICS AND COMPUTING↗

Bottom-up reconstruction scenarios for (un)constrained MSSM parameters at the CERN LHC

We consider some specific inverse problem or 'bottom-up' reconstruction strategies at the CERN LHC for both general and constrained minimal supersymmetric standard model (MSSM) parameters, starting from a plausibly limited set of sparticle identification and mass measurements, using mainly gluino/squark cascade decays, plus eventually the lightest Higgs boson mass. For the three naturally separated sectors of gaugino/Higgsino, squark/slepton, and Higgs parameters, we examine different step-by-step algorithms based on rather simple, entirely analytical, inverted relations between masses and basic MSSM parameters. This includes also reasonably good approximations of some of the relevant radiative correction calculations. We distinguish the constraints obtained for a general MSSM from those obtained with universality assumptions in the three different sectors. Our results are compared at different stages with the determination from more standard 'top-down' fit of models to data, and finally combined into a global determination of all the relevant parameters. Our approach gives complementary information to more conventional analysis, and is not restricted to the specific LHC measurement specificities. In addition, the bottom-up renormalization group evolution of general MSSM parameters, being an important ingredient in this framework, is illustrated as a new publicly available option of the MSSM spectrum calculation code SuSpect.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Verification of the Coupled Fluid/Solid Transfer in a CASL Grid-to-Rod-Fretting Simulation: A Technical Brief on the Analysis of Convergence Behavior and Demonstration of Software Tools for Verification

For a CASL grid-to-rod fretting problem, Sandia's Percept software was used in conjunction with the Sierra Mechanics suite to analyze the convergence behavior of the data transfer from a fluid simulation to a solid mechanics simulation. An analytic function, with properties relatively close to numerically computed fluid approximations, was chosen to represent the pressure solution in the fluid domain. The analytic pressure was interpolated on a sequence of grids on the fluid domain, and transferred onto a separate sequence of grids in the solid domain. The error in the resulting pressure in the solid domain was measured with respect to the analytic pressure. The error in pressure approached zero as both the fluid and solids meshes were refined. The convergence of the transfer algorithm was limited by whether the source grid resolution was the same or finer than the target grid resolution. In addition, using a feature coverage analysis, we found gaps in the solid mechanics code verification test suite directly relevant to the prototype CASL GTRF simulations.

99 GENERAL AND MISCELLANEOUS↗

DIMENSION REDUCTION NUMERICAL CLOSURE METHOD FOR ADVECTION-DIFFUSION-REACTION SYSTEMS

Many natural physical processes exhibit a multiscale behavior, that is the same processes allow different mathematical description on different scales. The microscale description is usually based on fundamental conservation laws that form a closed system of ordinary differential equations (ODEs) or partial differential equations (PDEs) but the numerical discretization of these equations may produce a system of ODEs with an enormous number of unknowns. Furthermore, a time integration of the microscale equations usually requires time steps that are smaller than the observation time by many orders of magnitude. A direct solution of these ODEs can be extremely expensive. This necessitates development of advanced algorithms for model (or dimension) reduction. Often, we are only interested in the average behavior of the system rather than the exact solution of the ODEs. Here we developed a novel dimension reduction method that gives an approximate solution of the ODEs and gives an accurate prediction of the average behavior. The method relies on a computational closure of averaged evolution balance equations. The computational closure is achieved via short bursts of microscale simulation. The dimension reduction model was used to simulate flow and transport with mixing controlled reactions and mineral precipitation. A pore-scale model was used as a microscale model. A good agreement between microscale simulations and the accelerated microscale simulations confirms the accuracy and computational efficiency of the dimension reduction model. The method significant accelerates microscale simulations, while providing accurate approximation of the solution and accurate prediction of the average behavior of the system.

99 GENERAL AND MISCELLANEOUS↗

Population parametrization of costly black box models using iterations between SAEM algorithm and kriging

In this article we focus on parametrization of black box models from repeated measurements among several individuals (population parametrization). We introduce a variant of the SAEM algorithm, called KSAEM algorithm, which couples the standard SAEM algorithm with the dynamic construction of an approximate metamodel. The costly evaluation of the genuine black box is replaced by a kriging step, using a basis of precomputed values, basis which is enlarged during SAEM algorithm to improve the accuracy of the metamodel in regions of interest.

97 MATHEMATICS AND COMPUTING↗

Algorithms for the Electronic and Vibrational Properties of Nanocrystals

Solving the electronic structure problem for nanoscale systems remains a computationally challenging problem. The numerous degrees of freedom, both electronic and nuclear, make the problem impossible to solve without some effective approximations. Here we illustrate some advances in algorithm developments to solve the Kohn-Sham eigenvalue problem, i.e., we solve the electronic structure problem within density functional theory using pseudopotentials expressed in real space. Our algorithms are based on a nonlinear Chebyshev-filtered subspace iteration method, which avoids computing explicit eigenvectors except at the first self-consistent-field iteration. Our method may be viewed as an approach to solve the original nonlinear Kohn-Sham equation by a nonlinear subspace iteration technique, without emphasizing the intermediate linearized Kohn-Sham eigenvalue problems. Replacing the standard iterative diagonalization at each self-consistent-field iteration by a Chebyshev subspace filtering step results in a significant speedup, often an order of magnitude or more, over methods based on standard diagonalization. We illustrate this method by predicting the electronic and vibrational states for silicon nanocrystals.

Chelikowsky, James↗

A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions

We propose an algorithm for recovering sparse orthogonal polynomial expansions via collocation. A standard sampling approach for recovering sparse polynomials uses Monte Carlo sampling, from the density of orthogonality, which results in poor function recovery when the polynomial degree is high. Our proposed approach aims to mitigate this limitation by sampling with respect to the weighted equilibrium measure of the parametric domain and subsequently solves a preconditioned $\ell^1$-minimization problem, where the weights of the diagonal preconditioning matrix are given by evaluations of the Christoffel function. Our algorithm can be applied to a wide class of orthogonal polynomial families on bounded and unbounded domains, including all classical families. We present theoretical analysis to motivate the algorithm and numerical results that show our method is superior to standard Monte Carlo methods in many situations of interest. In conclusion, numerical examples are also provided to demonstrate that our proposed algorithm leads to comparable or improved accuracy even when compared with Legendre- and Hermite-specific algorithms.

97 MATHEMATICS AND COMPUTING↗

Parallel Randomized Tucker Decomposition Algorithms

The Tucker tensor decomposition is a natural extension of the singular value decomposition (SVD) to multiway data. Here, we propose to accelerate Tucker tensor decomposition algorithms by using randomization and parallelization. We present two algorithms that scale to large data and many processors, significantly reduce both computation and communication cost compared to previous deterministic and randomized approaches, and obtain nearly the same approximation errors. The key idea in our algorithms is to perform randomized sketches with Kronecker-structured random matrices, which reduces computation compared to unstructured matrices and can be implemented using a fundamental tensor computational kernel. We provide probabilistic error analysis of our algorithms and implement a new parallel algorithm for the structured randomized sketch. Our experimental results demonstrate that our combination of randomization and parallelization achieves accurate Tucker decompositions much faster than alternative approaches. We observe up to a 16X speedup over the fastest deterministic parallel implementation on 3D simulation data.

Tucker decompositions↗

Failure and Redemption of Multifilter Rotating Shadowband Radiometer (MFRSR)/Normal Incidence Multifilter Radiometer (NIMFR) Cloud Screening: Contrasting Algorithm Performance at Atmospheric Radiation Measurement (ARM) North Slope of Alaska (NSA) and Southern Great Plains (SGP) Sites

Well-known cloud-screening algorithms, which are designed to remove cloud-contaminated aerosol optical depths (AOD) from AOD measurements, have shown great performance at many middle-to-low latitude sites around the world. However, they may occasionally fail under challenging observational conditions, such as when the sun is low (near the horizon) or when optically thin clouds with small spatial inhomogeneity occur. Such conditions have been observed quite frequently at the high-latitude Atmospheric Radiation Measurement (ARM) North Slope of Alaska (NSA) sites. A slightly modified cloud-screening version of the standard algorithm is proposed here with a focus on the ARM-supported Multifilter Rotating Shadowband Radiometer (MFRSR) and Normal Incidence Multifilter Radiometer (NIMFR) data. The modified version uses approximately the same techniques as the standard algorithm, but it additionally examines the magnitude of the slant-path line of sight transmittance and eliminates points when the observed magnitude is below a specified threshold. Substantial improvement of the multi-year (1999-2012) aerosol product (AOD and its Angstrom exponent) is shown for the NSA sites when the modified version is applied. Moreover, this version reproduces the AOD product at the ARM Southern Great Plains (SGP) site, which was originally generated by the standard cloud-screening algorithms. The proposed minor modification is easy to implement and its application to existing and future cloud-screening algorithms can be particularly beneficial for challenging observational conditions.

aerosol↗

Fast and accurate CMB computations in non-flat FLRW universes

We present a new method for calculating CMB anisotropies in a non-flat Friedmann universe, relying on a very stable algorithm for the calculation of hyperspherical Bessel functions, that can be pushed to arbitrary precision levels. We also introduce a new approximation scheme which gradually takes over in the flat space limit and leads to significant reductions of the computation time. Our method is implemented in the Boltzmann code class. It can be used to benchmark the accuracy of the camb code in curved space, which is found to match expectations. For default precision settings, corresponding to 0.1% for scalar temperature spectra and 0.2% for scalar polarisation spectra, our code is two to three times faster, depending on curvature. We also simplify the temperature and polarisation source terms significantly, so the different contributions to the C{sub ℓ} 's are easy to identify inside the code.

79 ASTRONOMY AND ASTROPHYSICS↗

SU-E-T-504: Intensity-Modulated Radiosurgery Treatments Derived by Optimizing Delivery of Sphere Packing Treatment Plans

Purpose To minimize the number of monitor units required to deliver a sphere packing stereotactic radiosurgery (SRS) plan by eliminating overlaps of individual beam projections. Methods An algorithm was written in C{sup ++} to calculate SRS treatment doses using sphere packing. Three fixed beams were used to approximate each arc in a typical SRS treatment plan. For cases involving multiple isocenters, at each gantry and table angle position beams directed to individual spheres overlap to produce regions of high dose, resulting in intensity modulated beams. These high dose regions were dampened by post-processing of the combined beam profile. The post-process dampening involves removing the excess overlapping fluence from all but the highest contributing beam. The dampened beam profiles at each table and gantry angle position were then summed to produce the new total dose distribution. Results Delivery times for even the most complex multiple sphere plans can be reduced to consistent times of about 20 to 30 minutes. The total MUs required to deliver the plan can also be reduced by as much as 85% of the original plan’s MUs. Conclusion Regions of high dose are removed. Dampening overlapping radiation fluence can produce the new beam profiles that have more uniform dose distributions using less MUs. This results in a treatment that requires significantly fewer intensity values than traditional IMRT or VAMT planning.

60 APPLIED LIFE SCIENCES↗

Studies of Front-End Electronics for High-Precision Timing Measurements with LGADs [Poster]

In Time-of-Arrival (ToA) measurements, simulations can be used to optimize precision detection and implementation methods of front-end electronics. The simulation tested in this project takes the response of a filter (in the s-domain) from a noisy input current signal from the detector, an LGAD (Low-Gain Avalanche Diode), and uses a threshold to determine the ToA value for the signal. Measuring the ToA values for a large sample of events and comparing them to a reference statistically produces the timing precision of the simulation. Here, the sub-algorithm to model LGAD events with piecewise linear (PWL) approximations (for more efficient Laplace transforms) was optimized. Using the Fourier Discrete Cosine Transform, 25 points could be selected to describe the primary behavior of the signal. Results showed that timing precision is on par with previous methods. We also found that the new algorithm is faster and equally consistent in producing accurate PWL approximations. Testi ng with larger samples is required to fully verify the new algorithm.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Asynchronously parallel optimization solver for finding multiple minima

This paper proposes and analyzes an asynchronously parallel optimization algorithm for finding multiple, high-quality minima of nonlinear optimization problems. Our multistart algorithm considers all previously evaluated points when determining where to start or continue a local optimization run. Theoretical results show that, under certain assumptions, the algorithm almost surely starts a finite number of local optimization runs and identifies, or has a single local optimization run converging to, every minimum. The algorithm is applicable to general optimization settings, but our numerical results focus on the case when derivatives are unavailable. In numerical tests, a PYTHON implementation of the algorithm is shown to yield good approximations of many minima (including a global minimum), and this ability scales well with additional resources. Our implementation’s time to solution is shown also to scale well even when the time to evaluate the function evaluation is highly variable.

97 MATHEMATICS AND COMPUTING↗