SEARCH · Engineering Papers

Results for “MATRICES”

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 523 records · Page 29

All sources NASA NTRS DOE OSTI

NASA NTRS1998

Model Refinement Using Eigensystem Assignment

This paper presented a novel approach for the refinement of finite-element-based analytical models of flexible structures is presented. The proposed approach models the possible refinements in the mass, damping, and stiffness matrices of the finite element model in the form of a constant gain feedback with acceleration, velocity, and displacement measurements, respectively. Once, the free elements of the structural matrices have been defined, the problem of model refinement reduces to obtaining position, velocity, and acceleration gain matrices, which reassign a desired subset of the eigenvalues of the model, along with partial mode shapes, from their baseline values to those obtained from system identification test data. A sequential procedure is used to assign one self-conjugate pair of closed-loop eigenvalues at each step using symmetric output feedback gain matrices, and the closed-loop eigenvectors are partially assigned, while ensuring that the eigenvalues assigned in the previous steps are not disturbed. The procedure can also impose that gain matrices be dissipative in order to guarantee the stability of the refined model. A numerical example, involving finite element model refinement for a structural testbed at NASA Langley (CSI Evolutionary Model) is presented to demonstrate the feasibility of the proposed approach.

Maghami, Pieman G.↗

NASA NTRS2011

Graph Theory Roots of Spatial Operators for Kinematics and Dynamics

Spatial operators have been used to analyze the dynamics of robotic multibody systems and to develop novel computational dynamics algorithms. Mass matrix factorization, inversion, diagonalization, and linearization are among several new insights obtained using such operators. While initially developed for serial rigid body manipulators, the spatial operators and the related mathematical analysis have been shown to extend very broadly including to tree and closed topology systems, to systems with flexible joints, links, etc. This work uses concepts from graph theory to explore the mathematical foundations of spatial operators. The goal is to study and characterize the properties of the spatial operators at an abstract level so that they can be applied to a broader range of dynamics problems. The rich mathematical properties of the kinematics and dynamics of robotic multibody systems has been an area of strong research interest for several decades. These properties are important to understand the inherent physical behavior of systems, for stability and control analysis, for the development of computational algorithms, and for model development of faithful models. Recurring patterns in spatial operators leads one to ask the more abstract question about the properties and characteristics of spatial operators that make them so broadly applicable. The idea is to step back from the specific application systems, and understand more deeply the generic requirements and properties of spatial operators, so that the insights and techniques are readily available across different kinematics and dynamics problems. In this work, techniques from graph theory were used to explore the abstract basis for the spatial operators. The close relationship between the mathematical properties of adjacency matrices for graphs and those of spatial operators and their kernels were established. The connections hold across very basic requirements on the system topology, the nature of the component bodies, the indexing schemes, etc. The relationship of the underlying structure is intimately connected with efficient, recursive computational algorithms. The results provide the foundational groundwork for a much broader look at the key problems in kinematics and dynamics. The properties of general graphs and trees of nodes and edge were examined, as well as the properties of adjacency matrices that are used to describe graph connectivity. The nilpotency property of such matrices for directed trees was reviewed, and the adjacency matrices were generalized to the notion of block weighted adjacency matrices that support block matrix elements. This leads us to the development of the notion of Spatial Kernel Operator SKO kernels. These kernels provide the basis for the development of SKO resolvent operators.

Jain, Abhinandan↗

DOE OSTI2020

Macromolecular gelatin properties affect fibrin microarchitecture and tumor spheroid behavior in fibrin-gelatin gels

The biophysical properties of extracellular matrices (ECM) are known to regulate cell behavior, however decoupling cell behavior changes due to the relative contributions of material microstructure versus biomechanics or nutrient permeability remains challenging, especially within complex, multi-material matrices. We developed four gelatin-fibrin interpenetrating network (IPN) formulations which are identical in composition but possess variable gelatin molecular weight distributions, and display differences in microstructure, biomechanics, and diffusivity. In this work we interrogate the response of multicellular tumor spheroids to these IPN formulations and found that a high stiffness, gelatin-network dominated IPNs impeded remodeling and invasion of multicellular tumor spheroids; whereas relatively lower stiffness, fibrin-network dominated IPNs permitted protease-dependent remodeling and spheroid invasion. Cell proliferation correlated to nutrient diffusivity across tested IPN formulations. These findings demonstrate the complexity of ECM IPNs, relative to single polymer matrices, and highlight that cell response does not derive from a single aspect of the ECM, but rather from the interplay of multiple biomechanical properties. The methodology developed in this study represents a framework for future studies which aim to characterize cellular phenotypic responses to biophysical cues present within complex, multi-material matrices.

36 MATERIALS SCIENCE↗

DOE OSTI2021

Statistical learning for predicting density–matrix-based electron dynamics

In this study, we consider the problem of learning density-dependent molecular Hamiltonian matrices from time series of electron density matrices, all in the context of Hartree–Fock theory. Prior work developed a solution to this problem for small molecular systems with density and Hamiltonian matrices of size at most 6 × 6. Here, using a battery of techniques, we scale prior methods to larger molecular systems with, for example, 29 × 29 matrices. This includes systems that either have more electrons or are expressed in large basis sets such as 6-311++G**. Scaling the method to larger systems enhances its relevance for realistic applications in chemistry and physics. To achieve this scaling, we apply dimensionality reduction, ridge regression and analytic computation of Hessians. Through the combination of these techniques, we are able to learn Hamiltonians by minimizing an objective function that encodes local propagation error. Importantly, these learned Hamiltonians can then be used to predict electron dynamics for thousands of steps: When we use our learned Hamiltonians to numerically solve the time-dependent Hartree–Fock equation, we obtain predicted dynamics that are in close quantitative agreement with ground truth dynamics. This includes field-off trajectories similar to the training data and field-on trajectories outside of the training data.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2021

Assessment the leaching characteristics and long-term leaching behavior of some radionuclides from synthesized zeolite cement matrix

Highlights: • Synthesis and characterization of zeolite cement synthesized from fly ash • Leaching tests were used to assess the release rate of {sup 85}Sr and {sup 60}Co radionuclides. • Simple mathematical models were used to detect leaching mechanisms. • Long-term leaching behavior of {sup 85}Sr and {sup 60}Co from cementitious matrix was assessed. The development of cementitious materials remains a vital goal to produce valuable products with good mechanical, physical and chemical properties suitable for the safe disposal of concentrated radionuclides resulted from the treatment of contaminated solutions. In this paper, zeolite cement with good properties was laboratory synthesized from industrial by-products fly ash and characterized using various characterization techniques. The leaching characteristics of strontium and cobalt radionuclides from the synthesized zeolite cement were scrutinized conforming with the standard leaching methodology of International Atomic Energy Authority (IAEA). A mechanical strength assessment was executed to characterize the extent of immobilization process of the solidified matrices. The cumulative leaching fraction (φ) of the two studied radionuclides was found to be less than 5% in all examined conditions, which implies the applicability of the IAEA-recommended methodology for estimating the diffusion coefficient. The experimental leaching data were regressed nonlinearly to various mathematical kinetic models to assess the controlling leaching mechanism and to determine the leaching parameters. The regression results indicated that strontium ({sup 85}Sr) and cobalt ({sup 60}Co) leaching resulted from two succeeding mechanisms: as first order kinetic reaction, and then diffusion. The calculated values of leachability indices signify that the performance of each of the studied matrices is within an acceptable range. A simplified mathematical model, rooted in the first order reaction and diffusion mechanisms, was simulated to predict the radionuclides leaching rates from zeolite cement matrices. By comparing the synthesized zeolite cement with other cementitious materials, it can be concluded that the synthesized material can be classified as an efficient material suitable to immobilize {sup 85}Sr and {sup 60}Co from radioactive wastes. The acquired findings demonstrated that the studied immobilized waste matrices have acceptable mechanical effectiveness.

36 MATERIALS SCIENCE↗

DOE OSTI2021

On the use of limestone calcined clay cement (LC3) in high-strength strain-hardening cement-based composites (HS-SHCC)

Highlights: • Use of LC{sup 3} slightly reduces flowability and shortens the setting time of fresh matrices. • Highly polymerized C-A-S-H gel and abundant ettringite benefit flexural strength of LC{sup 3}-matrices. • Use of LC{sup 3} enhances the bond strength between fiber and high-strength matrix. • LC{sup 3}-based HS-SHCC yields similar flexural performance as the composite with Portland cement. High-strength strain-hardening cement-based composites (HS-SHCC) demonstrate excellent mechanical and durability properties. However, high cement content typical to HS-SHCC results not only in high carbon footprint, but also in excessive hydration heat and severe autogenous shrinkage. In this investigation, Limestone Calcined Clay Cement (LC{sup 3}) was used to produce sustainable HS-SHCC. The LC{sup 3} substitution resulted in higher energy consumption during mixing and in shorter setting times of the fresh, plain matrices. Although the LC{sup 3} substitution slightly reduced the compressive strength, the formation of highly polymerized C-A-S-H gel and abundant ettringite benefited the flexural strength of the plain matrices. Additionally, single-fiber pullout experiments showed that the use of LC{sup 3} led to increased fiber-matrix bond strength and pullout energy. Finally, the replacement of Portland cement by LC{sup 3} resulted in HS-SHCC with similar mechanical performance to the reference composite, indicating a high potential for using LC{sup 3} in high-performance cement-based composites.

36 MATERIALS SCIENCE↗

DOE OSTI2023

DESI mock challenge: constructing DESI galaxy catalogues based on FastPM simulations

Together with larger spectroscopic surveys such as the Dark Energy Spectroscopic Instrument (DESI), the precision of large-scale structure studies and thus the constraints on the cosmological parameters are rapidly improving. Therefore, one must build realistic simulations and robust covariance matrices. We build galaxy catalogues by applying a halo occupation distribution (HOD) model upon the FastPM simulations, such that the resulting galaxy clustering reproduces high-resolution N-body simulations. While the resolution and halo finder are different from the reference simulations, we reproduce the reference galaxy two-point clustering measurements – monopole and quadrupole – to a precision required by the DESI Year 1 emission line galaxy sample down to non-linear scales, i.e. $k\lt 0.5\, h\, \mathrm{Mpc}^{-1}$ or $s\gt 10\, \mathrm{Mpc}\, h^{-1}$. Furthermore, we compute covariance matrices based on the resulting FastPM galaxy clustering – monopole and quadrupole. We study for the first time the effect of fitting on Fourier conjugate (e.g. power spectrum) on the covariance matrix of the Fourier counterpart (e.g. correlation function). We estimate the uncertainties of the two parameters of a simple clustering model and observe a maximum variation of 20 per cent for the different covariance matrices. Nevertheless, for most studied scales the scatter is between 2 and 10 per cent. Consequently, using the current pipeline we can precisely reproduce the clustering of N-body simulations and the resulting covariance matrices provide robust uncertainty estimations against HOD fitting scenarios. We expect our methodology will be useful for the coming DESI data analyses and their extension for other studies.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2024

Generalized Quantum Signal Processing

Quantum signal processing (QSP) and quantum singular value transformation (QSVT) currently stand as the most efficient techniques for implementing functions of block-encoded matrices, a central task that lies at the heart of most prominent quantum algorithms. However, current QSP approaches face several challenges, such as the restrictions imposed on the family of achievable polynomials and the difficulty of calculating the required phase angles for specific transformations. In this paper, we present a generalized quantum signal processing (GQSP) approach, employing general SU(2) rotations as our signal-processing operators, rather than relying solely on rotations in a single basis. Our approach lifts all practical restrictions on the family of achievable transformations, with the sole remaining condition being that | P | ≤ 1 , a restriction necessary due to the unitary nature of quantum computation. Furthermore, GQSP provides a straightforward recursive formula for determining the rotation angles needed to construct the polynomials in cases where P and Q are known. In cases where only P is known, we provide an efficient optimization algorithm capable of identifying in under a minute of GPU time, a corresponding Q for polynomials of degree on the order of 10 7 . We further illustrate GQSP simplifies QSP-based strategies for Hamiltonian simulation, offer an optimal solution to the ϵ -approximate fractional query problem that requires O ( ( 1 / δ ) + log ( 1 / ϵ ) ) queries to perform where O ( 1 / δ ) is a proved lower bound, and introduces novel approaches for implementing bosonic operators. Moreover, we propose a novel framework for the implementation of normal matrices, demonstrating its applicability through synthesis of diagonal matrices, as well as the development of a new algorithm for convolution through synthesis of circulant matrices using only O ( d log N + log 2 N ) 1 and 2-qubit gates for a filter of lengths d . Published by the American Physical Society 2024

Motlagh, Danial↗

DOE OSTI2020

Reducing Communication in Graph Neural Network Training

Graph Neural Networks (GNNs) are powerful and flexible neural networks that use the naturally sparse connectivity information of the data. GNNs represent this connectivity as sparse matrices, which have lower arithmetic intensity and thus higher communication costs compared to dense matrices, making GNNs harder to scale to high concurrencies than convolutional or fully-connected neural networks. Here, we introduce a family of parallel algorithms for training GNNs and show that they can asymptotically reduce communication compared to previous parallel GNN training methods. We implement these algorithms, which are based on 1D, 1. 5D, 2D, and 3D sparse-dense matrix multiplication, using torch.distributed on GPU-equipped clusters. Our algorithms optimize communication across the full GNN training pipeline. We train GNNs on over a hundred GPUs on multiple datasets, including a protein network with over a billion edges.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations

Rank-revealing matrix decompositions provide an essential tool in spectral analysis of matrices, including the Singular Value Decomposition (SVD) and related low-rank approximation techniques. QR with Column Pivoting (QRCP) is usually suitable for these purposes, but it can be much slower than the unpivoted QR algorithm. For large matrices, the difference in performance is due to increased communication between the processor and slow memory, which QRCP needs in order to choose pivots during decomposition. Our main algorithm, Randomized QR with Column Pivoting (RQRCP), uses randomized projection to make pivot decisions from a much smaller sample matrix, which we can construct to reside in a faster level of memory than the original matrix. This technique may be understood as trading vastly reduced communication for a controlled increase in uncertainty during the decision process. Furthermore, for rank-revealing purposes, the selection mechanism in RQRCP produces results that are the same quality as the standard algorithm, but with performance near that of unpivoted QR (often an order of magnitude faster for large matrices). Additionally, we also propose two formulas that facilitate further performance improvements. The first efficiently updates sample matrices to avoid computing new randomized projections. The second avoids large trailing updates during the decomposition in truncated low-rank approximations. Our truncated version of RQRCP also provides a key initial step in our truncated SVD approximation, TUXV. These advances open up a new performance domain for large matrix factorizations that will support efficient problem-solving techniques for challenging applications in science, engineering, and data analysis.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Microporous structure in silicone polymers with polylactic acid and polyethylene glycol microspheres: Synthesis and characterization

Porosity in polymer parts could improve mechanical properties while reducing weight and density. Individual pores must be small enough that bulk mechanical properties are retained but significant enough to reduce the density of the material. Filler materials can be incorporated into polymer matrices and removed to create voids. Here, this paper focuses on creating spherical pores in silicone matrices by inserting and removing core materials or fillers during post-cure. A method was developed to incorporate pore formers into an uncured polymer resin and remove the pore former materials from the matrix. Polyethylene glycol (PEG) and polylactic acid (PLA) microspheres were created and incorporated into silicone matrices as pore formers. Microspheres with controllable size distributions were formed via an emulsion formation. Microspheres are removed from the matrix by solvent extraction and calcination. Thermogravimetric Analysis (TGA), Dynamic Mechanical Analysis (DMA), and optical imaging characterize and determine the successful creation of micropores in the polymer matrices.

36 MATERIALS SCIENCE↗

DOE OSTI2023

Improved quantum algorithms for linear and nonlinear differential equations

We present substantially generalized and improved quantum algorithms over prior work for inhomogeneous linear and nonlinear ordinary differential equations (ODE). Specifically, we show how the norm of the matrix exponential characterizes the run time of quantum algorithms for linear ODEs opening the door to an application to a wider class of linear and nonlinear ODEs. In [1], a quantum algorithm for a certain class of linear ODEs is given, where the matrix involved needs to be diagonalizable. The quantum algorithm for linear ODEs presented here extends to many classes of non-diagonalizable matrices including singular matrices. The algorithm here is also exponentially faster than the bounds derived in [1] for certain classes of diagonalizable matrices. Our linear ODE algorithm is then applied to nonlinear differential equations using Carleman linearization (an approach taken recently by us in [2]). The improvement over that result is two-fold. First, we obtain an exponentially better dependence on error. This kind of logarithmic dependence on error has also been achieved by [3], but only for homogeneous nonlinear equations. Second, the present algorithm can handle any sparse matrix (that models dissipation) if it has a negative log-norm (including non-diagonalizable matrices), whereas [2] and [3] additionally require normality.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1972

Solar system applications of Mie theory and of radiative transfer of polarized light

A theory of the multiple scattering of polarized light is discussed using the doubling method of van de Hulst. The concept of the Stokes parameters is derived and used to develop the form of the scattering phase matrix of a single particle. The diffuse reflection and transmission matrices of a single scattering plane parallel atmosphere are expressed as a function of the phase matrix, and the symmetry properties of these matrices are examined. Four matrices are required to describe scattering and transmission. The scattering matrix that results from the addition of two identical layers is derived. Using the doubling method, the scattering and transmission matrices of layers of arbitrary optical thickness can be derived. The doubling equations are then rewritten in terms of their Fourier components. Computation time is reduced since each Fourier component doubles independently. Computation time is also reduced through the use of symmetry properties.

Whitehill, L. P.↗

NASA NTRS1972

Elimination on sparse symmetric systems of a special structure.

Consideration of the problem of finding a permutation of rows and columns and an algorithm for solving ordered systems of linear algebraic equations with sparse matrices having a certain regular structure. Two approaches to the solution of this problem, in which the sparsity is used to some extent, are outlined. One of them is a very general approach where optimal (or nearly optimal) ordering is sought and the algorithm for solving the ordered system treats the matrix element by element to perform only necessary operations. The other approach involves the use of band matrices. After comparing these two approaches, a third approach is then suggested which involves the use of pipe matrices, and a means of ordering the rows and columns to obtain this type of matrix is presented. Examples of matrices reordered by the proposed procedure are cited.

Segethova, J.↗

NASA NTRS1986

A combined integrating and differentiating matrix formulation for boundary value problems on rectangular domains

Integrating and differentiating matrices allow the numerical integration and differential of functions whose values are known at points of a discrete grid. Previous derivations of these matrices were restricted to one dimensional grids or to rectangular grids with uniform spacing in at least one direction. Integrating and differentiating matrices were developed for grids with nonuniform spacing in both directions. The use of these matrices as operators to reformulate boundary value problems on rectangular domains as matrix problems for a finite dimensional solution vector is considered. The method requires nonuniform grids which include near boundary points. An eigenvalue problem for the transverse vibrations of a simply supported rectangular plate is solved to illustrate the method.

Lakin, W. D.↗

NASA NTRS1986

A combined integrating- and differentiating-matrix formulation for boundary-value problems on rectangular domains

Lakin, W. D.↗

NASA NTRS1989

Compression Of Data In Imaging Radar Polarimetry

Algorithms developed to reduce number of radar polarimetric data processed to synthesize image of arbitrary combination of transmitting and receiving polarizations. Brings image-processing requirements within computing capabilities of typical users, without degrading images excessively. In scattering-matrix approach to reduction of image data, four adjacent picture elements combined into one by synthesizing new scattering matrix from scattering matrices of four elements. In phase-matrix approach, phase matrices generated from scattering matrices of four adjacent picture elements, and four phase matrices added to combine four picture elements into one.

Zebker, H. A.↗

NASA NTRS1992

Large-scale sparse singular value computations

Four numerical methods for computing the singular value decomposition (SVD) of large sparse matrices on a multiprocessor architecture are presented. Lanczos and subspace iteration-based methods for determining several of the largest singular triplets (singular values and corresponding left and right-singular vectors) for sparse matrices arising from two practical applications: information retrieval and seismic reflection tomography are emphasized. The target architectures for implementations are the CRAY-2S/4-128 and Alliant FX/80. The sparse SVD problem is well motivated by recent information-retrieval techniques in which dominant singular values and their corresponding singular vectors of large sparse term-document matrices are desired, and by nonlinear inverse problems from seismic tomography applications which require approximate pseudo-inverses of large sparse Jacobian matrices.

Berry, Michael W.↗