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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Nearly Periodic Maps and Geometric Integration of Noncanonical Hamiltonian Systems

Abstract M. Kruskal showed that each continuous-time nearly periodic dynamical system admits a formal U (1)-symmetry, generated by the so-called roto-rate. When the nearly periodic system is also Hamiltonian, Noether’s theorem implies the existence of a corresponding adiabatic invariant. We develop a discrete-time analog of Kruskal’s theory. Nearly periodic maps are defined as parameter-dependent diffeomorphisms that limit to rotations along a U (1)-action. When the limiting rotation is non-resonant, these maps admit formal U (1)-symmetries to all orders in perturbation theory. For Hamiltonian nearly periodic maps on exact presymplectic manifolds, we prove that the formal U (1)-symmetry gives rise to a discrete-time adiabatic invariant using a discrete-time extension of Noether’s theorem. When the unperturbed U (1)-orbits are contractible, we also find a discrete-time adiabatic invariant for mappings that are merely presymplectic, rather than Hamiltonian. As an application of the theory, we use it to develop a novel technique for geometric integration of non-canonical Hamiltonian systems on exact symplectic manifolds.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

On Properties of Adjoint Systems for Evolutionary PDEs

We investigate the geometric structure of adjoint systems associated with evolutionary partial differential equations at the fully continuous, semi-discrete, and fully discrete levels and the relations between these levels. We show that the adjoint system associated with an evolutionary partial differential equation has an infinite-dimensional Hamiltonian structure, which is useful for connecting the fully continuous, semi-discrete, and fully discrete levels. We subsequently address the question of discretize-then-optimize versus optimize-then-discrete for both semi-discretization and time integration, by characterizing the commutativity of discretize-then-optimize methods versus optimize-then-discretize methods uniquely in terms of an adjoint-variational quadratic conservation law. For Galerkin semi-discretizations and one-step time integration methods in particular, we explicitly construct these commuting methods by using structure-preserving discretization techniques.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A Type II Hamiltonian Variational Principle and Adjoint Systems for Lie Groups

We present a novel Type II variational principle on the cotangent bundle of a Lie group which enforces Type II boundary conditions, i.e., fixed initial position and final momentum. In general, such Type II variational principles are only globally defined on vector spaces or locally defined on general manifolds; however, by left translation, we are able to define this variational principle globally on cotangent bundles of Lie groups. Type II boundary conditions are particularly important for adjoint sensitivity analysis, which is our motivating application. As such, we additionally discuss adjoint systems on Lie groups, their properties, and how they can be used to solve optimization problems subject to dynamics on Lie groups.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

On Bayes Equality and Related Issues

To make calculations in the Bayesian analysis, the formalism of which is based on the layering of a probability measure defined on the product of measurable spaces, it is useful to have a summary of the properties of this layering. In this paper we formulate and prove those of them that are used in calculations more often than others. Particularly, we prove Hoeffding-type inequalities using direct elementary techniques.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Behavior of Stabilizing Solutions of the Riccati Equation

Sufficient conditions are found for the existence of stabilizing solutions of the Riccati differential equation y′ = (y − y{sub 1}(x)) (y − y{sub 2}(x)) with given y{sub 1}(x) and y{sub 2}(x). For various types of stabilizing solutions, the number of points of extremum is examined.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Towards the Reverse Decomposition of Unipotents

Decomposition of unipotents gives short polynomial expressions of the conjugates of elementary generators as products of elementaries. It turns out that with some minor twist the decomposition of unipotents can be read backwards to give very short polynomial expressions of the elementary generators themselves in terms of elementary conjugates of an arbitrary matrix and its inverse. For absolute elementary subgroups of classical groups this was recently observed by Raimund Preusser. I discuss various generalizations of these results for exceptional groups, specifically those of types E{sub 6} and E{sub 7}, and also mention further possible generalizations and applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

New preconditioning strategy for Jacobian-free solvers for variably saturated flows with Richards’ equation

We develop a new approach for solving the nonlinear Richards’ equation arising in variably saturated flow modeling. The growing complexity of geometric models for simulation of subsurface flows leads to the necessity of using unstructured meshes and advanced discretization methods. Typically, a numerical solution is obtained by first discretizing PDEs and then solving the resulting system of nonlinear discrete equations with a Newton-Raphson-type method. Efficiency and robustness of the existing solvers rely on many factors, including an empiric quality control of intermediate iterates, complexity of the employed discretization method and a customized preconditioner. We propose and analyze a new preconditioning strategy that is based on a stable discretization of the continuum Jacobian. We will show with numerical experiments for challenging problems in subsurface hydrology that this new preconditioner improves convergence of the existing Jacobian-free solvers 3-20 times. Furthermore, we show that the Picard method with this preconditioner becomes a more efficient nonlinear solver than a few widely used Jacobian-free solvers.

58 GEOSCIENCES↗
DOE OSTI2019

The conforming virtual element method for polyharmonic problems

Here, we exploit the capability of virtual element methods in accommodating approximation spaces featuring high-order continuity to numerically approximate differential problems of the form $(–Δ)^pu = f , p ≥ 1$. More specifically, we develop and analyze the conforming virtual element method for the numerical approximation of polyharmonic boundary value problems, and prove an abstract result that states the convergence of the method in suitable norms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Physics-based stabilized finite element approximations of the Poisson–Nernst–Planck equations

We present and analyze two stabilized finite element methods for solving numerically the Poisson–Nernst–Planck equations. The stabilization we consider is carried out by using a shock detector and a discrete graph Laplacian operator for the ion equations, whereas the discrete equation for the electric potential need not be stabilized. Discrete solutions stemmed from the first algorithm preserve both maximum and minimum discrete principles. For the second algorithm, its discrete solutions are conceived so that they hold discrete principles and obey an entropy law provided that an acuteness condition is imposed for meshes. Remarkably the latter is found to be unconditionally stable. We validate our methodology through transient numerical experiments that show convergence toward steady-state solutions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Finite grid instability and spectral fidelity of the electrostatic Particle-In-Cell algorithm

The origin of the Finite Grid Instability (FGI) is studied by resolving the dynamics in the 1D electrostatic Particle-In-Cell (PIC) model in the spectral domain at the single particle level and at the collective motion level. The spectral fidelity of the PIC model is contrasted with the underlying physical system or the gridless model. The systematic spectral phase and amplitude errors from the charge deposition and field interpolation are quantified for common particle shapes used in the PIC models. Lastly, it is shown through such analysis and in simulations that the lack of spectral fidelity relative to the physical system due to the existence of aliased spatial modes is the major cause of the FGI in the PIC model.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2019

A higher order approximate static condensation method for multi-material diffusion problems

The paper studies an approximate static condensation method for the diffusion problem with discontinuous diffusion coefficients. The method allows for a general polygonal mesh which is unfitted to the material interfaces. Moreover, the interfaces can be discontinuous across the mesh edges as typical for numerical reconstructions using the volume or moment-of-fluid methods. We apply a mimetic finite difference method to solve local diffusion problems and use P 1 (mortar) edge elements to couple local problems into the global system. The condensation process and the properties of the resulting algebraic system are discussed. It is demonstrated that the method is second order accurate on smooth solutions and performs well for problems with high contrast in diffusion coefficients. Experiments also show the robustness with respect to position of the material interfaces against the underlying mesh.

97 MATHEMATICS AND COMPUTING↗