Search NASA⌕ Search

SEARCH · Search NASA

Results for “mathematical regularization”

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

Boundary values of the Schwarzian derivative of a regular function

Regular functions f in the half-plane Imz>0 admitting an asymptotic expansion f(z)=c{sub 1}z+c{sub 2}z{sup 2}+c{sub 3}z{sup 3}+{gamma}(z)z{sup 3}, where c{sub 1}>0, Imc{sub 2}=0 and the angular limit <lim{sub z{yields}0{gamma}}(z)=0, are considered. For various conditions on the function f inequalities for the real part of the Schwarzian derivative S{sub f}(0)=6(c{sub 3}/c{sub 1}-c{sub 2}{sup 2}/c{sub 1}{sup 2}) are established. These inequalities complement and refine some known versions of Schwarz's lemma. The results obtained are close to the well-known Burns-Krantz rigidity theorem on regular self-maps and its generalizations due to Tauraso, Vlacci and Shoikhet. Bibliography: 16 titles.

97 MATHEMATICS AND COMPUTING↗

Chaotic dynamics in a periodically driven spin-1 condensate

We use periodically modulated magnetic fields to drive spin-1 Bose-Einstein condensates (BECs) and study the corresponding spin-mixing dynamics. Due to the time-dependent driving, this system permits chaotic dynamics depending on the drive parameters, which could not occur in previous studies. From the investigation of the Poincare sections, we find there exist complex trajectories in the phase space, leading to very complicated structures of the phase space with mixed regular and chaotic regions. By calculating the quasienergy levels of the corresponding Floquet operators, the signatures of quantum chaos are also found in this system. The level spacing distribution is very close to the Poisson distribution or Wigner distribution when the corresponding classical dynamics is regular or chaotic.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

ON THE MODE OF DYNAMO ACTION IN A GLOBAL LARGE-EDDY SIMULATION OF SOLAR CONVECTION

In this paper, we examine the mode of dynamo action in the implicit large-eddy magnetohydrodynamical simulation of solar convection reported upon in Ghizaru et al. Motivated by the presence of a strong and well-defined large-scale axisymmetric magnetic component undergoing regular polarity reversals, we define the fluctuating component of the magnetic field as the difference between the total field and its zonal average. The subsequent analysis follows the physical logic and mathematical formulation of mean-field electrodynamics, whereby a turbulent electromotive force (EMF) is computed by the suitable averaging of cross-correlations between fluctuating flow and field components and expressed in terms of the mean field via a linear truncated tensorial expansion. We use singular value decomposition to perform a linear least-squares fit of the temporal variation of the EMF to that of the large-scale magnetic component, which yields the components of the full {alpha}-tensor. Its antisymmetric component, describing general turbulent pumping, is also extracted. The {alpha}-tensor so calculated reproduces a number of features already identified in local, Cartesian simulations of magnetohydrodynamical rotating convection, including an {alpha}{sub {phi}{phi}} component positive in the northern solar hemisphere, peaking at high latitudes, and reversing sign near the bottom of the convection zone; downward turbulent pumping throughout the convecting layer; and significant equatorward turbulent pumping at mid latitudes, and poleward at high latitudes in subsurface layers. We also find that the EMF contributes significantly to the regeneration of the large-scale toroidal magnetic component, which from the point of view of mean-field dynamo models would imply that the simulation operates as an {alpha}{sup 2}{Omega} dynamo. We find little significant evidence of {alpha}-quenching by the large-scale magnetic field. The amplitude of the magnetic cycle appears instead to be regulated primarily by a magnetically driven reduction of the differential rotation.

79 ASTRONOMY AND ASTROPHYSICS↗

A Relaxation Approach to Vector-Valued Allen–Cahn MPEC Problems

In this paper we consider a vector-valued Allen–Cahn MPEC problem. To derive optimality conditions we exploit a regularization–relaxation technique. The optimality system of the regularized–relaxed subproblems are investigated by applying the classical result of Zowe and Kurcyusz. Finally we show that the stationary points of the regularized–relaxed subproblems converge to weak stationary points of the limit problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the Equality of Values in the Monge and Kantorovich Problems

This paper is concerned with the study of conditions under which the Monge and Kantorovich problems with a continuous cost function on a product of two completely regular spaces and two given atomless Radon measures-projections on these spaces have equal values of the corresponding infima.

97 MATHEMATICS AND COMPUTING↗

The exact discontinuity of a partial wave along the left-hand cut and the exact N∕D method in non-relativistic scattering

We first deduce the analytical continuation in the complex planes of the initial and final three-momenta of the Lippmann–Schwinger equation in coupled or uncoupled partial-wave amplitudes. This result allows us to deduce a master equation whose solution is the exact discontinuity of the on-shell partial-wave amplitudes along the left-hand cut. This equation is always a linear non-singular integral equation whose solution is fixed exclusively by the knowledge of the potential, applicable to either regular or singular potentials. The capability of calculating exactly this discontinuity allows one to settle the exact N∕D method in two-body non-relativistic scattering for coupled and uncoupled waves. We exemplify this new advance in scattering theory by explicitly checking the agreement between the Lippmann–Schwinger equation with the corresponding solutions of the exact N∕D method for some examples that involve regular and singular potentials, either attractive or repulsive.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Whittaker-Hill equation and semifinite-gap Schroedinger operators

A periodic one-dimensional Schroedinger operator is called semifinite gap if every second gap in its spectrum is eventually closed. We construct explicit examples of semifinite-gap Schroedinger operators in trigonometric functions by applying Darboux transformations to the Whittaker-Hill equation. We give a criterion for the regularity of the corresponding potentials and investigate the spectral properties of the new operators.

97 MATHEMATICS AND COMPUTING↗

Topological field theory with Haagerup symmetry

Here, we construct a (1 + 1)d topological field theory (TFT) whose topological defect lines (TDLs) realize the transparent Haagerup $\mathscr{H}$ 3 fusion category. This TFT has six vacua, and each of the three non-invertible simple TDLs hosts three defect operators, giving rise to a total of 15 point-like operators. The TFT data, including the three-point coefficients and lasso diagrams, are determined by solving all the sphere four-point crossing equations and torus one-point modular invariance equations. We further verify that the Cardy states furnish a non-negative integer matrix representation under TDL fusion. While many of the constraints we derive are not limited to this particular TFT with six vacua, we leave open the construction of TFTs with two or four vacua. Finally, TFTs realizing the Haagerup $\mathscr{H}$ 1 and $\mathscr{H}$ 2 fusion categories can be obtained by gauging algebra objects. This article makes a modest offering in our pursuit of exotica and the quest for their eventual conformity.

97 MATHEMATICS AND COMPUTING↗

The Scientific Impact of the Exascale Computing Project

The recent arrival of the Frontier Supercomputer at Oak Ridge National Laboratory officially marked the dawn of the exascale computing era. Its successful deployment coincided with the culmination of the U.S. Department of Energy Exascale Computing Project (ECP), an ambitious, complex, and risky research and development effort that integrated contributions from a broad and diverse subset of the high-performance computing community. The success of ECP will ultimately be judged by the scientific and engineering advances that it enabled. In conclusion, this Special Issue is focused on showcasing early successes in the use of exascale resources to enable breakthroughs in key areas of science in engineering.

97 MATHEMATICS AND COMPUTING↗

Scenarios of Transitions to Hyperchaos in Nonideal Oscillating Systems

We consider a class of nonideal oscillating (by Sommerfeld and Kononenko) dynamical systems and establish the existence of two types of hyperchaotic attractors in these systems. The scenarios of transitions from regular to chaotic ones attractors and the scenarios of transitions between chaotic attractors of different types are described.

97 MATHEMATICS AND COMPUTING↗

Stochasticity and robustness in spiking neural networks

Despite drawing inspiration from biological systems which are inherently noisy and variable, artificial neural networks have been shown to require precise weights to carry out the task which they are trained to accomplish. This creates a challenge when adapting these artificial networks to specialized execution platforms which may encode weights in a manner which restricts their accuracy and/or precision.Reflecting back on the non-idealities which are observed in biological systems, we investigated the effect these properties have on the robustness of spiking neural networks under perturbations to weights. First, we examined techniques extant in conventional neural networks which resemble noisy processes, and postulated they may produce similar beneficial effects in spiking neural networks. Second, we evolved a set of spiking neural networks utilizing biological non-idealities to solve a pole-balancing task, and estimated their robustness. We showed it is higher in networks using noisy neurons, and demonstrated that one of these networks can perform well under the variance expected when a hafnium-oxide based resistive memory is used to encode synaptic weights. Lastly, we trained a series of networks using a surrogate gradient method on the MNIST classification task. We confirmed that these networks demonstrate similar trends in robustness to the evolved networks. We discuss these results and argue that they display empirical evidence supporting the role of noise as a regularizer which can increase network robustness.

97 MATHEMATICS AND COMPUTING↗

Delta distributions supported on quadratic O(p,q)-invariant surfaces

An important subset of distributions encountered in physics is the set of multiplet delta distributions {delta}{sub c{sub y}}{sup (k)}, with support a quadratic O(p,q)-invariant surface c{sub y}{delta}-bar{l_brace}x is an element of R{sup n}:P(x)=y{r_brace}, n=p+q. The evaluation of these distributions for a general test function is not always sufficiently detailed in the classical literature, especially for those distributions that are defined as a regularization and/or when one needs their causal or anticausal version (for p=1 or q=1). This work intends to improve this situation by deriving explicit expressions for <{delta}{sub c{sub y}}{sup (k)},{phi}>, for all p,q is an element of Z{sub +}, for all k is an element of N, for all y is an element of R, and for all {phi} is an element of D(R{sup n}), in a form suitable for practical applications. In addition, we also apply to these distributions a new approach to regularization. Distributions that need to be regularized are (equivalently) defined as extensions of a partial distribution. This extension process reveals in a natural way that regularized multiplet delta distributions are in general, uncountably multivalued. In the work of Gel'fand and Shilov [Generalized Functions (Academic, New York, 1964), Vol. 1] four types of multiplet delta distributions with support the null space c{sub 0} were introduced: {delta}{sub 1}{sup (k)}(P), {delta}{sub 2}{sup (k)}(P) and {delta}{sup (k)}(P{sub +}), {delta}{sup (k)}(P{sub -}). Our regularization method explains why this particular nonuniqueness was observed and further discloses the full extent of this nonuniqueness.

97 MATHEMATICS AND COMPUTING↗

Steiner minimal trees in small neighbourhoods of points in Riemannian manifolds

In contrast to the Euclidean case, almost no Steiner minimal trees with concrete boundaries on Riemannian manifolds are known. A result describing the types of Steiner minimal trees on a Riemannian manifold for arbitrary small boundaries is obtained. As a consequence, it is shown that for sufficiently small regular n-gons with n⩾7 their boundaries without a longest side are Steiner minimal trees. Bibliography: 22 titles. (paper)

97 MATHEMATICS AND COMPUTING↗

The role of stiffness in training and generalization of ResNets

Neural ordinary differential equations (NODEs) have recently regained popularity as large-depth limits of a large class of neural networks. In particular, residual neural networks (ResNets) are equivalent to an explicit Euler discretization of an underlying NODE, where the transition from one layer to the next is one time step of the discretization. The relationship between continuous and discrete neural networks has been of particular interest. Notably, analysis from the ordinary differential equation viewpoint can potentially lead to new insights for understanding the behavior of neural networks in general. In this work, we take inspiration from differential equations to define the concept of stiffness for a ResNet via the interpretation of a ResNet as the discretization of a NODE. Here, we then examine the effects of stiffness on the ability of a ResNet to generalize, via computational studies on example problems coming from climate and chemistry models. We find that penalizing stiffness does have a unique regularizing effect, but we see no benefit to penalizing stiffness over L 2 regularization (penalization of network parameter norms) in terms of predictive performance.

97 MATHEMATICS AND COMPUTING↗

Uncertainty propagation in full-core Monte Carlo depletion simulations using Serpent

The desire to accurately model the heterogeneity of the nuclear reactor environment combined with the ever more powerful computational resources have made in recent years the use of Monte Carlo method more attractive and feasible (if challenging) even for 3-D full core depletion simulation. However, in this case statistical uncertainty is combined with error propagating through the calculation from previous steps. In an effort to understand this error propagation, a numerical study was undertaken and previously reported modeling depletion of a four fuel assemblies (a 'quad'). This work extends results and analysis on a full nuclear reactor core depletion simulation where isotopics of individual fuel pins is tracked. By changing the code's initial random number seed, the data produced by a series of 19 replica runs was used to investigate the true and apparent variance in k{sub eff} and pin powers. It is hoped that this results can help to identify some common regularities in the behavior of uncertainty in several key parameters, and ultimately develop a predictive model. (authors)

97 MATHEMATICS AND COMPUTING↗

Error Estimates for the Optimal Control of a Parabolic Fractional PDE

In this work, we consider the integral definition of the fractional Laplacian and analyze a linear-quadratic optimal control problem for the so-called fractional heat equation; control constraints are also considered. We derive existence and uniqueness results, first order optimality conditions, and regularity estimates for the optimal variables. To discretize the state equation we propose a fully discrete scheme that relies on an implicit finite difference discretization in time combined with a piecewise linear finite element discretization in space. We derive stability results and a novel $L^2(0,T;L^2(\Omega))$ a priori error estimate. On the basis of the aforementioned solution technique, we propose a fully discrete scheme for our optimal control problem that discretizes the control variable with piecewise constant functions, and we derive a priori error estimates for it. We illustrate the theory with one- and two-dimensional numerical experiments.

97 MATHEMATICS AND COMPUTING↗