Search NASA⌕ Search

SEARCH · Search NASA

Results for “Standard Problem”

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 415 records · Page 23

Large Deviation Methods for the Analysis and Design of Monte Carlo Schemes in Physics and Chemistry. Final Technical Report

This proposal is concerned with applications of Monte Carlo to problems in physics and chemistry where rare events degrade the performance of standard Monte Carlo. One class of problems is concerned with computation of various aspects of the equilibrium behavior of some Markov process via time averages. The problem to be overcome is that rare events interfere with the efficient sampling of all relevant parts of phase space. A second class concerns sampling transitions between two or more stable attractors. Here, rare events do not interfere with the sampling of all relevant parts of phase space, but make Monte Carlo inefficient because of the very large number of samples required to obtain variance comparable to the quantity estimated. The project uses large deviation methods for the mathematical analyses of various Monte Carlo techniques, and in particular for algorithmic analysis and design. This is done in the context of relevant application areas, mainly from chemistry and biology.

97 MATHEMATICS AND COMPUTING↗

Toward textbook multigrid efficiency for fully implicit resistive magnetohydrodynamics

Multigrid methods can solve some classes of elliptic and parabolic equations to accuracy below the truncation error with a work-cost equivalent to a few residual calculations – so-called “textbook” multigrid efficiency. We investigate methods to solve the system of equations that arise in time dependent magnetohydrodynamics (MHD) simulations with textbook multigrid efficiency. We apply multigrid techniques such as geometric interpolation, full approximate storage, Gauss-Seidel smoothers, and defect correction for fully implicit, nonlinear, second-order finite volume discretizations of MHD. We apply these methods to a standard resistive MHD benchmark problem, the GEM reconnection problem, and add a strong magnetic guide field, which is a critical characteristic of magnetically confined fusion plasmas. We show that our multigrid methods can achieve near textbook efficiency on fully implicit resistive MHD simulations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Understanding the Hierarchy of Dense Subgraphs in Stationary and Temporally Varying Setting

Graphs are widely used to model relationships in a wide variety of domains such as sociology, bioinformatics, infrastructure, the WWW, to name a few. One of the key observations is that while real-world graphs are often globally sparse, they are locally dense. In other words, the average degree is often quite small (say at most 10 in a million vertex graph), but vertex neighborhoods are often dense. Finding dense subgraphs is a critical aspect of graph mining It has been used for finding communities and spam link farms in web graphs, graph visualization, real-time story identification, DNA motif detection in biological networks, finding correlated genes, epilepsy prediction, finding price value motifs in financial data, graph compression, distance query indexing, and increasing the throughput of social networking site servers. However, most standard formulations of this problem (like clique, quasi-clique, k-densest subgraph) are NP-hard. Furthermore, current dense subgraph finding algorithms usually optimize some objective, and only find a few such subgraphs without providing any structural relations, whereas the goal is rarely to find the "true optimum," but to identify many (if not all) dense substructures, understand their distribution in the graph, and ideally determine relationships among them. In this project, we first aim to devise algorithms and provide 3 implementations with nice visualizations to find the hierarchy between dense subgraphs, and then understand the structure of the hierarchy to gain more insight on the hidden patterns in real-world networks. Another important aspects in graph analysis is the temporal nature of networks. Networks evolve over time and in many applications data arrives at a high velocity, and thus it is important to design algorithms that can process data efficiently. We report three main results towards identifying dense structures in large evolving graphs. First, we will show how the hierarchical connectedness structure can be maintained efficiently, where connectedness is defined by increasing levels of connectivity strength. Next, we present dense structure can be identified in bipartite graphs without building projection graphs. And finally, we present a new method for peeling algorithms This new approach avoids sequential nature of peeling algorithms and is amenable to parallelization, which is crucial for processing high velocity data.

97 MATHEMATICS AND COMPUTING↗

Field Emission Analysis in SRF Cavities for PIP-II Using GEANT4

Field emission (FE) remains a significant hurdle for achieving optimal performance and reliability in superconducting radiofrequency (SRF) cavities used in accelerator cryomodules. A thorough understanding of the generation and propagation of FE-induced radiation is therefore essential to mitigate this problem. The absence of standardized measurement protocols further complicates the comparison of radiation data across different testing phases and facilities. This highlights the need for a precise quantitative method to diagnose and analyze FE-induced radiation. Such efforts could prove beneficial for improving cavity preparation and cleanroom assembly techniques during the prototype and production stages of Fermilab's Proton Improvement Plan-II (PIP-II) project. This study presents the initial steps of detailed Geant4 simulations aimed at analyzing FE-induced radiation in the low-beta 650 MHz 5-cell elliptical (LB650) cavity. Our goal is to combine these results with radiation diagnostics to enhance diagnostic accuracy and optimize detector positioning. This integrated approach ultimately aims to improve the preparation, assembly, and testing procedures for PIP-II SRF cavities, ensuring the delivery of FE-free cryomodules.

Wijethunga, Sajini A.K. [Fermilab] (ORCID:00000002↗

Optimality of Gradient-MUSIC for Spectral Estimation

We introduce the Gradient-MUSIC algorithm for estimating the unknown frequencies and amplitudes of a nonharmonic signal from noisy time samples. While the classical MUSIC algorithm performs a computationally expensive search over a fine grid, Gradient-MUSIC is significantly more efficient and eliminates the need for discretization over a fine grid by using optimization techniques. It coarsely scans the 1D landscape to find initialization simultaneously for all frequencies followed by parallelizable local refinement via gradient descent. We also analyze its performance when the noise level is sufficiently small and the signal frequencies are separated by at least 8π/m, where π/m is the standard resolution of this problem. Even though the 1D landscape is nonconvex, we prove a global convergence result for Gradient-MUSIC: coarse scanning provably finds suitable initialization and gradient descent converges at a linear rate. In addition to convergence results, we also upper bound the error between the true signal frequencies and amplitudes with those found by Gradient-MUSIC. For example, if the noise has $\ell^\infty$ norm at most ϵ, then the frequencies and amplitudes are recovered up to error at most Cϵ/m and Cϵ respectively, which are minimax optimal in m and ϵ. Our theory can also handle stochastic noise with performance guarantees under nonstationary independent Gaussian noise. Our main approach is a comprehensive geometric analysis of the landscape, a perspective that has not been explored before.

97 MATHEMATICS AND COMPUTING↗

Quantum simulation of massive Thirring and Gross--Neveu models for arbitrary number of flavors

The study of fermionic quantum field theories is an important problem for realizing the standard model of particle physics on a quantum computer. As a step towards this goal, we consider the massive Thirring and Gross--Neveu models with arbitrary number of fermion flavors, $N_f$, discretized on a spatial one-dimensional lattice of size $L$ in the Hamiltonian formulation. We compute the gate complexity using the higher-order product formula and using block-encoding/qubitization and quantum singular value transformations in the limit of large $N_f$ and $L$. We also prepare the ground states of both models with excellent fidelity for system sizes up to 20 qubits with $N_f = 1,2,3,4$ using the adaptive-variational quantum imaginary time algorithm. In addition, we also classify the dynamical Lie algebras of these relativistic fermionic models and show that they belong to the same isomorphism class. Our work is a concrete step towards the quantum simulation of real-time dynamics of large $N_f$ fermionic quantum field theories models relevant for chiral symmetry breaking, understanding dimensional transmutation, and exploring the conformal window of field theories on near-term and early fault-tolerant quantum computers.

FOS: Physical sciences↗

Quantum fate of the Choptuik naked singularity

Classical critical collapse provides a dynamical route from smooth initial data to a naked singularity, representing a sharper violation of predictability than ordinary black hole singularities. We argue that this distinction is erased by quantum backreaction. Building on the semiclassical interior analysis, where quantum self-energy of the collapsing matter generates a universal growing mode and a finite mass gap, we study the exterior naked singularity region that determines global visibility in the Einstein-scalar system. We analyze controlled exterior models in both $2+1$ and $3+1$ dimensions. In the former, smooth matching and physical boundary conditions analytically select a vacuum polarization state, whose backreaction cloaks the classically naked region by a quantum trapped branch. In the latter, numerical horizon tracing shows that near a quantum-shifted threshold the exterior develops finite-mass marginally trapped surfaces rather than a zero-mass naked endpoint. These results suggest a global quantum picture in which the Choptuik naked singularity shares the fate of an ordinary black hole singularity: quantum effects push the putative Cauchy horizon behind a quantum-generated horizon, thereby reducing the loss of predictability to the standard black hole evaporation problem.

FOS: Physical sciences↗

Reliable cabling for space vehicles.

Cabling material problems associated with military standard connectors for space vehicles, discussing reliability, fabrication, assembly and design

SPACECRAFT ELECTRONIC EQUIPMENT↗

The stability of motion of satellites with flexible appendages

The mathematical formulation associated with the problem of stability of motion of a satellite consisting of a main rigid body and three (or less) pairs of flexible rods is presented. The rods are capable of flexure in two orthogonal directions. Whereas the rotational motion of the body is described by generalized coordinates depending on time alone, the elastic displacements of the rods depend both on spatial position and time. Assuming no external torques, there exist motion integrals in the form of momentum integrals. These integrals can be regarded as constraint equations relating the system velocities, and used to reduce the number of variables describing the motion. The stability analysis has been carried out by means of an extension of the Liapunov direct method. Since the elastic vibrations result in energy dissipation, it is shown that the equilibrium position is asymptotically stable if the Hamiltonian is positive definite and unstable if it can take negative values in the neighborhood of the equilibrium. Determining the sign definiteness of the Hamiltonian is complicated by the fact that it contains spatial derivatives of the elastic displacements. Two methods are presented to cope with this problem. The first, the standard modal analysis in conjunction with series truncation, develops criteria in terms of infinite series associated with the natural modes and frequencies of the elastic rods. The second, the method of integral coordinates, yields closed-form stability criteria involving the system parameters, such as the body moments of inertia, the length and mass distribution of the rods, the lowest natural frequencies of the rods, and the satellite spin velocity.

Meirovitch, L.↗

Detection of structural deterioration and associated airline maintenance problems

Airline operations involving the detection of structural deterioration and associated maintenance problems are discussed. The standard approach to the maintenance and inspection of aircraft components and systems is described. The frequency of inspections and the application of preventive maintenance practices are examined. The types of failure which airline transport aircraft encounter and the steps taken to prevent catastrophic failure are reported.

Henniker, H. D.↗

Elastic-plastic analysis using a triangular ring element in NASTRAN

An elastic plastic triangular ring element is implemented in NASTRAN computer program. The plane strain problem of partially plastic thick walled cylinder under internal pressure is solved and compared with the earlier finite difference solution. A very good agreement has been reached. In order to demonstrate its application to more general problems, an overloaded thread problem for the British Standard Buttress is examined. The maximum axial and principal stresses are located and their values are determined as functions of loadings.

Chen, P. C. T.↗

Hardware synthesis from DDL description

The details of digital systems can be conveniently input into the design automation system by means of hardware description language (HDL). The computer aided design and test (CADAT) system at NASA MSFC is used for the LSI design. The digital design language (DDL) was selected as HDL for the CADAT System. DDL translator output can be used for the hardware implementation of the digital design. Problems of selecting the standard cells from the CADAT standard cell library to realize the logic implied by the DDL description of the system are addressed.

Shiva, S. G.↗

A programing system for research and applications in structural optimization

The flexibility necessary for such diverse utilizations is achieved by combining, in a modular manner, a state-of-the-art optimization program, a production level structural analysis program, and user supplied and problem dependent interface programs. Standard utility capabilities in modern computer operating systems are used to integrate these programs. This approach results in flexibility of the optimization procedure organization and versatility in the formulation of constraints and design variables. Features shown in numerical examples include: variability of structural layout and overall shape geometry, static strength and stiffness constraints, local buckling failure, and vibration constraints.

Sobieszczanski-Sobieski, J.↗

Hardware synthesis from DDL

The details of the digital systems can be conveniently input into the design automation system by means of Hardware Description Languages (HDL). The Computer Aided Design and Test (CADAT) system at NASA MSFC is used for the LSI design. The Digital Design Language (DDL) has been selected as HDL for the CADAT System. DDL translator output can be used for the hardware implementation of the digital design. This paper addresses problems of selecting the standard cells from the CADAT standard cell library to realize the logic implied by the DDL description of the system.

Shah, A. M.↗

A programing system for research and applications in structural optimization

The paper describes a computer programming system designed to be used for methodology research as well as applications in structural optimization. The flexibility necessary for such diverse utilizations is achieved by combining, in a modular manner, a state-of-the-art optimization program, a production level structural analysis program, and user supplied and problem dependent interface programs. Standard utility capabilities existing in modern computer operating systems are used to integrate these programs. This approach results in flexibility of the optimization procedure organization and versatility in the formulation of contraints and design variables. Features shown in numerical examples include: (1) variability of structural layout and overall shape geometry, (2) static strength and stiffness constraints, (3) local buckling failure, and (4) vibration constraints. The paper concludes with a review of the further development trends of this programing system.

Sobieszczanski-Sobieski, J.↗

Nonlinear structural dynamics analysis using a modified modal method

The procedure for predicting the nonlinear dynamic response of structural components subjected to a step loading is presented. The procedure is a modified modal method that involves a change of dependent variables from the unknown nodal degrees of freedom of the finite element model of the structure to a smaller set of generalized coordinates. This change of dependent variables uses a combination of the nonlinear static solution and some selected vibration mode shapes. The vibration mode shapes correspond to the eigenvectors obtained by solving a standard free vibration eigenvalue problem wherein the stiffness matrix is expanded about the nonlinear static solution. A strategy is also presented for determining which and how many vibration mode shapes to include in the transformation. The effect of inaccurate representation of the spatial distribution of the applied load on the nonlinear dynamic response is discussed for two classes of structural behavior. Application of the procedure to structures which exhibit a stiffening behavior and to those with a softening behavior is presented.

Knight, N. F., Jr.↗

Finite-dimensional approximation for optimal fixed-order compensation of distributed parameter systems

In controlling distributed parameter systems it is often desirable to obtain low-order, finite-dimensional controllers in order to minimize real-time computational requirements. Standard approaches to this problem employ model/controller reduction techniques in conjunction with LQG theory. In this paper we consider the finite-dimensional approximation of the infinite-dimensional Bernstein/Hyland optimal projection theory. This approach yields fixed-finite-order controllers which are optimal with respect to high-order, approximating, finite-dimensional plant models. The technique is illustrated by computing a sequence of first-order controllers for one-dimensional, single-input/single-output, parabolic (heat/diffusion) and hereditary systems using spline-based, Ritz-Galerkin, finite element approximation. Numerical studies indicate convergence of the feedback gains with less than 2 percent performance degradation over full-order LQG controllers for the parabolic system and 10 percent degradation for the hereditary system.

Bernstein, Dennis S.↗

Modal representations in control/structure interaction

When control/structure interaction problems are examined, a standard method for representing the structure is to choose a truncated set of normal modes calculated from either a finite-element or a distributed-parameter model. However, the normal modes can neglect important static information about the structure. Using a set of fixed interface modes results in a much more accurate closed-loop model, even when relatively low-bandwidth controllers are used. The fixed interface modes are calculated with control input degrees of freedom held fixed, and standard finite-element software can be used. Illustrative examples include a simple hinged beam and a complex model of the phase-I Space Station configuration.

Blelloch, Paul A.↗