Search NASA⌕ Search

SEARCH · Search NASA

Results for “Problem structuring methods”

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 361 records · Page 20

In Search of Grid Converged Solutions

Assessing solution error continues to be a formidable task when numerically solving practical flow problems. Currently, grid refinement is the primary method used for error assessment. The minimum grid spacing requirements to achieve design order accuracy for a structured-grid scheme are determined for several simple examples using truncation error evaluations on a sequence of meshes. For certain methods and classes of problems, obtaining design order may not be sufficient to guarantee low error. Furthermore, some schemes can require much finer meshes to obtain design order than would be needed to reduce the error to acceptable levels. Results are then presented from realistic problems that further demonstrate the challenges associated with using grid refinement studies to assess solution accuracy.

Lockard, David P.↗

A Hybrid SBR/MoM Technique for Analysis of Scattering from Small Protrusions on a Large Conducting Body

For analysis of large-scale electromagnetic scattering problems, high-frequency asymptotic methods are fast but approximate, whereas low-frequency numerical methods are accurate but slow. Neither can produce an efficient and accurate solution to scattering by large bodies containing small structures. A promising approach is to combine the best features of both types of methods to produce a hybrid technique that is sufficiently fast, reasonably accurate, and applicable to a class of unsolvable problems such as the scatterers mentioned above. There are two extremes for this type of hybridization. One is simply to superimpose solutions from asymptotic and numerical methods. While this approach is most widely used in practical applications, it neglects the interactions between the two solutions, which can be significant in many problems. The other extreme is to combine an asymptotic and a numerical method in an exact manner. In this approach, the effect of a large body is included by incorporating its diffraction into the Green's function in the integral equation for the small structures, which accounts for all interactions. While this approach is accurate, it is difficult to be implemented in a general-purpose computer code because of its complex nature. A more practical approach is to develop a technique that can include all significant interactions and neglect all trivial interactions. The resulting hybrid technique can produce sufficient accuracy and can be implemented in a general-purpose computer code. In this paper, we develop a technique that combines the shooting and- bouncing-ray (SBR) method and the method of moments (MoM) to solve for the scattering by large conducting bodies with small structures mounted on their surfaces.

Jin, J. M.↗

A coupling approach for linear elasticity problems with spatially non-coincident discretized interfaces

Here we present a new method for coupled linear elasticity problems whose finite element discretization may lead to spatially non-coincident discretized interfaces. Our approach combines the classical Dirichlet–Neumann coupling formulation with a new set of discretized interface conditions obtained through Taylor series expansions. We show that these conditions ensure linear consistency of the coupled finite element solution. We then formulate an iterative solution method for the coupled discrete system and apply the new coupling approach to two representative settings for which we also provide several numerical illustrations. The first setting is a mesh-tying problem in which both coupled structures have the same Lamé parameters whereas the second setting is an interface problem for which the Lamé parameters in the two coupled structures are different.

97 MATHEMATICS AND COMPUTING↗

Acoustic radiation from a shell with internal structures

A method is developed to compute frequency response and acoustic radiation of a complex shell. The axisymmetric geometry of the shell includes cylindrical, conical, and spherical segments stiffened by discrete rings and bulkheads. The shell is coupled to internal masses and elastic frames. Shell segments are treated by transfer matrices. Rings, bulkheads, frames, and concentrated masses are treated by impedances at junctions of segments. The shell is coupled to an external acoustic fluid treated by Green's function and curved surface elements. A major issue facing the method's treatment of the fluid would be lack of existence or uniqueness encountered in the uncoupled, external acoustic problem at characteristic wavenumbers. By using a simple spherical shell, without internal structures, this potential hindrance is shown not to arise. A fuller application of the method awaits subsequent results.

El-Raheb, M.↗

On implementation of the extended interior penalty function

The extended interior penalty function formulation is implemented. A rational method for determining the transition between the interior and extended parts is set forth. The formulation includes a straightforward method for avoiding design points with some negative components, which are physically meaningless in structural analysis. The technique, when extended to problems involving parametric constraints, can facilitate closed form integration of the penalty terms over the most important parts of the parameter interval. The method lends itself well to the use of approximation concepts, such as design variable linking, constraint deletion and Taylor series expansions of response quantities in terms of design variables. Examples demonstrating the algorithm, in the context of planar orthogonal frames subjected to ground motion, are included.

Cassis, J. H.↗

Stochastic finite volume method for uncertainty quantification of transient flow in gas pipeline networks

We develop a weakly intrusive framework to simulate the propagation of uncertainty in solutions of generic hyperbolic partial differential equation systems on graph-connected domains with nodal coupling and boundary conditions. The method is based on the Stochastic Finite Volume (SFV) approach and can be applied for uncertainty quantification (UQ) of the dynamical state of fluid flow over actuated transport networks. The numerical scheme has specific advantages for modeling intertemporal uncertainty in time-varying boundary parameters, which cannot be characterized by strict upper and lower (interval) bounds. We describe the scheme for a single pipe, and then formulate the controlled junction Riemann problem (JRP) that enables the extension to general network structures. In conclusion, we demonstrate the method's capabilities and performance characteristics using a standard benchmark test network.

97 MATHEMATICS AND COMPUTING↗

Convergence of variational Monte Carlo simulation and scale-invariant pre-training

We provide theoretical convergence bounds for the variational Monte Carlo (VMC) method as applied to optimize neural network wave functions for the electronic structure problem. Here, we study both the energy minimization phase and the supervised pre-training phase that is commonly used prior to energy minimization. For the energy minimization phase, the standard algorithm is scale-invariant by design, and we provide a proof of convergence for this algorithm without modifications. The pre-training stage typically does not feature such scale-invariance. We propose using a scale-invariant loss for the pretraining phase and demonstrate empirically that it leads to faster pre-training.

97 MATHEMATICS AND COMPUTING↗

Maximizing efficiency of dataset compression for machine learning potentials with information theory

Machine learning interatomic potentials (MLIPs) balance high accuracy and lower costs compared to density functional theory calculations, but their performance often depends on the size and diversity of training datasets. Large datasets improve model accuracy and generalization but are computationally expensive to produce and train on, while smaller datasets risk discarding rare but important atomic environments and compromising MLIP accuracy/reliability. Here, we develop an information-theoretical framework to quantify the efficiency of dataset compression methods and propose an algorithm that maximizes this efficiency. By framing atomistic dataset compression as an instance of the minimum set cover (MSC) problem over atom-centered environments, our method identifies the smallest subset of structures that contains as much information as possible from the original dataset while pruning redundant information. The approach is extensively demonstrated on the GAP-20 and TM23 datasets and validated on 64 varied datasets from the ColabFit repository. Across all cases, MSC consistently retains outliers, preserves dataset diversity, and reproduces the long-tail distributions of forces even at high compression rates, outperforming other subsampling methods. Furthermore, MLIPs trained on MSC-compressed datasets exhibit reduced error for out-of-distribution data even in low-data regimes. We explain these results using an outlier analysis and show that such quantitative conclusions could not be achieved with conventional dimensionality reduction methods. The algorithm is implemented in the open-source QUESTS package and can be used for several tasks in atomistic modeling, from data subsampling, outlier detection, and training improved MLIPs at a lower cost.

36 MATERIALS SCIENCE↗

Nature of polariton transport in a Fabry-Perot cavity

Fabry-Perot microcavities can strongly enhance interactions between light and molecules, leading to the formation of hybrid light-matter states known as polaritons. Polaritons possess much smaller effective masses and much larger group velocities when the molecules are resonant with cavity modes that have finite (nonzero) in-plane wave vectors, giving rise to the possibilities of long-range and ultrafast ballistic transport. In this paper, we present the results of numerical simulations of the ultrafast ballistic transport phenomenon in real space and time during and after initialization with a short, spatially localized pulse. Here, we address this problem with two approaches: the standard transfer-matrix method (TMM) for planar structures and a second simulation based on the numerical solution of the Maxwell-Bloch equations that can be used for general configurations (complex metasurfaces, for instance) and excitation modes. The agreement between the TMM and the full numerical calculation with the Maxwell-Bloch equations when applied to multilayer planar configurations provides proof of the validity of both approaches for the present analyses. Overall, we find that the transport of the molecular excitons inside the cavity synchronize with the evolution of the enhanced electromagnetic field inside the cavity. Moreover, the synchronized transport rate is in good agreement with the group velocities predicted from a calculated dispersion relation across a wide range of frequencies. Finally, we relate the group velocity to the Hopfield coefficient obtained from quantum modeling and suggest that the dependence of light-matter coupling on the in-plane wave vector can be an important but overlooked factor for understanding the transport behavior of polaritons. These simulations provide an intuitive tool for understanding the collective motion of light and excitons and helps us to better understand how experimental observations of polaritons should be interpreted.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Closed-Form Approximation of the Total Variation Proximal Operator

Total variation (TV) is a widely used function for regularizing imaging inverse problems that is particularly appropriate for images whose underlying structure is piecewise constant. TV regularized optimization problems are typically solved using proximal methods, but the way in which they are applied is constrained by the absence of a closed-form expression for the proximal operator of the TV function. A closed-form approximation of the TV proximal operator has previously been proposed, but its accuracy was not theoretically explored in detail. Here, we address this gap by making several new theoretical contributions, proving that the approximation leads to a proximal operator of some convex function, it is equivalent to a gradient descent step on a smoothed version of TV, and that its error can be fully characterized and controlled with its scaling parameter. We experimentally validate our theoretical results on image denoising and sparse-view computed tomography (CT) image reconstruction.

97 MATHEMATICS AND COMPUTING↗

Group structure selection with random forests

Choosing an appropriate group structure for multigroup transport is far from an exact science. For some applications, one blindly uses a group structure developed years ago by forgotten methods. Furthermore, one sometimes uses the same group structure for a variety of problems, even if the group structure was originally developed with a certain application in mind. In this work, we create optimized group structures with simulated annealing for critical assembly test problems and apply a random forest regressor with bagging to choose the best group structure based on parameters of the different test problems. The optimized group structures were generated using a simulated annealing optimizer for several simple, spherical, and unreflected problems. The optimization was performed to minimize a cost function that included fission rate, absorption rate, leakage, and k{sub eff}. A random forest regressor was then trained on a set of International Criticality Safety Benchmark Evaluation Project inputs and used to select one of these six group structures. The trained machine learning model chose the best group structure 65% of the time, and one of the three best 89% of the time. Furthermore, it decreased the L2 error over all test problems by a factor of 25 when compared to the standard Los Alamos 70-group structure. In other words, the model chose group structure that were far more appropriate for the test problems than the traditional LANL group structure. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Analytical methods for performance evaluation of nonlinear filters.

In the investigation, the filtering problem is considered in the continuous time domain. The postulated simple suboptimal nonlinear filter structure closely parallels the structure of the Kalman-Bucy optimal linear filter algorithm. Two filter performance evaluation methods are developed based on the Kolmogorov equations for the transition density of Markov processes. The expansions in the approximations for the nonlinear system and observation functions are in effect carried out up to second-order terms in both methods. The description of the filter's performance is sought in terms of second-order statistics in both methods.

Bejczy, A. K.↗

New large deflection analysis for NASTRAN

A large deflection analysis was developed for NASTRAN level 16 as an alternative to Rigid Format 4. A progress report is presented for a long term, general nonlinear analysis NASTRAN project, which contains (1) the theory of the structural analysis and numerical analysis methods presently used, and (2) some simple test problems comparing the new analysis with Rigid Format 4.

Hurwitz, M. M.↗

Seventh NASTRAN User's Colloquium

The general application of finite element methodology and the specific application of NASTRAN to a wide variety of static and dynamic structural problems are described. Topics include: fluids and thermal applications, NASTRAN programming, substructuring methods, unique new applications, general auxiliary programs, specific applications, and new capabilities.

Source record↗

Finite element analysis in a minicomputer/mainframe environment

Design considerations were evaluated for general purpose finite element systems to maximize performance when installed on distributed computer hardware/software systems. It is shown how the features of current minicomputers complement those of a modular implementation of the finite element method for increasing the control, speed, and visibility (interactive graphics) in solving structural problems at reduced cost. The approach used is to implement a finite element system in a distributed computer environment to solve structural problems and to explore alternatives in distributing finite element computations.

Storaasli, O. O.↗

Space construction base control system

Aspects of an attitude control system were studied and developed for a large space base that is structurally flexible and whose mass properties change rather dramatically during its orbital lifetime. Topics of discussion include the following: (1) space base orbital pointing and maneuvering; (2) angular momentum sizing of actuators; (3) momentum desaturation selection and sizing; (4) multilevel control technique applied to configuration one; (5) one-dimensional model simulation; (6) N-body discrete coordinate simulation; (7) structural analysis math model formulation; and (8) discussion of control problems and control methods.

Source record↗

Summary of research in applied mathematics, numerical analysis, and computer sciences

The major categories of current ICASE research programs addressed include: numerical methods, with particular emphasis on the development and analysis of basic numerical algorithms; control and parameter identification problems, with emphasis on effective numerical methods; computational problems in engineering and physical sciences, particularly fluid dynamics, acoustics, and structural analysis; and computer systems and software, especially vector and parallel computers.

Source record↗