Search NASA⌕ Search

SEARCH · Search NASA

Results for “MATHEMATICAL SOLUTIONS”

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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

The scaling of kinetic and transport behaviors in the solution-phase chemistry of a plasma–liquid interface

The reactions at a plasma–liquid interface often involve species such as the solvated electron or the hydroxyl radical, which initiate the reduction or oxidation of solution-phase reactants (so-called scavengers) or are consumed by their own second-order recombination. Here, the mathematical scaling of the reaction–diffusion equations at the interface is used to obtain a characteristic time that can be used to determine the transition from highly efficient scavenger reduction or oxidation to lower efficiencies due to transport limitations. The characteristic time (tc) is validated using numerical solutions of the reaction–diffusion equations. When the scavenger kinetics are faster than second-order recombination, this characteristic transition time scales proportionally with the scavenger diffusivity (Ds) and the square of the scavenger bulk concentration (SB) and inversely proportional to the electron flux (J) squared; that is, t c = D s S B 2 F 2 /J 2 , where F is Faraday’s constant. However, when the scavenger kinetics are comparable or slower than second-order recombination, this scaling does not hold. Extending this analysis to three-dimensional systems shows that the profile of the electron flux on the surface affects the spatial location where reactions are most effective. Finally, the assessment of the implications of these behaviors for the reactor design highlights how effectively controlling the electron flux and solution transport may be necessary to improve the efficiency of scavenger reactions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Semi-analytic solutions to the Noh problem with a black box EoS

The objective of this paper is to derive a method of constructing semi-analytic solutions to the Noh problem when the equation of state is a black box. Such solutions can be used for verification tests of hydrodynamics codes. We present the underlying theory, the method for finding solutions, and several examples of derived semi-analytic solutions. We end by performing a classic verification convergence test comparing numerical results from a hydrodynamics code against a non-trivial semi-analytic solution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Construction of a Code Verification Matrix for Heat Conduction With Finite Element Code Applications

When establishing the pedigree of a simulation tool, code verification is used to ensure that the implemented numerical algorithm is a faithful representation of its underlying mathematical model. During this process, numerical results on various meshes are systematically compared to a reference analytic solution. The selection of analytic solutions can be a laborious process, as it is difficult to establish adequate code confidence without performing redundant work. In this report we address this issue by applying a physics-based process that establishes a set of reference problems. In this process, code simulation options are categorized and systematically tested, which ensures that gaps in testing are easily identified and addressed. The resulting problems are primarily intended for code verification analysis but may also be useful for comparison to other simulation codes, troubleshooting activities, or training exercises. The process is used to select fifteen code verification problems relevant for the one-dimensional steady-state heat conduction equation. These problems are applicable to a wide variety of simulation tools, but, in this work, a demonstration is performed using the finite element-based nuclear fuel performance code BISON. Convergence to the analytic solution at the theoretical rate is quantified for a selection of the problems, which establishes a baseline pedigree for the code. Not only can this standard set of conduction solutions be used for verification of other codes, but also the physics-based process for selecting problems can be utilized to quantify and expand testing for any simulation tool.

42 ENGINEERING↗
DOE OSTI2022

Sensitivity of time-dependent density functional theory to initial conditions

Time-dependent density-functional theory is mathematically formulated through nonlinear coupled time-dependent three-dimensional partial differential equations, and it is natural to expect a strong sensitivity of its solutions to variations of the initial conditions, akin to the butterfly effect ubiquitous in classical dynamics. Since the Schrödinger equation for an interacting many-body system is, however, linear and mathematically the exact equations of the density-functional theory reproduce the corresponding one-body properties, it would follow that the Lyapunov exponents are also vanishing within a density-functional theory framework. Whether for realistic implementations of the time-dependent density-functional theory the question of the absence of the butterfly effect and whether the dynamics provided is indeed a predictable theory was never discussed. At the same time, since the time-dependent density-functional theory is a unique tool allowing us to study the nonequilibrium dynamics of strongly interacting many-fermion systems, the question of predictability of this theoretical framework is of paramount importance. Here our analysis, for a number of quantum superfluid many-body systems (unitary Fermi gas, nuclear fission, and heavy-ion collisions) with a classical equivalent number of degrees of freedom O(10 10 ) and larger, suggests that its maximum Lyapunov exponents are negligible for all practical purposes.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Code verification for practically singular equations

We report the method-of-moments implementation of the electric-field integral equation (EFIE) yields many code-verification challenges due to the various sources of numerical error and their possible interactions. Matters are further complicated by singular integrals, which arise from the presence of a Green's function. To address these singular integrals, an approach is presented in wherein both the solution and Green's function are manufactured. Because the arising equations are poorly conditioned, they are reformulated as a set of constraints for an optimization problem that selects the solution closest to the manufactured solution. In this paper, we demonstrate how, for such practically singular systems of equations, computing the truncation error by inserting the exact solution into the discretized equations cannot detect certain orders of coding errors. On the other hand, the discretization error from the optimal solution is a more sensitive metric that can detect orders less than those of the expected convergence rate.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A forced Korteweg–de Vries model for nonlinear mixing of oscillations in a dusty plasma

Nonlinear mixing of oscillations in a dusty plasma due to the harmonic time varying modulation of a nonlinear compressional oscillation is analyzed using a simple mathematical model consisting of a forced Korteweg-de Vries equation. An exact analytic solution of this equation is found to exhibit nonlinear mixing in the system. Here, the model solution can be usefully employed to predict the existence of nonlinear mixing of oscillations in a two-dimensional dusty plasma system of a particular experimental configuration.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

Direct E&M Field Solver for a Plane Wave without Sources

A three dimensional direct field solver for the electric and magnetic fields using the Finite Difference Time Domain (FDTD) method is described. Example simulations using periodic and absorbing boundary conditions in a vacuum medium for a plane wave propagating in three dimensions are explored and are compared to theory.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Fourier Analyses of High-Order Continuous and Discontinuous Galerkin Methods

In this paper, we present a Fourier analysis of wave propagation problems subject to a class of continuous and discontinuous discretizations using high-degree Lagrange polynomials. This allows us to obtain explicit analytical formulas for the dispersion relation and group velocity and, for the first time to our knowledge, characterize analytically the emergence of gaps in the dispersion relation at specific wavenumbers, when they exist, and compute their specific locations. Wave packets with energy at these wavenumbers will fail to propagate correctly, leading to significant numerical dispersion. We also show that the Fourier analysis generates mathematical artifacts, and we explain how to remove them through a branch selection procedure conducted by analysis of eigenvectors and associated reconstructed solutions. The higher frequency eigenmodes, named erratic in this study, are also investigated analytically and numerically.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Some aspects of the five-dimensional Lovelock black hole spacetime: Strong homotopy retract, perihelion precession and quasistationary levels

Highlights: • Some topological aspects are explored. • The perihelion precession is calculated. • The general Heun functions are applied to obtain analytical solutions. • The quasibound states and the radial wave eigenfunctions are obtained. In this work we explore some mathematical physics aspects of the spherically symmetric Lovelock black hole in high dimensions. Intended for this aim, we thoroughly consider the metric corresponding to the five-dimensional Lovelock black hole spacetime. We construct the strong retractions by the geodesic equations on the background under consideration. As a result, from the topological point of view, we construct the theory of strong homotopy retract, which will allow us, in principle, to better understand some of its suitable applications on astrophysics and cosmology, in particular, in the analysis of the spacetime singularities. We find the solutions of the equation of motion for both radial and angular coordinates, and then we describe the outer (“exterior”) and lower (“interior”) apparent horizons. Indeed, the outer apparent horizon is the last surface from which the light waves could still escape from the black hole. Thus, it is meaningful to analyze some physical phenomena related to quantum particles propagating outside the exterior apparent horizon, in particular, we discuss the quasistationary levels of scalar fields and their radial wave functions, which are given in terms of the general Heun functions. We also calculate the perihelion precession in this background.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

A robust and efficient generalized real cascade model

This paper describes a new separation cascade model that allows for arbitrary cascade connectivity and includes the effects of mixing, material losses and generalized separation element performance. The model also accommodates mixtures with an arbitrary number of component species. The mathematical and numerical framework of this model includes both time-dependent and steady state cascade simulation. Robust numerical approximations of the continuous mathematical model are accomplished using the Sundials suite of nonlinear algebraic and differential-algebraic equation solvers. Verification of the model is accomplished using manufactured solutions while validation is demonstrated by comparison to published experimental results and benchmarks.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Posiform planting: generating QUBO instances for benchmarking

We are interested in benchmarking both quantum annealing and classical algorithms for minimizing quadratic unconstrained binary optimization (QUBO) problems. Such problems are NP-hard in general, implying that the exact minima of randomly generated instances are hard to find and thus typically unknown. While brute forcing smaller instances is possible, such instances are typically not interesting due to being too easy for both quantum and classical algorithms. In this contribution, we propose a novel method, called posiform planting , for generating random QUBO instances of arbitrary size with known optimal solutions, and use those instances to benchmark the sampling quality of four D-Wave quantum annealers utilizing different interconnection structures (Chimera, Pegasus, and Zephyr hardware graphs) and the simulated annealing algorithm. Posiform planting differs from many existing methods in two key ways. It ensures the uniqueness of the planted optimal solution, thus avoiding groundstate degeneracy, and it enables the generation of QUBOs that are tailored to a given hardware connectivity structure, provided that the connectivity is not too sparse. Posiform planted QUBOs are a type of 2-SAT boolean satisfiability combinatorial optimization problems. Our experiments demonstrate the capability of the D-Wave quantum annealers to sample the optimal planted solution of combinatorial optimization problems with up to 5, 627 qubits.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Systemwide Planning with a Branch-and-Price Algorithm for Pavement-Marking Assessment Data Collection via the Mobile Retroreflectivity Unit Routing Model

The visibility of pavement markings is one of the most critical factors for traffic safety, and a periodical assessment plan is crucial for maintaining this function. Traditional assessment methods, such as visual windshield surveys or manual testing using handheld devices, are unsafe, time-consuming, and labor-intensive. In recent years, transportation agencies have begun to adopt the use of mobile retroreflectivity units (MRUs) for condition assessment of pavement markings. MRUs, different from other manual methods, can be utilized to collect large-scale retroreflectivity data in an efficient manner. However, no relevant research has yet proposed a mathematical optimization model for arranging the evaluation schedule and paths of MRUs. This study aims to propose a MRU routing model, and an efficient solution methodology. A branch-and-price algorithm, including column generation and branch-and-bound, was implemented. Computational experiments have been conducted based on actual tasks from the Florida MRU program for validation. In conclusion, results show that the proposed solution methodology with a set partitioning model in this study not only finds the optimal solution for problems with tasks less than 60, but also effectively narrows the solution gap to be within 1.0% for problems with tasks less than 131.

42 ENGINEERING↗
DOE OSTI2022

An Asymptotically Compatible Coupling Formulation for Nonlocal Interface Problems with Jumps

Here, we introduce a mathematically rigorous formulation for a nonlocal interface problem with jumps and propose an asymptotically compatible finite element discretization for the weak form of the interface problem. After proving the well-posedness of the weak form, we demonstrate that solutions to the nonlocal interface problem converge to the corresponding local counterpart when the nonlocal data are appropriately prescribed. Several numerical tests in one and two dimensions show the applicability of our technique, its numerical convergence to exact nonlocal solutions, its convergence to the local limit when the horizons vanish, and its robustness with respect to the patch test.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Incremental Interval Assignment by Integer Linear Algebra with Improvements

Interval Assignment (IA) is the problem of selecting the number of mesh edges (intervals) for each curve for conforming quad and hex meshing. The intervals x is fundamentally integer-valued. Many other approaches perform numerical optimization then convert a floating-point solution into an integer solution, which is slow and error prone. We avoid such steps: we start integer, and stay integer. Incremental Interval Assignment (IIA) uses integer linear algebra (Hermite normal form) to find an initial solution to the meshing constraints, satisfying the integer matrix equation Solving for reduced row echelon form provides integer vectors spanning the nullspace of A. Here we add vectors from the nullspace to improve the initial solution, maintaining Ax = b Heuristics find good integer linear combinations of nullspace vectors that provide strict improvement towards variable bounds or goals. IIA always produces an integer solution if one exists. In practice we usually achieve solutions close to the user goals, but there is no guarantee that the solution is optimal, nor even satisfies variable bounds, e.g. has positive intervals. We describe several algorithmic changes since first publication that tend to improve the final solution. The software is freely available.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

An optimization method for chaotic turbulent flow

Evidence indicates that quantities-of-interest in some turbulent flows can be controlled despite the overall chaotic dynamics. It is typically thought that this is via relatively deterministic, larger-scale components of the turbulence. However, finding such controls, if they exist, is challenging because chaos causes sensitivity gradients to explode and the search space to become intractably non-convex. This challenge is analyzed, and a penalty method is introduced to cope with it. In the new approach, the time domain is broken into segments approximately matching the chaos time scales, so that the solution within each segment is both physical and relatively deterministic. The initial condition of each segment is included in an adjoint-based gradient optimization, which temporarily introduces artificial Δq discontinuities in the overall solution. The optimization then proceeds in stages with increasing penalization of Δq. The method is developed and illustrated for a logistic map, the Lorenz Equation, and an advection augmented Kuramoto–Sivashinsky Equation. These examples show how the Δq temporarily increases the search scale prior to the strong Δq → 0 penalization that recovers a physical solution. It is then applied to turbulent Kolmogorov flow, for which it also far outperforms a standard adjoint-based gradient search. Finally, the utility of such an optimized chaotic solution is discussed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A hybrid Monte Carlo, discontinuous Galerkin method for linear kinetic transport equations

Here we present a hybrid method for time-dependent particle transport problems that combines Monte Carlo (MC) estimation with deterministic solutions based on discrete ordinates. For spatial discretizations, the MC algorithm computes a piecewise constant solution and the discrete ordinates use bilinear discontinuous finite elements. From the hybridization of the problem, the resulting problem solved by Monte Carlo is scattering free, resulting in a simple, efficient solution procedure. Between time steps, we use a projection approach to “relabel” collided particles as uncollided particles. In conclusion, from a series of standard 2-D Cartesian test problems we observe that our hybrid method has improved accuracy and reduction in computational complexity of approximately an order of magnitude relative to standard discrete ordinates solutions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Uniqueness of relaxation times determined by dielectric spectroscopy

Dielectric spectroscopy is extremely powerful to study molecular dynamics, because of the very broad frequency range. Often multiple processes superimpose resulting in spectra that expand over several orders of magnitude, with some of the contributions partially hidden. For illustration, we selected two examples, (i) normal mode of high molar mass polymers partially hidden by conductivity and polarization and (ii) contour length fluctuations partially hidden by reptation using the well-studied polyisoprene melts as example. The intuitive approach to describe experimental spectra and to extract relaxation times is the addition of two or more model functions. Here, we use the empirical Havriliak-Negami function to illustrate the ambiguity of the extracted relaxation time, despite an excellent agreement of the fit with experimental data. We show that there are an infinite number of solutions for which a perfect description of experimental data can be achieved. However, a simple mathematical relationship indicates uniqueness of the pairs of the relaxation strength and relaxation time. Sacrificing the absolute value of the relaxation time enables to find the temperature dependence of the parameters with a high accuracy. For the specific cases studied here, the time temperature superposition (TTS) is very useful to confirm the principle. However, the derivation is not based on a specific temperature dependence, hence, independent from the TTS. We compare new and traditional approaches and find the same trend for the temperature dependence. The important advantage of the new technology is the knowledge of the accuracy of the relaxation times. Relaxation times determined from data for which the peak is clearly visible are the same within the experimental accuracy for traditional and new technology. However, for data where a dominant process hides the peak, substantial deviations can be observed. Finally, we conclude that the new approach is particularly helpful for cases in which relaxation times need to be determined without having access to the associated peak position.

36 MATERIALS SCIENCE↗