Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear system”

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 1,405 records · Page 78
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Optimization to Generate Equations of State for Hydrogen Production

On a high level, the larger project in question, HydroGEN, aims to develop software used for finding equations of state (EOS) to optimize catalyst configuration for H 2 production through water splitting. In particular, this summer project focused on solving the nonlinear equations used in fitting the equations. This problem involved using Python to solve a linear system with nonlinear constraints. In order for this to be achieved, Pyomo was used to build a model and the solver Ipopt, interior point optimizer, was used. Pyomo is a Python-based language developed at Sandia; it is an optimization modeling language. Rather than solving the entire problem at once, a toy problem was created, simplifying the problem down to the most important focus. This problem had a known solution, comparable to the calculated solution to assess accuracy and as progress was made towards finding solutions, complexity was gradually added to the problem. After building and solving the toy problem, it was found that it gave reasonably accurate solutions, better compared to the two existing solvers previously used with this project in terms of functionality. The solver is now ready for implementation into the project’s main software.

08 HYDROGEN↗
DOE OSTI2023

Data-Driven Smoothers for Extreme-Scale Computing

Patch-based relaxation refers to a family of methods for solving linear systems which partitions the matrix into smaller pieces often corresponding to groups of adjacent degrees of freedom residing within patches of the computational domain. The two most common families of patch-based methods are block-Jacobi and Schwarz methods, where the former typically corresponds to non-overlapping domains and the later implies some overlap. We focus on cases where each patch consists of the degrees of freedom on a finite element method mesh cell. Patch methods often capture complex local physics much more effectively than simpler point-smoothers such as Jacobi; however, forming, inverting, and applying each patch can be prohibitively expensive in terms of both storage and computation time. To this end, we propose several approaches for performing analysis on these patches and constructing a reduced representation. The compression techniques rely on either matrix norm comparisons or unsupervised learning via a clustering approach. We illustrate how it is frequently possible to retain/factor less than 5% of all patches and still develop a method that converges only a little slower than when all patches are stored/factored.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

MPACT Performance Improvements in VERA-CS

The report summarizes the initial profile of MPACT representative of the version that was distributed with VERA 3.4. It then describes several activities recently performed to increase the overall performance of the code. For the various improvements described in this report, several have been well known to the development team and reactor physics methods community for some time; while others proved novel in their combination of other existing ideas. Still, other improvements were the result of unanticipated breakthroughs in numerical methods research. These performance improvement activities focused on the following components of MPACT. Method of Characteristics Transport Kernel Iterative Methods for Coarse Mesh Finite Difference Linear System Macroscopic Cross Section and Effective Fission Spectrum Calculation Resonance self-shielding (Subgroup) calculation A summary of the overall improvement from this work as tested on a few representative problems is provided in the table below. The incremental improvements for various changes are shown in the figure below.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2017

Modal Substructuring of Geometrically Nonlinear Finite Element Models with Interface Reduction

Substructuring methods have been widely used in structural dynamics to divide large, complicated finite element models into smaller substructures. For linear systems, many methods have been developed to reduce the subcomponents down to a low order set of equations using a special set of component modes, and these are then assembled to approximate the dynamics of a large scale model. In this paper, a substructuring approach is developed for coupling geometrically nonlinear structures, where each subcomponent is drastically reduced to a low order set of nonlinear equations using a truncated set of fixedinterface and characteristic constraint modes. The method used to extract the coefficients of the nonlinear reduced order model (NLROM) is non-intrusive in that it does not require any modification to the commercial FEA code, but computes the NLROM from the results of several nonlinear static analyses. The NLROMs are then assembled to approximate the nonlinear differential equations of the global assembly. The method is demonstrated on the coupling of two geometrically nonlinear plates with simple supports at all edges. The plates are joined at a continuous interface through the rotational degrees-of-freedom (DOF), and the nonlinear normal modes (NNMs) of the assembled equations are computed to validate the models. The proposed substructuring approach reduces a 12,861 DOF nonlinear finite element model down to only 23 DOF, while still accurately reproducing the first three NNMs of the full order model.

42 ENGINEERING↗
DOE OSTI2020

Chaos, Percolation and the Coronavirus Spread

The dynamics of the spreading of the COVID-19 virus has similar features to the turbulent flow, chaotic maps and other non-linear systems: a small seed grows exponentially and eventually saturates. Like in the percolation model, the virus is mostly dangerous if the probability of transmission (or the bond probability p in the percolation model) is high. This suggests a relation with the population density, ρ s , which must be higher than a certain value (ρ s > 1000 persons/km 2 ). A ‘seed’ implanted in such towns grows vigorously and affects nearby places at distance x. Thus, the spreading is governed by the ratio ρ = ρ s /x. Assuming a power law dependence τ of the number of positives to the virus N + from ρ, we find τ = 0.55, 0.75 and 0.96 for S.Korea, Italy and China respectively.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

An Evolve-Then-Correct Reduced Order Model for Hidden Fluid Dynamics

In this paper, we put forth an evolve-then-correct reduced order modeling approach that combines intrusive and nonintrusive models to take hidden physical processes into account. Specifically, we split the underlying dynamics into known and unknown components. In the known part, we first utilize an intrusive Galerkin method projected on a set of basis functions obtained by proper orthogonal decomposition. We then present two variants of correction formula based on the assumption that the observed data are a manifestation of all relevant processes. The first method uses a standard least-squares regression with a quadratic approximation and requires solving a rank-deficient linear system, while the second approach employs a recurrent neural network emulator to account for the correction term. We further enhance our approach by using an orthonormality conforming basis interpolation approach on a Grassmannian manifold to address off-design conditions. The proposed framework is illustrated here with the application of two-dimensional co-rotating vortex simulations under modeling uncertainty. The results demonstrate highly accurate predictions underlining the effectiveness of the evolve-then-correct approach toward real-time simulations, where the full process model is not known a priori.

long short-term memory↗
DOE OSTI2026

Domain Knowledge Guided Bayesian Optimization For Autonomous Alignment Of Complex Scientific Instruments

Bayesian Optimization (BO) is a powerful tool for optimizing complex non-linear systems. However, its performance degrades in high-dimensional problems with tightly coupled parameters and highly asymmetric objective landscapes, where rewards are sparse. In such needle-in-a-haystack scenarios, even advanced methods like trust-region BO (TurBO) often lead to unsatisfactory results. We propose a domain knowledge guided Bayesian Optimization approach, which leverages physical insight to fundamentally simplify the search problem by transforming coordinates to decouple input features and align the active subspaces with the primary search axes. We demonstrate this approach's efficacy on a challenging 12-dimensional, 6-crystal Split-and-Delay optical system, where conventional approaches, including standard BO, TuRBO and multi-objective BO, consistently led to unsatisfactory results. When combined with an reverse annealing exploration strategy, this approach reliably converges to the global optimum. The coordinate transformation itself is the key to this success, significantly accelerating the search by aligning input co-ordinate axes with the problem's active subspaces. As increasingly complex scientific instruments, from large telescopes to new spectrometers at X-ray Free Electron Lasers are deployed, the demand for robust high-dimensional optimization grows. Our results demonstrate a generalizable paradigm: leveraging physical insight to transform high-dimensional, coupled optimization problems into simpler representations can enable rapid and robust automated tuning for consistent high performance while still retaining current optimization algorithms.

FOS: Computer and information sciences↗
DOE OSTI2016

An optimized treatment for algorithmic differentiation of an important glaciological fixed-point problem

We apply an optimized method to the adjoint generation of a time-evolving land ice model through algorithmic differentiation (AD). The optimization involves a special treatment of the fixed-point iteration required to solve the nonlinear stress balance, which differs from a straightforward application of AD software, and leads to smaller memory requirements and in some cases shorter computation times of the adjoint. The optimization is done via implementation of the algorithm of Christianson (1994) for reverse accumulation of fixed-point problems, with the AD tool OpenAD. For test problems, the optimized adjoint is shown to have far lower memory requirements, potentially enabling larger problem sizes on memory-limited machines. In the case of the land ice model, implementation of the algorithm allows further optimization by having the adjoint model solve a sequence of linear systems with identical (as opposed to varying) matrices, greatly improving performance. Finally, the methods introduced here will be of value to other efforts applying AD tools to ice models, particularly ones which solve a hybrid shallow ice/shallow shelf approximation to the Stokes equations.

58 GEOSCIENCES↗
NASA NTRS1967

Polynomial manipulator AP-168

Linear Systems Design Evaluation Program, AP-168 combines the many different analysis techniques used to evaluate and manipulate polynomials. The single program is a pseudo instruction abstraction. It allows the user to enter polynomials of the laplace operators and to manipulate them freely.

Tutt, G. E.↗
NASA NTRS1968

Stability and sensitivity

Graphical and analytical techniques for calculating regions of absolute stability of linear systems

Siljak, D.↗