Search NASA⌕ Search

SEARCH · Search NASA

Results for “ODE”

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 469 records · Page 26

Analytic treatment of the black-hole bomb

A bosonic field impinging on a rotating black hole can be amplified as it scatters off the hole, a phenomenon known as superradiant scattering. If in addition the field has a nonzero rest mass {mu}, the mass term effectively works as a mirror, reflecting the scattered wave back towards the black hole. In this physical system, known as a black-hole bomb, the wave may bounce back and forth between the black hole and some turning point, amplifying itself each time. Consequently, the field grows exponentially over time and is unstable. In this paper we study analytically for the first time the phenomenon of superradiant instability (the black-hole bomb mechanism) in the regime M{mu}=O(1) of greatest instability. We find a maximal instability growth rate of {tau}{sup -1}=1.7x10{sup -3}M{sup -1}. This instability is 4 orders of magnitude stronger than has been previously estimated.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Observation of quantum interferences via light-induced conical intersections in diatomic molecules

We observe energy-dependent angle-resolved diffraction patterns in protons from strong-field dissociation of the molecular hydrogen ion H + 2 . The interference is a characteristic of dissociation around a laser-induced conical intersection (LICI), which is a point of contact between two surfaces in the dressed 2-dimensional Born-Oppenheimer potential energy landscape of a diatomic molecule in a strong laser field. The interference magnitude and angular period depend strongly on the energy difference between the initial state and the LICI, consistent with coherent diffraction around a cone-shaped potential barrier whose width and thickness depend on the relative energy of the initial state and the cone apex. As a result, these findings are supported by numerical solutions of the time-dependent Schrodinger equation for similar experimental conditions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Topological photonics

Topological photonics is a rapidly emerging field of research in which geometrical and topological ideas are exploited to design and control the behavior of light. Drawing inspiration from the discovery of the quantum Hall effects and topological insulators in condensed matter, recent advances have shown how to engineer analogous effects also for photons, leading to remarkable phenomena such as the robust unidirectional propagation of light, which hold great promise for applications. Here, thanks to the flexibility and diversity of photonics systems, this field is also opening up new opportunities to realize exotic topological models and to probe and exploit topological effects in new ways. This article reviews experimental and theoretical developments in topological photonics across a wide range of experimental platforms, including photonic crystals, waveguides, metamaterials, cavities, optomechanics, silicon photonics, and circuit QED. A discussion of how changing the dimensionality and symmetries of photonics systems has allowed for the realization of different topological phases is offered, and progress in understanding the interplay of topology with non-Hermitian effects, such as dissipation, is reviewed. As an exciting perspective, topological photonics can be combined with optical nonlinearities, leading toward new collective phenomena and novel strongly correlated states of light, such as an analog of the fractional quantum Hall effect.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A point mutation in the [2Fe–2S] cluster binding region of the NAF-1 protein (H114C) dramatically hinders the cluster donor properties

NAF-1 has been shown to be related with human health and disease, is upregulated in epithelial breast cancer and suppression of its expression significantly suppresses tumor growth. It is shown that replacement of the single His ligand with Cys resulted in dramatic changes to the properties of its 2Fe-2S clusters without any global crystal structural changes. NAF-1 is an important [2Fe–2S] NEET protein associated with human health and disease. A mis-splicing mutation in NAF-1 results in Wolfram Syndrome type 2, a lethal childhood disease. Upregulation of NAF-1 is found in epithelial breast cancer cells, and suppression of NAF-1 expression by knockdown significantly suppresses tumor growth. Key to NAF-1 function is the NEET fold with its [2Fe–2S] cluster. In this work, the high-resolution structure of native NAF-1 was determined to 1.65 Å resolution (R factor = 13.5%) together with that of a mutant in which the single His ligand of its [2Fe–2S] cluster, His114, was replaced by Cys. The NAF-1 H114C mutant structure was determined to 1.58 Å resolution (R factor = 16.0%). All structural differences were localized to the cluster binding site. Compared with native NAF-1, the [2Fe–2S] clusters of the H114C mutant were found to (i) be 25-fold more stable, (ii) have a redox potential that is 300 mV more negative and (iii) have their cluster donation/transfer function abolished. Because no global structural differences were found between the mutant and the native (wild-type) NAF-1 proteins, yet significant functional differences exist between them, the NAF-1 H114C mutant is an excellent tool to decipher the underlying biological importance of the [2Fe–2S] cluster of NAF-1 in vivo.

60 APPLIED LIFE SCIENCES↗

Self-stabilizing Connected Components

For the problem of computing the connected components of a graph, this paper considers the design of algorithms that are resilient to transient hardware faults, like bit Hips. More specifically, it applies the technique of self-stabilization. A system is self-stabilizing if, when starting from a valid or invalid state, it is guaranteed to reach a valid state after a finite number of steps. Therefore on a machine subject to a transient fault, a self-stabilizing algorithm could recover if that fault caused the system to enter an invalid state. We give a comprehensive analysis of the valid and invalid states during label propagation and derive algorithms to verify and correct the invalid state. The self-stabilizing label-propagation algorithm performs O (V log V) additional computation and requires O (V) additional storage over its conventional counterpart (and, as such, does not increase asymptotic complexity over conventional label propagation). When run against a battery of simulated fault injection tests, the self-stabilizing label propagation algorithm exhibits more resilient behavior than a triple modular redundancy (TMR) based fault-tolerant algorithm in 80% of cases. From a performance perspective, it also outperforms TMR as it requires fewer iterations in total. Beyond the fault tolerance properties of self-stabilizing label-propagation, we believe, they are useful from the theoretical perspective; and may have other use-cases.

Sao, Piyush↗

Wassersplines for Neural Vector Field-Controlled Animation

Much of computer-generated animation is created by manipulating meshes with rigs. While this approach works well for animating articulated objects like animals, it has limited flexibility for animating less structured free-form objects. Here we introduce Wassersplines, a novel trajectory inference method for animating unstructured densities based on recent advances in continuous normalizing flows and optimal transport. The key idea is to train a neurally-parameterized velocity field that represents the motion between keyframes. Trajectories are then computed by advecting keyframes through the velocity field. We solve an additional Wasserstein barycenter interpolation problem to guarantee strict adherence to keyframes. Our tool can stylize trajectories through a variety of PDE-based regularizers to create different visual effects. We demonstrate our tool on various keyframe interpolation problems to produce temporally-coherent animations without meshing or rigging.

97 MATHEMATICS AND COMPUTING↗

Reverse dissimilatory sulfite reductase as phylogenetic marker for a subgroup of sulfur-oxidizing prokaryotes

Sulfur-oxidizing prokaryotes (SOP) catalyse a central step in the global S-cycle and are of major functional importance for a variety of natural and engineered systems, but our knowledge on their actual diversity and environmental distribution patterns is still rather limited. In this study we developed a specific PCR assay for the detection of dsrAB that encode the reversely operating sirohaem dissimilatory sulfite reductase (rDSR) and are present in many but not all published genomes of SOP. The PCR assay was used to screen 42 strains of SOP (most without published genome sequence) representing the recognized diversity of this guild. For 13 of these strains dsrAB was detected and the respective PCR product was sequenced. Interestingly, most dsrAB-encoding SOP are capable of forming sulfur storage compounds. Phylogenetic analysis demonstrated largely congruent rDSR and 16S rRNA consensus tree topologies, indicating that lateral transfer events did not play an important role in the evolutionary history of known rDSR. Thus, this enzyme represents a suitable phylogenetic marker for diversity analyses of sulfur storage compound-exploiting SOP in the environment. The potential of this new functional gene approach was demonstrated by comparative sequence analyses of all dsrAB present in published metagenomes and by applying it for a SOP census in selected marine worms and an alkaline lake sediment.

59 BASIC BIOLOGICAL SCIENCES↗

Continuous polymer films deposited on top of porous substrates using plasma-enhanced atomic layer deposition and molecular layer deposition

Molecular layer deposition (MLD) is able to produce ultrathin polymer films with control over thickness, cross-linking, and chemical composition. With these capabilities, MLD should be useful in the fabrication of novel polymer membranes on porous supports. However, confining a continuous MLD film to the surface of porous substrates is difficult because of MLD film growth in the pores. The deposition in the pores lowers the conductance of the porous support. This paper presents a method to deposit continuous polymer films on top of porous substrates. In this method, Al2O3 plasma-enhanced atomic layer deposition (PE-ALD) using trimethylaluminum and oxygen plasma as the reactants was first used to cap the pores of the substrate. Subsequently, a polyamide MLD film was deposited on the Al2O3 PE-ALD capping layer using m-phenylenediamine and trimesoyl chloride as the reactants. The Al2O3 pore caps were then removed from the porous substrate by etching from the backside using a timed exposure to a dilute sodium hydroxide solution. This method was demonstrated using anodic aluminum oxide (AAO) and polyethersulfone (PES) porous substrates. Al2O3 PE-ALD film growth was limited to the top of the porous substrate, resulting in rapid surface recombination or high sticking coefficients for the reactive plasma species within the pores. Gas permeance measurements confirmed the pore capping of the AAO substrates. The reopening of the pores by dissolving the Al2O3 pore caps with a sodium hydroxide solution was monitored using gas permeance versus etch time. The removal of the Al2O3 pore caps from the PES substrates could also dissolve the Al2O3 layer underneath the MLD film. The loss of this Al2O3 layer led to the detachment of the MLD film from the PES substrate. However, the MLD film could be anchored to the PES support at fractures located in the Al2O3 film prior to the MLD. The Al2O3 film fracture allowed the MLD film to anchor firmly to the PES substrate by MLD in the pores of the PES porous substrate. The distance between the anchor points was a function of fracture density. This distance could be controlled by applying a tensile stress to the Al2O3 PE-ALD film to fracture the film through sample bending. This method produced firmly anchored polymer MLD films on top of the PES porous substrates.

Welch, Brian C. (ORCID:000000029747045X)↗

3D strain-induced superconductivity in La 2 CuO 4+δ using a simple vertically aligned nanocomposite approach

A long-term goal for superconductors is to increase the superconducting transition temperature, T C . In cuprates, T C depends strongly on the out-of-plane Cu-apical oxygen distance and the in-plane Cu-O distance, but there has been little attention paid to tuning them independently. Here, in simply grown, self-assembled, vertically aligned nanocomposite thin films of La 2 CuO 4+δ + LaCuO 3 , by strongly increasing out-of-plane distances without reducing in-plane distances (three-dimensional strain engineering), we achieve superconductivity up to 50 K in the vertical interface regions, spaced ~50 nm apart. No additional process to supply excess oxygen, e.g., by ozone or high-pressure oxygen annealing, was required, as is normally the case for plain La 2 CuO 4+δ films. Finally, our proof-of-concept work represents an entirely new approach to increasing >T C n cuprates or other superconductors.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Communication-avoiding symmetric-indefinite factorization

We describe and analyze a novel symmetric triangular factorization algorithm. The algorithm is essentially a block version of Aasen's triangular tridiagonalization. It factors a dense symmetric matrix A as the product A=PLTL T P T where P is a permutation matrix, L is lower triangular, and T is block tridiagonal and banded. The algorithm is the first symmetric-indefinite communication-avoiding factorization: it performs an asymptotically optimal amount of communication in a two-level memory hierarchy for almost any cache-line size. Adaptations of the algorithm to parallel computers are likely to be communication efficient as well; one such adaptation has been recently published. As a result, the current paper describes the algorithm, proves that it is numerically stable, and proves that it is communication optimal.

97 MATHEMATICS AND COMPUTING↗

Improving the Numerical Stability of Fast Matrix Multiplication

Fast algorithms for matrix multiplication, namely those that perform asymptotically fewer scalar operations than the classical algorithm, have been considered primarily of theoretical interest. Apart from Strassen's original algorithm, few fast algorithms have been efficiently implemented or used in practical applications. However, there exist many practical alternatives to Strassen's algorithm with varying performance and numerical properties. Fast algorithms are known to be numerically stable, but because their error bounds are slightly weaker than the classical algorithm, they are not used even in cases where they provide a performance benefit. We argue in this study that the numerical sacrifice of fast algorithms, particularly for the typical use cases of practical algorithms, is not prohibitive, and we explore ways to improve the accuracy both theoretically and empirically. The numerical accuracy of fast matrix multiplication depends on properties of the algorithm and of the input matrices, and we consider both contributions independently. We generalize and tighten previous error analyses of fast algorithms and compare their properties. We discuss algorithmic techniques for improving the error guarantees from two perspectives: manipulating the algorithms, and reducing input anomalies by various forms of diagonal scaling. In conclusion, we benchmark performance and demonstrate our improved numerical accuracy.

97 MATHEMATICS AND COMPUTING↗

Generative Ensemble Regression: Learning Particle Dynamics from Observations of Ensembles with Physics-informed Deep Generative Models

Here, we propose a new method for inferring the governing stochastic ordinary differential equations (SODEs) by observing particle ensembles at discrete and sparse time instants, i.e., multiple “snapshots.” Particle coordinates at a single time instant, possibly noisy or truncated, are recorded in each snapshot but are unpaired across the snapshots. By training a physics-informed generative model that generates “fake” sample paths, we aim to fit the observed particle ensemble distributions with a curve in the probability measure space, which is induced from the inferred particle dynamics. We employ different metrics to quantify the differences between distributions, e.g., the sliced Wasserstein distances and the adversarial losses in generative adversarial networks. We refer to this method as generative “ensemble-regression” (GER), in analogy to the classic “point-regression,” where we infer the dynamics by performing regression in the Euclidean space. We illustrate the GER by learning the drift and diffusion terms of particle ensembles governed by SODEs with Brownian motions and Lévy processes up to 100 dimensions. We also discuss how to treat cases with noisy or truncated observations. Apart from systems consisting of independent particles, we also tackle nonlocal interacting particle systems with unknown interaction potential parameters by constructing a physics-informed loss function. Finally, we investigate scenarios of paired observations and discuss how to reduce the dimensionality in such cases by proving a convergence theorem that provides theoretical support.

97 MATHEMATICS AND COMPUTING↗

Binary Optimal Control of Single-Flux-Quantum Pulse Sequences

We introduce a binary, relaxed gradient, trust-region method for optimizing pulse sequences for single flux quanta (SFQ) control of a quantum computer. The pulse sequences are optimized with the goal of realizing unitary gate transformations. Each pulse has a fixed amplitude and duration. Here we model this process as an binary optimal control problem, constrained by Schrödinger’s equation, where the binary variables indicate whether each pulse is on or off. We introduce a first-order trust-region method, which takes advantage of a relaxed gradient to determine an optimal pulse sequence that minimizes the gate infidelity, while also suppressing leakage to higher energy levels. The proposed algorithm has a computational complexity of O(p log(p)), where p is the number of pulses in the sequence. We present numerical results for the H and X gates, where the optimized pulse sequences give gate fidelity’s better than 99.9%, in ≈ 25 trust-region iterations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Brief announcement: Hypergraph parititioning for parallel sparse matrix-matrix multiplication

The performance of parallel algorithms for sparse matrix-matrix multiplication is typically determined by the amount of interprocessor communication performed, which in turn depends on the nonzero structure of the input matrices. In this paper, we characterize the communication cost of a sparse matrix-matrix multiplication algorithm in terms of the size of a cut of an associated hypergraph that encodes the computation for a given input nonzero structure. Obtaining an optimal algorithm corresponds to solving a hypergraph partitioning problem. Furthermore, our hypergraph model generalizes several existing models for sparse matrix-vector multiplication, and we can leverage hypergraph partitioners developed for that computation to improve application-specific algorithms for multiplying sparse matrices.

97 MATHEMATICS AND COMPUTING↗