Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Numerical linear algebra”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Computing rank‐revealing factorizations of matrices stored out‐of‐core

This paper describes efficient algorithms for computing rank-revealing factorizations of matrices that are too large to fit in main memory (RAM), and must instead be stored on slow external memory devices such as disks (out-of-core or out-of-memory). Traditional algorithms for computing rank-revealing factorizations (such as the column pivoted QR factorization and the singular value decomposition) are very communication intensive as they require many vector-vector and matrix-vector operations, which become prohibitively expensive when data is not in RAM. Randomization allows to reformulate new methods so that large contiguous blocks of the matrix are processed in bulk. The paper describes two distinct methods. The first is a blocked version of column pivoted Householder QR, organized as a “left-looking” method to minimize the number of the expensive write operations. The second method results employs a UTV factorization. It is organized as an algorithm-by-blocks to overlap computations and I/O operations. As it incorporates power iterations, it is much better at revealing the numerical rank. Numerical experiments on several computers demonstrate that the new algorithms are almost as fast when processing data stored on slow memory devices as traditional algorithms are for data stored in RAM.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Hierarchical Model Reduction Driven by Machine Learning for Parametric Advection-Diffusion-Reaction Problems in the Presence of Noisy Data

Abstract We propose a new approach to generate a reliable reduced model for a parametric elliptic problem, in the presence of noisy data. The reference model reduction procedure is the directional HiPOD method, which combines Hierarchical Model reduction with a standard Proper Orthogonal Decomposition, according to an offline/online paradigm. In this paper we show that directional HiPOD looses in terms of accuracy when problem data are affected by noise. This is due to the interpolation driving the online phase, since it replicates, by definition, the noise trend. To overcome this limit, we replace interpolation with Machine Learning fitting models which better discriminate relevant physical features in the data from irrelevant unstructured noise. The numerical assessment, although preliminary, confirms the potentialities of the new approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Dynamics retrieval from stochastically weighted incomplete data by low-pass spectral analysis

Time-resolved serial femtosecond crystallography (TR-SFX) provides access to protein dynamics on sub-picosecond timescales, and with atomic resolution. Due to the nature of the experiment, these datasets are often highly incomplete and the measured diffracted intensities are affected by partiality. To tackle these issues, one established procedure is that of splitting the data into time bins, and averaging the multiple measurements of equivalent reflections within each bin. This binning and averaging often involve a loss of information. Here, we propose an alternative approach, which we call low-pass spectral analysis (LPSA). In this method, the data are projected onto the subspace defined by a set of trigonometric functions, with frequencies up to a certain cutoff. This approach attenuates undesirable high-frequency features and facilitates retrieving the underlying dynamics. A time-lagged embedding step can be included prior to subspace projection to improve the stability of the results with respect to the parameters involved. Subsequent modal decomposition allows to produce a low-rank description of the system's evolution. Using a synthetic time-evolving model with incomplete and partial observations, we analyze the LPSA results in terms of quality of the retrieved signal, as a function of the parameters involved. We compare the performance of LPSA to that of a range of other sophisticated data analysis techniques. We show that LPSA allows to achieve excellent dynamics reconstruction at modest computational cost. Finally, we demonstrate the superiority of dynamics retrieval by LPSA compared to time binning and merging, which is, to date, the most commonly used method to extract dynamical information from TR-SFX data.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

Fractional Laplacian spectral approach to turbulence in a dusty plasma monolayer

This work presents an analytical investigation of anomalous diffusion and turbulence in a dusty plasma monolayer, where energy transport across scales leads to the spontaneous formation of spatially disordered patterns. Many-body simulations of 10,000-particle dusty plasma monolayers are used to demonstrate how the global dynamics depend on the statistical properties of the dust assembly for realistic laboratory conditions. We find that disorder due to variations in the dust size distribution and charge-driven nonlocal interactions resulting in anomalous dust diffusion are key factors for the onset of instabilities. The resulting dynamics exhibit features of inertial turbulence over slightly more than half a decade of scales proportional or smaller than the Debye shielding length. These processes are examined analytically using a recently developed Fractional Laplacian Spectral (FLS) technique, which identifies the active energy channels as a function of scale, disorder concentration, and features of the nonlocal-interactions. The predictions from the theoretical (spectral) analysis demonstrate agreement with the results from the many-body (kinetic) simulations, thus providing a powerful tool for the study of active turbulence.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Quasioptical modeling of wave beams with and without mode conversion. IV. Numerical simulations of waves in dissipative media

We report the first quasi-optical simulations of wave beams in a hot plasma using the quasi-optical code PARADE (PAraxial RAy DEscription) [K. Yanagihara, I. Y. Dodin, and S. Kubo, Phys. Plasmas 26, 072112 (2019)]. This code is unique in that it accounts for inhomogeneity of the dissipation-rate across the beam and mode conversion simultaneously. We show that the dissipation-rate inhomogeneity shifts beams relative to their trajectories in cold plasma and that the two electromagnetic modes are coupled via this process, an effect that was ignored in the past. Additionally, we propose a simplified approach to account for the dissipation-rate inhomogeneity. This approach is computationally inexpensive and simplifies the analysis of actual experiments.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Complex Fermi–Löwdin orbital self-interaction correction

Here, this paper introduces the use of complex Fermi orbital descriptors (FODs) in the Fermi–Löwdin self-interaction-corrected density functional theory (FLOSIC). With complex FODs, the Fermi–Löwdin orbitals (FLOs) that are used to evaluate the SIC correction to the total energy become complex. Complex FLO-SIC (cFLOSIC) calculations based on the local spin density approximation produce total energies that are generally lower than the corresponding energies found with FLOSIC restricted to real orbitals (rFLOSIC). The cFLOSIC results are qualitatively similar to earlier Perdew–Zunger SIC (PZ-SIC) calculations using complex orbitals. The energy lowering stems from the exchange–correlation part of the self-interaction correction. The Hartree part of the correction is more negative in rFLOSIC. The energy difference between real and complex solutions is greater for more strongly hybridized FLOs in atoms and for FLOs corresponding to double and triple bonds in molecules. The case of N2 is examined in detail to show the differences between the real and complex FLOs. We show that the complex triple-bond orbitals are simple, and physically appealing combinations of π and σ g orbitals that have not been discussed before. Consideration of complex FODs, and resulting unitary transformations, underscores the fact that FLO centroids are not necessarily good guesses for FOD positions in a FLOSIC calculation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

A review on recent machine learning applications for imaging mass spectrometry studies

Imaging mass spectrometry (IMS) is a powerful analytical technique widely used in biology, chemistry, and materials science fields that continue to expand. IMS provides a qualitative compositional analysis and spatial mapping with high chemical specificity. The spatial mapping information can be 2D or 3D depending on the analysis technique employed. Due to the combination of complex mass spectra coupled with spatial information, large high-dimensional datasets (hyperspectral) are often produced. Therefore, the use of automated computational methods for an exploratory analysis is highly beneficial. The fast-paced development of artificial intelligence (AI) and machine learning (ML) tools has received significant attention in recent years. These tools, in principle, can enable the unification of data collection and analysis into a single pipeline to make sampling and analysis decisions on the go. There are various ML approaches that have been applied to IMS data over the last decade. Here, in this review, we discuss recent examples of the common unsupervised (principal component analysis, non-negative matrix factorization, k-means clustering, uniform manifold approximation and projection), supervised (random forest, logistic regression, XGboost, support vector machine), and other methods applied to various IMS datasets in the past five years. The information from this review will be useful for specialists from both IMS and ML fields since it summarizes current and representative studies of computational ML-based exploratory methods for IMS.

47 OTHER INSTRUMENTATION↗
DOE OSTI2023

A parallel, distributed memory implementation of the adaptive sampling configuration interaction method

The many-body simulation of quantum systems is an active field of research that involves several different methods targeting various computing platforms. Many methods commonly employed, particularly coupled cluster methods, have been adapted to leverage the latest advances in modern high-performance computing. Selected configuration interaction (sCI) methods have seen extensive usage and development in recent years. However, the development of sCI methods targeting massively parallel resources has been explored only in a few research works. Here, we present a parallel, distributed memory implementation of the adaptive sampling configuration interaction approach (ASCI) for sCI. In particular, we will address the key concerns pertaining to the parallelization of the determinant search and selection, Hamiltonian formation, and the variational eigenvalue calculation for the ASCI method. Load balancing in the search step is achieved through the application of memory-efficient determinant constraints originally developed for the ASCI-PT2 method. The presented benchmarks demonstrate near optimal speedup for ASCI calculations of Cr 2 (24e, 30o) with 10 6 , 10 7 , and 3 × 10 8 variational determinants on up to 16 384 CPUs. Importantly, to the best of the authors’ knowledge, this is the largest variational ASCI calculation to date.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Augmenting machine learning of Grad–Shafranov equilibrium reconstruction with Green's functions

This work presents a method for predicting plasma equilibria in tokamak fusion experiments and reactors. The approach involves representing the plasma current as a linear combination of basis functions using principal component analysis of plasma toroidal current densities (J t ) from the EFIT-AI equilibrium database. Then utilizing EFIT's Green's function tables, basis functions are created for the poloidal flux (ψ) and diagnostics generated from the toroidal current (J t ). Similar to the idea of a physics-informed neural network (NN), this physically enforces consistency between ψ, J t , and the synthetic diagnostics. First, the predictive capability of a least squares technique to minimize the error on the synthetic diagnostics is employed. The results show that the method achieves high accuracy in predicting ψ and moderate accuracy in predicting J t with median R 2 = 0.9993 and R 2 = 0.978, respectively. A comprehensive NN using a network architecture search is also employed to predict the coefficients of the basis functions. The NN demonstrates significantly better performance compared to the least squares method with median R 2 = 0.9997 and 0.9916 for J t and ψ, respectively. The robustness of the method is evaluated by handling missing or incorrect data through the least squares filling of missing data, which shows that the NN prediction remains strong even with a reduced number of diagnostics. Additionally, the method is tested on plasmas outside of the training range showing reasonable results.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Impact of various DIII-D diagnostics on the accuracy of neural network surrogates for kinetic EFIT reconstructions

Abstract Kinetic equilibrium reconstructions make use of profile information such as particle density and temperature measurements in addition to magnetics data to compute a self-consistent equilibrium. They are used in a multitude of physics-based modeling. This work develops a multi-layer perceptron (MLP) neural network (NN) model as a surrogate for kinetic Equilibrium Fitting (EFITs) and trains on the 2019 DIII-D discharge campaign database of kinetic equilibrium reconstructions. We investigate the impact of including various diagnostic data and machine actuator controls as input into the NN. When giving various categories of data as input into NN models that have been trained using those same categories of data, the predictions on multiple equilibrium reconstruction solutions (poloidal magnetic flux, global scalars, pressure profile, current profile) are highly accurate. When comparing different models with different diagnostics as input, the magnetics-only model outputs accurate kinetic profiles and the inclusion of additional data does not significantly impact the accuracy. When the NN is tasked with inferring only a single target such as the EFIT pressure profile or EFIT current profile, we see a large increase in the accuracy of the prediction of the kinetic profiles as more data is included. These results indicate that certain MLP NN configurations can be reasonably robust to different burning-plasma-relevant diagnostics depending on the accuracy requirements for equilibrium reconstruction tasks.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2026

BoBa

BoBa is a C++ software library for working with large matrices, tensors, and tensor decompositions. The library provides tools for dense matrix and tensor operations, tensor decompositions, and tensor decomposition methods that support modern CPU and GPU architectures. It includes portable abstractions for linear algebra, tensor algebra, and multidimensional computation. BoBa is intended for scientific computing applications that involve large multidimensional data sets or high dimensional mathematical models. Its capabilities support tasks such as data compression, linear algebra, efficient numerical computation, and the development of scalable algorithms for heterogeneous hardware. Tutorials, tests, and example applications are included to help users learn and apply the library.

Yao, Jin [Lawrence Livermore National Laboratory (↗
DOE OSTI2025

Evaluation of data driven low-rank matrix factorization for accelerated solutions of the Vlasov equation

Low-rank methods have shown success in accelerating simulations of a collisionless plasma described by the Vlasov equation, but still rely on computationally costly linear algebra every time step. We propose a data-driven factorization method using artificial neural networks, specifically with convolutional layer architecture, that trains on existing simulation data. At inference time, the model outputs a low-rank decomposition of the distribution field of the charged particles, and we demonstrate that this step is faster than the standard linear algebra technique. Numerical experiments show that the method achieves comparable reconstruction accuracy for interpolation tasks, generalizing to unseen test data in a manner beyond just memorizing training data; patterns in factorization also inherently followed the same numerical trend as those within algebraic methods (e.g., truncated singular-value decomposition). However, when training on the first 70% of a time-series data and testing on the remaining 30%, the method fails to meaningfully extrapolate. Despite this limiting result, the technique may have benefits for simulations in a statistical steady-state or otherwise showing temporal stability. These results suggest that while the model offers a computationally efficient alternative for datasets with temporal stability, its current formulation is best suited for interpolation rather than for predicting future states in time-evolving systems. This study thus lays the groundwork for further refinement of neural network-based approaches to low-rank matrix factorization in high-dimensional plasma simulations.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1974

A finite-element method for lifting surfaces in steady incompressible subsonic flow

The problem of potential steady subsonic flow for lifting surfaces is considered. This problem requires the solution of an integral equation relating the value of the potential discontinuity on the lifting surface and its wake to the values of the normal derivative of the potential which are known from the boundary conditions. The lifting surface is divided into small (quadrilateral hyperboloidal) surface elements, which are described in terms of the Cartesian components of the four corner points. The values of the potential discontinuity and the normal derivative of the potential are assumed to be constant within each element and equal to their values at the centroids of the elements. This yields a set of linear algebraic equations. Numerical results are in good agreement with existing ones.

Morino, L.↗
NASA NTRS1978

ORACLS: A system for linear-quadratic-Gaussian control law design

A modern control theory design package (ORACLS) for constructing controllers and optimal filters for systems modeled by linear time-invariant differential or difference equations is described. Numerical linear-algebra procedures are used to implement the linear-quadratic-Gaussian (LQG) methodology of modern control theory. Algorithms are included for computing eigensystems of real matrices, the relative stability of a matrix, factored forms for nonnegative definite matrices, the solutions and least squares approximations to the solutions of certain linear matrix algebraic equations, the controllability properties of a linear time-invariant system, and the steady state covariance matrix of an open-loop stable system forced by white noise. Subroutines are provided for solving both the continuous and discrete optimal linear regulator problems with noise free measurements and the sampled-data optimal linear regulator problem. For measurement noise, duality theory and the optimal regulator algorithms are used to solve the continuous and discrete Kalman-Bucy filter problems. Subroutines are also included which give control laws causing the output of a system to track the output of a prescribed model.

Armstrong, E. S.↗
DOE OSTI2023

Symmetric Random Butterfly Transform (SRBT) Based Preconditioner

Summary of work using Symmetric Random Butterfly Transformation (SRBT) in conjunction with Incomplete LDL T factorization as a preconditioner for FGMRES solver as a way of solving linear systems arising from interior point methods applied to power system problems. These linear systems have proven difficult to parallelize and this represents a possible route forward.

interior point optimization↗
NASA NTRS1986

On recent advances and future research directions for computational fluid dynamics

This paper highlights some recent accomplishments regarding CFD numerical algorithm constructions for generation of discrete approximate solutions to classes of Reynolds-averaged Navier-Stokes equations. Following an overview of turbulent closure modeling, and development of appropriate conservation law systems, a Taylor weak-statement semi-discrete approximate solution algorithm is developed. Various forms for completion to the final linear algebra statement are cited, as are a range of candidate numerical linear algebra solution procedures. This development sequence emphasizes the key building blocks of a CFD RNS algorithm, including solution trial and test spaces, integration procedure and added numerical stability mechanisms. A range of numerical results are discussed focusing on key topics guiding future research directions.

Baker, A. J.↗
DOE OSTI2023

Fast truncated SVD of sparse and dense matrices on graphics processors

We investigate the solution of low-rank matrix approximation problems using the truncated singular value decomposition (SVD). For this purpose, we develop and optimize graphics processing unit (GPU) implementations for the randomized SVD and a blocked variant of the Lanczos approach. Our work takes advantage of the fact that the two methods are composed of very similar linear algebra building blocks, which can be assembled using numerical kernels from existing high-performance linear algebra libraries. Furthermore, the experiments with several sparse matrices arising in representative real-world applications and synthetic dense test matrices reveal a performance advantage of the block Lanczos algorithm when targeting the same approximation accuracy.

Computer Science↗
NASA NTRS2008

Numerical Determination of Critical Conditions for Thermal Ignition

The determination of ignition or thermal explosion in an oxidizing porous body of material, as described by a dimensionless reaction-diffusion equation of the form .tu = .2u + .e-1/u over the bounded region O, is critically reexamined from a modern perspective using numerical methodologies. First, the classic stationary model is revisited to establish the proper reference frame for the steady-state solution space, and it is demonstrated how the resulting nonlinear two-point boundary value problem can be reexpressed as an initial value problem for a system of first-order differential equations, which may be readily solved using standard algorithms. Then, the numerical procedure is implemented and thoroughly validated against previous computational results based on sophisticated path-following techniques. Next, the transient nonstationary model is attacked, and the full nonlinear form of the reaction-diffusion equation, including a generalized convective boundary condition, is discretized and expressed as a system of linear algebraic equations. The numerical methodology is implemented as a computer algorithm, and validation computations are carried out as a prelude to a broad-ranging evaluation of the assembly problem and identification of the watershed critical initial temperature conditions for thermal ignition. This numerical methodology is then used as the basis for studying the relationship between the shape of the critical initial temperature distribution and the corresponding spatial moments of its energy content integral and an attempt to forge a fundamental conjecture governing this relation. Finally, the effects of dynamic boundary conditions on the classic storage problem are investigated and the groundwork is laid for the development of an approximate solution methodology based on adaptation of the standard stationary model.

Luo, W.↗