Search NASA⌕ Search

SEARCH · Search NASA

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 487 records · Page 27

A step in the direction of resolving the paradox of Perdew–Zunger self-interaction correction. II. Gauge consistency of the energy density at three levels of approximation

The Perdew-Zunger(PZ) self-interaction correction (SIC) was designed to correct the one-electron limit of any approximate density functional for the exchange-correlation (xc) energy, while yielding no correction to the exact functional. Unfortunately, it spoils the slowly-varying-in-space limits of the uncorrected approximate functionals, where those functionals are right by construction. The right limits can be restored by locally scaling down the energy density of the PZ SIC in many-electron regions, but then a spurious correction to the exact functional would be found unless the self-Hartree and exact self-xc terms of the PZ SIC energy density were expressed in the same gauge. Only the local density approximation satisfies the same-gauge condition for the energy density, which explains why the recent local-scaling SIC (LSIC) is found here to work excellently for atoms and molecules only with this basic approximation, and not with the more advanced generalized gradient approximations (GGAs) and meta-GGAs, which lose the Hartree gauge via simplifying integrations by parts. The transformation of energy density that achieves the Hartree gauge for the exact xc functional can also be applied to approximate functionals. Doing so leads to a simple scaled-down self-interaction (sdSIC) correction that is typically much more accurate than PZ SIC in tests for many molecular properties (including equilibrium bond lengths). The present work shows unambiguously that the largest errors of PZ SIC applied to standard functionals at three levels of approximation can be removed by restoring their correct slowlyvarying- density limits. Here, it also confirms the relevance of these limits to atoms and molecules.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Koopmans' condition for density-functional theory

In approximate Kohn-Sham density-functional theory, self-interaction manifests itself as the dependence of the energy of an orbital on its fractional occupation. This unphysical behavior translates into qualitative and quantitative errors that pervade many fundamental aspects of density-functional predictions. Here, we first examine self-interaction in terms of the discrepancy between total and partial electron removal energies, and then highlight the importance of imposing the generalized Koopmans' condition - that identifies orbital energies as opposite total electron removal energies - to resolve this discrepancy. In the process, we derive a correction to approximate functionals that, in the frozen-orbital approximation, eliminates the unphysical occupation dependence of orbital energies up to the third order in the single-particle densities. This non-Koopmans correction brings physical meaning to single-particle energies; when applied to common local or semilocal density functionals it provides results that are in excellent agreement with experimental data - with an accuracy comparable to that of GW many-body perturbation theory - while providing an explicit total energy functional that preserves or improves on the description of established structural properties.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

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.↗

Convergence of multipoint Pade approximants of piecewise analytic functions

The behaviour as n{yields}{infinity} of multipoint Pade approximants to a function which is (piecewise) holomorphic on a union of finitely many continua is investigated. The convergence of multipoint Pade approximants is proved for a function which extends holomorphically from these continua to a union of domains whose boundaries have a certain symmetry property. An analogue of Stahl's theorem is established for two-point Pade approximants to a pair of functions, either of which is a multivalued analytic function with finitely many branch points. Bibliography: 11 titles.

97 MATHEMATICS AND COMPUTING↗

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↗

ATOMIC PARTITION FUNCTION FOR STELLAR ATMOSPHERES AND PLASMA DIAGNOSTICS

A new approximate partition function is derived as a function of temperature and total number density of particles in the given system, and three adjustable parameters. The derivation assumes that we can simulate the calculations of the partition function for hydrogen by means of averages of the energies and sums of the statistical weights. We present the procedure and mathematical process to obtain an approximate analytic function and its derivatives that depend on those parameters. The comparisons with other calculations reported in the literature show good agreement. The free parameters of this function are calculated and given in a table for all the ions of the first 20 atomic species.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

Combining density-functional theory and density-matrix-functional theory

We combine density-functional theory with density-matrix-functional theory to draw the best from both worlds. This is achieved by range separation of the electronic interaction which permits one to rigorously combine a short-range density functional with a long-range density-matrix functional. The short-range density functional is approximated by the short-range version of the Perdew-Burke-Ernzerhof functional (srPBE). The long-range density-matrix functional is approximated by the long-range version of the Buijse-Baerends functional (lrBB). The obtained srPBE+lrBB method accurately describes both the static and dynamic electron correlation at a computational cost similar to that of standard density-functional approximations. This is shown for the dissociation curves of the H{sub 2}, LiH, BH, and HF molecules.

74 ATOMIC AND MOLECULAR PHYSICS↗

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.↗

An adaptive regularization parameter choice strategy for multispectral bioluminescence tomography

Purpose: Bioluminescence tomography (BLT) provides an effective tool for monitoring physiological and pathological activities in vivo. However, the measured data in bioluminescence imaging are corrupted by noise. Therefore, regularization methods are commonly used to find a regularized solution. Nevertheless, for the quality of the reconstructed bioluminescent source obtained by regularization methods, the choice of the regularization parameters is crucial. To date, the selection of regularization parameters remains challenging. With regards to the above problems, the authors proposed a BLT reconstruction algorithm with an adaptive parameter choice rule. Methods: The proposed reconstruction algorithm uses a diffusion equation for modeling the bioluminescent photon transport. The diffusion equation is solved with a finite element method. Computed tomography (CT) images provide anatomical information regarding the geometry of the small animal and its internal organs. To reduce the ill-posedness of BLT, spectral information and the optimal permissible source region are employed. Then, the relationship between the unknown source distribution and multiview and multispectral boundary measurements is established based on the finite element method and the optimal permissible source region. Since the measured data are noisy, the BLT reconstruction is formulated as l{sub 2} data fidelity and a general regularization term. When choosing the regularization parameters for BLT, an efficient model function approach is proposed, which does not require knowledge of the noise level. This approach only requests the computation of the residual and regularized solution norm. With this knowledge, we construct the model function to approximate the objective function, and the regularization parameter is updated iteratively. Results: First, the micro-CT based mouse phantom was used for simulation verification. Simulation experiments were used to illustrate why multispectral data were used rather than monochromatic data. Furthermore, the study conducted using an adaptive regularization parameter demonstrated our ability to accurately localize the bioluminescent source. With the adaptively estimated regularization parameter, the reconstructed center position of the source was (20.37, 31.05, 12.95) mm, and the distance to the real source was 0.63 mm. The results of the dual-source experiments further showed that our algorithm could localize the bioluminescent sources accurately. The authors then presented experimental evidence that the proposed algorithm exhibited its calculated efficiency over the heuristic method. The effectiveness of the new algorithm was also confirmed by comparing it with the L-curve method. Furthermore, various initial speculations regarding the regularization parameter were used to illustrate the convergence of our algorithm. Finally, in vivo mouse experiment further illustrates the effectiveness of the proposed algorithm. Conclusions: Utilizing numerical, physical phantom and in vivo examples, we demonstrated that the bioluminescent sources could be reconstructed accurately with automatic regularization parameters. The proposed algorithm exhibited superior performance than both the heuristic regularization parameter choice method and L-curve method based on the computational speed and localization error.

61 RADIATION PROTECTION AND DOSIMETRY↗

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↗