Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algebraic models”

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,315 records · Page 73

Inexact iterative numerical linear algebra for neural network-based spectral estimation and rare-event prediction

Understanding dynamics in complex systems is challenging because there are many degrees of freedom, and those that are most important for describing events of interest are often not obvious. The leading eigenfunctions of the transition operator are useful for visualization, and they can provide an efficient basis for computing statistics, such as the likelihood and average time of events (predictions). Here, we develop inexact iterative linear algebra methods for computing these eigenfunctions (spectral estimation) and making predictions from a dataset of short trajectories sampled at finite intervals. We demonstrate the methods on a low-dimensional model that facilitates visualization and a high-dimensional model of a biomolecular system. Implications for the prediction problem in reinforcement learning are discussed.

Chemistry↗

Multiscale convergence properties for spectral approximations of a model kinetic equation

Here in this work, we prove rigorous convergence properties for a semi-discrete, moment-based approximation of a model kinetic equation in one dimension. This approximation is equivalent to a standard spectral method in the velocity variable of the kinetic distribution and, as such, is accompanied by standard algebraic estimates of the form N -q , where N is the number of modes and q > 0 depends on the regularity of the solution. However, in the multiscale setting, the error estimate can be expressed in terms of the scaling parameter ϵ, which measures the ratio of the mean-free-path to the characteristic domain length. We show that, for isotropic initial conditions, the error in the spectral approximation is $\mathcal{O}$($ϵ^{N+1}$). More surprisingly, the coefficients of the expansion satisfy super convergence properties. In particular, the error of the ℓ th coefficient of the expansion scales like $\mathcal{O}$($ϵ^{2N}$ ) when ℓ = 0 and $\mathcal{O}$($ϵ^{2N+2-ℓ}$ ) for all 1 ≤ ℓ ≤ N. This result is significant, because the low-order coefficients correspond to physically relevant quantities of the underlying system. All the above estimates involve constants depending on N, the time t, and the initial condition. We investigate specifically the dependence on N, in order to assess whether increasing N actually yields an additional factor of ϵ in the error. Numerical tests will also be presented to support the theoretical results.

97 MATHEMATICS AND COMPUTING↗

Accelerating Scientific Computing in the Post-Moore’s Era

Novel uses of graphical processing units for accelerated computation revolutionized the field of high-performance scientific computing by providing specialized workflows tailored to algorithmic requirements. As the era of Moore’s law draws to a close, many new non–von Neumann processors are emerging as potential computational accelerators, including those based on the principles of neuromorphic computing, tensor algebra, and quantum information. While development of these new processors is continuing to mature, the potential impact on accelerated computing is anticipated to be profound. We discuss how different processing models can advance computing in key scientific paradigms: machine learning and constraint satisfaction. Significantly, each of these new processor types utilizes a fundamentally different model of computation, and this raises questions about how to best use such processors in the design and implementation of applications. While many processors are being developed with a specific domain target, the ubiquity of spin-glass models and neural networks provides an avenue for multi-functional applications. Furthermore, this also hints at the infrastructure needed to integrate next-generation processing units into future high-performance computing systems.

97 MATHEMATICS AND COMPUTING↗

COEK

COEK (C++ Optimization Expression Kernel) is a C++ library that supports the expression and manipulation of algebraic expressions commonly used in optimization applications. COEK. Supports several mechanisms for defining and managing expressions and performing automatic differentiation. COEK also includes low-level interfaces for defining optimization models and interfacing with optimization solvers.SAND2019-14491 M Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-NA0003525.

Hart, William↗

Enhancements to viscous-shock-layer technique

A solution procedure is presented which considerably improves the computational efficiency of the viscous-shock-layer technique, especially for long slender bodies. The 'predictor-corrector' procedure suggested for obtaining the shock shape beyond the nose region requires only a single global pass. The accuracy of the present method is demonstrated by comparison with globally iterated results over the entire body and with ground- and flight-test data. A good comparison of the results computed with the two methods is shown for different flowfield chemistry models and axisymmetric body shapes. The new procedure results in computer run times 1/3 to 1/2 of the times required for the full-body global iteration procedure. Further, the algebraic expressions used to specify the initial shock shape eliminate the need for a shock shape generated by external means and permit immediate introduction of the full viscous-shock-layer equations. Finally, the present method of solution for the VSL equations provides to the aerothermal designer a very efficient and accurate tool for detailed flowfield as well as future technology studies.

Gupta, Roop N.↗

A Textbook for a First Course in Computational Fluid Dynamics

This paper describes and discusses the textbook, Fundamentals of Computational Fluid Dynamics by Lomax, Pulliam, and Zingg, which is intended for a graduate level first course in computational fluid dynamics. This textbook emphasizes fundamental concepts in developing, analyzing, and understanding numerical methods for the partial differential equations governing the physics of fluid flow. Its underlying philosophy is that the theory of linear algebra and the attendant eigenanalysis of linear systems provides a mathematical framework to describe and unify most numerical methods in common use in the field of fluid dynamics. Two linear model equations, the linear convection and diffusion equations, are used to illustrate concepts throughout. Emphasis is on the semi-discrete approach, in which the governing partial differential equations (PDE's) are reduced to systems of ordinary differential equations (ODE's) through a discretization of the spatial derivatives. The ordinary differential equations are then reduced to ordinary difference equations (O(Delta)E's) using a time-marching method. This methodology, using the progression from PDE through ODE's to O(Delta)E's, together with the use of the eigensystems of tridiagonal matrices and the theory of O(Delta)E's, gives the book its distinctiveness and provides a sound basis for a deep understanding of fundamental concepts in computational fluid dynamics.

Zingg, D. W.↗

Algebraic multigrid preconditioners for two-phase flow in porous media with phase transitions [Algebraic multigrid preconditioners for multiphase flow in porous media with phase transitions]

Multiphase flow is a critical process in a wide range of applications, including oil and gas recovery, carbon sequestration, and contaminant remediation. Numerical simulation of multiphase flow requires solving of a large, sparse linear system resulting from the discretization of the partial differential equations modeling the flow. In the case of multiphase multicomponent flow with miscible effect, this is a very challenging task. The problem becomes even more difficult if phase transitions are taken into account. A new approach to handle phase transitions is to formulate the system as a nonlinear complementarity problem (NCP). Unlike in the primary variable switching technique, the set of primary variables in this approach is fixed even when there is phase transition. Not only does this improve the robustness of the nonlinear solver, it opens up the possibility to use multigrid methods to solve the resulting linear system. The disadvantage of the complementarity approach, however, is that when a phase disappears, the linear system has the structure of a saddle point problem and becomes indefinite, and current algebraic multigrid (AMG) algorithms cannot be applied directly. In this study, we explore the effectiveness of a new multilevel strategy, based on the multigrid reduction technique, to deal with problems of this type. We demonstrate the effectiveness of the method through numerical results for the case of two-phase, two-component flow with phase appearance/disappearance. In conclusion, we also show that the strategy is efficient and scales optimally with problem size.

02 PETROLEUM↗

A new form of the Saint-Venant equations for variable topography

The solution stability of river models using the one-dimensional (1D) Saint-Venant equations can be easily undermined when source terms in the discrete equations do not satisfy the Lipschitz smoothness condition for partial differential equations. Although instability issues have been previously noted, they are typically treated as model implementation issues rather than as underlying problems associated with the form of the governing equations. This study proposes a new reference slope form of the Saint-Venant equations to ensure smooth slope source terms and eliminate one source of potential numerical oscillations. It is shown that a simple algebraic transformation of channel geometry provides a smooth reference slope while preserving the correct cross-section flow area and the total Piezometric pressure gradient that drives the flow. The reference slope method ensures the slope source term in the governing equations is Lipschitz continuous while maintaining all the underlying complexity of the real-world geometry. The validity of the mathematical concept is demonstrated with the open-source Simulation Program for River Networks (SPRNT) model in a series of artificial test cases and a simulation of a small urban creek. Validation comparisons are made with analytical solutions and the Hydrologic Engineering Center's River Analysis System (HEC-RAS) model. The new method reduces numerical oscillations and instabilities without requiring ad hoc smoothing algorithms.

54 ENVIRONMENTAL SCIENCES↗

ACCELERATED FITTING OF STELLAR SPECTRA

Stellar spectra are often modeled and fitted by interpolating within a rectilinear grid of synthetic spectra to derive the stars’ labels: stellar parameters and elemental abundances. However, the number of synthetic spectra needed for a rectilinear grid grows exponentially with the label space dimensions, precluding the simultaneous and self-consistent fitting of more than a few elemental abundances. Shortcuts such as fitting subsets of labels separately can introduce unknown systematics and do not produce correct error covariances in the derived labels. In this paper we present a new approach—Convex Hull Adaptive Tessellation (chat)—which includes several new ideas for inexpensively generating a sufficient stellar synthetic library, using linear algebra and the concept of an adaptive, data-driven grid. A convex hull approximates the region where the data lie in the label space. A variety of tests with mock data sets demonstrate that chat can reduce the number of required synthetic model calculations by three orders of magnitude in an eight-dimensional label space. The reduction will be even larger for higher dimensional label spaces. In chat the computational effort increases only linearly with the number of labels that are fit simultaneously. Around each of these grid points in the label space an approximate synthetic spectrum can be generated through linear expansion using a set of “gradient spectra” that represent flux derivatives at every wavelength point with respect to all labels. These techniques provide new opportunities to fit the full stellar spectra from large surveys with 15–30 labels simultaneously.

79 ASTRONOMY AND ASTROPHYSICS↗

Emergent Superconductivity and Competing Charge Orders in Hole-Doped Square-Lattice t – J Model

The square-lattice Hubbard and closely related t-J models are considered as basic paradigms for understanding strong correlation effects and unconventional superconductivity (SC). Recent large-scale density matrix renormalization group simulations on the extended t-J model have identified d-wave SC on the electron-doped side (with the next-nearest-neighbor hopping t 2 > 0) but a dominant charge density wave (CDW) order on the hole-doped side (t 2 < 0), which is inconsistent with the SC of hole-doped cuprate compounds. We re-examine the ground-state phase diagram of the extended t-J model by employing the state-of-the-art density matrix renormalization group calculations with much enhanced bond dimensions, allowing more accurate determination of the ground state. On six-leg cylinders, while different CDW phases are identified on the hole-doped side for the doping range δ = 1/16 – 1/8, a SC phase emerges at a lower doping regime, with algebraically decaying pairing correlations and d-wave symmetry. On the wider eight-leg systems, the d-wave SC also emerges on the hole-doped side at the optimal 1=8 doping, demonstrating the winning of SC over CDW by increasing the system width. Furthermore, our results not only suggest a new path to SC in general t-J model through weakening the competing charge orders, but also provide a unified understanding on the SC of both hole- and electron-doped cuprate superconductors.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Quantum scars of bosons with correlated hopping

Abstract Recent experiments on Rydberg atom arrays have found evidence of anomalously slow thermalization and persistent density oscillations, which have been interpreted as a many-body analog of the phenomenon of quantum scars. Periodic dynamics and atypical scarred eigenstates originate from a “hard” kinetic constraint: the neighboring Rydberg atoms cannot be simultaneously excited. Here we propose a realization of quantum many-body scars in a 1D bosonic lattice model with a “soft” constraint in the form of density-assisted hopping. We discuss the relation of this model to the standard Bose-Hubbard model and possible experimental realizations using ultracold atoms. We find that this model exhibits similar phenomenology to the Rydberg atom chain, including weakly entangled eigenstates at high energy densities and the presence of a large number of exact zero energy states, with distinct algebraic structure.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fine- and hyperfine-structure effects in molecular photoionization. I. General theory and direct photoionization

We develop a model for predicting fine- and hyperfine intensities in the direct photoionization of molecules based on the separability of electron and nuclear spin states from vibrational-electronic states. Using spherical tensor algebra, we derive highly symmetrized forms of the squared photoionization dipole matrix elements from which we derive the salient selection and propensity rules for fine- and hyperfine resolved photoionizing transitions. Our theoretical results are validated by the analysis of the fine-structure resolved photoelectron spectrum of O{sub 2} reported by Palm and Merkt [Phys. Rev. Lett. 81, 1385 (1998)] and are used for predicting hyperfine populations of molecular ions produced by photoionization.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Almost strong zero modes at finite temperature

Interacting fermionic chains exhibit extended regions of topological degeneracy of their ground states as a result of the presence of Majorana or parafermionic zero modes localized at the edges. In the opposite limit of infinite temperature, the corresponding nonintegrable spin chains, obtained via generalized Jordan-Wigner mapping, are known to host so-called almost strong zero modes, which are long-lived with respect to any bulk excitations. Here we study the fairly unexplored territory that bridges these two extreme cases of zero and infinite temperature. We blend two established techniques for states, the Lanczos series expansion and a tensor network ansatz, uplifting them to the level of operator algebra. This allows us to efficiently simulate large system sizes for arbitrarily long timescales and to extract the temperature-dependent decay rates. We observe that for the Kitaev-Hubbard model, the decay rate of the edge mode depends exponentially on the inverse temperature 𝛽, and on an effective energy scale Δ eff that is greater than the thermodynamic gap of the system Δ.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

ChatMPI: LLM-Driven MPI Code Generation for HPC Workloads

The Message Passing Interface (MPI) standard plays a crucial role in enabling scientific applications for parallel computing and is an essential component in high-performance computing (HPC). However, implementing MPI code manually—especially applying a proper domain decomposition and communication pattern—is a challenging and error-prone task. We present ChatMPI, an AI assistant for MPI parallelization of sequential C codes. In our analysis, we focus on testing six essential HPC workloads, which are based on Basic Linear Algebra Subprograms levels 1, 2, and 3 as well as sparse, stencil, and iterative operations. We analyze the process of creating ChatMPI by using the ChatHPC library. This lightweight large language model (LLM)–based infrastructure enables HPC experts to efficiently create and supervise trustworthy AI capabilities for critical HPC software tasks. We study the data required for training (fine-tuning) ChatMPI to generate parallel codes that not only use MPI syntax correctly but also apply HPC techniques to reduce memory communication and maximize performance by using proper work decomposition. With a relatively small training dataset composed of a few dozen prompts and fewer than 15 minutes of fine-tuning on one node equipped with two NVIDIA H100 GPUs, ChatMPI elevates trustworthiness for MPI code generation of current LLMs (e.g., Code Llama, ChatGPT-4o and ChatGPT 5). Additionally, we evaluate the performance of the MPI codes generated by ChatMPI in comparison with the ones generated by ChatGPT-4o and ChatGPT-5. The codes generated by ChatMPI provide up to a 4 × boost in performance by using better problem decomposition, communication patterns, and HPC techniques (e.g., communication avoiding).

Valero Lara, Pedro [ORNL] (ORCID:0000000214794310)↗

ASCR Workshop on Quantum Computing for Science

This report details the findings of the DOE ASCR Workshop on Quantum Computing for Science that was organized to assess the viability of quantum computing technologies to meet the computational requirements of the DOE’s science and energy mission, and to identify the potential impact of quantum technologies. The workshop was held on February 17-18, 2015, in Bethesda, MD, to solicit input from members of the quantum computing community. The workshop considered models of quantum computation and programming environments, physical science applications relevant to DOE's science mission as well as quantum simulation, and applied mathematics topics including potential quantum algorithms for linear algebra, graph theory, and machine learning. This report summarizes these perspectives into an outlook on the opportunities for quantum computing to impact problems relevant to the DOE’s mission as well as the additional research required to bring quantum computing to the point where it can have such impact.

97 MATHEMATICS AND COMPUTING↗

Demonstration and performance testing of extreme-resolution simulations with static meshes on Summit (CPU & GPU) for a parked-turbine configuration and an actuator-line (mid-fidelity model) wind farm configuration (ECP-Q4 FY2020 Milestone Report)

The goal of the ExaWind project is to enable predictive simulations of wind farms comprised of many megawatt-scale turbines situated in complex terrain. Predictive simulations will require computational fluid dynamics (CFD) simulations for which the mesh resolves the geometry of the turbines and captures the rotation and large deflections of blades. Whereas such simulations for a single turbine are arguably petascale class, multi-turbine wind farm simulations will require exascale-class resources. The primary physics codes in the ExaWind simulation environment are Nalu-Wind, an unstructured-grid solver for the acoustically incompressible Navier-Stokes equations, AMR-Wind, a block-structured-grid solver with adaptive mesh refinement capabilities, and OpenFAST, a wind-turbine structural dynamics solver. The Nalu-Wind model consists of the mass-continuity Poisson-type equation for pressure and Helmholtz-type equations for transport of momentum and other scalars. For such modeling approaches, simulation times are dominated by linear-system setup and solution for the continuity and momentum systems. For the ExaWind challenge problem, the moving meshes greatly affect overall solver costs as reinitialization of matrices and recomputation of preconditioners is required at every time step. The choice of overset-mesh methodology to model the moving and non-moving parts of the computational domain introduces constraint equations in the elliptic pressure-Poisson solver. The presence of constraints greatly affects the performance of algebraic multigrid preconditioners.

17 WIND ENERGY↗

Investigation of automated task learning, decomposition and scheduling

The details and results of research conducted in the application of neural networks to task planning and decomposition are presented. Task planning and decomposition are operations that humans perform in a reasonably efficient manner. Without the use of good heuristics and usually much human interaction, automatic planners and decomposers generally do not perform well due to the intractable nature of the problems under consideration. The human-like performance of neural networks has shown promise for generating acceptable solutions to intractable problems such as planning and decomposition. This was the primary reasoning behind attempting the study. The basis for the work is the use of state machines to model tasks. State machine models provide a useful means for examining the structure of tasks since many formal techniques have been developed for their analysis and synthesis. It is the approach to integrate the strong algebraic foundations of state machines with the heretofore trial-and-error approach to neural network synthesis.

Livingston, David L.↗

Health Monitoring of a Satellite System

A health monitoring system based on analytical redundancy is developed for satellites on elliptical orbits. First, the dynamics of the satellite including orbital mechanics and attitude dynamics is modelled as a periodic system. Then, periodic fault detection filters are designed to detect and identify the satellite's actuator and sensor faults. In addition, parity equations are constructed using the algebraic redundant relationship among the actuators and sensors. Furthermore, a residual processor is designed to generate the probability of each of the actuator and sensor faults by using a sequential probability test. Finally, the health monitoring system, consisting of periodic fault detection lters, parity equations and residual processor, is evaluated in the simulation in the presence of disturbances and uncertainty.

Chen, Robert H.↗