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 865 records · Page 48

Controlled Nonlinear Stochastic Delay Equations: Part II: Approximations and Pipe-Flow Representations

This is the second part of a work dealing with key issues that have not been addressed in the modeling and numerical optimization of nonlinear stochastic delay systems. We consider new classes of models, such as those with nonlinear functions of several controls (such as products), each with is own delay, controlled random Poisson measure driving terms, admissions control with delayed retrials, and others. Part I was concerned with issues concerning the class of admissible controls and their approximations, since the classical definitions are inadequate for our models. This part is concerned with transportation equation representations and their approximations. Such representations of nonlinear stochastic delay models have been crucial in the development of numerical algorithms with much reduced memory and computational requirements. The representations for the new models are not obvious and are developed. They also provide a template for the adaptation of the Markov chain approximation numerical methods.

97 MATHEMATICS AND COMPUTING↗

Semi-Analytic Reconstruction of Flux in Finite Volume Formulations

Semi-analytic reconstruction uses the analytic solution to a second-order, steady, ordinary differential equation (ODE) to simultaneously evaluate the convective and diffusive flux at all interfaces of a finite volume formulation. The second-order ODE is itself a linearized approximation to the governing first- and second- order partial differential equation conservation laws. Thus, semi-analytic reconstruction defines a family of formulations for finite volume interface fluxes using analytic solutions to approximating equations. Limiters are not applied in a conventional sense; rather, diffusivity is adjusted in the vicinity of changes in sign of eigenvalues in order to achieve a sufficiently small cell Reynolds number in the analytic formulation across critical points. Several approaches for application of semi-analytic reconstruction for the solution of one-dimensional scalar equations are introduced. Results are compared with exact analytic solutions to Burger s Equation as well as a conventional, upwind discretization using Roe s method. One approach, the end-point wave speed (EPWS) approximation, is further developed for more complex applications. One-dimensional vector equations are tested on a quasi one-dimensional nozzle application. The EPWS algorithm has a more compact difference stencil than Roe s algorithm but reconstruction time is approximately a factor of four larger than for Roe. Though both are second-order accurate schemes, Roe s method approaches a grid converged solution with fewer grid points. Reconstruction of flux in the context of multi-dimensional, vector conservation laws including effects of thermochemical nonequilibrium in the Navier-Stokes equations is developed.

Gnoffo, Peter A.↗

Approximate equations of state in two-temperature plasma mixtures

Approximate thermodynamic state relations for multicomponent atomic and molecular gas mixtures are often constructed by artificially partitioning the mixture into its constituent materials and requiring the separated materials to be in temperature and pressure equilibrium. Iterative numerical algorithms have been employed to enforce this equilibration and compute the resulting approximate state relations in single-temperature mixtures. In partially ionized gas mixtures, there is both theoretical and empirical evidence that equilibrating the chemical potentials, number densities, or partial pressures of the free electrons is likely to produce more accurate results than equilibrating the total pressures. Moreover, in many situations of practical interest the free electrons and heavy particles have different temperatures. In this paper, we present a generalized algorithm for equilibrating the heavy-particle and electron temperatures and a third user-specified independent thermodynamic variable in a two-temperature plasma mixture. Test calculations based on the equilibration of total pressure vs. electron pressure are presented for three different mixtures.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Multi-level methods and approximating distribution functions

Biochemical reaction networks are often modelled using discrete-state, continuous-time Markov chains. System statistics of these Markov chains usually cannot be calculated analytically and therefore estimates must be generated via simulation techniques. There is a well documented class of simulation techniques known as exact stochastic simulation algorithms, an example of which is Gillespie’s direct method. These algorithms often come with high computational costs, therefore approximate stochastic simulation algorithms such as the tau-leap method are used. However, in order to minimise the bias in the estimates generated using them, a relatively small value of tau is needed, rendering the computational costs comparable to Gillespie’s direct method. The multi-level Monte Carlo method (Anderson and Higham, Multiscale Model. Simul. 10:146–179, 2012) provides a reduction in computational costs whilst minimising or even eliminating the bias in the estimates of system statistics. This is achieved by first crudely approximating required statistics with many sample paths of low accuracy. Then correction terms are added until a required level of accuracy is reached. Recent literature has primarily focussed on implementing the multi-level method efficiently to estimate a single system statistic. However, it is clearly also of interest to be able to approximate entire probability distributions of species counts. We present two novel methods that combine known techniques for distribution reconstruction with the multi-level method. We demonstrate the potential of our methods using a number of examples.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

POLARIZED LINE FORMATION WITH LOWER-LEVEL POLARIZATION AND PARTIAL FREQUENCY REDISTRIBUTION

In the well-established theories of polarized line formation with partial frequency redistribution (PRD) for a two-level and two-term atom, it is generally assumed that the lower level of the scattering transition is unpolarized. However, the existence of unexplained spectral features in some lines of the Second Solar Spectrum points toward a need to relax this assumption. There exists a density matrix theory that accounts for the polarization of all the atomic levels, but it is based on the flat-spectrum approximation (corresponding to complete frequency redistribution). In the present paper we propose a numerical algorithm to solve the problem of polarized line formation in magnetized media, which includes both the effects of PRD and the lower level polarization (LLP) for a two-level atom. First we derive a collisionless redistribution matrix that includes the combined effects of the PRD and the LLP. We then solve the relevant transfer equation using a two-stage approach. For illustration purposes, we consider two case studies in the non-magnetic regime, namely, the J {sub a} = 1, J {sub b} = 0 and J {sub a} = J {sub b} = 1, where J {sub a} and J {sub b} represent the total angular momentum quantum numbers of the lower and upper states, respectively. Our studies show that the effects of LLP are significant only in the line core. This leads us to propose a simplified numerical approach to solve the concerned radiative transfer problem.

79 ASTRONOMY AND ASTROPHYSICS↗

Design and simulation of stratified probability digital receiver with application to the multipath communication

One approach to the problem of simplifying complex nonlinear filtering algorithms is through using stratified probability approximations where the continuous probability density functions of certain random variables are represented by discrete mass approximations. This technique is developed in this paper and used to simplify the filtering algorithms developed for the optimum receiver for signals corrupted by both additive and multiplicative noise.

Deal, J. H.↗

An implicit and stiffly stable finite element CFD algorithm for unsteady aerodynamics

A stable and accurate finite element CFD algorithm for hyperbolic/incompletely parabolic conservation law systems is described and verified. It combines a Taylor weak statement FEM, an optimal implicit Runge-Kutta time integration algorithm, and a matrix tensor product approximate factorization linear algebra procedure. The results of computational experiments show that the developed algorithm is robust.

Baker, A. J.↗

A computationally efficient method for tempered fractional differential equations with application

This paper investigates the numerical approximation of the tempered fractional integral by using the Sinc-collocation scheme. The algorithm is extended to solve a class of tempered fractional differential equations that converges to the solution with exponential rate. Several numerical examples compare the numerical approximations with the exact solutions. The behavioral responses of the lumped capacitance model with tempered fractional order for transient conduction are investigated. The efficiency and accuracy of the proposed scheme are analyzed in the perspective of the L{sub 2}-norm error and convergence order.

97 MATHEMATICS AND COMPUTING↗

Implicit multigrid algorithms for the three-dimensional flux split Euler equations

The full approximation scheme multigrid method is applied to several implicit flux-split algorithms for solving the three-dimensional Euler equations in a body fitted coordinate system. Each uses a variation of approximate factorization and is implemented in a finite volume formulation. The algorithms are all vectorizable with little or no scalar computations required. The flux vectors are split into upwind components using both the splittings of Steger-Warming and Van Leer. Results comparing pressure distributions with experimental data using both splitting types are shown. The stability and smoothing rate of each of the schemes are examined using a Fourier analysis of the complete system of equations. Results are presented for three-dimensional subsonic, transonic, and supersonic flows which demonstrate substantially improved convergence rates with the multigrid algorithm. The influence of using both a V-cycle and a W-cycle on the convergence is examined. Using the multigrid method on both subsonic and transonic wing calculations, the final lift coefficient is obtained to within 0.1 percent of its final value in a few as 15 cycles for a mesh with over 210,000 points. A spectral radius of 0.89 is achieved for both subsonic and transonic flow over the ONERA M6 wing while a spectral radius of 0.83 is obtained for supersonic flow over an analytically defined forebody. Results compared with experiment for all cases show good agreement.

Anderson, W. K.↗

Optimizing Reduced-Order Transfer Functions

Transfer-function approximations made optimal in special least-squares sense. Algorithm computes reduced-order rational-fraction approximates to single-input/single-output transfer functions. Reduces amount of computation needed for such purposes as numerical simulation of dynamics and design of control subsystems.

Spanos, John T.↗

Comparison of Multisine Peak Factor Minimization Algorithms for Aircraft System Identification

Two phase-optimized multisine peak factor minimization algorithms are presented and evaluated. The first algorithm minimizes peak factor by iteratively clipping the peaks of generated multisine signals. The second algorithm optimizes peak factor indirectly through minimization of an approximation of the infinity norm of the multisine. Algorithm performance was evaluated as a function of different signal properties, including the number of harmonics, harmonic spacing, and number of snow harmonics (extra harmonics included for further reduction of the peak factor). The two algorithms are compared against results obtained by minimizing peak factor directly using a simplex algorithm, which has been a common approach when designing phase-optimized multisines for system identification flight tests. Sample results show that the clipping and infinity norm algorithms produced multisine signals with comparable peak factors that were lower than that of the simplex algorithm. However, the clipping algorithm runs an order of magnitude faster than the other two algorithms, which also makes it practical to repeat the algorithm multiple times to achieve even lower peak factors.

system identification↗

Comparison of Multisine Peak Factor Minimization Algorithms for Aircraft System Identification(Presentation)

Two phase-optimized multisine peak factor minimization algorithms are presented and evaluated. The first algorithm minimizes peak factor by iteratively clipping the peaks of generated multisine signals. The second algorithm optimizes peak factor indirectly through minimization of an approximation of the infinity norm of the multisine. Algorithm performance was evaluated as a function of different signal properties, including the number of harmonics, harmonic spacing, and number of snow harmonics (extra harmonics included for further reduction of the peak factor). The two algorithms are compared against results obtained by minimizing peak factor directly using a simplex algorithm, which has been a common approach when designing phase-optimized multisines for system identification flight tests. Sample results show that the clipping and infinity norm algorithms produced multisine signals with comparable peak factors that were lower than that of the simplex algorithm. However, the clipping algorithm runs an order of magnitude faster than the other two algorithms, which also makes it practical to repeat the algorithm multiple times to achieve even lower peak factors.

flight test↗

Counting independent sets using the Bethe approximation

The authors consider the problem of counting the number of independent sets or the partition function of a hard-core model in a graph. The problem in general is computationally hard (P hard). They study the quality of the approximation provided by the Bethe free energy. Belief propagation (BP) is a message-passing algorithm can be used to compute fixed points of the Bethe approximation; however, BP is not always guarantee to converge. As the first result, they propose a simple message-passing algorithm that converges to a BP fixed pont for any grapy. They find that their algorithm converges within a multiplicative error 1 + {var_epsilon} of a fixed point in {Omicron}(n{sup 2}E{sup -4} log{sup 3}(nE{sup -1})) iterations for any bounded degree graph of n nodes. In a nutshell, the algorithm can be thought of as a modification of BP with 'time-varying' message-passing. Next, they analyze the resulting error to the number of independent sets provided by such a fixed point of the Bethe approximation. Using the recently developed loop calculus approach by Vhertkov and Chernyak, they establish that for any bounded graph with large enough girth, the error is {Omicron}(n{sup -{gamma}}) for some {gamma} > 0. As an application, they find that for random 3-regular graph, Bethe approximation of log-partition function (log of the number of independent sets) is within o(1) of corret log-partition - this is quite surprising as previous physics-based predictions were expecting an error of o(n). In sum, their results provide a systematic way to find Bethe fixed points for any graph quickly and allow for estimating error in Bethe approximation using novel combinatorial techniques.

97 MATHEMATICS AND COMPUTING↗

Accuracy versus precision in boosted top tagging with the ATLAS detector

The identification of top quark decays where the top quark has a large momentum transverse to the beam axis, known as top tagging , is a crucial component in many measurements of Standard Model processes and searches for beyond the Standard Model physics at the Large Hadron Collider. Machine learning techniques have improved the performance of top tagging algorithms, but the size of the systematic uncertainties for all proposed algorithms has not been systematically studied. This paper presents the performance of several machine learning based top tagging algorithms on a dataset constructed from simulated proton-proton collision events measured with the ATLAS detector at $\sqrt{s}$ = 13 TeV. The systematic uncertainties associated with these algorithms are estimated through an approximate procedure that is not meant to be used in a physics analysis, but is appropriate for the level of precision required for this study. The most performant algorithms are found to have the largest uncertainties, motivating the development of methods to reduce these uncertainties without compromising performance. To enable such efforts in the wider scientific community, the datasets used in this paper are made publicly available.

47 OTHER INSTRUMENTATION↗

Algorithm 1049: The Delaunay Density Diagnostic

Accurate approximation of a real-valued function depends on two aspects of the available data: the density of inputs within the domain of interest and the variation of the outputs over that domain. There are few methods for assessing whether the density of inputs is sufficient to identify the relevant variations in outputs—i.e., the “geometric scale” of the function—despite the fact that sampling density is closely tied to the success or failure of an approximation method. In this article, we introduce a general purpose, computational approach to detecting the geometric scale of real-valued functions over a fixed domain using a deterministic interpolation technique from computational geometry. The algorithm is intended to work on scalar data in moderate dimensions (2–10). Our algorithm is based on the observation that a sequence of piecewise linear interpolants will converge to a continuous function at a quadratic rate (in L 2 norm) if and only if the data are sampled densely enough to distinguish the feature from noise (assuming sufficiently regular sampling). We present numerical experiments demonstrating how our method can identify feature scale, estimate uncertainty in feature scale, and assess the sampling density for fixed (i.e., static) datasets of input–output pairs. Finally, we include analytical results in support of our numerical findings and have released lightweight code that can be adapted for use in a variety of data science settings.

97 MATHEMATICS AND COMPUTING↗

Quantum simulation of Lindbladian dynamics via repeated interactions

The Lindblad equation generalizes the Schrödinger equation to quantum systems that undergo dissipative dynamics. The quantum simulation of Lindbladian dynamics is therefore non-unitary, preventing a naive application of state-of-the-art quantum algorithms. Here, we make use of an approximate correspondence between Lindbladian dynamics and evolution based on repeated interaction (RI) CPTP maps to write down a Hamiltonian formulation of the Lindblad dynamics and derive a rigorous error bound on the master equation. Specifically, we show that the number of interactions needed to simulate the Liouvillian within error e scales in most physical scenarios as . This is significant because the error in the Lindbladian approximation to the dynamics is not explicitly bounded in existing quantum algorithms for open system simulations. We then provide quantum algorithms to simulate RI maps using an iterative qubitization approach and Trotter–Suzuki formulas, and specifically show that for iterative qubitization the number of operations needed to simulate the dynamics (for a fixed value of ?) scales as in the limit where a0 (the coefficient 1-norm for the system and bath Hamiltonians) asymptotically dominates over the corresponding factor for the interaction Hamiltonian, which is often the case in weak coupling. This scaling would appear to be optimal if the complexity of ? is not considered, which underscores the importance of considering the error in the Liouvillian that we reveal in this work.

Quantum Computing↗

hp -VPINNs: Variational physics-informed neural networks with domain decomposition

We formulate a general framework for hp-variational physics-informed neural networks (hp-VPINNs) based on the nonlinear approximation of shallow and deep neural networks and hp-refinement via domain decomposition and projection onto the space of high-order polynomials. The trial space is the space of neural network, which is defined globally over the entire computational domain, while the test space contains piecewise polynomials. Specifically in this study, the hp-refinement corresponds to a global approximation with a local learning algorithm that can efficiently localize the network parameter optimization. Here, we demonstrate the advantages of hp-VPINNs in both accuracy and training cost for several numerical examples of function approximation and in solving differential equations.

42 ENGINEERING↗

Passive Microwave Remote Sensing of Rainfall Considering the Effects of Wind and Nonprecipitating Clouds

It has long been shown both in theory and in observation that emission from rain drops in a raining cloud results in upwelling brightness temperature above that caused by the sea surface alone. High brightness temperatures at microwave frequencies (e.g. 37 and 19 GHz) have usually been quantitatively associated with rainfall using physical or statistical models. By comparing concurrent special sensor microwave/imager and radar data, however, we noticed many cases where there is no appreciable rainfall in a field of view (FOV) which exhibits high brightness temperature (T(sub B)) at 37 and 19 GHz. On the basis of calculations and past literature it is shown that such high brightness temperatures can be caused by nonprecipitating clouds and by wind. The effect of the wind is to create wave and high-emissivity foam on the sea surface. A model is developed to relate T(sub B) to the fractional coverage of rain, f, within a FOV. The parameters of the model are calibrated by fitting the model to the observed brightness temperature and fractional rain coverage data. The critical parameter of the model, T(sub B min.), which is the threshold brightness temperature for the presence of rain, depends on the strength of the storm. The strength of the storm is characterized by the fraction of the FOVs within a large area that have T(sub B) higher than 240 K, which is readily obtainable from satellite data alone. The instantaneous FOV rain rate R can then be obtained through the f approximately R relationship which is empirically derived using radar data. An algorithm has been proposed based on the T(sub B) approximately f and f approximately R relationship. Application of the algorithm to TOGA-COARE and Darwin storms results in reasonable instantaneous FOV rain estimate. When averaged over the entire radar scan, a more accurate and unbiased areal rain estimate can be achieved.

Qihang Li.↗