Transfer matrices and stiffness matrices for uniform beams
Transfer matrices and stiffness matrices for uniform beams in steady state vibration
STRUCTURAL BEAM↗
SEARCH · Search NASA
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.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Numerical inversion of finite Toeplitz matrices and vector Toeplitz matrices
Numerical technique increases the efficiencies of the numerical methods involving Toeplitz matrices by reducing the number of multiplications required by an N-order Toeplitz matrix from N-cubed to N-squared multiplications. Some efficient algorithms are given.
Bareiss, E. H.↗
Fast multiplication of random dense matrices with sparse matrices
This work focuses on accelerating the multiplication of a dense random matrix with a (fixed) sparse matrix, which is frequently used in sketching algorithms.
Demmel, James↗
The asymptotic spectra of banded Toeplitz and quasi-Toeplitz matrices
Toeplitz matrices occur in many mathematical, as well as, scientific and engineering investigations. This paper considers the spectra of banded Toeplitz and quasi-Toeplitz matrices with emphasis on non-normal matrices of arbitrarily large order and relatively small bandwidth. These are the type of matrices that appear in the investigation of stability and convergence of difference approximations to partial differential equations. Quasi-Toeplitz matrices are the result of non-Dirichlet boundary conditions for the difference approximations. The eigenvalue problem for a banded Toeplitz or quasi-Toeplitz matrix of large order is, in general, analytically intractable and (for non-normal matrices) numerically unreliable. An asymptotic (matrix order approaches infinity) approach partitions the eigenvalue analysis of a quasi-Toeplitz matrix into two parts, namely the analysis for the boundary condition independent spectrum and the analysis for the boundary condition dependent spectrum. The boundary condition independent spectrum is the same as the pure Toeplitz matrix spectrum. Algorithms for computing both parts of the spectrum are presented. Examples are used to demonstrate the utility of the algorithms, to present some interesting spectra, and to point out some of the numerical difficulties encountered when conventional matrix eigenvalue routines are employed for non-normal matrices of large order. The analysis for the Toeplitz spectrum also leads to a diagonal similarity transformation that improves conventional numerical eigenvalue computations. Finally, the algorithm for the asymptotic spectrum is extended to the Toeplitz generalized eigenvalue problem which occurs, for example, in the stability of Pade type difference approximations to differential equations.
Beam, Richard M.↗
Symmetry-Based Structured Matrices for Efficient Approximately Equivariant Networks
There has been much recent interest in designing symmetry-aware neural networks (NNs) exhibiting relaxed equivariance. Such NNs aim to interpolate between being exactly equivariant and being fully flexible, affording consistent performance benefits. In a separate line of work, certain structured parameter matrices -- those with displacement structure, characterized by low displacement rank (LDR) -- have been used to design small-footprint NNs. Displacement structure enables fast function and gradient evaluation, but permits accurate approximations via compression primarily to classical convolutional neural networks (CNNs). In this work, we propose a general framework -- based on a novel construction of symmetry-based structured matrices -- to build approximately equivariant NNs with significantly reduced parameter counts. Our framework integrates the two aforementioned lines of work via the use of so-called Group Matrices (GMs), a forgotten precursor to the modern notion of regular representations of finite groups. GMs allow the design of structured matrices -- resembling LDR matrices -- which generalize the linear operations of a classical CNN from cyclic groups to general finite groups and their homogeneous spaces. We show that GMs can be employed to extend all the elementary operations of CNNs to general discrete groups. Further, the theory of structured matrices based on GMs provides a generalization of LDR theory focussed on matrices with cyclic structure, providing a tool for implementing approximate equivariance for discrete groups. We test GM-based architectures on a variety of tasks in the presence of relaxed symmetry. We report that our framework consistently performs competitively compared to approximately equivariant NNs, and other structured matrix-based compression frameworks, sometimes with a one or two orders of magnitude lower parameter count.
Samudre, Ashwin↗
Development and Characterization of Hot-Pressed Matrices for Engineered Ceramic Matrix Composites (E-CMCs)
The present research effort was undertaken to develop a new generation of SiC fiber-reinforced engineered ceramic matrix composites (E-CMCs). In contrast to traditional CMCs with a brittle SiC matrix, an E-CMC is designed to consist of a matrix engineered to possess sufficient high temperature plasticity to minimize crack propagation, relatively high fracture toughness, and self-healing capabilities to prevent oxygen ingress to the BN-coated fibers through surface-connected cracks. The present paper discusses the bend strength, isothermal oxidation, microstructures and self-healing properties of several silicide-behaved engineered matrices. Based on the oxidation tests, where it was observed that some of the matrices exhibited either catastrophic oxidation ("pesting") or spalling of the oxide scale, two engineered matrices, CrSi2/SiC/Si3N4 and CrMoSi/SiC/Si3N4, were down-selected for further investigation. Four-point bend tests were conducted on these two engineered matrices between room temperature and 1698 degrees Kelvin. Although these matrices were brittle at low temperatures, it was observed that the bend strengths and bend ductility increased at high temperatures as the silicide particles became more ductile, which was qualitatively consistent with the theoretically expected behavior that crack blunting at these particles should increase the matrix strength. Additional studies were conducted to study the effects of different additives on the self-healing properties of the engineered matrices, which helped to identify the most effective additives.
Composite Materials↗
Efficient computer algebra algorithms for polynomial matrices in control design
The theory of polynomial matrices plays a key role in the design and analysis of multi-input multi-output control and communications systems using frequency domain methods. Examples include coprime factorizations of transfer functions, cannonical realizations from matrix fraction descriptions, and the transfer function design of feedback compensators. Typically, such problems abstract in a natural way to the need to solve systems of Diophantine equations or systems of linear equations over polynomials. These and other problems involving polynomial matrices can in turn be reduced to polynomial matrix triangularization procedures, a result which is not surprising given the importance of matrix triangularization techniques in numerical linear algebra. Matrices with entries from a field and Gaussian elimination play a fundamental role in understanding the triangularization process. In the case of polynomial matrices, matrices with entries from a ring for which Gaussian elimination is not defined and triangularization is accomplished by what is quite properly called Euclidean elimination. Unfortunately, the numerical stability and sensitivity issues which accompany floating point approaches to Euclidean elimination are not very well understood. New algorithms are presented which circumvent entirely such numerical issues through the use of exact, symbolic methods in computer algebra. The use of such error-free algorithms guarantees that the results are accurate to within the precision of the model data--the best that can be hoped for. Care must be taken in the design of such algorithms due to the phenomenon of intermediate expressions swell.
Baras, J. S.↗
What is the gradient of a scalar function defined on a subspace of square matrices?
We illustrate a technique to calculate the gradient of scalar functions that are defined on any arbitrary matrix subspace. It generalizes our earlier work titled “What is the gradient of a scalar function of a symmetric matrix ?”(Indian Journal of Pure and Applied Mathematics (2022), https://doi.org/10.1007/s13226-022-00313-x), in which we considered the special case of the subspace of symmetric matrices. Extant methods to calculate the gradient in such cases have an inherent flaw which leads to spurious results that populate several publications, as well as respected textbooks and handbooks on matrix calculus. Here, we examine these sources and results in a rigorous and concrete mathematical setting of a finite-dimensional inner-product space and discover the inherent flaw and also a remedy. We demonstrate two ways to calculate the derivative/gradient and second derivative for scalar functions of matrices defined over an arbitrary matrix subspace; the first method is by considering any (differentiable) extension to the space of square matrices and projection of its gradient onto the given subspace. The second method utilizes an ordered basis and computes each component of the gradient through evaluation of the directional derivative. All the ideas presented are illustrated by non-trivial examples, namely, considering the subspace of 3 x 3 circulant and Toeplitz matrices and presenting the results of gradient-descent with both the spurious and correct gradients. Moreover, our bibliography makes it clear that a rigorous approach to matrix calculus is not common in practice, and our presentation of matrix calculus in the language of inner-product spaces will be significant and meaningful for applied mathematicians, engineers and researchers working in inter-disciplinary fields to avoid the conceptual pitfalls that exist.
97 MATHEMATICS AND COMPUTING↗
An Evaluation of Actinide Reactivity with CO 2 , O 2 , and O 2 /He Gases using Inductively Coupled Plasma Tandem Mass Spectrometry: Application to Simultaneous Measurement of 241 Am/ 241 Pu Ratios in Unseparated Complex Matrices
Accurate actinide measurements are critical within the field of nuclear science. Traditional methods for actinide quantification require time-consuming sample processing prior to analysis. There is a need for rapid analytical techniques that still maintain a high degree of accuracy. In this work, actinide reactivity was assessed for multiple oxygen-containing reaction gases using quadrupole inductively coupled plasma tandem mass spectrometry (Q-ICP-MS/MS) to evaluate actinide analysis in complex sample matrices without analyte-matrix separation. A novel method was developed to measure 241 Am/ 241 Pu in complex sample matrices using O 2 /He reaction gas with no matrix removal or analyte pre-concentration. This inline method reduces matrix-derived polyatomic interferences that complicate traditional ICP-MS analyses by mass-shifting to 241 Am 16 O + and 241 Pu 16 O 2 + , allowing Am and Pu to be mass separated for simultaneous analysis. While mass shifting is efficient, a small portion of Am + (<1.3%) and Pu + (<1.4%) react to from AmO 2 + and PuO + , respectively. Therefore, a mass balance approach was used, in combination with reactivity determined from 242 Pu and 243 Am standard solutions, to correct for residual 241 PuO + and 241 AmO 2 + . The method was validated by measuring 241 Am/ 241 Pu in Pu isotope standards CRM-136 and CRM-137 (separated in March/April 1970 and February 2022, respectively) in both neat solutions and complex matrices containing diluted soil (NIST SRM 2711a, >1000 µg·g -1 ). Method detection limits of 15.9 and 9.6 fg·g -1 were determined for 241 Am and 241 Pu, respectively, and 241 Am/ 241 Pu ratios were measured with accuracies within <3.5%. In conclusion, this work presents the first direct analysis of 241 Am/ 241 Pu in unseparated complex matrices, advancing capabilities for rapid actinide measurements.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Determining the Ensemble N -Representability of Reduced Density Matrices
The N-representability problem for reduced density matrices remains a fundamental challenge in electronic structure theory. Following our previous work that employs a unitary-evolution algorithm based on an adaptive derivative-assembled pseudo-Trotter variational quantum algorithm to probe pure-state N-representability of reduced density matrices [J. Chem. Theory Comput. 2024, 20, 9968], in this work we propose a practical framework for determining the ensemble N-representability of a p-body matrix. This is accomplished using a purification strategy that embeds an ensemble state into a pure state defined on an extended Hilbert space, such that the reduced density matrices of the purified state reproduce those of the original ensemble. By iteratively applying variational unitaries to an initial purified state, the proposed algorithm minimizes the Hilbert-Schmidt distance between its p-body reduced density matrix and a specified target p-body matrix, which serves as a measure of the N-representability of the target. This methodology facilitates both error correction of defective ensemble reduced density matrices and quantum-state reconstruction on a quantum computer, offering a route for density-matrix refinement. We validate the algorithm with numerical simulations on systems of two, three, and four electrons in both simple models as well as molecular systems at finite temperature, demonstrating its robustness.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Esterification of 3-quinuclidinol, a marker for the incapacitant BZ, for analysis by EI-GC-MS in OPCW test matrices
The analysis by EI-GC-MS of 3-quinuclidinol (3Q), a marker for the riot control and incapacitating agent quinuclinidyl benzilate (BZ), using several, new acylation strategies is described. After evaluating and optimizing conditions for the acylations, these were tested on their ability to successfully derivatize 3Q in three different matrices featured in the 44th Organisation for the Prohibition of Chemical Weapons (OPCW) proficiency test (PT). As 3Q is a highly polar compound, the work here describes acylation strategies that generate 3Q analogs with superior gas chromatographic profiles relative to the underivatized material. The acyl groups studied in this work included acetyl, benzoyl, pentafluorobenzoyl and the bis(3,5-trifluoromethyl)benzoyl. The acylated 3Q products provide sharp, detectable peaks with significantly different retention times from that of the unmodified 3Q. Thus, the retention times for acetyl-, benzoyl-, pentafluorobenzoyl- and 3,5-bis(trifluoromethyl)benzoyl-3Q were determined to be 15.9, 24.9, 22.8 and 22.1 min respectively, in stark contrast to the unmodified 3Q which provides a sharp peak with a retention time centered at ~ 13.5 min only at high concentrations (> 10 µg/mL or µg/g) while a broad peak (RT ~ 15–15.5 min) at low concentrations (< 5 µg/mL or µg/g). The developed protocol was used to derivatize 3Q in three separate matrices. The first two matrices were liquid samples featured during the 44th OPCW PT at two separate concentrations in each (5 and 50 µg/mL). The last matrix was a soil sample featured in the same 44th OPCW PT wherein the 3Q had been spiked at a 12 µg/g concentration. The approach involves the extraction of 3Q from all matrices followed by its acylation resulting in a second reportable analytical method for an OPCW PT. The presented derivatization strategies should find wide applicability particularly in laboratories involved with the analysis of this chemical weapon agent degradation product and those participating in the yearly OPCW PTs.
3-quinuclidinol↗
Improved Evaluation of Large Network Matrices for Linear Power Flow Within Optimization Problems
This work presents methods for evaluating the Power Transfer Distribution Factor (PTDF) and Line Outage Distribution Factor (LODF) matrices by employing sparse linear algebra for large-scale computing applications. These matrices play a critical role in many power system applications, such as the Unit Commitment Problem (UC), pre- and post-contingency power flow analysis, and transmission expansion. These matrices are typically dense, which means they require a significant amount of time and memory to be computed for large networks. However, by analyzing the structure of the matrices and their computation method, it is possible to use reduced memory methods based on sparse matrix operations. This paper shows that sparse linear algebra algorithms are faster and require less memory and time than traditional dense approaches. Additionally, we explore the effect of matrix sparsification by eliminating trailing digits on power flow calculations.
large scale↗
What is the gradient of a scalar function defined on a subspace of square matrices?
We illustrate a technique to calculate the gradient of scalar functions that are defined on any arbitrary matrix subspace. It generalizes our earlier work titled “What is the gradient of a scalar function of a symmetric matrix ?”(Indian Journal of Pure and Applied Mathematics (2022), doi:10.1007/s13226-022-00313-x), in which we considered the special case of the subspace of symmetric matrices. Extant methods to calculate the gradient in such cases have an inherent flaw which leads to spurious results that populate several publications, as well as respected textbooks and handbooks on matrix calculus. We examine these sources and results in a rigorous and concrete mathematical setting of a finite-dimensional inner-product space and discover the inherent flaw and also a remedy. We demonstrate two ways to calculate the derivative/gradient and second derivative for scalar functions of matrices defined over an arbitrary matrix subspace; the first method is by considering any (differentiable) extension to the space of square matrices and projection of its gradient onto the given subspace. The second method utilizes an ordered basis and computes each component of the gradient through evaluation of the directional derivative. All the ideas presented are illustrated by non-trivial examples, namely, considering the subspace of 3 × 3 circulant and Toeplitz matrices and presenting the results of gradient-descent with both the spurious and correct gradients. Moreover, our bibliography makes it clear that a rigorous approach to matrix calculus is not common in practice, and our presentation of matrix calculus in the language of inner-product spaces will be significant and meaningful for applied mathematicians, engineers and researchers working in inter-disciplinary fields to avoid the conceptual pitfalls that exist.
97 MATHEMATICS AND COMPUTING↗
Commutative semigroups of real and complex matrices
The computation of divergence is studied. Covariance matrices to be analyzed admit a common diagonalization, or even triangulation. Sufficient conditions are given for such phenomena to take place, the arguments cover both real and complex matrices, and are not restricted to Hermotian or other special forms. Specifically, it is shown to be sufficient that the matrices in question commute in order to admit a common triangulation. Several results hold in the case that the matrices in question form a closed and bounded set, rather than only in the finite case.
Brown, D. R.↗
An automated procedure for calculating system matrices from perturbation data generated by an EAI Pacer and 100 hybrid computer system
Techniques are presented for determining the elements of the A, B, C, and D state variable matrices for systems simulated on an EAI Pacer 100 hybrid computer. An automated procedure systematically generates disturbance data necessary to linearize the simulation model and stores these data on a floppy disk. A separate digital program verifies this data, calculates the elements of the system matrices, and prints these matrices appropriately labeled. The partial derivatives forming the elements of the state variable matrices are approximated by finite difference calculations.
Milner, E. J.↗
Higher dimensional Hadamard matrices
The paper defines higher dimensional Hadamard matrices and enumerates on some of the simplest three-, four-, and five-dimensional cases and procedures for generating them. Special emphasis is given to proper matrices that have a dimensional hierarchy of orthogonalities. It is determined that this property lends itself primarily to the application of higher dimensional Hadamard matrices to error-correcting codes. A list of derived statements for n-dimensional Hadamard matrices are given, as well as a definition of Hadamard matrix families, such as minimal, Petrie polygon, antipodal (n-2)-dimensional sections, and double proximity shells.
Schlichta, P. J.↗
Numerical computation of exponential matrices using the Cayley-Hamilton theorem
A method for computing exponential matrices, which often arise naturally in the solution of systems of linear differential equations, is developed. An exponential matrix is generated as a linear combination of a finite number (equal to the matrix order) of matrices, the coefficients of which are scalar infinite sums. The method can be generalized to apply to any formal power series of matrices. Attention is focused upon the exponential function, and the matrix exponent is assumed tri-diagonal in form. In such cases, the terms in the coefficient infinite sums can be extracted, as recursion relations, from the characteristic polynomial of the matrix exponent. Two numerical examples are presented in some detail: (1) the three dimensional infinitesimal rotation rate matrix, which is skew symmetric, and (2) an N-dimensional tri-diagonal and symmetric finite difference matrix which arises in the numerical solution of the heat conduction partial differential equation. In the second example, the known eigenvalues and eigenvectors of the finite difference matrix permit an analytical solution for the exponential matrix, through the theory of diagonalization and similarity transformations, which is used for independent verification. The convergence properties of the scalar infinite summations are investigated for finite difference matrices of various orders up to ten, and it is found that the number of terms required for convergence increases slowly with the order of the matrix.
Walden, H.↗