SEARCH · Engineering Papers

Results for “matrix 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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 289 records · Page 16

All sources NASA NTRS DOE OSTI

DOE OSTI2021

Gapless spin liquid and pair density wave of the Hubbard model on three-leg triangular cylinders

We study the ground state properties of the Hubbard model on three-leg triangular cylinders using large-scale density-matrix renormalization group simulations. At half-filling, we identify an intermediate gapless spin liquid phase, which has one gapless spin mode and algebraic spin–spin correlations but exponential decay scalar chiral–chiral correlations, between a metallic phase at weak coupling and Mott insulating dimer phase at strong interaction. Upon light doping the gapless spin liquid, the system exhibits power-law charge-density-wave (CDW) correlations but short-range single-particle, spin–spin, and chiral–chiral correlations. Similar to CDW correlations, the superconducting correlations also decay in power-law but oscillate in sign as a function of distance, which is consistent with the striped pair-density wave. When further doping the gapless spin liquid phase or doping the dimer order phase, another phase takes over, which has similar CDW correlations but all other correlations decay exponentially.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

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 (↗

NASA NTRS1974

Equation solving program for aerodynamic lifting surface theory

A description of and user's manual are presented for one of a group of FORTRAN programs which, together, can be used for the analysis and design of wings in steady, subsonic flow according to a kernel function method lifting surface theory. This particular program is the one which solves the sets of simultaneous, linear, algebraic equations arising from the thin wing analysis. This program has the capability of striking out rows and columns of the aerodynamic influence matrix and rows of the associated boundary condition vectors (right hand sides). This capability significantly enhances the effectiveness of the kernel function method of lifting surface theory because studies of the convergence of solutions with the number of control points can be done with the calculation of only a single influence matrix.

Medan, R. T.↗

NASA NTRS1977

Problems in characterizing atmospheric aerosols by lidar alone

In this paper we review the scattering properties of real atmospheric aerosols as they relate to laser radar measurements. We address two major subjects: theoretical approximations for modeling lidar experiments and laboratory measurements for characterizing real aerosols. In the first category we review: (1) the Mueller algebra and Stokes vectors, (2) approximations for the single scattering properties of various aerosols, (3) the information content of the Mueller or scattering matrix and related limitations of lidar measurements, and (4) the effects of multiple scattering on lidar returns. In the second category we review: (1) polar nephelometers, (2) calibration procedures for nephelometers, and (3) characterization of the scattering medium. Finally, we summarize the outstanding problems in measuring the atmospheric aerosols by lidar alone.

Holland, A. C.↗

NASA NTRS1986

Some insights into the stability of difference approximations for hyperbolic initial-boundary-value problems

This paper states a conjecture which relates Lax-Richmyer stability to the algebraic test of the stability theory of Gustafsson, Kreiss, and Sundstrom (1972), developed for difference approximations to initial boundary value problems where the matrix size J increases linearly with n as n goes to infinity. This corresponds to mesh refinement in both space and time for t = n x delta t = constant.

Warming, Robert F.↗

DOE OSTI2022

Pyomo.DOE: An open-source package for model-based design of experiments in Python

Predictive mathematical models are a cornerstone of science and engineering. Yet selecting, calibrating, and validating said science-based models often remains an art in practice. Model-based design of experiments (MBDoE) provides a systematic framework to maximize information gain from experiments while minimizing time and resource costs. But MBDoE remains limited to niche application areas, in part because practitioners must integrate expertise in statistics, computational optimization, and modeling. To help reduce this barrier, we introduce Pyomo.DOE, an open-source package for MBDoE. Pyomo.DOE uses a nonlinear sensitivity analysis code k_aug to quickly approximate the Fisher information matrix and leverages a new stochastic programming abstraction. We demonstrate Pyomo.DOE with the first application of MBDoE to fixed-bed breakthrough experiments, which highlights the power of Pyomo.DOE to quantify the value of experimental modifications a priori for large-scale partial differential-algebraic equation (PDAE) models. Here we also provide a mathematical primer on MBDoE targeted at general chemical engineers.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2022

Smoothed aggregation for difficult stretched mesh and coefficient variation problems

Abstract Four adaptations of the smoothed aggregation algebraic multigrid (SA‐AMG) method are proposed with an eye toward improving the convergence and robustness of the solver in situations when the discretization matrix contains many weak connections. These weak connections can cause higher than expected levels of fill‐in within the coarse discretization matrices and can also give rise to suboptimal smoothing within the prolongator smoothing phase. These smoothing drawbacks are due to the relatively small size of some diagonal entries within the filtered matrix that one obtains after dropping the weak connections. The new algorithms consider modifications to the Jacobi‐like step that defines the prolongator smoother, modifications to the filtered matrix, and also direct modifications to the resulting grid transfer operators. Numerical results are given illustrating the potential benefits of the proposed adaptations.

Hu, Jonathan J.↗

DOE OSTI2021

Symbol alphabets from plabic graphs II: rational letters

Symbol alphabets of n-particle amplitudes in N = 4 super-Yang-Mills theory are known to contain certain cluster variables of G(4, n) as well as certain algebraic functions of cluster variables. The first paper arXiv:2007.00646 in this series focused on n = 8 algebraic letters. In this paper we show that it is possible to obtain all rational symbol letters (in fact all cluster variables) by solving matrix equations of the form C Z = 0 if one allows C to be an arbitrary cluster parameterization of the top cell of G + (n-4, n).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2026

Intrusive Uncertainty Quantification and Optimal Experiment Design in the Open-Source Pyomo Ecosystem

This contribution describes ParmEst and Pyomo.DoE, two pillars of the open-source Python-based Pyomo ecosystem for computational optimization with (partial differential) algebraic equation mathematical models. Specifically, ParmEst facilitates intrusive frequentist parameter estimation (PE) and uncertainty quantification (UQ) through built-in features, such as covariance matrix estimation, bootstrapping, and likelihood ratio tests. Complementary, Pyomo.DoE enables optimal experiment design by maximizing various metrics of the Fisher information matrix, such as A-optimality (trace), D-optimality (determinant), E-optimality (minimum eigenvalue), and ME-optimality (condition number). ParmEst and Pyomo.DoE can solve high-dimensional optimization problems by leveraging the model structure and exact derivative information. Finally, we will discuss future opportunities to integrate PE and UQ capabilities with optimization under uncertainty, including robust optimization with non-convex models via PyROS.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1991

Component mode damping assignment techniques

A relation between the system modal damping matrix and the component modal damping matrix is derived from First Principles. An optimization problem is then formulated to select all the component modes' damping ratios that best satisfy the above derived relation. A weighting matrix is used in the cost functional to stress the relative importance of the diagonal terms in the damping matrix. Inequality constraints are also added to the optimization problem to pick only nonnegative component modes' damping factors. The optimization problem may be solved algebraically or iteratively. The proposed techniques are successfully used on a high order, finite element model of the Galileo spacecraft.

Lee, Allan Y.↗

NASA NTRS1992

Recursive formulation of operational space control

A recently developed spatial operator algebra approach to modeling and analysis of multibody robotic systems is used to develop O(n) recursive algorithms that compute the operational space mass matrix and the operational space coriolis/centrifugal and gravity terms of an n-link serial manipulator. These algorithms enable an O(n) recursive implementation of operational space control.

Kreutz-Delgado, K.↗

NASA NTRSDate not supplied

Memory Optimizations for Sparse Linear Algebra on GPU Hardware

An effort to maximize memory bandwidth utilization for a sparse linear algebra kernel executing on NVIDIA® Tesla V100 and A100 Graphics Processing Units (GPUs) is described. The kernel consists of a block-sparse matrix-vector product and a series of forward/backward triangular solves. The computation is memory-bound and exhibits low arithmetic intensity. Along with a relatively small block size, the data layout poses a challenge to effectively utilize the available memory bandwidth on common GPU architectures. An earlier implementation using a warp to process a single row of the matrix was found to yield good memory performance on the V100 architecture. However, anew approach, which assigns a warp to six rows of the matrix, is proposed for the A100. In addition, two new features offered by the A100 architecture are explored.L2residency control enables a portion of theL2cache to be used for persistent data access, and the asynchronous copy instruction allows data to be loaded directly from main memory into shared memory. Demonstrations show that the new implementation improves memory bandwidth utilization from 71.5% to 81.2% of the peak available on theA100 architecture.

GPU↗

NASA NTRS1993

Convection equation modeling: A non-iterative direct matrix solution algorithm for use with SINDA

The determination of the boundary conditions for a component-level analysis, applying discrete finite element and finite difference modeling techniques often requires an analysis of complex coupled phenomenon that cannot be described algebraically. For example, an analysis of the temperature field of a coldplate surface with an integral fluid loop requires a solution to the parabolic heat equation and also requires the boundary conditions that describe the local fluid temperature. However, the local fluid temperature is described by a convection equation that can only be solved with the knowledge of the locally-coupled coldplate temperatures. Generally speaking, it is not computationally efficient, and sometimes, not even possible to perform a direct, coupled phenomenon analysis of the component-level and boundary condition models within a single analysis code. An alternative is to perform a disjoint analysis, but transmit the necessary information between models during the simulation to provide an indirect coupling. For this approach to be effective, the component-level model retains full detail while the boundary condition model is simplified to provide a fast, first-order prediction of the phenomenon in question. Specifically for the present study, the coldplate structure is analyzed with a discrete, numerical model (SINDA) while the fluid loop convection equation is analyzed with a discrete, analytical model (direct matrix solution). This indirect coupling allows a satisfactory prediction of the boundary condition, while not subjugating the overall computational efficiency of the component-level analysis. In the present study a discussion of the complete analysis of the derivation and direct matrix solution algorithm of the convection equation is presented. Discretization is analyzed and discussed to extend of solution accuracy, stability and computation speed. Case studies considering a pulsed and harmonic inlet disturbance to the fluid loop are analyzed to assist in the discussion of numerical dissipation and accuracy. In addition, the issues of code melding or integration with standard class solvers such as SINDA are discussed to advise the user of the potential problems to be encountered.

Schrage, Dean S.↗

DOE OSTI2024

QuTree: A tree tensor network package

Here we present QuTree, a C++ library for tree tensor network approaches. QuTree provides class structures for tensors, tensor trees, and related linear algebra functions that facilitate the fast development of tree tensor network approaches such as the multilayer multiconfigurational time-dependent Hartree approach or the density matrix renormalization group approach and its various extensions. We investigate the efficiency of relevant tensor and tensor network operations and show that the overhead for managing the network structure is negligible, even in cases with a million leaves and small tensors. QuTree focuses on providing simple, high-level routines while retaining easy access to the backend to facilitate novel developments. We demonstrate the capabilities of the package by computing the eigenstates of coupled harmonic oscillator Hamiltonians and performing random circuit simulations on a virtual quantum computer.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

NASA NTRS1991

Post-glacial relaxation of a viscously stratified compressible mantle

The postglacial relaxation phenomenon of a viscously compressible nonself-gravitating spherical-shell model is investigated. Analytical solutions to an exponentially depth-dependent viscosity are developed with various types of compressible density models such as those with an exponential dependence of the radius and an algebraic-root dependence of the radius. The solutions of a viscously compressible multilayered model with constant thermodynamic properties and viscosity are developed by the propagator matrix method. The results show that inferences of deep mantle viscosity from postglacial rebound would be hampered by mantle compressibility for long-wavelength harmonics because of the smaller excitation of compressible eigenfunctions in the lower mantle. The relaxation times and velocity fields are more sensitive to higher viscosity contrast for the exponentially varying viscosity than for models with discrete jumps in the viscosity structure.

Wu, J.↗

DOE OSTI2022

Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning

We present an algorithmic framework for quantum-inspired classical algorithms on close-to-low-rank matrices, generalizing the series of results started by Tang’s breakthrough quantum-inspired algorithm for recommendation systems [STOC’19]. Motivated by quantum linear algebra algorithms and the quantum singular value transformation (SVT) framework of Gilyén et al. [STOC’19], we develop classical algorithms for SVT that run in time independent of input dimension, under suitable quantum-inspired sampling assumptions. Our results give compelling evidence that in the corresponding QRAM data structure input model, quantum SVT does not yield exponential quantum speedups. Since the quantum SVT framework generalizes essentially all known techniques for quantum linear algebra, our results, combined with sampling lemmas from previous work, suffice to generalize all prior results about dequantizing quantum machine learning algorithms. In particular, our classical SVT framework recovers and often improves the dequantization results on recommendation systems, principal component analysis, supervised clustering, support vector machines, low-rank regression, and semidefinite program solving. We also give additional dequantization results on low-rank Hamiltonian simulation and discriminant analysis. Our improvements come from identifying the key feature of the quantum-inspired input model that is at the core of all prior quantum-inspired results: ℓ 2 -norm sampling can approximate matrix products in time independent of their dimension. We reduce all our main results to this fact, making our exposition concise, self-contained, and intuitive.

Computer Science↗

DOE OSTI2024

Quantum chaos on edge

Recently, the physics of many-body quantum chaotic systems close to their ground states has come under intensified scrutiny. Such studies are motivated by the emergence of model systems exhibiting chaotic fluctuations throughout the entire spectrum [the Sachdev-Ye-Kitaev (SYK) model being a renowned representative] as well as by the physics of holographic principles, which likewise unfold close to ground states. Interpreting the edge of the spectrum as a quantum critical point, here we combine a wide range of analytical and numerical methods to the identification and comprehensive description of two different universality classes: the near edge physics of “sparse” and the near edge of “dense” chaotic systems. The distinction lies in the ratio between the number of a system's random parameters and its Hilbert space dimension, which is exponentially small or algebraically small in the sparse and dense case, respectively. Notable representatives of the two classes are generic chaotic many-body models (sparse) and invariant random matrix ensembles or chaotic gravitational systems (dense). While the two families share identical spectral correlations at energy scales comparable to the level spacing, the density of states and its fluctuations near the edge are different. Considering the SYK model as a representative of the sparse class, we apply a combination of field theory and exact diagonalization to a detailed discussion of its edge spectrum. Conversely, Jackiw-Teitelboim gravity is our reference model for the dense class, where an analysis of the gravitational path integral and random matrix theory reveal universal differences to the sparse class, whose implications for the construction of holographic principles we discuss. Published by the American Physical Society 2024

Altland, Alexander (ORCID:0000000229914805)↗

DOE OSTI2021

Butterfly Factorization Via Randomized Matrix-Vector Multiplications

This paper presents an adaptive randomized algorithm for computing the butterfly factorization of an m × n matrix with m ≈ n provided that both the matrix and its transpose can be rapidly applied to arbitrary vectors. The resulting factorization is composed of O(log n) sparse factors, each containing O(n) nonzero entries. The factorization can be attained using O(n 3/2 log n) computation and O(n log n) memory resources. Furthermore, the proposed algorithm can be implemented in parallel and can apply to matrices with strong or weak admissibility conditions arising from surface integral equation solvers as well as multi-frontal-based finite-difference, finite-element, or finite-volume solvers. A distributed-memory parallel implementation of the algorithm demonstrates excellent scaling behavior.

97 MATHEMATICS AND COMPUTING↗