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,189 records · Page 66

Many-Body Green Function of Degenerate Systems

A rigorous nonperturbative adiabatic approximation of the evolution operator in the many-body physics of degenerate systems is derived. This approximation is used to solve the long-standing problem of the choice of the initial states of H{sub 0} leading to eigenstates of H{sub 0}+V for degenerate systems. These initial states are eigenstates of P{sub 0}VP{sub 0}, where P{sub 0} is the projection onto a degenerate eigenspace of H{sub 0}. This result is used to give the proper definition of the Green function, the statistical Green function and the nonequilibrium Green function of degenerate systems. The convergence of these Green functions is established.

97 MATHEMATICS AND COMPUTING↗

WearGP: A computationally efficient machine learning framework for local erosive wear predictions via nodal Gaussian processes

Computational fluid dynamics (CFD)-based wear predictions are computationally expensive to evaluate, even with a high-performance computing infrastructure. Thus, it is difficult to provide accurate local wear predictions in a timely manner. Data-driven approaches provide a more computationally efficient way to approximate the CFD wear predictions without running the actual CFD wear models. In this paper, a machine learning (ML) approach, termed WearGP, is presented to approximate the 3D local wear predictions, using numerical wear predictions from steady-state CFD simulations as training and testing datasets. The proposed framework is built on Gaussian process (GP) and utilized to predict wear in a much shorter time. The WearGP framework can be segmented into three stages. At the first stage, the training dataset is built by using a number of CFD simulations in the order of O (10 2 ). At the second stage, the data cleansing and data mining process are performed, where the nodal wear solutions are extracted from the solution database to build a training dataset. At the third stage, the wear predictions are made, using trained GP processes. Two CFD case studies including 3D slurry pump impeller and casing are used to demonstrate the WearGP framework, in which 144 training and 40 testing data points are used to train and test the proposed method, respectively. The numerical accuracy, computational effiency and effectiveness between the WearGP framework and CFD wear model for both slurry pump impellers and casings are compared. It is shown that the WearGP framework can achieve highly accurate results that are comparable with the CFD results, with a relatively small size training dataset, with a computational time reduction in an order of 10 5 to 10 6 .

42 ENGINEERING↗

Compact finite difference schemes for the time fractional diffusion equation with nonlocal boundary conditions

Fourth-order compact finite difference schemes for solving the time fractional diffusion equation with nonlocal boundary conditions are considered in this paper. The second-order derivative in one space variable is approximated by a fourth-order compact finite difference. Two different time derivatives, the Caputo derivative and Riemann–Liouville derivative are considered in the equations that we discuss. The Caputo time derivative is discretized by the L1-approximation and a second-order approximation is used for the Riemann–Liouville derivative. Stability analysis using the discrete energy method for Scheme I is given, and error estimation of this scheme is derived by conducting the local truncation error analysis, using the stability result. Numerical results are provided to show that both two fully discrete schemes have fourth-order accuracy in space, and 2−γ order of accuracy in time for Scheme I with γ being the order of the fractional derivative, while Scheme II has second-order accuracy in time when the theoretical solutions are smooth with zero initial values.

97 MATHEMATICS AND COMPUTING↗

Local bilinear computation of Jacobi sets

Abstract We propose a novel method for the computation of Jacobi sets in 2D domains. The Jacobi set is a topological descriptor based on Morse theory that captures gradient alignments among multiple scalar fields, which is useful for multi-field visualization. Previous Jacobi set computations use piecewise linear approximations on triangulations that result in discretization artifacts like zig-zag patterns. In this paper, we utilize a local bilinear method to obtain a more precise approximation of Jacobi sets by preserving the topology and improving the geometry. Consequently, zig-zag patterns on edges are avoided, resulting in a smoother Jacobi set representation. Our experiments show a better convergence with increasing resolution compared to the piecewise linear method. We utilize this advantage with an efficient local subdivision scheme. Finally, our approach is evaluated qualitatively and quantitatively in comparison with previous methods for different mesh resolutions and across a number of synthetic and real-world examples.

97 MATHEMATICS AND COMPUTING↗

A Cartesian grid embedded boundary method for solving the Poisson and heat equations with discontinuous coefficients in three dimensions

We present a method for solving Poisson and heat equations with discon- tinuous coefficients in two- and three-dimensions. It uses a Cartesian cut-cell/embedded boundary method to represent the interface between materi- als, as described in Johansen& Colella (1998). Matching conditions across the interface are enforced using an approximation to fluxes at the boundary. Overall second order accuracy is achieved, as indicated by an array of tests using non-trivial interface geometries. Both the elliptic and heat solvers are shown to remain stable and efficient for material coefficient contrasts up to 106, thanks in part to the use of geometric multigrid. A test of accuracy when adaptive mesh refinement capabilities are utilized is also performed. An example problem relevant to nuclear reactor core simulation is presented, demonstrating the ability of the method to solve problems with realistic physical parameters.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Solutions to higher-order anisotropic parabolic equations in unbounded domains

The paper is devoted to a certain class of doubly nonlinear higher-order anisotropic parabolic equations. Using Galerkin approximations it is proved that the first mixed problem with homogeneous Dirichlet boundary condition has a strong solution in the cylinder D=(0,∞)×Ω, where Ω⊂R{sup n}, n≥3, is an unbounded domain. When the initial function has compact support the highest possible rate of decay of this solution as t→∞ is found. An upper estimate characterizing the decay of the solution is established, which is close to the lower estimate if the domain is sufficiently 'narrow'. The same authors have previously obtained results of this type for second order anisotropic parabolic equations. Bibliography: 29 titles.

97 MATHEMATICS AND COMPUTING↗

Classical Benchmarks for Variational Quantum Eigensolver Simulations of the Hubbard Model

Simulating the Hubbard model is of great interest to a wide range of applications within condensed matter physics, however its solution on classical computers remains challenging in dimensions larger than one. The relative simplicity of this model, embodied by the sparseness of the Hamiltonian matrix, allows for its efficient implementation on quantum computers, and for its approximate solution using variational algorithms such as the variational quantum eigensolver. While these algorithms have been shown to reproduce the qualitative features of the Hubbard model, their quantitative accuracy in terms of producing true ground state energies and other properties, and the dependence of this accuracy on the system size and interaction strength, the choice of variational ansatz, and the degree of spatial inhomogeneity in the model, remains unknown. Here we present a rigorous classical benchmarking study, demonstrating the potential impact of these factors on the accuracy of the variational solution of the Hubbard model on quantum hardware, for systems with up to 32 qubits. We find that even when using the most accurate wavefunction ansätze for the Hubbard model, the error in its ground state energy and wavefunction plateaus for larger lattices, while stronger electronic correlations magnify this issue. Concurrently, spatially inhomogeneous parameters and the presence of off-site Coulomb interactions only have a small effect on the accuracy of the computed ground state energies. Our study highlights the capabilities and limitations of current approaches for solving the Hubbard model on quantum hardware, and we discuss potential future avenues of research.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Compact video content representation for video coding using low multi-linear tensor rank approximation with dynamic core tensor order

Tensor is a multi-way representation of an entity that is widely used in many applications of mathematics and physics. The wide range of tensor algebra operations attract the researchers of graphical and vision field to identify unique methods for various applications such as segmentation, compression, indexing and so on. In this paper, low multi-linear rank approximation of a tensor is used for decomposition so as to perform compression on a video that is represented as a 4D tensor. Thus, the encoder has blocks for (1) multilinear rank approximation method so as to aid decomposition, (2) sparsity removal of residual data to reduce the required memory storage to a small level, (3) quantization on the sparse less residual data and (4) LZ77 dictionary coding for the video. The decoder uses a tensor reconstruction block along with residual error correction block that reduces loss/error in the reconstructed video. The size of core tensor is an important factor in rank approximation. It is identified at run time depending on the video contents. This size is determined adaptively using Tikhonov’s regularization method. The best value of core tensor size is identified with the corner of L-curve which preserves the video contents from heavy loss/error. Experimental results of the proposed work on comparison with H.264/AVC compression method indicate that the proposed method achieves up to 10% improvement in compression ratio with the least amount of loss and a maximum signal to noise ratio of 0.14. The proposed system gives better compression ratio than H.265 for videos with more number of frames without compromising quality.

97 MATHEMATICS AND COMPUTING↗

2D/1D approximations to the 3D neutron transport equation. I: Theory

A new class of '2D/1D' approximations is proposed for the 3D linear Boltzmann equation. These approximate equations preserve the exact transport physics in the radial directions x and y and diffusion physics in the axial direction z. Thus, the 2D/1D equations are more accurate approximations of the 3D Boltzmann equation than the conventional 3D diffusion equation. The 2D/1D equations can be systematically discretized, to yield accurate simulation methods for 3D reactor core problems. The resulting solutions will be more accurate than 3D diffusion solutions, and less expensive to generate than standard 3D transport solutions. In this paper, we (i) show that the simplest 2D/1D equation has certain desirable properties, (ii) systematically discretize this equation, and (iii) derive a stable iteration scheme for solving the discrete system of equations. In a companion paper [1], we give numerical results that confirm the theoretical predictions of accuracy and iterative stability. (authors)

97 MATHEMATICS AND COMPUTING↗

Nonperturbative gravity corrections to bulk reconstruction

Abstract We introduce a new algebraic framework for understanding nonperturbative gravitational aspects of bulk reconstruction with a finite or infinite-dimensional boundary Hilbert space. We use relative entropy equivalence between bulk and boundary with an inclusion of nonperturbative gravitational errors, which give rise to approximate recovery. We utilize the privacy/correctability correspondence to prove that the reconstruction wedge, the intersection of all entanglement wedges in pure and mixed states, manifestly satisfies bulk reconstruction. We explicitly demonstrate that local operators in the reconstruction wedge of a given boundary region can be recovered in a state-independent way for arbitrarily large code subspaces, up to nonperturbative errors in G N . We further discuss state-dependent recovery beyond the reconstruction wedge and the use of the twirled Petz map as a universal recovery channel. We discuss our setup in the context of quantum islands and the information paradox.

97 MATHEMATICS AND COMPUTING↗

Modifications of functions, Fourier coefficients and nonlinear approximation

This work continues the author's investigations of the convergence of greedy algorithms from the standpoint of classical results on correction of functions. In particular, the following result is obtained: for each {epsilon}, 0<{epsilon}<1, there exists a measurable set E subset of [0,1) of measure |E|>1-{epsilon} such that for each function f element of L{sup 1}[0,1) a function f-tilde element of L{sup 1}(0,1) equal to f on E can be found such that the greedy algorithm for f-tilde with respect to the Walsh system converges to it almost everywhere on [0,1], and all the nonzero elements of the sequence of Walsh-Fourier coefficients of the function thus obtained are arranged in decreasing order of their absolute values. Bibliography: 35 titles.

97 MATHEMATICS AND COMPUTING↗

Truncated multiGaussian fields and effective conductance of binary media.

Truncated Gaussian fields provide a flexible model for defining binary media with dispersed (as opposed to layered) inclusions. General properties of excursion sets on these truncated fields are coupled with a distance-based upscaling algorithm and approximations of point process theory to develop an estimation approach for effective conductivity in two-dimensions. Estimation of effective conductivity is derived directly from knowledge of the kernel size used to create the multiGaussian field, defined as the full-width at half maximum (FWHM), the truncation threshold and conductance values of the two modes. Therefore, instantiation of the multiGaussian field is not necessary for estimation of the effective conductance. The critical component of the effective medium approximation developed here is the mean distance between high conductivity inclusions. This mean distance is characterized as a function of the FWHM, the truncation threshold and the ratio of the two modal conductivities. Sensitivity of the resulting effective conductivity to this mean distance is examined for two levels of contrast in the two modal conductances and different FWHM sizes. Results demonstrate that the FWHM is a robust measure of mean travel distance in the background medium. The resulting effective conductivities are accurate when compared to numerical results and results obtained from effective media theory, distance-based upscaling and numerical simulation.

97 MATHEMATICS AND COMPUTING↗

Interaction and merging of vortex filaments

The asymptotic solutions of Navier-Stokes equations for vortex filaments of finite strength with small effective vortical cores are summarized with special emphasis placed on the physical meaning and the practical limit to the applicability of the asymptotic solution. Finite-difference solutions of Navier-Stokes equations for the marging of the filament(s) are described with a focus on the development of the approximate boundary conditions for the computational domain. An efficiency study employing a model problem is used to assess the advantages of the present approximate boundary condition method over previously used techniques. Applications of the present method are presented for the motion and decay of a 3:1 elliptic vortex ring, and for the merging process of a pair of coaxial vortex rings. A numerical procedure for the problem of local merging of vortex filaments, which requires the asymptotic analysis as well as the numerical Navier-Stokes solver, is also presented.

Liu, C. H.↗

Shape sensitivity analysis of flutter response of a laminated wing

A method is presented for calculating the shape sensitivity of a wing aeroelastic response with respect to changes in geometric shape. Yates' modified strip method is used in conjunction with Giles' equivalent plate analysis to predict the flutter speed, frequency, and reduced frequency of the wing. Three methods are used to calculate the sensitivity of the eigenvalue. The first method is purely a finite difference calculation of the eigenvalue derivative directly from the solution of the flutter problem corresponding to the two different values of the shape parameters. The second method uses an analytic expression for the eigenvalue sensitivities of a general complex matrix, where the derivatives of the aerodynamic, mass, and stiffness matrices are computed using a finite difference approximation. The third method also uses an analytic expression for the eigenvalue sensitivities, but the aerodynamic matrix is computed analytically. All three methods are found to be in good agreement with each other.

Kapania, Rakesh K.↗

A Full Navier-Stokes Analysis of Subsonic Diffuser of a Bifurcated 70/30 Supersonic Inlet for High Speed Civil Transport Application

A full Navier-Stokes analysis was performed to evaluate the performance of the subsonic diffuser of a NASA Lewis Research Center 70/30 mixed-compression bifurcated supersonic inlet for high speed civil transport application. The PARC3D code was used in the present study. The computations were also performed when approximately 2.5 percent of the engine mass flow was allowed to bypass through the engine bypass doors. The computational results were compared with the available experimental data which consisted of detailed Mach number and total pressure distribution along the entire length of the subsonic diffuser. The total pressure recovery, flow distortion, and crossflow velocity at the engine face were also calculated. The computed surface ramp and cowl pressure distributions were compared with experiments. Overall, the computational results compared well with experimental data. The present CFD analysis demonstrated that the bypass flow improves the total pressure recovery and lessens flow distortions at the engine face.

Kapoor, Kamlesh↗

Real and complex valued geometrical optics inverse ray-tracing for inline field calculations

In this work, a 3-D ray based model for computing laser fields in dissipative and amplifying media is presented. The eikonal equation is solved using inverse ray-tracing on a dedicated nonstructured 3-D mesh. Inverse ray-tracing opens the possibility of using Complex Geometrical Optics (CGO), for which we propose a propagation formalism in a finite element mesh. Divergent fields at caustics are corrected using an etalon integral method for fold-type caustics. This method is successfully applied in dissipative media by modifying the ray-ordering and root selection rules, thereby allowing one to reconstruct the field in the entire caustic region. In addition, we demonstrate how caustics in the CGO framework can disappear entirely for sufficiently dissipative media, making the complex ray approach valid in the entire medium. CGO is shown to offer a more precise modeling of laser refraction and absorption in a dissipative medium when compared to Geometrical Optics (GO). In the framework of Inertial Confinement Fusion (ICF), this occurs mostly at intermediate temperatures or at high temperatures close to the critical density. Additionally, GO is invalid at low temperatures if an approximated expression of the permittivity is used. The inverse ray-tracing algorithm for GO and CGO is implemented in the IFRIIT code, in the framework of a dielectric permittivity described in 3-D using a piecewise linear approximation in tetrahedrons. Fields computed using GO and CGO are compared to results from the electromagnetic wave solver LPSE. Excellent agreement is obtained in 1-D linear and nonlinear permittivity profiles. Good agreement is also obtained for ICF-like Gaussian density profiles in 2-D. Finally, we demonstrate how the model reproduces Gaussian beam diffraction using CGO. The IFRIIT code will be interfaced inline to 3-D radiative hydrodynamic codes to describe the nonlinear laser plasma interaction in ICF and high-energy-density plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Modeling of three-dimensional surfaces using high-level canonical piecewise-linear functions in cylindrical coordinates

In this paper, the potential application of the high-level canonical piecewise-linear model in the field of three-dimensional visualization is proposed. This idea emerges from the premise that a three-dimensional surface can be modeled by a continuous two-dimensional function. In this regard, the main contribution consists in providing a methodology for the construction of such function. For this purpose, the well-known algorithm used in the high-level canonical piecewise-linear model has been modified to achieve functions with greater graphing capability. One of the most notorious changes made with respect to the traditional methodology is the use of a new scheme of function domain partition. Contrary to the simplicial partitioning, in our proposal, an equally distributed angular partitioning is considered. With this, the resulting approximate function is expressed in cylindrical coordinates which overcome the typical limitation of graphs in Cartesian coordinates of only representing single-valued surfaces. Another remarkable change can be found in the range of evaluation of the function. Instead of using an open interval, in our approach, a closed interval from 0 to 2π is adopted. To support this proposal, illustrative case studies are reported. Numerical simulations demonstrate the effectiveness of this type of representation model not only in visual perception of three-dimensional surfaces, but also in more complex tasks like volume estimation.

97 MATHEMATICS AND COMPUTING↗

Physical models, cross sections, and numerical approximations used in MCNP and GEANT4 Monte Carlo codes for photon and electron absorbed fraction calculation

Purpose: Radiopharmaceutical applications in nuclear medicine require a detailed dosimetry estimate of the radiation energy delivered to the human tissues. Over the past years, several publications addressed the problem of internal dose estimate in volumes of several sizes considering photon and electron sources. Most of them used Monte Carlo radiation transport codes. Despite the widespread use of these codes due to the variety of resources and potentials they offered to carry out dose calculations, several aspects like physical models, cross sections, and numerical approximations used in the simulations still remain an object of study. Accurate dose estimate depends on the correct selection of a set of simulation options that should be carefully chosen. This article presents an analysis of several simulation options provided by two of the most used codes worldwide: MCNP and GEANT4. Methods: For this purpose, comparisons of absorbed fraction estimates obtained with different physical models, cross sections, and numerical approximations are presented for spheres of several sizes and composed as five different biological tissues. Results: Considerable discrepancies have been found in some cases not only between the different codes but also between different cross sections and algorithms in the same code. Maximum differences found between the two codes are 5.0% and 10%, respectively, for photons and electrons.Conclusion: Even for simple problems as spheres and uniform radiation sources, the set of parameters chosen by any Monte Carlo code significantly affects the final results of a simulation, demonstrating the importance of the correct choice of parameters in the simulation.

62 RADIOLOGY AND NUCLEAR MEDICINE↗