Search NASA⌕ Search

SEARCH · Search NASA

Results for “Hyperbolic”

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 109 records · Page 6

Hyperbolic exciton polaritons in a van der Waals magnet

Abstract Exciton polaritons are quasiparticles of photons coupled strongly to bound electron-hole pairs, manifesting as an anti-crossing light dispersion near an exciton resonance. Highly anisotropic semiconductors with opposite-signed permittivities along different crystal axes are predicted to host exotic modes inside the anti-crossing called hyperbolic exciton polaritons (HEPs), which confine light subdiffractionally with enhanced density of states. Here, we show observational evidence of steady-state HEPs in the van der Waals magnet chromium sulfide bromide (CrSBr) using a cryogenic near-infrared near-field microscope. At low temperatures, in the magnetically-ordered state, anisotropic exciton resonances sharpen, driving the permittivity negative along one crystal axis and enabling HEP propagation. We characterize HEP momentum and losses in CrSBr, also demonstrating coupling to excitonic sidebands and enhancement by magnetic order: which boosts exciton spectral weight via wavefunction delocalization. Our findings open new pathways to nanoscale manipulation of excitons and light, including routes to magnetic, nonlocal, and quantum polaritonics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stability analysis of the Eulerian–Lagrangian finite volume methods for nonlinear hyperbolic equations in one space dimension

In this paper, we construct a novel Eulerian–Lagrangian finite volume (ELFV) method for nonlinear scalar hyperbolic equations in one space dimension. It is well known that the exact solutions to such problems may contain shocks though the initial conditions are smooth, and direct numerical methods may suffer from restricted time step sizes. To relieve the restriction, we propose an ELFV method, where the space-time domain was separated by the partition lines originated from the cell interfaces whose slopes are obtained following the Rakine–Hugoniot junmp condition. Unfortunately, to avoid the intersection of the partition lines, the time step sizes are still limited. To fix this gap, we detect effective troubled cells (ETCs) and carefully design the influence region of each ETC, within which the partitioned space-time regions are merged together to form a new one. Then with the new partition of the space-time domain, we theoretically prove that the proposed first-order scheme with Euler forward time discretization is total-variation-diminishing and maximum-principle-preserving with at least twice larger time step constraints than the classical first order Eulerian method for Burgers’ equation. Numerical experiments verify the optimality of the designed time step sizes.

97 MATHEMATICS AND COMPUTING↗

High order explicit local time stepping methods for hyperbolic conservation laws

In this paper we present and analyze a general framework for constructing high order explicit local time stepping (LTS) methods for hyperbolic conservation laws. In particular, we consider the model problem discretized by Runge-Kutta discontinuous Galerkin (RK-DG) methods and design LTS algorithms based on the strong stability preserving Runge-Kutta (SSP-RK) schemes, that allow spatially variable time step sizes to be used for time integration in different regions of the computational domain. The proposed algorithms are of predictor-corrector type, in which the interface information along the time direction is first predicted based on the SSP-RK approximations and Taylor expansions, and then the fluxes over the region of the interface are corrected to conserve mass exactly at each time step. Following the proposed framework, we detail the corresponding LTS schemes with accuracy up to the fourth order, and prove their conservation property and nonlinear stability for the scalar conservation laws. Numerical experiments are also presented to demonstrate excellent performance of the proposed LTS algorithms.

58 GEOSCIENCES↗

Uniform accuracy of implicit-explicit Runge-Kutta (IMEX-RK) schemes for hyperbolic systems with relaxation

Implicit-explicit Runge-Kutta (IMEX-RK) schemes are popular methods to treat multiscale equations that contain a stiff part and a non-stiff part, where the stiff part is characterized by a small parameter. Here, in this work, we prove rigorously the uniform stability and uniform accuracy of a class of IMEX-RK schemes for a linear hyperbolic system with stiff relaxation. The result we obtain is optimal in the sense that it holds regardless of the value of and the order of accuracy is the same as the design order of the original scheme, i.e., there is no order reduction.

97 MATHEMATICS AND COMPUTING↗

Project Fire photographic summary and record of reentry phenomena at hyperbolic velocities

Project Fire was undertaken by the National Aeronautics and Space Administration to measure the total and radiative heating experienced by a blunt body reentering the earth's atmosphere at 11 300 meters per second. This report presents a photographic record of the Fire II spacecraft during its reentry. The photographs were clear enough to establish the times of major events, and they show that adequate-separation was maintained between the reentry package and the spent Antares. This report also identifies operational problems encountered in spacecraft reentry at hyperbolic velocities and presents the solutions satisfactorily employed.

Reentry vehicle↗

Convergence of Hyperbolic Neural Networks Under Riemannian Stochastic Gradient Descent

Abstract We prove, under mild conditions, the convergence of a Riemannian gradient descent method for a hyperbolic neural network regression model, both in batch gradient descent and stochastic gradient descent. We also discuss a Riemannian version of the Adam algorithm. We show numerical simulations of these algorithms on various benchmarks.

Whiting, Wes (ORCID:0000000247505060)↗