Search NASA⌕ Search

SEARCH · Search NASA

Results for “approximate computing”

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 1,549 records · Page 86

Towards time-dependent current-density-functional theory in the non-linear regime

Time-Dependent Density-Functional Theory (TDDFT) is a well-established theoretical approach to describe and understand irradiation processes in clusters and molecules. However, within the so-called adiabatic local density approximation (ALDA) to the exchange-correlation (xc) potential, TDDFT can show insufficiencies, particularly in violently dynamical processes. This is because within ALDA the xc potential is instantaneous and is a local functional of the density, which means that this approximation neglects memory effects and long-range effects. A way to go beyond ALDA is to use Time-Dependent Current-Density-Functional Theory (TDCDFT), in which the basic quantity is the current density rather than the density as in TDDFT. This has been shown to offer an adequate account of dissipation in the linear domain when the Vignale-Kohn (VK) functional is used. Here, we go beyond the linear regime and we explore this formulation in the time domain. In this case, the equations become very involved making the computation out of reach; we hence propose an approximation to the VK functional which allows us to calculate the dynamics in real time and at the same time to keep most of the physics described by the VK functional. We apply this formulation to the calculation of the time-dependent dipole moment of Ca, Mg and Na{sub 2}. Our results show trends similar to what was previously observed in model systems or within linear response. In the non-linear domain, our results show that relaxation times do not decrease with increasing deposited excitation energy, which sets some limitations to the practical use of TDCDFT in such a domain of excitations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Direct numerical simulations for hybrid rocket boundary layers: Performance modeling and scaling

This paper presents a comprehensive performance and scaling analysis of direct numerical simulations for reacting boundary layers, focusing on slab burner configurations. Using a PETSc-based finite volume CFD framework, the study evaluates the scalability and computational cost of flow, chemistry, and radiation evaluations across 2D and 3D simulations. Polymethyl methacrylate (PMMA) is the fuel with pure O 2 as the oxidizer, modeled using a detailed chemical kinetics mechanism with 113 species and 660 reactions. A ray-tracing-based radiation solver, designed for distributed memory applications, is implemented to model radiation heat transfer. Parallel scalability is analyzed for the coupled flow, chemistry, and radiation heat transfer processes. Weak and strong scaling studies are conducted on up to 15,000 computational ranks, revealing robust performance when flow cells exceed 200 per rank. Chemistry evaluations dominate the computational cost in large 3D simulations, accounting for approximately 40% of the total runtime, while flow processes contribute around 35%, and radiation solver contributions remain below 10% due to reduced evaluation frequencies. GPU accelerated chemistry evaluation, implemented with Zero-RK, demonstrates significant promise, achieving up to a 4x speedup for workloads exceeding 30,000 cells per GPU. However, diminishing returns are observed for smaller workloads due to CPU-GPU communication overhead. This study identifies key challenges, including memory bottlenecks and the effects of domain partitioning on flow scalability, while highlighting the potential of GPU-accelerated chemistry to reduce computational costs. In conclusion, these findings provide realizable run configurations for 2D, 3D, and GPU-accelerated cases, offering insights for optimizing reactive flow solvers.

CFD Scalability↗

Magneto-optical absorption in semiconducting spherical quantum dots: Influence of the dot-size, confining potential, and magnetic field

Semiconducting quantum dots – more fancifully dubbed artificial atoms – are quasi-zero dimensional, tiny, man-made systems with charge carriers completely confined in all three dimensions. The scientific quest behind the synthesis of quantum dots is to create and control future electronic and optical nanostructures engineered through tailoring size, shape, and composition. The complete confinement – or the lack of any degree of freedom for the electrons (and/or holes) – in quantum dots limits the exploration of spatially localized elementary excitations such as plasmons to direct rather than reciprocal space. Here we embark on a thorough investigation of the magneto-optical absorption in semiconducting spherical quantum dots characterized by a confining harmonic potential and an applied magnetic field in the symmetric gauge. This is done within the framework of Bohm-Pines’ random-phase approximation that enables us to derive and discuss the full Dyson equation that takes proper account of the Coulomb interactions. As an application of our theoretical strategy, we compute various single-particle and many-particle phenomena such as the Fock-Darwin spectrum; Fermi energy; magneto-optical transitions; probability distribution; and the magneto-optical absorption in the quantum dots. It is observed that the role of an applied magnetic field on the absorption spectrum is comparable to that of a confining potential. Increasing (decreasing) the strength of the magnetic field or the confining potential is found to be analogous to shrinking (expanding) the size of the quantum dots: resulting into a blue (red) shift in the absorption spectrum. The Fermi energy diminishes with both increasing magnetic-field and dot-size; and exhibits saw-tooth-like oscillations at large values of field or dot-size. Unlike laterally confined quantum dots, both (upper and lower) magneto-optical transitions survive even in the extreme instances. However, the intra-Landau level transitions are seen to be forbidden. The spherical quantum dots have an edge over the strictly two-dimensional quantum dots in that the additional (magnetic) quantum number makes the physics richer (but complex). A deeper grasp of the Coulomb blockade, quantum coherence, and entanglement can lead to a better insight into promising applications involving lasers, detectors, storage devices, and quantum computing.

36 MATERIALS SCIENCE↗

Theoretical transition probabilities, oscillator strengths, and radiative lifetimes of levels in Pb IV

Transition probabilities and oscillator strengths of 176 spectral lines with astrophysical interest arising from 5d{sup 10}ns (n = 7,8), 5d{sup 10}np (n = 6,7), 5d{sup 10}nd (n = 6,7), 5d{sup 10}5f, 5d{sup 10}5g, 5d{sup 10}nh (n = 6,7,8), 5d{sup 9}6s{sup 2}, and 5d{sup 9}6s6p configurations, and radiative lifetimes for 43 levels of Pb IV, have been calculated. These values were obtained in intermediate coupling (IC) and using relativistic Hartree-Fock calculations including core-polarization effects. For the IC calculations, we use the standard method of least-square fitting from experimental energy levels by means of the Cowan computer code. The inclusion in these calculations of the 5d{sup 10}7p and 5d{sup 10}5f configurations has facilitated a complete assignment of the energy levels in the Pb IV. Transition probabilities, oscillator strengths, and radiative lifetimes obtained are generally in good agreement with the experimental data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

THE BEHAVIOR OF TRANSVERSE WAVES IN NONUNIFORM SOLAR FLUX TUBES. I. COMPARISON OF IDEAL AND RESISTIVE RESULTS

Magnetohydrodynamic (MHD) waves are ubiquitously observed in the solar atmosphere. Kink waves are a type of transverse MHD waves in magnetic flux tubes that are damped due to resonant absorption. The theoretical study of kink MHD waves in solar flux tubes is usually based on the simplification that the transverse variation of density is confined to a nonuniform layer much thinner than the radius of the tube, i.e., the so-called thin boundary approximation. Here, we develop a general analytic method to compute the dispersion relation and the eigenfunctions of ideal MHD waves in pressureless flux tubes with transversely nonuniform layers of arbitrary thickness. Results for kink waves are produced and compared with fully numerical resistive MHD eigenvalue computations in the limit of small resistivity. We find that the frequency and resonant damping rate are the same in both ideal and resistive cases. The actual results for thick nonuniform layers deviate from the behavior predicted in the thin boundary approximation and strongly depend on the shape of the nonuniform layer. The eigenfunctions in ideal MHD are very different from those in resistive MHD. The ideal eigenfunctions display a global character regardless of the thickness of the nonuniform layer, while the resistive eigenfunctions are localized around the resonance and are indistinguishable from those of ordinary resistive Alfvén modes. Consequently, the spatial distribution of wave energy in the ideal and resistive cases is dramatically different. This poses a fundamental theoretical problem with clear observational consequences.

79 ASTRONOMY AND ASTROPHYSICS↗

Meromorphic approximants to complex Cauchy transforms with polar singularities

We study AAK-type meromorphic approximants to functions of the form F(z)={integral}(d{lambda}(t))/(z-t)+R(z), where R is a rational function and {lambda} is a complex measure with compact regular support included in (-1,1), whose argument has bounded variation on the support. The approximation is understood in the L{sup p}-norm of the unit circle, p{>=}2. We dwell on the fact that the denominators of such approximants satisfy certain non-Hermitian orthogonal relations with varying weights. They resemble the orthogonality relations that arise in the study of multipoint Pade approximants. However, the varying part of the weight implicitly depends on the orthogonal polynomials themselves, which constitutes the main novelty and the main difficulty of the undertaken analysis. We obtain that the counting measures of poles of the approximants converge to the Green equilibrium distribution on the support of {lambda} relative to the unit disc, that the approximants themselves converge in capacity to F, and that the poles of R attract at least as many poles of the approximants as their multiplicity and not much more. Bibliography: 35 titles.

97 MATHEMATICS AND COMPUTING↗

Estimating the Bias of Local Polynomial Approximations Using the Peano Kernel

These presentation visuals define local polynomial approximations, give formulas for bias and random components of the error, and express bias error in terms of the Peano kernel. They further derive constants that give figures of merit, and show the figures of merit for 3 common weighting functions. The Peano kernel theorem yields estimates for the bias error for local-polynomial-approximation smoothing that are superior in several ways to the error estimates in the current literature.

97 MATHEMATICS AND COMPUTING↗

An adhesive contact mechanics formulation based on atomistically induced surface traction

In this work, we have developed a novel multiscale computational contact formulation based on the generalized Derjuguin approximation for continua that are characterized by atomistically enriched constitutive relations in order to study macroscopic interaction between arbitrarily shaped deformable continua. The proposed adhesive contact formulation makes use of the microscopic interaction forces between individual particles in the interacting bodies. In particular, the double-layer volume integral describing the contact interaction (energy, force vector, matrix) is converted into a double-layer surface integral through a mathematically consistent approach that employs the divergence theorem and a special partitioning technique. The proposed contact model is formulated in the nonlinear continuum mechanics framework and implemented using the standard finite element method. With no large penalty constant, the stiffness matrix of the system will in general be well-conditioned, which is of great significance for quasi-static analysis. Three numerical examples are presented to illustrate the capability of the proposed method. Results indicate that with the same mesh configuration, the finite element computation based on the surface integral approach is faster and more accurate than the volume integral based approach. In addition, the proposed approach is energy preserving even in a very long dynamic simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Evidence for the utility of quantum computing before fault tolerance

Quantum computing promises to offer substantial speed-ups over its classical counterpart for certain problems. However, the greatest impediment to realizing its full potential is noise that is inherent to these systems. The widely accepted solution to this challenge is the implementation of fault-tolerant quantum circuits, which is out of reach for current processors. Here we report experiments on a noisy 127-qubit processor and demonstrate the measurement of accurate expectation values for circuit volumes at a scale beyond brute-force classical computation. We argue that this represents evidence for the utility of quantum computing in a pre-fault-tolerant era. These experimental results are enabled by advances in the coherence and calibration of a superconducting processor at this scale and the ability to characterize and controllably manipulate noise across such a large device. We establish the accuracy of the measured expectation values by comparing them with the output of exactly verifiable circuits. In the regime of strong entanglement, the quantum computer provides correct results for which leading classical approximations such as pure-state-based 1D (matrix product states, MPS) and 2D (isometric tensor network states, isoTNS) tensor network methods break down. These experiments demonstrate a foundational tool for the realization of near-term quantum applications.

97 MATHEMATICS AND COMPUTING↗

Analytical effective tensor for flow-through composites

A machine, method and computer-usable medium for modeling an average flow of a substance through a composite material. Such a modeling includes an analytical calculation of an effective tensor K.sup.a suitable for use with a variety of media. The analytical calculation corresponds to an approximation to the tensor K, and follows by first computing the diagonal values, and then identifying symmetries of the heterogeneity distribution. Additional calculations include determining the center of mass of the heterogeneous cell and its angle according to a defined Cartesian system, and utilizing this angle into a rotation formula to compute the off-diagonal values and determining its sign.

42 ENGINEERING↗

Metaplectic geometrical optics for modeling caustics in uniform and non-uniform media

As an approximate theory that is highly regarded for its computational efficiency, geometrical optics (GO) is widely used for modeling waves in various areas of physics. However, GO fails at caustics, which significantly limits its applicability. A new framework, called metaplectic geometrical optics (MGO), has recently been developed that allows caustics of certain types to be modeled accurately within the GO framework. Here, we extend MGO to the most general case. Further, to illustrate our new theory, we also apply it to several sample problems, including calculations of two-dimensional wavefields near fold and cusp caustics. In contrast with traditional GO solutions, the corresponding MGO solutions are finite everywhere and approximate the true wavefield well near these caustics.

79 ASTRONOMY AND ASTROPHYSICS↗

An adaptive Hessian approximated stochastic gradient MCMC method

Bayesian approaches have been successfully integrated into training deep neural networks. One popular family is stochastic gradient Markov chain Monte Carlo methods (SG-MCMC), which have gained increasing interest due to their ability to handle large datasets and the potential to avoid overfitting. Although standard SG-MCMC methods have shown great performance in a variety of problems, they may be inefficient when the random variables in the target posterior densities have scale differences or are highly correlated. Here, we present an adaptive Hessian approximated stochastic gradient MCMC method to incorporate local geometric information while sampling from the posterior. The idea is to apply stochastic approximation (SA) to sequentially update a preconditioning matrix at each iteration. The preconditioner possesses second-order information and can guide the random walk of a sampler efficiently. Instead of computing and saving the full Hessian of the log posterior, we use limited memory of the samples and their stochastic gradients to approximate the inverse Hessian-vector multiplication in the updating formula. Moreover, by smoothly optimizing the preconditioning matrix via SA, our proposed algorithm can asymptotically converge to the target distribution with a controllable bias under mild conditions. To reduce the training and testing computational burden, we adopt a magnitude-based weight pruning method to enforce the sparsity of the network. Our method is user-friendly and demonstrates better learning results compared to standard SG-MCMC updating rules. The approximation of inverse Hessian alleviates storage and computational complexities for large dimensional models. Numerical experiments are performed on several problems, including sampling from 2D correlated distribution, synthetic regression problems, and learning the numerical solutions of heterogeneous elliptic PDE. The numerical results demonstrate great improvement in both the convergence rate and accuracy.

97 MATHEMATICS AND COMPUTING↗

Computing the partition function, ensemble averages, and density of states for lattice spin systems by sampling the mean

An algorithm to approximately calculate the partition function (and subsequently ensemble averages) and density of states of lattice spin systems through non-Monte-Carlo random sampling is developed. This algorithm (called the sampling-the-mean algorithm) can be applied to models where the up or down spins at lattice nodes interact to change the spin states of other lattice nodes, especially non-Ising-like models with long-range interactions such as the biological model considered here. Because it is based on the Central Limit Theorem of probability, the sampling-the-mean algorithm also gives estimates of the error in the partition function, ensemble averages, and density of states. Easily implemented parallelization strategies and error minimizing sampling strategies are discussed. The sampling-the-mean method works especially well for relatively small systems, systems with a density of energy states that contains sharp spikes or oscillations, or systems with little a priori knowledge of the density of states.

97 MATHEMATICS AND COMPUTING↗

Globally Optimizing QAOA Circuit Depth for Constrained Optimization Problems

We develop a global variable substitution method that reduces n-variable monomials in combinatorial optimization problems to equivalent instances with monomials in fewer variables. We apply this technique to 3-SAT and analyze the optimal quantum unitary circuit depth needed to solve the reduced problem using the quantum approximate optimization algorithm. For benchmark 3-SAT problems, we find that the upper bound of the unitary circuit depth is smaller when the problem is formulated as a product and uses the substitution method to decompose gates than when the problem is written in the linear formulation, which requires no decomposition.

3-SAT↗

A comparison of global optimization algorithms with standard benchmark functions and real-world applications using Energy Plus

There is an increasing interest in the use of computer algorithms to identify combinations of parameters which optimise the energy performance of buildings. For such problems, the objective function can be multi-modal and needs to be approximated numerically using building energy simulation programs. As these programs contain iterative solution algorithms, they introduce discontinuities in the numerical approximation to the objective function. Metaheuristics often work well for such problems, but their convergence to a global optimum cannot be established formally. Moreover, different algorithms tend to be suited to particular classes of optimization problems. To shed light on this issue we compared the performance of two metaheuristics, the hybrid CMA-ES/HDE and the hybrid PSO/HJ, in minimizing standard benchmark functions and real-world building energy optimization problems of varying complexity. From this we find that the CMA-ES/HDE performs well on more complex objective functions, but that the PSO/HJ more consistently identifies the global minimum for simpler objective functions. Both identified similar values in the objective functions arising from energy simulations, but with different combinations of model parameters. This may suggest that the objective function is multi-modal. The algorithms also correctly identified some non-intuitive parameter combinations that were caused by a simplified control sequence of the building energy system that does not represent actual practice, further reinforcing their utility.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Hierarchical off-diagonal low-rank approximation of Hessians in inverse problems, with application to ice sheet model initialization

Obtaining lightweight and accurate approximations of discretized objective functional Hessians in inverse problems governed by partial differential equations (PDEs) is essential to make both deterministic and Bayesian statistical large-scale inverse problems computationally tractable. The cubic computational complexity of dense linear algebraic tasks, such as Cholesky factorization, that provide a means to sample Gaussian distributions and determine solutions of Newton linear systems is a computational bottleneck at large-scale. These tasks can be reduced to log-linear complexity by utilizing hierarchical off-diagonal low-rank (HODLR) matrix approximations. In this work, we show that a class of Hessians that arise from inverse problems governed by PDEs are well approximated by the HODLR matrix format. In particular, we study inverse problems governed by PDEs that model the instantaneous viscous flow of ice sheets. In these problems, we seek a spatially distributed basal sliding parameter field such that the flow predicted by the ice sheet model is consistent with ice sheet surface velocity observations. Here, we demonstrate the use of HODLR Hessian approximation to efficiently sample the Laplace approximation of the posterior distribution with covariance further approximated by HODLR matrix compression. Computational studies are performed which illustrate ice sheet problem regimes for which the Gauss–Newton data-misfit Hessian is more efficiently approximated by the HODLR matrix format than the low-rank (LR) format. We then demonstrate that HODLR approximations can be favorable, when compared to global LR approximations, for large-scale problems by studying the data-misfit Hessian associated with inverse problems governed by the first-order Stokes flow model on the Humboldt glacier and Greenland ice sheet.

97 MATHEMATICS AND COMPUTING↗

Variational principles with Padé approximants for tearing mode analysis

Tearing modes occur in several distinct physical regimes, and it is often important to compute the inner layer response for these modes with various effects. There is a need for an approximate and efficient method of solving the inner layer equations in all these regimes. In this paper, we introduce a method of solving the inner layer equations based on using a variational principle with Padé approximants. For all the regimes considered, the main layer equations to be solved are inhomogeneous, and Padé approximants give a convenient and efficient method of satisfying the correct asymptotic behavior at the edge of the layer. Results using this variational principle—Padé approximant method in three of these regimes is presented. These regimes are the constant-ψ resistive-inertial (RI) regime, the constant-ψ viscoresistive regime, and the non-constant-ψ inviscid tearing regime. The last regime includes the constant-ψ RI regime and the inertial regime. The results show that reasonable accuracy can be obtained very efficiently with Padé approximants having a small number of parameters.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Weighted greedy-optimal design of computer experiments for kernel-based and Gaussian process model emulation and calibration

This article is concerned with the approximation of high-dimensional functions by kernel-based methods. Motivated by uncertainty quantification, which often necessitates the construction of approximations that are accurate with respect to a probability density function of random variables, we aim at minimizing the approximation error with respect to a weighted $L^p$-norm. We present a greedy procedure for designing computer experiments based upon a weighted modification of the pivoted Cholesky factorization. The method successively generates nested samples with the goal of minimizing error in regions of high probability. Numerical experiments validate that this new importance sampling strategy is superior to other sampling approaches, especially when used with non-product probability density functions. We also show how to use the proposed algorithm to efficiently generate surrogates for inferring unknown model parameters from data.

97 MATHEMATICS AND COMPUTING↗