SEARCH · Search NASA
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.
In the present paper, the normalizer of a unipotent short and long root subgroup in a Chevalley group over an arbitrary field is calculated in detail. Surely this result is known to specialists. However the author could not find a reference to it.
Not Available
The analysis of graphs has become increasingly important to a wide range of applications. Graph analysis presents a number of unique challenges in the areas of (1) software complexity, (2) data complexity, (3) security, (4) mathematical complexity, (5) theoretical analysis, (6) serial performance, and (7) parallel performance. Implementing graph algorithms using matrix-based approaches provides a number of promising solutions to these challenges. The GraphBLAS standard (istcbigdata.org/GraphBlas) is being developed to bring the potential of matrix based graph algorithms to the broadest possible audience. The GraphBLAS mathematically defines a core set of matrix-based graph operations that can be used to implement a wide class of graph algorithms in a wide range of programming environments. This paper provides an introduction to the GraphBLAS and describes how the GraphBLAS can be used to address many of the challenges associated with analysis of graphs.
The soft mean spherical approximation is employed for the study of the thermodynamics of dusty plasma liquids, the latter treated as Yukawa one-component plasmas. Within this integral theory method, the only input necessary for the calculation of the reduced excess energy stems from the solution of a single non-linear algebraic equation. Consequently, thermodynamic quantities can be routinely computed without the need to determine the pair correlation function or the structure factor. The level of accuracy of the approach is quantified after an extensive comparison with numerical simulation results. The approach is solved over a million times with input spanning the whole parameter space and reliable analytic expressions are obtained for the basic thermodynamic quantities.
Linear Hamiltonian systems with time-dependent coefficients are of importance to nonlinear Hamiltonian systems, accelerator physics, plasma physics, and quantum physics. It is shown here that the solution map of a linear Hamiltonian system with time-dependent coefficients can be parameterized by an envelope matrix w(t), which has a clear physical meaning and satisfies a nonlinear envelope matrix equation. It is proved that a linear Hamiltonian system with periodic coefficients is stable if and only if the envelope matrix equation admits a solution with periodic w † w and a suitable initial condition. The mathematical devices utilized in this theoretical development with significant physical implications are time-dependent canonical transformations, normal forms for stable symplectic matrices, and horizontal polar decomposition of symplectic matrices. These tools systematically decompose the dynamics of linear Hamiltonian systems with time-dependent coefficients and are expected to be effective in other studies as well, such as those on quantum algorithms for classical Hamiltonian systems.
We examine the two-photon exchange corrections to elastic electron-nucleon scattering within a dispersive approach, including contributions from both nucleon and Δ intermediate states. The dispersive analysis avoids off-shell uncertainties inherent in traditional approaches based on direct evaluation of loop diagrams, and guarantees the correct unitary behavior in the high energy limit. Using empirical information on the electromagnetic nucleon elastic and N Δ transition form factors, we compute the two-photon exchange corrections both algebraically and numerically. Finally, results are compared with recent measurements of e + p to e - p cross section ratios from the CLAS, VEPP-3 and OLYMPUS experiments.
In this work, we introduce an explicit expression for the inverse of the symmetric bilinear form of Virasoro Verma modules, the so-called Shapovalov form, in terms of singular vector operators and their conformal dimensions. Our proposed expression also determines the resolution of the identity for Verma modules of the Virasoro algebra, and can be thus employed in the computation of Virasoro conformal blocks via the sewing procedure. Published by the American Physical Society 2025
Here, we study an element agglomeration coarsening strategy that requires data redistribution at coarse levels when the number of coarse elements becomes smaller than the number of MPI processes used on the finest level. The overall procedure generates coarse elements (general unstructured unions of fine grid elements) within the framework of element-based algebraic multigrid methods (or AMGe) studied previously. The AMGe-generated coarse spaces have the ability to exhibit approximation properties of the same order as the fine-level spaces since by construction they contain the piecewise polynomials of the same order as on the fine level. These approximation properties are key for the successful use of AMGe in multilevel solvers for nonlinear partial differential equations as well as for multilevel Monte Carlo (MLMC) simulations. The ability to coarsen without being constrained by the number of MPI processes, as described in the present paper, allows to improve the scalability of these solvers as well as the overall MLMC method. The paper illustrates this latter fact with detailed scalability study of MLMC simulations applied to model Darcy equations with a stochastic log-normal permeability field.
Gravitational lensing is a phenomenon where light bends around massive objects, resulting in distorted images seen by an observer. Studying gravitationally lensed systems provides insights into cosmology and astrophysics, including constraints of the expansion rate of the Universe and the distribution of dark matter. Thus, we introduce JAXtronomy, a re-implementation of the gravitational lensing software package lenstronomy (Birrer, 2021; Birrer & Amara, 2018) using JAX (Bradbury et al., 2018). JAX is a Python library that uses an accelerated linear algebra (XLA) compiler to improve the performance of computing software. Our core design principle of JAXtronomy is to maintain an identical API to that of lenstronomy. The main JAX features utilized in JAXtronomy are just-in-time compilation, which can lead to significant reductions in execution time, and automatic differentiation, which allows for the implementation of gradient-based algorithms that were previously impossible. Additionally, JAX allows code to be run on GPUs or parallelized across CPU cores, further boosting the performance of JAXtronomy.
Due to the changing nature of the power grid, it is increasingly important to be able to solve a high-fidelity optimal power-flow models on large power networks. This high-fidelity problem, called AC Optimal Power Flow (ACOPF), is a nonlinear, nonconvex optimization problem. One of the few reliable ways of solving such a problem is interior point methods. These methods result in sparse linear systems where the coefficient matrix is symmetric, indefinite and nearly always ill-conditioned. As such, they are particularly challenging for sparse linear solvers and represent a considerable computational bottleneck in solving the ACOPF problem. In this paper, we introduce a repository of linear systems captured from ACOPF problems when solved by the open-source optimizer IPOPT. These matrices are meant to be used as a test suite for sparse linear solver development.
We introduce a definition and framework for internal topological symmetries in quantum field theory, including “noninvertible symmetries” and “categorical symmetries”. We outline a calculus of topological defects which takes advantage of well-developed theorems and techniques in topological field theory. Our discussion focuses on finite symmetries, and we give indications for a generalization to other symmetries. We treat quotients and quotient defects (often called “gauging” and “condensation defects”), finite electromagnetic duality, and duality defects, among other topics. We include an appendix on finite homotopy theories, which are often used to encode finite symmetries and for which computations can be carried out using methods of algebraic topology. Throughout we emphasize exposition and examples over a detailed technical treatment.
Book on threshold logic for logical design of digital systems including threshold element synthesis by iteration, tabulation and network synthesis
Spectral factorization has been used previously to derive the steady-state solution of Kalman filtering equations without iteration for constant coefficient systems. The present work extends the spectral factorization algorithm to time-varying systems having periodic coefficient matrices for cases of both discrete and continuous systems. Time-consuming, expensive iterations of sequential covariance equations are not required to reach the final solution since this is an algebraic algorithm employing existing eigenvalue, eigenvector subroutines. The computer program incorporating the algorithm is suitable for sensitivity studies in formulating navigation and guidance strategies of low-thrust interplanetary missions. The determination of an optimum tracking pattern from an earth station is examined as an example.
Numerical results are presented for three-dimensional compressible turbulent jet and wake flows. An alternating direction implicit numerical procedure is used to solve the finite-difference form of the parabolic elliptic Navier-Stokes equations. A coordinate transformation maps the boundaries at infinity into a finite computational domain in order to properly specify infinity boundary conditions as well as contain the downstream growth of the viscous flow field in a fixed computational grid. Turbulence closure is achieved through an algebraic mixing length eddy viscosity model. Numerical results for supersonic flow are presented for an axisymmetric jet, an elliptical jet, an elliptical wake, and two interacting rectangular jets. Experimental data were not available for comparison with the numerical results. However, the results compare well with empirical results for free shear flows.
Several FORTRAN program modules for performing one-dimensional and two-dimensional discrete Fourier transforms, Mellin, and Fourier-Bessel transforms are described along with programs that realize the algebra of high speed Fourier transforms on a computer. The programs can perform numerical harmonic analysis of functions, synthesize complex optical filters on a computer, and model holographic image processing methods.
The GIM computer code for fluid dynamics research was developed. Enhancement of the computer code, implicit algorithm development, turbulence model implementation, chemistry model development, interactive input module coding and wing/body flowfield computation are described. The GIM quasi-parabolic code development was completed, and the code used to compute a number of example cases. Turbulence models, algebraic and differential equations, were added to the basic viscous code. An equilibrium reacting chemistry model and implicit finite difference scheme were also added. Development was completed on the interactive module for generating the input data for GIM. Solutions for inviscid hypersonic flow over a wing/body configuration are also presented.
A numerical simulation is carried out of the incompressible three-dimensional turbulent boundary-layer experiments of van den Berg and Elsenaar (1972), Dechow (1977), and Muller (1982). The simulation is effected by integrating the boundary-layer equations together with an algebraic eddy-viscosity turbulence model. With this computational method, the downstream portion of the flow treated by van den Berg and Elsenaar, where the crossflow is large, cannot be predicted. It is believed that this flow is significantly influenced by elliptic flow-field effects. Even though Dechow's experiment also indicated departures from the boundary-layer concept, the calculations made here agree reasonably well with the mean-flow development up to separation. The normal pressure gradients in Muller's experiment are found to be negligible in regions with large skewing, making it possible to test turbulence models using the boundary-layer equations. The simulation of this flow compares favorably with the experimental data throughout the flow field.
Simultaneous co-located observations from two different orbits lead to several advantages (i.e., cross calibration of sensors and a wider range of solar-zenith and sensor look angles). The question was asked how many times per year (on the average) do the sub-satellite points of two satellites simultaneously come within D kilometers of each other?. For the Space Station (altitude: 500 km, inclination: 28 deg) and a Sun synchronous satellite (altitude 705 km, inclination 98.21 deg) the answers are 16, 41 and 82 times per year for encounter distances D of 20, 50, and 100 km espectively. The relationship between encounters per year and distance D is linear. The answers were obtained in two ways: (1) a closed form statistical approach which led to a simple algebraic expression, and (2) a Monte Carlo type computer solution. The largest difference between the two solutions was less than 12%.