Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mathematics of 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 127 records · Page 7

Uncertainty analysis of trade-offs between multiple responses using hypervolume

When multiple responses are considered in process optimization, the degree to which they can be simultaneously optimized depends on the optimization objectives and the amount of trade-offs between the responses. The normalized hypervolume of the Pareto front is a useful summary to quantify the amount of trade-offs required to balance performance across the multiple responses. In order to quantify the impact of uncertainty of the estimated response surfaces and add realism to what future data to expect, 2 versions of the scaled normalized hypervolume of the Pareto front are presented. To demonstrate the variation of the hypervolume distributions, we explore a case study for a chemical process involving 3 responses, each with a different type of optimization goal. Our results show that the global normalized hypervolume characterizes the proximity to the ideal results possible, while the instance-specific summary considers the richness of the front and the severity of trade-offs between alternatives. Furthermore, the 2 scaling schemes complement each other and highlight different features of the Pareto front and hence are useful to quantify what solutions are possible for simultaneous optimization of multiple responses.

97 MATHEMATICS AND COMPUTING↗

Selecting a near-optimal design for multiple criteria with improved robustness to different user priorities

In a decision-making process, relying on only one objective can often lead to oversimplified decisions that ignore important considerations. Incorporating multiple, and likely competing, objectives is critical for balancing trade-offs on different aspects of performance. When multiple objectives are considered, it is often hard to make a precise decision on how to weight the different objectives when combining their performance for ranking and selecting designs. We show that there are situations when selecting a design with near-optimality for a broad range of weight combinations of the criteria is a better test selection strategy compared with choosing a design that is strictly optimal under very restricted conditions. Here, we propose a new design selection strategy that identifies several top-ranked solutions across broad weight combinations using layered Pareto fronts and then selects the final design that offers the best robustness to different user priorities. This method involves identifying multiple leading solutions based on the primary objectives and comparing the alternatives using secondary objectives to make the final decision. We focus on the selection of screening designs because they are widely used both in industrial research, development, and operational testing. The method is illustrated with an example of selecting a single design from a catalog of designs of a fixed size. However, the method can be adapted to more general designed experiment selection problems that involve searching through a large design space.

97 MATHEMATICS AND COMPUTING↗

Kink dynamics in a parametric Φ 6 system: a model with controllably many internal modes

We explore a variant of the Φ 6 model originally proposed in Phys. Rev.D 12 (1975) 1606 as a prototypical, so-called, “bag” model in which domain walls play the role of quarks within hadrons. We examine the steady state of the model, namely an apparent bound state of two kink structures. We explore its linearization, and we find that, as a function of a parameter controlling the curvature of the potential, an effectively arbitrary number of internal modes may arise in the point spectrum of the linearization about the domain wall profile. We explore some of the key characteristics of kink-antikink collisions, such as the critical velocity and the multi-bounce windows, and how they depend on the principal parameter of the model. We find that the critical velocity exhibits a non-monotonic dependence on the parameter controlling the curvature of the potential. For the multi-bounce windows, we find that their range and complexity decrease as the relevant parameter decreases (and as the number of internal modes in the model increases). We use a modified collective coordinates method [in the spirit of recent works such as Phys. Rev.D 94 (2016) 085008] in order to capture the relevant phenomenology in a semi-analytical manner.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗