Search NASA⌕ Search

SEARCH · Search NASA

Results for “mathematics 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,693 records · Page 94

Genetic programming for the nuclear many-body problem: a guide

Genetic Programming (GP) is an evolutionary algorithm that generates computer programs, or mathematical expressions, to solve complex problems. In this Guide, we demonstrate how to use GP to develop surrogate models to mitigate the computational costs of modeling atomic nuclei with ever increasing complexity. The computational burden escalates when uncertainty quantification is pursued, or when observables must be globally computed for thousands of nuclei. By studying three models in which the mean field depends on the total particle density self-consistently, we show that by constructing reduced order models supported by GP one can speed up many-body computations by several orders of magnitude with a negligible loss in accuracy.

dimensionality reduction↗

Flow and transport in three-dimensional discrete fracture matrix models using mimetic finite difference on a conforming multi-dimensional mesh

Here, we present a comprehensive workflow to simulate single-phase flow and transport in fractured porous media using the discrete fracture matrix approach. The workflow has three primary parts: (1) a method for conforming mesh generation of and around a three-dimensional fracture network, (2) the discretization of the governing equations using a second-order mimetic finite difference method, and (3) implementation of numerical methods for high-performance computing environments. A method to create a conforming Delaunay tetrahedralization of the volume surrounding the fracture network, where the triangular cells of the fracture mesh are faces in the volume mesh, that addresses pathological cases which commonly arise and degrade mesh quality is also provided. Our open-source subsurface simulator uses a hierarchy of process kernels (one kernel per physical process) that allows for both strong and weak coupling of the fracture and matrix domains. We provide verification tests based on analytic solutions for flow and transport, as well as numerical convergence. We also provide multiple expositions of the method in complex fracture networks. In the first example, we demonstrate that the method is robust by considering two scenarios where the fracture network acts as a barrier to flow, as the primary pathway, or offers the same resistance as the surrounding matrix. In the second test, flow and transport through a three-dimensional stochastically generated network containing 257 fractures is presented.

97 MATHEMATICS AND COMPUTING↗

Time-Resolved Optical Pump-Resonant X-ray Probe Spectroscopy of 4-Thiouracil: A Simulation Study

We theoretically monitor the photoinduced ππ* → nπ* internal conversion process in 4-thiouracil (4TU), triggered by an optical pump. The element-sensitive spectroscopic signatures are recorded by a resonant X-ray probe tuned to the sulfur, oxygen, or nitrogen K-edge. We employ high-level electronic structure methods optimized for core-excited electronic structure calculation combined with quantum nuclear wavepacket dynamics computed on two relevant nuclear modes, fully accounting for their quantum nature of nuclear motions. We critically discuss the capabilities and limitations of the resonant technique. For sulfur and nitrogen, we document a pre-edge spectral window free from ground-state background and rich with ππ* and nπ* absorption features. The lowest sulfur K-edge shows strong absorption for both ππ* and nπ*. In the lowest nitrogen K-edge window, we resolve a state-specific fingerprint of the ππ* and an approximate timing of the conical intersection via its depletion. A spectral signature of the nπ* transition, not accessible by UV–vis spectroscopy, is identified. The oxygen K-edge is not sensitive to molecular deformations and gives steady transient absorption features without spectral dynamics. Here, the ππ*/nπ* coherence information is masked by more intense contributions from populations. Altogether, element-specific time-resolved resonant X-ray spectroscopy provides a detailed picture of the electronic excited-state dynamics and therefore a sensitive window into the photophysics of thiobases.

97 MATHEMATICS AND COMPUTING↗

Accelerating Asymptotically Exact MCMC for Computationally Intensive Models via Local Approximations

We construct a new framework for accelerating Markov chain Monte Carlo in posterior sampling problems where standard methods are limited by the computational cost of the likelihood, or of numerical models embedded therein. Our approach introduces local approximations of these models into the Metropolis–Hastings kernel, borrowing ideas from deterministic approximation theory, optimization, and experimental design. Previous efforts at integrating approximate models into inference typically sacrifice either the sampler’s exactness or efficiency; our work seeks to address these limitations by exploiting useful convergence characteristics of local approximations. We prove the ergodicity of our approximate Markov chain, showing that it samples asymptotically from the exact posterior distribution of interest. We describe variations of the algorithm that employ either local polynomial approximations or local Gaussian process regressors. Our theoretical results reinforce the key observation underlying this article: when the likelihood has some local regularity, the number of model evaluations per Markov chain Monte Carlo (MCMC) step can be greatly reduced without biasing the Monte Carlo average. Numerical experiments demonstrate multiple order-of-magnitude reductions in the number of forward model evaluations used in representative ordinary differential equation (ODE) and partial differential equation (PDE) inference problems, with both synthetic and real data. Supplementary materials for this article are available online.

97 MATHEMATICS AND COMPUTING↗

Nonnegative canonical tensor decomposition with linear constraints: nnCANDELINC

Abstract There is an emerging interest for tensor factorization applications in big‐data analytics and machine learning. To speed up the factorization of extra‐large datasets, organized in multidimensional arrays (also known as tensors), easy to compute compression‐based tensor representations, such as, Tucker and tensor train formats, are used to approximate the initial large‐tensor. Further, tensor factorization is used to extract latent features that can facilitate discoveries of new mechanisms and signatures hidden in the data, where the explainability of the latent features is of principal importance. Nonnegative tensor factorization extracts latent features that are naturally sparse and parts of the data, which makes them easily interpretable. However, to take into account available domain knowledge and subject matter expertise, often additional constraints need to be imposed, which lead us to canonical decomposition with linear constraints (CANDELINC), a canonical polyadic decomposition with rank deficient factors. In CANDELINC, Tucker compression is used as a preprocessing step, which lead to a larger residual error but to more explainable latent features. Here, we propose a nonnegative CANDELINC (nnCANDELINC) accomplished via a specific nonnegative Tucker decomposition; we refer to as minimal or canonical nonnegative Tucker. We derive several results required to understand the specificity of nnCANDELINC, focusing on the difficulties of preserving the nonnegative rank of a tensor to its Tucker core and comparing the real valued to nonnegative case. Finally, we demonstrate nnCANDELINC performance on synthetic and real‐world examples.

97 MATHEMATICS AND COMPUTING↗

SULI Intern Final Report: Computationally Investigating Hydrogen Thermo-Diffusion in Yttrium Hydride Using Multiscale Methods

The renaissance of nuclear energy has arrived, heralding an age of abundant inexpensive clean energy, and renewed space exploration. In nuclear-powered spacecraft and microreactors, safety and size are of utmost importance. Yttrium Hydride (YHx) is being researched for its utility as a neutron moderator in nuclear reactors; the hydrogen in YHx slows down neutrons, enabling a continuous nuclear reaction in the reactor. This has the benefit of allowing reactors to be more safe, compact, and efficient. The goal of this effort is to computationally predict the coefficient of temperature-dependent hydrogen diffusion within YHx, the Soret coefficient. This parameter is essential for determining the safe operating modes of YHx moderators. Zirconium Hydride (ZrHx) is used in the Training, Research, Isotopes, General Atomics (TRIGA) reactor, is the reference material for these calculations. In this work, nanoscale atomic modeling in the Vienna Ab initio Simulation Package (VASP) is combined with the mesoscale finite element phase-field module in the Multiphysics Object-Oriented Simulation Environment (MOOSE); this culminates in a new multiscale computational method to simulate Soret diffusion of hydrogen in YHx. This data is useful for predicting experimental outcomes. This workflow involves convergence testing followed by static, Nudged Elastic Band (NEB), Quasi-Harmonic Approximation (QHA), and Molecular Dynamics (MD) calculations - linked with phase field simulation. NEB simulates hydrogen migration, while QHA and MD predict temperature-dependent properties. The static calculations align with literature, and preliminary NEB and QHA calculations yield accurate results. Once the atomic calculations are complete, we will incorporate Electron Backscatter Diffraction (EBSD) images and VASP-generated parameters into the phase field module to simulate intra- and intergranular transport of hydrogen in ZrHx and YHx. Future research will extend our approach to fuel-moderator materials systems such as Uranium-Yttrium Hydride (U-YHx). This work contributes to the development of advanced nuclear energy solutions for space travel.

36 - MATERIALS SCIENCE↗

Error mitigation with Clifford quantum-circuit data

Achieving near-term quantum observables despite significant hardware noise. For this purpose, we propose a novel, scalable error-mitigation method that applies to gate-based quantum computers. The method generates training data { X i noisy , X i exact } via quantum circuits composed largely of Clifford gates, which can be efficiently simulated classically, where X i noisy and X i exact are noisy and noiseless observables respectively. Fitting a linear ansatz to this data then allows for the prediction of noise-free observables for arbitrary circuits. We analyze the performance of our method versus the number of qubits, circuit depth, and number of non-Clifford gates. Here, we obtain an order-of-magnitude error reduction for a ground-state energy problem on 16 qubits in an IBMQ quantum computer and on a 64-qubit noisy simulator.

97 MATHEMATICS AND COMPUTING↗

Numeric invariants from multidimensional persistence

Topological data analysis is the study of data using techniques from algebraic topology. Often, one begins with a finite set of points representing data and a “filter” function which assigns a real number to each datum. Using both the data and the filter function, one can construct a filtered complex for further analysis. For example, applying the homology functor to the filtered complex produces an algebraic object known as a “one-dimensional persistence module”, which can often be interpreted as a finite set of intervals representing various geometric features in the data. If one runs the above process incorporating multiple filter functions simultaneously, one instead obtains a multidimensional persistence module. Unfortunately, these are much more difficult to interpret. In this article, we analyze the space of multidimensional persistence modules from the perspective of algebraic geometry. First we build a moduli space of a certain subclass of easily analyzed multidimensional persistence modules, which we construct specifically to capture much of the information which can be gained by using multidimensional persistence instead of one-dimensional persistence. Fruthermore, we argue that the global sections of this space provide interesting numeric invariants when evaluated against our subclass of multidimensional persistence modules. Finally, we extend these global sections to the space of all multidimensional persistence modules and discuss how the resulting numeric invariants might be used to study data. This paper extends the results of Adcock et al. (Homol Homotopy Appl 18(1), 381–402, 2016) by constructing numeric invariants from the computation of a multidimensional persistence module as given by Carlsson et al. (J Comput Geom 1(1), 72–100, 2010).

58 GEOSCIENCES↗

Asymptotic Behavior of the Stock Price Distribution Density and Implied Volatility in Stochastic Volatility Models

We study the asymptotic behavior of distribution densities arising in stock price models with stochastic volatility. The main objects of our interest in the present paper are the density of time averages of the squared volatility process and the density of the stock price process in the Stein-Stein and the Heston model. We find explicit formulas for leading terms in asymptotic expansions of these densities and give error estimates. As an application of our results, sharp asymptotic formulas for the implied volatility in the Stein-Stein and the Heston model are obtained.

97 MATHEMATICS AND COMPUTING↗

A Planning Problem Combining Calculus of Variations and Optimal Transport

We consider some variants of the classical optimal transport where not only one optimizes over couplings between some variables x and y but also over some control variables governing the evolutions of these variables with time. Such a situation is motivated by an assignment problem of tasks with workers whose characteristics can evolve with time (and be controlled). We distinguish between the coupled and decoupled case. The coupled case is a standard optimal transport with the value of some optimal control problem as cost. The decoupled case is more involved since it is nonlinear in the transport plan.

97 MATHEMATICS AND COMPUTING↗

Sufficient Stochastic Maximum Principle in a Regime-Switching Diffusion Model

We prove a sufficient stochastic maximum principle for the optimal control of a regime-switching diffusion model. We show the connection to dynamic programming and we apply the result to a quadratic loss minimization problem, which can be used to solve a mean-variance portfolio selection problem.

97 MATHEMATICS AND COMPUTING↗

Multiperiod Mean-Variance Portfolio Optimization via Market Cloning

The problem of finding the mean variance optimal portfolio in a multiperiod model can not be solved directly by means of dynamic programming. In order to find a solution we therefore first introduce independent market clones having the same distributional properties as the original market, and we replace the portfolio mean and variance by their empirical counterparts. We then use dynamic programming to derive portfolios maximizing a weighted sum of the empirical mean and variance. By letting the number of market clones converge to infinity we are able to solve the original mean variance problem.

97 MATHEMATICS AND COMPUTING↗

Optimal Control of Heterogeneous Systems with Endogenous Domain of Heterogeneity

The paper deals with optimal control of heterogeneous systems, that is, families of controlled ODEs parameterized by a parameter running over a domain called domain of heterogeneity. The main novelty in the paper is that the domain of heterogeneity is endogenous: it may depend on the control and on the state of the system. This extension is crucial for several economic applications and turns out to rise interesting mathematical problems. A necessary optimality condition is derived, where one of the adjoint variables satisfies a differential inclusion (instead of equation) and the maximization of the Hamiltonian takes the form of 'min-max'. As a consequence, a Pontryagin-type maximum principle is obtained under certain regularity conditions for the optimal control. A formula for the derivative of the objective function with respect to the control from L{sub {infinity}} is presented together with a sufficient condition for its existence. A stylized economic example is investigated analytically and numerically.

97 MATHEMATICS AND COMPUTING↗

Weak Convergence and Fluid Limits in Optimal Time-to-Empty Queueing Control Problems

We consider a class of controlled queue length processes, in which the control allocates each server's effort among the several classes of customers requiring its service. Served customers are routed through the network according to (prescribed) routing probabilities. In the fluid rescaling, X{sup n}(t) = 1/nX(nt) , we consider the optimal control problem of minimizing the integral of an undiscounted positive running cost until the first time that X{sup n}=0. Our main result uses weak convergence ideas to show that the optimal value functions V{sup n} of the stochastic control problems for X{sup n}(t) converge (as n{yields}{infinity}) to the optimal value V of a control problem for the limiting fluid process. This requires certain equicontinuity and boundedness hypotheses on (V{sup n}). We observe that these are essentially the same hypotheses that would be needed for the Barles-Perthame approach in terms of semicontinuous viscosity solutions. Sufficient conditions for these equicontinuity and boundedness properties are briefly discussed.

97 MATHEMATICS AND COMPUTING↗

Convergence of the Approximation Scheme to American Option Pricing via the Discrete Morse Semiflow

We consider the approximation scheme to the American call option via the discrete Morse semiflow, which is a minimizing scheme of a time semi-discretized variational functional. In this paper we obtain a rate of convergence of approximate solutions and the convergence of approximate free boundaries. We mainly apply the theory of variational inequalities and that of viscosity solutions to prove our results.

97 MATHEMATICS AND COMPUTING↗

On Shape Optimization for an Evolution Coupled System

A shape optimization problem in three spatial dimensions for an elasto-dynamic piezoelectric body coupled to an acoustic chamber is introduced. Well-posedness of the problem is established and first order necessary optimality conditions are derived in the framework of the boundary variation technique. In particular, the existence of the shape gradient for an integral shape functional is obtained, as well as its regularity, sufficient for applications e.g. in modern loudspeaker technologies. The shape gradients are given by functions supported on the moving boundaries. The paper extends results obtained by the authors in (Math. Methods Appl. Sci. 33(17):2118-2131, 2010) where a similar problem was treated without acoustic coupling.

97 MATHEMATICS AND COMPUTING↗