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 181 records · Page 10

Family of potentials with power law kink tails

Here, we provide examples of a large class of one-dimensional higher-order field theories with kink solutions which asymptotically have a power law tail either at one end or at both ends. In particular, we provide examples of a family of potentials which admit a kink as well as a mirror kink solution where all four ends of the two kinks, or only two extreme ends of the two kinks have a power law tail (while the two ends facing each other have an exponential tail). The remaining case includes the situation when the ends facing each other have a power law tail while the two extreme ends of the two kinks have an exponential tail. Further, we show that for a kink with a power law tail at either one end or at both ends, there is no gap between the zero mode and the continuum of the corresponding stability equation. This is in contrast with the kinks with an exponential tail at both ends, in which case there is always a gap between the zero mode and the continuum.

97 MATHEMATICS AND COMPUTING↗

Connections between complex PT-invariant solutions and complex periodic solutions of several nonlinear equations

We point out novel connections between complex PT-invariant solutions of several nonlinear equations such as $\phi$ 4 , $\phi$ 6 sine-Gordon, hyperbolic sine-Gordon, double sine-Gordon, double hyperbolic sine-Gordon, mKdV, etc. We then use these connections to obtain several new complex PT-invariant periodic solutions of some of these equations.

97 MATHEMATICS AND COMPUTING↗

Wide class of logarithmic potentials with power-tower kink tails

We present a wide class of potentials which admit kinks and corresponding mirror kinks with either a power law or an exponential tail at the two extreme ends and a power-tower form of tails at the two neighbouring ends. We analyse kink stability equation in all these cases and show that there is no gap between the zero mode and the beginning of the continuum. Finally, we provide a recipe for obtaining logarithmic potentials with power-tower kink tails and estimate kink–kink interaction strength.

97 MATHEMATICS AND COMPUTING↗

Behavior of solitary waves of coupled nonlinear Schrödinger equations subjected to complex external periodic potentials with odd-$\mathcal{PT}$ symmetry

In this work, we discuss the response of both moving and trapped solitary wave solutions of a two-component nonlinear Schrödinger system in 1 + 1 dimensions to an odd-$\mathcal{PT}$ external periodic complex potential. The dynamical behavior of perturbed solitary waves is explored by conducting numerical simulations of the nonlinear system and using a collective coordinate variational approximation. We present case examples corresponding to choices of parameter values and initial conditions involved therein. The results of the collective coordinate approximation are compared against numerical simulations where we observe qualitatively good agreement between the two. Unlike the case for a single-component solitary wave in a complex periodic $\mathcal{PT}$-symmetric potential, the collective coordinate equations do not have a small oscillation regime, and initially the height of the two components changes in opposite directions often causing instability. We find that the dynamic stability criteria we have used in the one-component case are a good indicator for the onset of dynamic instabilities in the present setup.

97 MATHEMATICS AND COMPUTING↗

Early Career Paths at Los Alamos National Laboratory

We represent a selection of early career staff at LANL with backgrounds in mathematics. There are many possible paths to a position at LANL. The lab has very active graduate research and postdoctoral programs, and it is not uncommon for graduate students to become postdocs, who can then be “converted” to staff. Conversion from being a postdoc is not the only route to a position at LANL, nor is it a guarantee, but most of us did postdocs here before becoming staff. Being a postdoc here also gives you an idea of whether you’d like living in northern New Mexico, a rugged, beautiful, and somewhat remote area. It is important to say here that citizenship is not a requirement for many of the positions at the lab. The lab historically and currently welcomes investigators from all over the world. LANL offers a broad spectrum of mathematical challenges that are largely problem driven. Particularly to those who feel that academic mathematics can be stove-piped, with a focus on deep but not necessarily broad expertise, the LANL environment gives the flexibility to move and grow in many different directions. The lab encourages a team-based approach to problems, which not only enhances the breadth of our approach to solving problems, but also gives team members access to new fields. From the outside (academia), however, it can be difficult to see how fields map between academia and the lab. This is one of the reasons that having interaction with the lab as a graduate student or postdoc can be helpful in understanding if the environment would be a good match for you. An important advantage of working at the lab is our high visibility both in academia, as well as in industry and the government. Because of its mission-driven projects, LANL, and more broadly the Department of Energy Laboratories, help set research directions that are picked up by researchers in academia. For this reason, many lab staff have worked at LANL for a number of years, then have transferred into academia after having set the agenda for their field of expertise. Below, we will share some of our experiences, opinions, and reflections in order to give the reader a feel for our own early career experiences.

97 MATHEMATICS AND COMPUTING↗

Nonlinear dimension reduction for surrogate modeling using gradient information

We introduce a method for the nonlinear dimension reduction of a high-dimensional function $u:{\mathbb{R}}^d\rightarrow{\mathbb{R}}$, $d\gg 1$. Our objective is to identify a nonlinear feature map $g:{\mathbb{R}}^d\rightarrow{\mathbb{R}}^m$, with a prescribed intermediate dimension $m\ll d$, so that $u$ can be well approximated by $f\circ g$ for some profile function $f:{\mathbb{R}}^m\rightarrow{\mathbb{R}}$. We propose to build the feature map by aligning the Jacobian $\nabla g$ with the gradient $\nabla u$, and we theoretically analyze the properties of the resulting $g$. Once $g$ is built, we construct $f$ by solving a gradient-enhanced least squares problem. Our practical algorithm uses a sample $\{{\textbf{x}}^{(i)},u({\textbf{x}}^{(i)}),\nabla u({\textbf{x}}^{(i)})\}_{i=1}^N$ and builds both $g$ and $f$ on adaptive downward-closed polynomial spaces, using cross validation to avoid overfitting. We numerically evaluate the performance of our algorithm across different benchmarks, and explore the impact of the intermediate dimension $m$. We show that building a nonlinear feature map $g$ can permit more accurate approximation of $u$ than a linear $g$, for the same input data set.

97 MATHEMATICS AND COMPUTING↗

Speed-of-light pulses in a massless nonlinear Dirac equation

Here, in this work, we explore a massless nonlinear Dirac equation, i.e., a nonlinear Weyl equation. We study the dynamics of its pulse solutions and find that a localized one-hump initial condition splits into a localized two-hump pulse, while an associated phase structure emerges in suitable components of the spinor field. For times larger than a transient time t s this pulse moves with the speed of light, effectively featuring linear wave dynamics and maintaining its shape (both in two and three dimensions). We show that for the considered nonlinearity, this pulse represents an exact solution of the nonlinear equation. Finally, we briefly comment on the generalization of the results to a broader class of nonlinearities.

97 MATHEMATICS AND COMPUTING↗

Jamming and tiling in fragmentation of rectangles

We investigate a stochastic process where a rectangle breaks into smaller rectangles through a series of horizontal and vertical fragmentation events. We focus on the case where both the vertical size and the horizontal size of a rectangle are discrete variables. Because of this constraint, the system reaches a jammed state where all rectangles are sticks, that is, rectangles with minimal width. Sticks are frozen as they cannot break any further. The average number of sticks in the jammed state, S , grows as S ≃ A /√2π ln A with rectangle area A in the large-area limit, and remarkably, this behavior is independent of the aspect ratio. The distribution of stick length has a power-law tail, and further, its moments are characterized by a nonlinear spectrum of scaling exponents. Here, we also study an asymmetric breakage process where vertical and horizontal fragmentation events are realized with different probabilities. In this case, there is a phase transition between a weakly asymmetric phase where the length distribution is independent of system size and a strongly asymmetric phase where this distribution depends on system size.

97 MATHEMATICS AND COMPUTING↗

Transition from susceptible-infected to susceptible-infected-recovered dynamics in a susceptible-cleric-zombie-recovered active matter model

The susceptible-infected (SI) and susceptible-infected-recovered (SIR) models provide two distinct representations of epidemic evolution, distinguished by whether or not the number of susceptibles always drops to zero at long times. Here, in this study, we introduce a new active matter epidemic model, the “susceptible-cleric-zombie-recovered” (SCZR) model, in which spontaneous recovery is absent but zombies can recover with probability γ via interaction with a cleric. Upon colliding with a zombie, both susceptibles and clerics enter the zombie state with probability β and α, respectively. By changing the initial fraction of clerics or their healing ability rate γ, we can tune the SCZR model between SI dynamics, in which no susceptibles or clerics remain at long times, and SIR dynamics, in which a finite number of clerics and susceptibles survive at long times. The model is relevant to certain real world diseases such as HIV where spontaneous recovery is impossible but where medical interventions by a limited number of caregivers can reduce or eliminate the spread of infection.

60 APPLIED LIFE SCIENCES↗

Characterizing different motility-induced regimes in active matter with machine learning and noise

Here we examine motility-induced phase separation (MIPS) in two-dimensional run-and-tumble disk systems using both machine learning and noise fluctuation analysis. Our measures suggest that within the MIPS state there are several distinct regimes as a function of density and run time, so that systems with MIPS transitions exhibit an active fluid, an active crystal, and a critical regime. The different regimes can be detected by combining an order parameter extracted from principal component analysis with a cluster stability measurement. The principal component-derived order parameter is maximized in the critical regime, remains low in the active fluid, and has an intermediate value in the active crystal regime. We demonstrate that machine learning can better capture dynamical properties of the MIPS regimes compared to more standard structural measures such as the maximum cluster size. The different regimes can also be characterized via changes in the noise power of the fluctuations in the average speed. In the critical regime, the noise power passes through a maximum and has a broad spectrum with a 1/f 1.6 signature, similar to the noise observed near depinning transitions or for solids undergoing plastic deformation.

97 MATHEMATICS AND COMPUTING↗

Kinetics of Aggregation with Choice

Here we generalize the ordinary aggregation process to allow for choice. In ordinary aggregation, two random clusters merge and form a larger aggregate. In our implementation of choice, a target cluster and two candidate clusters are randomly selected and the target cluster merges with the larger of the two candidate clusters.We study the long-time asymptotic behavior and find that as in ordinary aggregation, the size density adheres to the standard scaling form. However, aggregation with choice exhibits a number of different features. First, the density of the smallest clusters exhibits anomalous scaling. Second, both the small-size and the large-size tails of the density are overpopulated, at the expense of the density of moderate-size clusters. Finally, we also study the complementary case where the smaller candidate cluster participates in the aggregation process and find an abundance of moderate clusters at the expense of small and large clusters. Additionally, we investigate aggregation processes with choice among multiple candidate clusters and a symmetric implementation where the choice is between two pairs of clusters.

97 MATHEMATICS AND COMPUTING↗

Aggregation-fragmentation-diffusion model for trail dynamics

We investigate statistical properties of trails formed by a random process incorporating aggregation, fragmentation, and diffusion. In this stochastic process, which takes place in one spatial dimension, two neighboring trails may combine to form a larger one, and also one trail may split into two. In addition, trails move diffusively. The model is defined by two parameters which quantify the fragmentation rate and the fragment size. In the long-time limit, the system reaches a steady state, and our focus is the limiting distribution of trail weights. We find that the density of trail weight has power-law tail P(w)~w –γ for small weight w. We obtain the exponent γ analytically and find that it varies continuously with the two model parameters. In conclusion, the exponent γ can be positive or negative, so that in one range of parameters small-weight trails are abundant and in the complementary range they are rare.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

How Difficult is it to Prepare a Quantum State?

Consider a quantum system prepared in an input state. One wants to drive it into a target state. Assuming classical states and operations as free resources, I identify a geometric cost function which quantifies the difficulty of the protocol in terms of how different it is from a classical process. The quantity determines a lower bound to the number of commuting unitary transformations required to complete the task. Lastly, I then discuss the link between the quantum character of a state preparation and the amount of coherence and quantum correlations that are created in the target state.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗