Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “APPROXIMATIONS”

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 37 records · Page 2

Taylor approximation variance reduction for approximation errors in PDE-constrained Bayesian inverse problems

In numerous applications, surrogate models are used as a replacement for accurate parameter-to-observable mappings when solving large-scale inverse problems governed by partial differential equations (PDEs). The surrogate model may be a computationally cheaper alternative to the accurate parameter-to-observable mappings and/or may ignore additional unknowns or sources of uncertainty. The Bayesian approximation error (BAE) approach provides a means to account for the induced uncertainties and approximation errors, i.e. the errors between the accurate parameter-to-observable mapping and the surrogate. The statistics of these errors are, however, in general unknown a priori, and are thus calculated using Monte Carlo sampling. Although the sampling is typically carried out offline, i.e. before considering the data, the process can still represent a computational bottleneck. In this work, we develop a scalable computational approach for reducing the costs associated with the sampling stage of the BAE approach. Specifically, we consider the Taylor expansion of the accurate and surrogate forward models with respect to the uncertain parameter fields either as a control variate for variance reduction or as a means to directly and efficiently approximate the mean and covariance of the approximation errors. We propose efficient methods for evaluating the expressions for the mean and covariance of the Taylor approximations based on linear(-ized) PDE solves. Furthermore, the proposed approach is independent of the dimension of the uncertain parameter, depending instead on the intrinsic dimension of the data, ensuring scalability to high-dimensional problems. The potential benefits of the proposed approach are demonstrated for two high-dimensional inverse problems governed by PDE examples, namely for the estimation of a distributed Robin boundary coefficient in a linear diffusion problem, and for a coefficient estimation problem governed by a nonlinear diffusion problem.

Bayesian approximation error↗

On uniform approximation of elliptic functions by Pade approximants

Diagonal Pade approximants of elliptic functions are studied. It is known that the absence of uniform convergence of such approximants is related to them having spurious poles that do not correspond to any singularities of the function being approximated. A sequence of piecewise rational functions is proposed, which is constructed from two neighbouring Pade approximants and approximates an elliptic function locally uniformly in the Stahl domain. The proof of the convergence of this sequence is based on deriving strong asymptotic formulae for the remainder function and Pade polynomials and on the analysis of the behaviour of a spurious pole. Bibliography: 23 titles.

97 MATHEMATICS AND COMPUTING↗

Analytical inversions in remote sensing of particle size distributions. I - Multispectral extinctions in the anomalous diffraction approximation. II Angular and spectral scattering in diffraction approximations

Consideration is given to analytical inversions in the remote sensing of particle size distributions, noting multispectral extinctions in anomalous diffraction approximation and angular and spectral scattering in diffraction approximation. A closed-form analytical inverse solution is derived in order to reconstruct the size distribution of atmospheric aerosols. The anomalous diffraction approximation to Mie's solution is used to describe the particles. Experimental data yield the geometrical area of aerosol polydispersion. Size distribution is thus found from a set of multispectral extinction measurements. In terms of the angular and spectral scattering of light in a narrow forward cone, it is shown that an analytical inverse solution may also be found for the Fraunhofer approximation to the Kirchhoff diffraction, and for an improved expression of this approximation due to Penndorf (1962) and Shifrin-Punina (1968).

Fymat, A. L.↗

Modifying AMG Coarse Spaces with Weak Approximation Property to Exhibit Approximation in Energy Norm

Algebraic multigrid (AMG) coarse spaces are commonly constructed so that they exhibit the so-called weak approximation property (WAP) which is a necessary and sufficient condition for uniform two-grid convergence. Here, this paper studies a modification of such coarse spaces so that the modified ones provide approximation in energy norm. Our modification is based on the projection in energy norm onto an orthogonal complement of original coarse space. This generally leads to dense modified coarse space matrices, which is hence computationally infeasible. To remedy this, based on the fact that the projection involves inverse of a well-conditioned matrix, we use polynomials to approximate the projection and, therefore, obtain a practical, sparse modified coarse matrix and prove that the modified coarse space maintains computationally feasible approximation in energy norm. We present some numerical results for both PDE discretization matrices as well as graph Laplacian ones, which are in accordance with our theoretical results.

97 MATHEMATICS AND COMPUTING↗

Two-nucleon emission in neutrino and electron scattering from nuclei: The modified convolution approximation

The theoretical formalism of inclusive lepton–nucleus scattering in the two-nucleon emission channel is discussed in the context of a simplified approach, the modified convolution approximation. This allows one to write the 2p2h responses of the relativistic Fermi gas as a folding integral of two 1p1h responses with the energies and momenta transferred to each nucleon. The idea behind this method is to introduce different average momenta for the two initial nucleons in the matrix elements of the two-body current, with the innovation that they depend on the transferred energies and momenta. This method treats exactly the two-body phase space kinematics, and reduces the formulae of the response functions from seven-dimensional integrals over momenta to much simpler three-dimensional ones. The applicability of the method is checked by comparing with the full results within a model of electroweak meson-exchange currents. The predictions are accurate enough, especially in the low-energy threshold region where the average momentum approximation works the best.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Combination of the pair density approximation and the Takahashi–Imada approximation for path integral Monte Carlo simulations

We construct an accurate imaginary time propagator for path integral Monte Carlo simulations for heterogeneous systems consisting of a mixture of atoms and molecules. We combine the pair density approximation, which is highly accurate but feasible only for the isotropic interactions between atoms, with the Takahashi–Imada approximation for general interactions. We present finite temperature simulations results for energy and structure of molecules–helium clusters X{sup 4}He{sub 20} (X=HCCH and LiH) which show a marked improvement over the Trotter approximation which has a 2nd-order time step bias. We show that the 4th-order corrections of the Takahashi–Imada approximation can also be applied perturbatively to a 2nd-order simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Approximate gauge symmetry of composite vector bosons

It can be shown in a solvable field theory model that the couplings of the composite vector bosons made of a fermion pair approach the gauge couplings in the limit of strong binding. Although this phenomenon may appear accidental and special to the vector bosons made of a fermion pair, we extend it to the case of bosons being constituents and find that the same phenomenon occurs in a more intriguing way. The functional formalism not only facilitates computation but also provides us with a better insight into the generating mechanism of approximate gauge symmetry, in particular, how the strong binding and global current conservation conspire to generate such an approximate symmetry. Remarks are made on its possible relevance or irrelevance to electroweak and higher symmetries.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

ON THE PROPER USE OF THE REDUCED SPEED OF LIGHT APPROXIMATION

I show that the reduced speed of light (RSL) approximation, when used properly (i.e., as originally designed—only for local sources but not for the cosmic background), remains a highly accurate numerical method for modeling cosmic reionization. Simulated ionization and star formation histories from the “Cosmic Reionization on Computers” project are insensitive to the adopted value of the RSL for as long as that value does not fall below about 10% of the true speed of light. A recent claim of the failure of the RSL approximation in the Illustris reionization model appears to be due to the effective speed of light being reduced in the equation for the cosmic background too and hence illustrates the importance of maintaining the correct speed of light in modeling the cosmic background.

79 ASTRONOMY AND ASTROPHYSICS↗

Approximate Green’s Function Coupled Cluster A Method Employing Effective Dimension Reduction

The Green’s function coupled cluster (GFCC) method, originally proposed in the early 1990s, is a powerful many-body tool for computing and analyzing the electronic structures of molecular structures and periodic systems, especially when electrons are strongly correlated. However, in order for the GFCC method to become an approach that can be routinely used in the electronic structure calculations, more robust linear algebraic techniques and approximations need to be employed to reduce its extremely high computational overhead. In our recent studies, we showed that the GFCC equation can be numerically solved by seeking solutions of multiple linear systems in the frequency regime of interest, which can be easily distributed in a massively parallel environment, and broaden the avenue for more state-of-the-art numerical linear algebraic tools associated with multiple linear systems to be kicked in to this field. In the present pursuit of this practice, we show a successful application of model order reduction (MOR) techniques in the GFCC framework. Briefly speaking, for a frequency regime of interest that requires a high resolution of spectral function, instead of solving GFCC linear equation in the original dimension for every single frequency point, an easily-solvable linear system model with reduced dimension can be built upon projecting the original GFCC linear system into a subspace, from which the interpolation and extrapolation can give a reasonable approximation to the results of the original GFCC linear equations. Here, we show that the subspace can be properly constructed in an iterative manner from the auxiliary vectors of the GFCC linear equations at some select frequencies inside the frequency regime. During the iterations, the quality of the subspace, as well as the linear system model, can be systematically improved. The approach is tested in this work in terms of the efficiency and accuracy of computing spectral functions for some typical molecular systems including carbon monoxide, 1,3-butadiene, benzene, and adenine molecules. As a byproduct, the high quality linear system model is also found to be able to provide high quality initial guess for the existing linear solver to improve the convergence performance.

Peng, Bo↗

Efficient Approximation Algorithms for Weighted $b$-Matching

We describe a half-approximation algorithm, b-Suitor, for computing a b-Matching of maximum weight in a graph with weights on the edges. b-Matching is a generalization of the well-known Matching problem in graphs, where the objective is to choose a subset of M edges in the graph such that at most a speci ed number b(v) of edges in M are incident on each vertex v. Subject to this restriction we maximize the sum of the weights of the edges in M. We prove that the b-Suitor algorithm computes the same b-Matching as the one obtained by the greedy algorithm for the problem. We implement the algorithm on serial and shared-memory parallel processors, and compare its performance against a collection of approximation algorithms that have been proposed earlier. Our results show that the b-Suitor algorithm outperforms the Greedy and Locally Dominant edge algorithms by one to two orders of magnitude on a serial processor. The b-Suitor algorithm has a high degree of concurrency, and it scales well up to 240 threads on a shared memory multiprocessor. The b-Suitor algorithm outperforms the Locally Dominant edge algorithm by a factor of fourteen on 16 cores of an Intel Xeon multiprocessor.

97 MATHEMATICS AND COMPUTING↗

Legendre-Tau approximation for functional differential equations. Part 3: Eigenvalue approximations and uniform stability

The stability and convergence properties of the Legendre-tau approximation for hereditary differential systems are analyzed. A charactristic equation is derived for the eigenvalues of the resulting approximate system. As a result of this derivation the uniform exponential stability of the solution semigroup is preserved under approximation. It is the key to obtaining the convergence of approximate solutions of the algebraic Riccati equation in trace norm.

Ito, K.↗

Legendre-tau approximation for functional differential equations. III - Eigenvalue approximations and uniform stability

The stability and convergence properties of the Legendre-tau approximation for hereditary differential systems are analyzed. A characteristic equation is derived for the eigenvalues of the resulting approximate system. As a result of this derivation the uniform exponential stability of the solution semigroup is preserved under approximation. It is the key to obtaining the convergence of approximate solutions of the algebraic Riccati equation in trace norm.

Ito, K.↗

Representation of Ice Geometry by Parametric Functions: Construction of Approximating NURBS Curves and Quantification of Ice Roughness--Year 1: Approximating NURBS Curves

Software was developed to construct approximating NURBS curves for iced airfoil geometries. Users specify a tolerance that determines the extent to which the approximating curve follows the rough ice. The user can therefore smooth the ice geometry in a controlled manner, thereby enabling the generation of grids suitable for numerical aerodynamic simulations. Ultimately, this ability to smooth the ice geometry will permit studies of the effects of smoothing upon the aerodynamics of iced airfoils. The software was applied to several different types of iced airfoil data collected in the Icing Research Tunnel at NASA Glenn Research Center, and in all cases was found to efficiently generate suitable approximating NURBS curves. This method is an improvement over the current "control point formulation" of Smaggice (v.1.2). In this report, we present the relevant theory of approximating NURBS curves and discuss typical results of the software.

Dill, Loren H.↗

FELIX-2.0: New version of the finite element solver for the time dependent generator coordinate method with the Gaussian overlap approximation

The time-dependent generator coordinate method (TDGCM) is a powerful method to study the largeamplitude collective motion of quantum many-body systems such as atomic nuclei. Under the GaussianOverlap Approximation (GOA), the TDGCM leads to a local, time-dependent Schrödinger equation in amulti-dimensional collective space. In this paper, we present the version 2.0 of the code FELIX that solvesthe collective Schrödinger equation in a finite element basis. This new version features: (i) the ability tosolve a generalized TDGCM+GOA equation with a metric term in the collective Hamiltonian, (ii) supportfor new kinds of finite elements and different types of quadrature to compute the discretized Hamiltonianand overlap matrices, (iii) the possibility to leverage the spectral element scheme, (iv) an explicit Krylovapproximation of the time propagator for time integration instead of the implicit Crank–Nicolson methodimplemented in the first version, (v) an entirely redesigned workflow. We benchmark this release on ananalytic problem as well as on realistic two-dimensional calculations of the low-energy fission of240Puand256Fm. Low to moderate numerical precision calculations are most efficiently performed with simplexelements with a degree 2 polynomial basis. Higher precision calculations should instead use the spectralelement method with a degree 4 polynomial basis. We emphasize that in a realistic calculation of fissionmass distributions of240Pu, FELIX-2.0 is about 20 times faster than its previous release (within a numericalprecision of a few percents).

Regnier, D.↗

The LISE package: solvers for static and time-dependent superfluid local density approximation equations in three dimensions

Nuclear implementation of the density functional theory (DFT) is at present the only microscopic framework applicable to the whole nuclear landscape. The extension of DFT to superfluid systems in the spirit of the Kohn-Sham approach, the superfluid local density approximation (SLDA) and its extension to time-dependent situations, time-dependent superfluid local density ap- proximation (TDSLDA), have been extensively used to describe various static and dynamical problems in nuclear physics, neutron star crust, and cold atom systems. In this paper, we present the codes that solve the static and time-dependent SLDA equations in three-dimensional coordinate space without any symmetry restriction. These codes are fully parallelized with the message passing interface (MPI) library and take advantage of graphic processing units (GPU) for accelerating execution. The dynamic codes have checkpoint/restart capabilities and for initial conditions one can use any generalized Slater determinant type of wave function. The code can describe a large number of physical problems: nuclear fission, collisions of heavy ions, the interaction of quantized vor- tices with nuclei in the nuclear star crust, excitation of superfluid fermion systems by time dependent external fields, quantum shock waves, domain wall generation and propagation, the dynamics of the Anderson-Bogoliubov-Higgs mode, dynamics of fragmented condensates, vortex rings dynamics, generation and dynamics of quantized vortices, their crossing and recombinations and the incipient phases of quantum turbulence.

Jin, Shi↗

Approximate Bayesian Model Inversion for PDEs with Heterogeneous and State-Dependent Coefficients

We present two approximate Bayesian inference methods for parameter estimation in partial differential equation (PDE) models with space-dependent and state-dependent parameters. We demonstrate that these methods provide accurate and cost-effective alternatives to Markov Chain Monte Carlo simulation. We assume a parameterized Gaussian prior on the unknown functions, and approximate the posterior density by a parameterized multivariate Gaussian density. The parameters of the prior and posterior are estimated from sparse observations of the PDE model's states and the unknown functions themselves by maximizing the evidence lower bound (ELBO), a lower bound on the log marginal likelihood of the observations. The first method, Laplace-EM, employs the expectation maximization algorithm to maximize the ELBO, with a Laplace approximation of the posterior on the E-step, and minimization of a Kullback-Leibler divergence on the M-step. The second method, DSVI-EB, employs the doubly stochastic variational inference (DSVI) algorithm, in which the ELBO is maximized via gradient-based stochastic optimization, with nosiy gradients computed via simple Monte Carlo sampling and Gaussian backpropagation. We apply these methods to identifying diffusion coefficients in linear and nonlinear diffusion equations, and we find that both methods provide accurate estimates of posterior densities and the hyperparameters of Gaussian priors. While the Laplace-EM method is more accurate, it requires computing Hessians of the physics model. The DSVI-EB method is found to be less accurate but only requires gradients of the physics model.

approximate Bayesian inference, model inversion, v↗