Search NASA⌕ Search

SEARCH · Search NASA

Results for “DISCRETE FUNCTION”

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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

The Functor system: a new on-the-fly take on Material Properties based on C++ functions

In the context of solving multiphysics problems, the discretization of the partial differential equations (PDE) at hand often takes the spotlight. However, for most engineering users and even application developers, the discretization of the equations has already been performed. Instead, they are tasked with implementing specific closure relations and material properties. MOOSE has long enabled this using the Materials system. This system relied on the pre-computation of all properties before they are used in the PDE or in postprocessing. In this talk we will introduce the Functor system, which was deployed in MOOSE in 2021, then present a few applications of functors in flow modeling simulations by the NEAMS program. Functors first offer great flexibility in their evaluation. Rather than storing various arrays for material properties, they are evaluated on the fly at the location and state, e.g. current or old value, requested. Unlike regular material properties, several operations such as the time derivative, the divergence and the curl can be requested from a functor. Similar to material properties, functors can be made to depend on arbitrary combinations of variables, functions, postprocessors and other properties. However, unlike material properties, any of these can be substituted for a functor material property. Thanks to this, objects no longer need to be duplicated based on the types of their parameters.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Bottomonium properties in the quark-gluon plasma from a lattice-QCD informed 𝑇-matrix approach

Recent computations of bottomonium correlation functions with extended sources in lattice-discretized quantum chromodynamics (lQCD) provide new insights into heavy-quark dynamics at distance scales which are of the order of the inverse temperature. We analyze these results employing the thermodynamic 𝑇-matrix framework, in a continued effort to interpret lQCD data for quarkonium correlation functions in a nonperturbative and self-consistently solved quantum-many-body approach to a strongly coupled quark-gluon plasma (QGP). Its key inputs are the in-medium driving kernel (potential) of the scattering equation and an interference function which implements 3-body effects in the quarkonium coupling to the thermal medium. A simultaneous description of lQCD results for the bottomonium correlators with extended operators and the previously analyzed Wilson line correlators only requires minor refinements of the potential but calls for stronger interference effects at larger separation of the bottom quark and antiquark. We then analyze the poles of the self-consistent 𝑇 matrices on the real axis to assess the survival of the various bound states. Here, we estimate the pertinent temperatures where the poles disappear for the various bottomonium states and discuss the relation to the corresponding peaks in the bottomonium spectral functions. We also recalculate the spatial diffusion coefficient of the QGP and find it to be similar to that in our previous study.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Path integrals, complex probabilities and the discrete Weyl representation

Abstract A discrete formulation of the real-time path integral as the expectation value of a functional of paths with respect to a complex probability on a sample space of discrete valued paths is explored. The formulation in terms of complex probabilities is motivated by a recent reinterpretation of the real-time path integral as the expectation value of a potential functional with respect to a complex probability distribution on cylinder sets of paths. The discrete formulation in this work is based on a discrete version of the Weyl algebra that can be applied to any observable with a finite number of outcomes. The origin of the complex probability in this work is the completeness relation. In the discrete formulation the complex probability exactly factors into products of conditional probabilities and exact unitarity is maintained at each level of approximation. The approximation of infinite dimensional quantum systems by discrete systems is discussed. The method is illustrated by applying it to scattering theory and quantum field theory. The implications of these applications for quantum computing is discussed.

Physics↗
NASA NTRS1991

Evaluation of discretization procedures for transition elements in adaptive mesh refinement

Three transition interpolation schemes for use in h-or r-refinement have been analyzed in terms of accuracy, implementation ease and extendability. They include blending-function interpolation, displacement averaging, and strain matching at discrete points along the transition edge lines. The results suggest that the choice of matching depends strongly on the element formulations, (viz. displacement or assumed strain, etc.) and mesh refinement criteria employed, and to a lesser extent the choice of computer architecture (serial vs. parallel) and the equation solution procedures. A recommended pairing of some of the elements with the choice factors is suggested.

Park, K. C.↗
NASA NTRS1974

The ergodic decomposition of stationary discrete random processes

The ergodic decomposition is discussed, and a version focusing on the structure of individual sample functions of stationary processes is proved for the special case of discrete-time random processes with discrete alphabets. The result is stronger in this case than the usual theorem, and the proof is both intuitive and simple. Estimation-theoretic and information-theoretic interpretations are developed and applied to prove existence theorems for universal source codes, both noiseless and with a fidelity criterion.

Gray, R. M.↗
NASA NTRS1994

Adaptive model reduction for continuous systems via recursive rational interpolation

A method for adaptive identification of reduced-order models for continuous stable SISO and MIMO plants is presented. The method recursively finds a model whose transfer function (matrix) matches that of the plant on a set of frequencies chosen by the designer. The algorithm utilizes the Moving Discrete Fourier Transform (MDFT) to continuously monitor the frequency-domain profile of the system input and output signals. The MDFT is an efficient method of monitoring discrete points in the frequency domain of an evolving function of time. The model parameters are estimated from MDFT data using standard recursive parameter estimation techniques. The algorithm has been shown in simulations to be quite robust to additive noise in the inputs and outputs. A significant advantage of the method is that it enables a type of on-line model validation. This is accomplished by simultaneously identifying a number of models and comparing each with the plant in the frequency domain. Simulations of the method applied to an 8th-order SISO plant and a 10-state 2-input 2-output plant are presented. An example of on-line model validation applied to the SISO plant is also presented.

Lilly, John H.↗
NASA NTRS1991

The behavior of quantization spectra as a function of signal-to-noise ratio

An expression for the spectrum of quantization error in a discrete-time system whose input is a sinusoid plus white Gaussian noise is derived. This quantization spectrum consists of two components: a white-noise floor and spurious harmonics. The dithering effect of the input Gaussian noise in both components of the spectrum is considered. Quantitative results in a discrete Fourier transform (DFT) example show the behavior of spurious harmonics as a function of the signal-to-noise ratio (SNR). These results have strong implications for digital reception and signal analysis systems. At low SNRs, spurious harmonics decay exponentially on a log-log scale, and the resulting spectrum is white. As the SNR increases, the spurious harmonics figure prominently in the output spectrum. A useful expression is given that roughly bounds the magnitude of a spurious harmonic as a function of the SNR.

Flanagan, M. J.↗
DOE OSTI2024

Inverse aspect-ratio expanded tokamak equilibria

Following Greene et al. [Phys. Fluids 14, 671 (1971)] and Connor et al. [Phys. Plasmas 31, 577 (1988); Plasma Phys. Control. Fusion 34, 161 (1992); and Nucl. Fusion 33, 1533 (1993)], the Grad-Shafranov equation for an axisymmetric tokamak plasma equilibrium is solved via an expansion in the, supposedly small, inverse aspect-ratio of the plasma, ϵ. The displacements of equilibrium magnetic flux-surfaces due to plasma shaping are assumed to be $\mathcal{O}$(ϵ) smaller than the minor radii of the surfaces, but no other restriction is placed on the nature of the shaping. The solution of the Grad-Shafranov equation is matched to a vacuum solution that extends to infinity, and consists of an expansion in toroidal functions. The external poloidal magnetic field generated by a finite set of discrete external poloidal magnetic field-coils is calculated, and incorporated into the toroidal function expansion. In this manner, the shape of a large aspect-ratio tokamak plasma is directly related to the currents flowing in the external poloidal field-coils. Finally, a pedestal in the plasma pressure, and the associated spike in the bootstrap current, are incorporated into the model.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS1998

An Astronomical Test of CCD Photometric Precision

This article considers a posteriori error estimation of specified functionals for first-order systems of conservation laws discretized using the discontinuous Galerkin (DG) finite element method. Using duality techniques. we derive exact error representation formulas for both linear and nonlinear functionals given an associated bilinear or nonlinear variational form. Weighted residual approximations of the exact error representation formula are then proposed and numerically evaluated for Ringleb flow, an exact solution of the 2-D Euler equations.

Koch, David↗
NASA NTRS1999

A Posteriori Error Estimation for Discontinuous Galerkin Approximations of Hyperbolic Systems

This article considers a posteriori error estimation of specified functionals for first-order systems of conservation laws discretized using the discontinuous Galerkin (DG) finite element method. Using duality techniques, we derive exact error representation formulas for both linear and nonlinear functionals given an associated bilinear or nonlinear variational form. Weighted residual approximations of the exact error representation formula are then proposed and numerically evaluated for Ringleb flow, an exact solution of the 2-D Euler equations.

Larson, Mats G.↗
NASA NTRSDate not supplied

Exergy-based Sensitivity Analysis of the Generic Hypersonic Vehicle using FUN3D

In this paper, the implementation of an exergy-based objective function and its adjoint gradient into NASA’s FUN3D solver is discussed and verified. In order to verify that the exergy-based functional is properly implemented, it is used to predict the drag of the Generic Hypersonic Vehicle (GHV), which is then compared to more traditional force-based drag predictions. In addition to the functional implementation, FUN3D’s adjoint capability was extended to obtain sensitivities. Results were verified using FUN3D’s native complex step method for di↵erentiation using a generic wing configuration. The complex and adjoint gradients yielded discrete agreement demonstrating correct implementation and that the functional can be used for gradient-based multidisciplinary analysis and optimization. Next, various trade studies are conducted on the GHV to understand the design space of the vehicle. Finally, an inverse design problem is solved to verify the utilized design optimization framework which is ready to be deployed for exergy-based optimizations in future work.

Neal L. Novotny↗
DOE OSTI2025

The latent variable proximal point algorithm for variational problems with inequality constraints

The latent variable proximal point (LVPP) algorithm is a framework for solving infinite-dimensional variational problems with pointwise inequality constraints. The algorithm is a saddle point reformulation of the Bregman proximal point algorithm. At the continuous level, the two formulations are equivalent, but the saddle point formulation is more amenable to discretization because it introduces a structure-preserving transformation between a latent function space and the feasible set. Working in this latent space is much more convenient for enforcing inequality constraints than the feasible set, as discretizations can employ general linear combinations of suitable basis functions, and nonlinear solvers can involve general additive updates. LVPP yields numerical methods with observed mesh-independence for obstacle problems, contact, fracture, plasticity, and others besides; in many cases, for the first time. The framework also extends to more complex constraints, providing means to enforce convexity in the Monge–Ampère equation and handling quasi-variational inequalities, where the underlying constraint depends implicitly on the unknown solution. Here, in this paper, we describe the LVPP algorithm in a general form and apply it to ten problems from across mathematics.

Inequality constraints↗
NASA NTRS1986

A minimum entropy principle in the gas dynamics equations

Let u(x bar,t) be a weak solution of the Euler equations, governing the inviscid polytropic gas dynamics; in addition, u(x bar, t) is assumed to respect the usual entropy conditions connected with the conservative Euler equations. We show that such entropy solutions of the gas dynamics equations satisfy a minimum entropy principle, namely, that the spatial minimum of their specific entropy, (Ess inf s(u(x,t)))/x, is an increasing function of time. This principle equally applies to discrete approximations of the Euler equations such as the Godunov-type and Lax-Friedrichs schemes. Our derivation of this minimum principle makes use of the fact that there is a family of generalized entrophy functions connected with the conservative Euler equations.

Tadmor, E.↗
NASA NTRS1997

Exact Integrations of Polynomials and Symmetric Quadrature Formulas over Arbitrary Polyhedral Grids

This paper is concerned with two important elements in the high-order accurate spatial discretization of finite volume equations over arbitrary grids. One element is the integration of basis functions over arbitrary domains, which is used in expressing various spatial integrals in terms of discrete unknowns. The other consists of quadrature approximations to those integrals. Only polynomial basis functions applied to polyhedral and polygonal grids are treated here. Non-triangular polygonal faces are subdivided into a union of planar triangular facets, and the resulting triangulated polyhedron is subdivided into a union of tetrahedra. The straight line segment, triangle, and tetrahedron are thus the fundamental shapes that are the building blocks for all integrations and quadrature approximations. Integrals of products up to the fifth order are derived in a unified manner for the three fundamental shapes in terms of the position vectors of vertices. Results are given both in terms of tensor products and products of Cartesian coordinates. The exact polynomial integrals are used to obtain symmetric quadrature approximations of any degree of precision up to five for arbitrary integrals over the three fundamental domains. Using a coordinate-free formulation, simple and rational procedures are developed to derive virtually all quadrature formulas, including some previously unpublished. Four symmetry groups of quadrature points are introduced to derive Gauss formulas, while their limiting forms are used to derive Lobatto formulas. Representative Gauss and Lobatto formulas are tabulated. The relative efficiency of their application to polyhedral and polygonal grids is detailed. The extension to higher degrees of precision is discussed.

Liu, Yen↗
NASA NTRS1977

The application of integral performance criteria to the analysis of discrete maneuvers in a driving simulator

The influence of vehicle transient response characteristics on driver-vehicle performance in discrete maneuvers as measured by integral performance criteria was investigated. A group of eight ordinary drivers was presented with a series of eight vehicle transfer function configurations in a driving simulator. Performance in two discrete maneuvers was analyzed by means of integral performance criteria. Results are presented.

Repa, B. S.↗
DOE OSTI2024

Solution of the Schrödinger equation for quasi-one-dimensional materials using helical waves

We formulate and implement a spectral method for solving the Schrödinger equation, as it applies to quasi-one-dimensional materials and structures. This allows for computation of the electronic structure of important technological materials such as nanotubes (of arbitrary chirality), nanowires, nanoribbons, chiral nanoassemblies, nanosprings and nanocoils, in an accurate, efficient and systematic manner. Our work is motivated by the observation that one of the most successful methods for carrying out electronic structure calculations of bulk/crystalline systems — the plane-wave method — is a spectral method based on eigenfunction expansion. Our scheme avoids computationally onerous approximations involving periodic supercells often employed in conventional plane-wave calculations of quasi-one-dimensional materials, and also overcomes several limitations of other discretization strategies, e.g., those based on finite differences and atomic orbitals. The basis functions in our method — called helical waves (or twisted waves) — are eigenfunctions of the Laplacian with symmetry adapted boundary conditions, and are expressible in terms of plane waves and Bessel functions in helical coordinates. We describe the setup of fast transforms to carry out discretization of the governing equations using our basis set, and the use of matrix-free iterative diagonalization to obtain the electronic eigenstates. Miscellaneous computational details, including the choice of eigensolvers, use of a preconditioning scheme, evaluation of oscillatory radial integrals and the imposition of a kinetic energy cutoff are discussed. We have implemented these strategies into a computational package called HelicES (Helical Electronic Structure). We demonstrate the utility of our method in carrying out systematic electronic structure calculations of various quasi-one-dimensional materials through numerous examples involving nanotubes, nanoribbons and nanowires. We also explore the convergence properties of our method, and assess its accuracy and computational efficiency by comparison against reference finite difference, transfer matrix method and plane-wave results. We anticipate that our method will find applications in computational nanomechanics and multiscale modeling, for carrying out transport calculations of interest to the field of semiconductor devices, and for the discovery of novel chiral phases of matter that are of relevance to the burgeoning quantum hardware industry.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
NASA NTRS2020

An Overview of the Null-Field Method. II: Convergence and Numerical Stability

In this paper we provide an analysis of the convergence and numerical stability of the null-field method with discrete sources. We show that (i) if the null-field scheme is numerically stable then we can decide whether or not convergence can be achieved; (ii) if the null-field scheme is numerically unstable then we cannot draw any conclusion about the convergence issue; and (iii) the numerical stability is closely related to the property of a tangential system of radiating discrete sources to form a Riesz basis. Our numerical analysis indicates that for prolate spheroids and localized vector spherical wave functions, the null-field scheme is numerically unstable (this system of vector functions does not form a Riesz basis), while for distributed vector spherical wave functions, the numerical instability is not so pronounced (this system of discrete sources almost possesses the property of being a Riesz basis). We also describe an analytical method for computing the surface integrals in the framework of the conventional null-field method with localized vector spherical wave functions which increases the stability of the numerical scheme.

Null-field method↗
NASA NTRS1990

Quadrature imposition of compatibility conditions in Chebyshev methods

Often, in solving an elliptic equation with Neumann boundary conditions, a compatibility condition has to be imposed for well-posedness. This condition involves integrals of the forcing function. When pseudospectral Chebyshev methods are used to discretize the partial differential equation, these integrals have to be approximated by an appropriate quadrature formula. The Gauss-Chebyshev (or any variant of it, like the Gauss-Lobatto) formula can not be used here since the integrals under consideration do not include the weight function. A natural candidate to be used in approximating the integrals is the Clenshaw-Curtis formula, however it is shown that this is the wrong choice and it may lead to divergence if time dependent methods are used to march the solution to steady state. The correct quadrature formula is developed for these problems. This formula takes into account the degree of the polynomials involved. It is shown that this formula leads to a well conditioned Chebyshev approximation to the differential equations and that the compatibility condition is automatically satisfied.

Gottlieb, D.↗