Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “functional approximation”

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 451 records · Page 25

Nonlinear electronic excitations in crystalline solids using meta-generalized gradient approximation and hybrid functional in time-dependent density functional theory

We develop methods to calculate electron dynamics in crystalline solids in real-time time-dependent density functional theory employing exchange-correlation potentials which reproduce band gap energies of dielectrics; a meta-generalized gradient approximation was proposed by Tran and Blaha [Phys. Rev. Lett. 102, 226401 (2009)] (TBm-BJ) and a hybrid functional was proposed by Heyd, Scuseria, and Ernzerhof [J. Chem. Phys. 118, 8207 (2003)] (HSE). In time evolution calculations employing the TB-mBJ potential, we have found it necessary to adopt the predictor-corrector step for a stable time evolution. We have developed a method to evaluate electronic excitation energy without referring to the energy functional which is unknown for the TB-mBJ potential. For the HSE functional, we have developed a method for the operation of the Fock-like term in Fourier space to facilitate efficient use of massive parallel computers equipped with graphic processing units. We compare electronic excitations in silicon and germanium induced by femtosecond laser pulses using the TB-mBJ, HSE, and a simple local density approximation (LDA). At low laser intensities, electronic excitations are found to be sensitive to the band gap energy: they are close to each other using TB-mBJ and HSE and are much smaller in LDA. At high laser intensities close to the damage threshold, electronic excitation energies do not differ much among the three cases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Combining Comparison Functions and Finite Element Approximations in CFD

In a variety of potential flow applications, the modal element method has been shown to significantly reduce the numerical grid, employ a more precise grid termination boundary condition, and give theoretical insight to the flow physics. The method employs eigenfunctions to replace the numerical grid over significant portions of the flow field. Generally, a numerical grid is employed around obstacles with complex geometry while eigenfunctions are applied to regions in the flow field where the boundary conditions can easily be satisfied. To handle a wider class of computational fluid dynamics (CFD) problems, the present paper extends the modal element to include function approximations which do not satisfy the governing differential equation. To accomplish this task, a double modal series approximation and weighted residual constraints are developed to force the comparison functions to satisfy the governing differential equation and to interface properly with the finite element solution. As an example, the method is applied to the problem of potential flow in a channel with two-dimensional cylindrical like obstacles. The calculated flow fields are in excellent agreement with exact analytical solutions.

Baumeister, Kenneth J.↗

Constrained Chebyshev approximations to some elementary functions suitable for evaluation with floating point arithmetic

Approximations which can be evaluated with precision using floating-point arithmetic are presented. The particular set of approximations thus far developed are for the function TAN and the functions of USASI FORTRAN excepting SQRT and EXPONENTIATION. These approximations are, furthermore, specialized to particular forms which are especially suited to a computer with a small memory, in that all of the approximations can share one general purpose subroutine for the evaluation of a polynomial in the square of the working argument.

Manos, P.↗

Nonlinear Matrix Approximation with Radial Basis Function Components

We introduce and investigate matrix approximation by decomposition into a sum of radial basis function (RBF) components. An RBF component is a generalization of the outer product between a pair of vectors, where an RBF function replaces the scalar multiplication between individual vector elements. Even though the RBF functions are positive definite, the summation across components is not restricted to convex combinations and allows us to compute the decomposition for any real matrix that is not necessarily symmetric or positive definite. We formulate the problem of seeking such a decomposition as an optimization problem with a nonlinear and non-convex loss function. Several modern versions of the gradient descent method, including their scalable stochastic counterparts, are used to solve this problem. We provide extensive empirical evidence of the effectiveness of the RBF decomposition and that of the gradient-based fitting algorithm. While being conceptually motivated by singular value decomposition (SVD), our proposed nonlinear counterpart outperforms SVD by drastically reducing the memory required to approximate a data matrix with the same L2 error for a wide range of matrix types. For example, it leads to 2 to 6 times memory save for Gaussian noise, graph adjacency matrices, and kernel matrices. Moreover, this proximity-based decomposition can offer additional interpretability in applications that involve, e.g., capturing the inner low-dimensional structure of the data, retaining graph connectivity structure, and preserving the acutance of images.

Rebrova, Elizaveta↗

Approximate Green's function methods for HZE transport in multilayered materials

A nonperturbative analytic solution of the high charge and energy (HZE) Green's function is used to implement a computer code for laboratory ion beam transport in multilayered materials. The code is established to operate on the Langley nuclear fragmentation model used in engineering applications. Computational procedures are established to generate linear energy transfer (LET) distributions for a specified ion beam and target for comparison with experimental measurements. The code was found to be highly efficient and compared well with the perturbation approximation.

Wilson, John W.↗

A Fast Algorithm for the Convolution of Functions with Compact Support Using Fourier Extensions

In this paper, we present a new algorithm for computing the convolution of two compactly supported functions. The algorithm approximates the functions to be convolved using Fourier extensions and then uses the fast Fourier transform to efficiently compute Fourier extension approximations to the pieces of the result. Finally, the complexity of the algorithm is O(N(log N) 2 ), where N is the number of degrees of freedom used in each of the Fourier extensions.

97 MATHEMATICS AND COMPUTING↗

A physically realistic approximate form for the redistribution function R(II-A)

An approximation is proposed to the redistribution function R(II-A) (coherent, isotropic scattering in the rest frame of the atom) which is fast to compute and attains much higher accuracy than previous approximations for the astrophysically important case of small Voigt parameters. Further, the new approximation permits the diffusion in frequency of wing photons ('Doppler drifting') which is lost in one of the widely-used versions of the R(II-A) approximation schemes: Kneer's normalization of the Jefferies-White formulation.

Ayres, T. R.↗

A linear surrogate for optimising functions of an orthogonal matrix with applications in wave function theory

The technique of surrogate optimisation is to use a simpler function to approximate a complex function that is time-consuming to evaluate. Here we show that the maximum of a special type of surrogate function f(U)=Tr(AU),UϵO(n) is at A T (AA T ) 1/2 , and that there is one and only one local maximum both in SO(n) and O(n)–SO(n). This function f(U) has been found to be useful in various aspects of electronic structure theory, including proving the Carlson-Keller theorem, and localising orbitals. As one other example, we apply it here to optimise the ground state of molecules using the Generalised Valence Bond wavefunction.

74 ATOMIC AND MOLECULAR PHYSICS↗

Multiscale Neural Networks for Approximating Green’s Functions

Neural networks (NNs) have been widely used to solve partial differential equations (PDEs) in the applications of physics, biology, and engineering. One effective approach for solving PDEs with a fixed differential operator is learning Green’s functions. However, Green’s functions are notoriously difficult to learn due to their poor regularity, which typically requires larger NNs and longer training times. In this work, we address these challenges by leveraging multiscale NNs to learn Green’s functions. Through theoretical analysis using multiscale Barron space methods and experimental validation, we show that the multiscale approach significantly reduces the necessary NN size and accelerates training.

97 MATHEMATICS AND COMPUTING↗

The determination of gravity anomalies from geoid heights using the inverse Stokes' formula, Fourier transforms, and least squares collocation

A numerical method for the determination of gravity anomalies from geoid heights is described using the inverse Stokes formula. This discrete form of the inverse Stokes formula applies a numerical integration over the azimuth and an integration over a cubic interpolatory spline function which approximates the step function obtained from the numerical integration. The main disadvantage of the procedure is the lack of a reliable error measure. The method was applied on geoid heights derived from GEOS-3 altimeter measurements in the calibration area of the GEOS-3 satellite.

Rummel, R.↗