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 55 records · Page 3

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↗

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↗

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↗

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↗

Anti-symmetric and positivity preserving formulation of a spectral method for Vlasov-Poisson equations

We analyze the anti-symmetric properties of a spectral discretization for the one-dimensional Vlasov-Poisson equations. The discretization is based on a spectral expansion in velocity with the symmetrically weighted Hermite basis functions, central finite differencing in space, and an implicit Runge Kutta integrator in time. The proposed discretization preserves the anti-symmetric structure of the advection operator in the Vlasov equation, resulting in a stable numerical method. We apply such discretization to two formulations: the canonical Vlasov-Poisson equations and their continuously transformed square-root representation. The latter preserves the positivity of the particle distribution function. We derive analytically the conservation properties of both formulations, including particle number, momentum, and energy, which are verified numerically on the following benchmark problems: manufactured solution, linear and nonlinear Landau damping, two-stream instability, bump-on-tail instability, and ion-acoustic wave.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Neural entropy-stable conservative flux form neural networks for learning hyperbolic conservation laws

We propose a neural entropy-stable conservative flux form neural network (NESCFN) for learning hyperbolic conservation laws and their associated entropy functions directly from solution trajectories, without requiring any predefined numerical discretization. While recent neural network architectures have successfully integrated classical numerical principles into learned models, most rely on prior knowledge of the governing equations or assume a fixed discretization. Our approach removes this dependency by embedding entropy-stable design principles into the learning process itself, enabling the discovery of physically consistent dynamics in a fully data-driven setting. By jointly learning both the flux function and a corresponding entropy, NESCFN promotes conservation and entropy dissipation, which is critical for long-term stability and fidelity in the system of hyperbolic conservation laws. Furthermore, numerical results demonstrate that the method achieves stability and conservation over extended time horizons and accurately captures shock propagation speeds, even without oracle access to future-time solution profiles in the training data.

Conservative flux form↗

A robust framework for frictional fault contact in geological formations using a stabilized augmented Lagrangian approach

Numerical simulations are essential to evaluate the performance and safety of engineered subsurface systems such as geological carbon storage sites, enhanced geothermal fields, and oil and gas reservoirs. A key challenge lies in accurately modeling the frictional contact behavior along fault surfaces. This problem involves inequality constraints that arise from the physics of frictional slip, requiring specialized numerical methods to handle the resulting highly nonlinear and path-dependent behavior. Here, in this work, we address this challenge using an Augmented Lagrangian Method (ALM) implemented via the Uzawa algorithm. The formulation employs mixed finite element spaces, combining low-order piecewise linear displacements within the 3D domain cells with piecewise constant tractions defined on the fault surfaces. Furthermore, to ensure stability and satisfy the inf-sup condition, the discrete displacement space is enriched with face bubble functions on both sides of the contact interfaces. This approach offers several advantages over other stabilization techniques that rely on additional terms, and it integrates naturally in the Uzawa framework.

58 GEOSCIENCES↗

Targeted materials discovery using Bayesian algorithm execution

Rapid discovery and synthesis of future materials requires intelligent data acquisition strategies to navigate large design spaces. A popular strategy is Bayesian optimization, which aims to find candidates that maximize material properties; however, materials design often requires finding specific subsets of the design space which meet more complex or specialized goals. We present a framework that captures experimental goals through straightforward user-defined filtering algorithms. These algorithms are automatically translated into one of three intelligent, parameter-free, sequential data collection strategies (SwitchBAX, InfoBAX, and MeanBAX), bypassing the time-consuming and difficult process of task-specific acquisition function design. Our framework is tailored for typical discrete search spaces involving multiple measured physical properties and short time-horizon decision making. We demonstrate this approach on datasets for TiO 2 nanoparticle synthesis and magnetic materials characterization, and show that our methods are significantly more efficient than state-of-the-art approaches. Overall, our framework provides a practical solution for navigating the complexities of materials design, and helps lay groundwork for the accelerated development of advanced materials.

42 ENGINEERING↗

Predicting the dark matter-baryon abundance ratio

We discuss relaxation solutions to the dark matter-baryon coincidence problem in the context of QCD axion dark matter. In relaxation solutions, a moduli dynamically adjusts the mass of dark matter and baryons until their energy densities are 𝒪⁡(1) the same. Because the QCD axion is heavily connected to QCD, scanning the QCD axion mass inherently also scans the proton mass. In the context of relaxation solutions, this implies that the ratio of dark matter to baryon abundances (Ω DM /Ω B ) is a ratio of beta functions showing that these models can only accommodate discrete values of ΩDM/ΩB thereby “predicting” the ratio of the dark matter to baryon abundances. The original composite axion model has only a single integer degree of freedom 𝑁, the size of the gauge group, and we show that when 𝑁 =8 the observed value of Ω DM /Ω B =5.36 is reproduced to within its percent level error bars. Novel tests of this model include more precise measurements of Ω DM /Ω B , a better lattice determination of the dependence of the proton mass on the high energy QCD gauge coupling, as well as more traditional tests such as fifth force experiments.

79 ASTRONOMY AND ASTROPHYSICS↗

Moment extraction using an unfolding protocol without binning

Deconvolving (“unfolding”) detector distortions is a critical step in the comparison of cross-section measurements with theoretical predictions in particle and nuclear physics. However, most existing approaches require histogram binning while many theoretical predictions are at the level of statistical moments. We develop a new approach to directly unfold distribution moments as a function of another observable without having to first discretize the data. Our moment unfolding technique uses machine learning and is inspired by Boltzmann weight factors and generative adversarial networks (GANs). We demonstrate the performance of this approach using jet substructure measurements in collider physics. With this illustrative example, we find that our moment unfolding protocol is more precise than bin-based approaches and is as or more precise than completely unbinned methods.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Lattice QCD Benchmark of Proton Helicity and Flavor-Dependent Unpolarized Transverse Momentum-Dependent Parton Distribution Functions at Physical Quark Masses

We present the first lattice QCD calculations of the isovector helicity transverse momentum-dependent parton distribution function (TMDPDF) and the flavor-dependent unpolarized TMDPDFs for up and down quarks in the proton. Our computations utilize domain-wall fermion discretization with physical quark masses. Employing Coulomb-gauge-fixed quark correlation functions within the large-momentum effective theory framework, we access nonperturbative transverse quark separations 𝑏 𝑇 up to approximately 1 fm, corresponding to transverse momenta as low as 200 MeV. Based on the quasi-TMD factorization theorem, we construct renormalization-group–invariant ratios that are equal to the corresponding light-cone TMDPDF ratios. At moderate 𝑥, our results reveal that the isovector helicity and unpolarized TMDPDFs exhibit nearly identical transverse structure up to a normalization factor, and the unpolarized distributions display only mild flavor dependence. These findings not only support key trends observed in recent global analyses but also provide robust, nonperturbative constraints that can distinguish between different parameterizations. This Letter establishes a first-principles benchmark for TMDPDFs, offering valuable input for ongoing and future experimental efforts to map the proton’s three-dimensional structure.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Development and Experimental Optimization of High-Temperature Modeling Tools and Methods for Concentrated Solar Power Particle - Systems

A novel, open-source radiative modeling toolset was developed to extend the functionality of particle-based modeling software (e.g. discrete element method (DEM)) to environmental conditions relevant to concentrated solar power applications. This toolset was optimized for deployment on desktop workstations instead of high-performance computing systems, to render such tools more accessible to the research community. Both particle-based modeling and radiative exchange modeling are computationally expensive and often require specialized programming expertise, making these methods cumbersome to use. Recent developments in DEM software by DCS Computing have greatly reduced these challenges, providing a graphical-user-interface based platform and modeling optimization for desktop workstations, HPCs, and cloud computing. The University of Dayton leveraged the experience of DCS Computing in developing a user-friendly, open-source radiative heat transfer expansion for DEM modeling. The University of Dayton DEM+ radiative modeling toolset was developed using a combination of fundamental experimental measurements, modeling, and simplified flow experiments over a range of temperatures and flow conditions. The toolset provides researchers with access to multiple radiative models including an accelerated Monte-Carlo Ray Tracing (application agnostic, highly computationally expensive), an expanded database of distance-based approximations (application limited, computationally light), and a weighted blending of the two methods capable of achieving over 90% reduction in computation time with equivalent accuracy compared to Monte-Carlo Ray Tracing. Through a graphical user interface, users can customize the radiative models to match their desired accuracy and available computational resources, improving access to particle based modeling for the research community. Ceramic sintered bauxite proppants were used in modeling and experimentally as a baseline. Both the radiative heat transfer and flow properties for particulate systems were investigated at elevated temperatures up to 800 °C. The major accomplishments for this work include a verified, open-source radiative modeling toolset to be distributed amongst the research community and the fabrication of three small-scale test facilities to investigate particle behavior and tune DEM flow properties for operation up to 800 °C. The findings have been shared with the research community via conference modeling workshops, deployment of the tools in DCS Computing Aspherix®, and open-source access to the developed radiative modeling tool. The development of next-generation CSP facilities and thermal energy storage systems based on ceramic particles requires providing access to computationally efficient and accurate modeling tools. Particles will experience a wide range of environments (20-800 °C) and handling conditions (dilute curtains or dense packing), requiring specially designed and optimized equipment. Optimizing solid particle physics models and establishing best-practices for particle modeling in CSP environments will assist researchers with designing optimized equipment, accelerating the deployment of more economically-competitive CSP facilities.

14 SOLAR ENERGY↗

Getting Started with Evaluations with Means and Uncertainties (EMU 3.0)

One of the most fundamental quantities in nuclear physics is the reaction cross section. A cross section represents the probability that a nuclear reaction will resolve through a given channel given a target nucleus and a projectile with a certain energy. A nuclear evaluation is a set of discrete data and interpolation rules to convert those discrete nuclear reaction data—such as the cross section—into a continuous function at arbitrary energies. Evaluated nuclear data files that can appear in Evaluated Nuclear Data File (ENDF) and Generalized Nuclear Data Structure (GNDS) formats, storing a “most-complete” discretized representation of nuclear data, based on both experimental measurements and theory models.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Griffin: A MOOSE-based reactor physics application for multiphysics simulation of advanced nuclear reactors

Griffin is a Multiphysics Object-Oriented Simulation Environment (MOOSE) based reactor physics application for multiphysics simulations of advanced reactor designs jointly developed by Idaho National Laboratory and Argonne National Laboratory. This paper summarizes the motivation, significance, architecture, design, and features of Griffin. Griffin offers flexible and extensible features to address the challenges associated with advanced reactor designs. These features range from fundamental particle transport to specific reactor physics tasks. The features cover a wide range including on-the-fly and traditional two-step cross-section generation methods, steady-state and transient transport solvers suitable for both heterogeneous and homogeneous models, high-fidelity depletion where thousands of isotopes can be tracked and low-fidelity depletion characterized by burnup, etc. The most fundamental aspect that sets Griffin apart from other reactor analysis codes is that it is developed based on the MOOSE framework. A modular development approach is strongly enforced, with multiphysics being an essential element considered since the beginning of Griffin’s development. Griffin links various MOOSE physics modules and couples to other MOOSE-based applications and non-MOOSE-based applications for multiphyiscs simulations. Griffin includes three modules: ISOXML for preparing and managing multigroup cross sections, radiation transport for solving the neutron transport equation, and reactor analysis for user-oriented reactor physics analysis functionalities. Griffin uses various finite element methods for spatial discretization, multigroup approximation for energy discretization and discrete ordinates method, spherical harmonics expansion method, and diffusion approximation for streaming direction discretization to solve the neutron transport equation. Griffin’s flexibility is evidenced through Griffin’s various applications to fast reactor, high-temperature reactor, pebble bed reactor, molten salt reactor, and microreactor designs. Griffin development follows the software quality assurance procedure for MOOSE-based applications and with software requirements consistent with the ASME NQA-1 standard. Griffin has been adopted into the reactor analysis system for the U.S. NRC and is in use at U.S. companies, universities and national laboratories.

97 MATHEMATICS AND COMPUTING↗

A variational mimetic finite difference method for elliptic interface problems on non-matching polytopal meshes with geometric interface inconsistencies

A new variational mimetic finite difference method for elliptic interface problems with perfect and imperfect thermal contacts on non-matching polytopal meshes with geometric interface inconsistencies is developed and analyzed theoretically and numerically. The method is defined on multiple non-matching submeshes with gaps and overlaps along their interfaces. The discrete equations are derived from a minimization problem for the augmented Dirichlet functional. For a perfect thermal contact, the functional uses a modified mimetic gradient with extended stencil which couples unknowns from both sides of an interface, as well as penalty terms to enforce weak continuity of temperature across the interface. The method leads to a symmetric positive definite matrix for any scaling of the penalty terms. For an imperfect thermal contact, the Dirichlet functional is supplemented with a quadratic jump term along the interface related to the interface thermal resistance. We prove that the method conserves the total heat flux across each interface. In conclusion, the obtained results are verified with numerical experiments showing convergence in the discrete L 2 and L ∞ norms.

97 MATHEMATICS AND COMPUTING↗

Tailoring Molecular Space to Navigate Phase Complexity in Cs-Based Quasi-2D Perovskites via Gated-Gaussian-Driven High-Throughput Discovery

Cesium-based quasi-2D halide perovskites (HPs) offer promising functionalities and low-temperature manufacturability, suited to stable tandem photovoltaics. However, the chemical interplays between the molecular spacers and the inorganic building blocks during crystallization cause substantial phase complexities in the resulting matrices. To successfully optimize and implement the quasi-2D HP functionalities, a systematic understanding of spacer chemistry, along with the seamless navigation of the inherently discrete molecular space, is necessary. Herein, by utilizing high-throughput automated experimentation, the phase complexities in the molecular space of quasi-2D HPs are explored, thus identifying the chemical roles of the spacer cations on the synthesis and functionalities of the complex materials. Furthermore, a novel active machine learning algorithm leveraging a two-stage decision-making process, called gated Gaussian process Bayesian optimization is introduced, to navigate the discrete ternary chemical space defined with two distinctive spacer molecules. Through simultaneous optimization of photoluminescence intensity and stability that “tailors” the chemistry in the molecular space, a ternary-compositional quasi-2D HP film realizing excellent optoelectronic functionalities is demonstrated. Finally, this work not only provides a pathway for the rational and bespoke design of complex HP materials but also sets the stage for accelerated materials discovery in other multifunctional systems.

36 MATERIALS SCIENCE↗

Green's function fast multipole method for continuum mechanics (SM-FMM)

Solid Mechanics Fast Multipole Method based on elastic Green's function and accelerated using FFTs The code calculates the mechanical fields (stress and strain) for a heterogeneous elasto-plastic material unit cell under quasi-static conditions (no dynamic effects). The fields are calculated using a Green's function method, where the strain field is given by a discrete convolution of Green's operator with an auxiliary stress field. The convolution is calculated using the fast multipole method.

Zecevic, Miroslav↗

Fortran mimetic abstraction language (Formal) v0.1.

The Fortran mimetic abstraction language ("Formal") is a domain-specific language (DSL) embedded in Fortran 202Y [1]. Formal provides novel software abstractions for simulating phenomena governed by the partial differential equations (PDEs) of vector and tensor calculus. Such equations model an extremely broad set of physical phenomena, ranging from atmospheric winds to light propagation. Formal's data structures and algorithms mimic in form and behavior continuous functions and operators. Formal supports these mathematical constructs using mimetic discretizations that define a discrete calculus satisfying various tensor calculus theorems, thereby ensuring high-fidelity representations of the physics being modeled. [2] Formal 0.1.0 also lays a foundation for the future use of Fortran 202Y type-safe templates to facilitate the formal verification of tensor contractions in computational physics and artificial intelligence [3]. [1] "Fortran 202Y" is Fortran standard committee's informal designation for the next Fortran revision, which will likely be "Fortran 2028". [2] Corbino, J. and Castillo, J. (2020) Journal of Computational and Applied Mathematics, https://doi.org/10.1016/j.cam.2019.06.042. [3] Haveraaen, M., Järvi, J., & Rouson, D. (2019). Reflecting on Generics for Fortran. https://j3-fortran.org/doc/year/19/19-188.pdf.

Rouson, Damian [Lawrence Berkeley National Laborat↗