Engineering Papers⌕ Search

SEARCH · Engineering Papers

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

At least 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1997

Two Improved Algorithms for Envelope and Wavefront Reduction

Two algorithms for reordering sparse, symmetric matrices or undirected graphs to reduce envelope and wavefront are considered. The first is a combinatorial algorithm introduced by Sloan and further developed by Duff, Reid, and Scott; we describe enhancements to the Sloan algorithm that improve its quality and reduce its run time. Our test problems fall into two classes with differing asymptotic behavior of their envelope parameters as a function of the weights in the Sloan algorithm. We describe an efficient 0(nlogn + m) time implementation of the Sloan algorithm, where n is the number of rows (vertices), and m is the number of nonzeros (edges). On a collection of test problems, the improved Sloan algorithm required, on the average, only twice the time required by the simpler Reverse Cuthill-Mckee algorithm while improving the mean square wavefront by a factor of three. The second algorithm is a hybrid that combines a spectral algorithm for envelope and wavefront reduction with a refinement step that uses a modified Sloan algorithm. The hybrid algorithm reduces the envelope size and mean square wavefront obtained from the Sloan algorithm at the cost of greater running times. We illustrate how these reductions translate into tangible benefits for frontal Cholesky factorization and incomplete factorization preconditioning.

Kumfert, Gary↗
DOE OSTI2023

Tangent functional connectomes uncover more unique phenotypic traits

Functional connectomes (FCs) containing pairwise estimations of functional couplings between pairs of brain regions are commonly represented by correlation matrices. As symmetric positive definite matrices, FCs can be transformed via tangent space projections, resulting into tangent-FCs. Tangent-FCs have led to more accurate models predicting brain conditions or aging. Motivated by the fact that tangent-FCs seem to be better biomarkers than FCs, we hypothesized that tangent-FCs have also a higher fingerprint. We explored the effects of six factors: fMRI condition, scan length, parcellation granularity, reference matrix, main-diagonal regularization, and distance metric. Our results showed that identification rates are systematically higher when using tangent-FCs across the “fingerprint gradient” (here including test-retest, monozygotic and dizygotic twins). Highest identification rates were achieved when minimally (0.01) regularizing FCs while performing tangent space projection using Riemann reference matrix and using correlation distance to compare the resulting tangent-FCs. Such configuration was validated in a second dataset (resting-state).

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1992

Algorithms For Compression Of Polarimetric-Radar Image Data

Two sets of algorithms provide moderate improvements in compression and decompression of scattering-matrix data from polarimetric imaging radar system. Algorithms operate on original single-look scattering matrices, do not symmetrize scattering matrices and, preserve asymmetrical data on background-noise and equipment effects.

Van Zyl, Jakob J.↗
NASA NTRS1991

Diffraction image formation in optical systems with polarization aberrations. II - Amplitude response matrices for rotationally symmetric systems

In the previous paper in this series (McGuire and Chipman, 1990), a formulation was established for the calculation and analysis of diffraction image quality in polarizing optical systems illuminated with partially polarized, partially coherent light. In the present paper, the effect of second- and fourth-order polarization aberrations on the image plane diffraction patterns are examined. The amplitude response matrix is calculated for optical systems with small numerical apertures. Numerical results are presented for optical systems with circular apertures for three of the aberration types.

Mcguire, James P., Jr.↗
NASA NTRS1975

Diagonalization and simultaneous symmetrization of the gas-dynamic matrices

The hyperbolic nature of the unsteady, inviscid, gas-dynamic equations implies the existence of a similarity transformation for diagonalizing an arbitrary linear combination of coefficient matrices. It is shown that the individual matrices are simultaneously symmetrized by the similarity transformation. The transformations and their norms can be applied to the well-posedness of the Cauchy problem, linear stability theory for finite-difference approximations, and simplification of block-tridiagonal systems that arise in implicit time-split algorithms.

Warming, R. F.↗
NASA NTRS1993

Efficient, massively parallel eigenvalue computation

In numerical simulations of disordered electronic systems, one of the most common approaches is to diagonalize random Hamiltonian matrices and to study the eigenvalues and eigenfunctions of a single electron in the presence of a random potential. An effort to implement a matrix diagonalization routine for real symmetric dense matrices on massively parallel SIMD computers, the Maspar MP-1 and MP-2 systems, is described. Results of numerical tests and timings are also presented.

Huo, Yan↗
DOE OSTI2024

Solving the homogeneous Bethe-Salpeter equation with a quantum annealer

The homogeneous Bethe-Salpeter equation (hBSE), describing a bound system in a genuinely relativistic quantum-field theory framework, was solved for the first time by using a D-Wave quantum annealer. After applying standard techniques of discretization, the hBSE, in ladder approximation, can be formally transformed in a generalized eigenvalue problem (GEVP), with two square matrices: one symmetric and the other nonsymmetric. The latter matrix poses the challenge of obtaining a suitable formal approach for investigating the GEVP by means of a quantum annealer, i.e., to recast it as a quadratic unconstrained binary optimization problem. A broad numerical analysis of the proposed algorithms, applied to matrices of dimension up to 64, was carried out by using both the simulated-annealing package and the D-Wave . The numerical results very nicely compare with those obtained with standard classical algorithms, and also show interesting scalability features. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

A High-Throughput Solver for Marginalized Graph Kernels on GPU

Here, we present the design and optimization of a solver for efficient and high-throughput computation of the marginalized graph kernel on General Purpose GPUs. The graph kernel is computed using the conjugate gradient method to solve a generalized Laplacian of the tensor product between a pair of graphs. To cope with the large gap between the instruction throughput and the memory bandwidth of the GPUs, our solver forms the graph tensor product on-the-fly without storing it in memory. This is achieved by using threads in a warp cooperatively to stream the adjacency and edge label matrices of individual graphs by small square matrix blocks called tiles, which are then staged in registers and the shared memory for later reuse. Warps across a thread block can further share tiles via the shared memory to increase data reuse. We exploit the sparsity of the graphs hierarchically by storing only non-empty tiles using a coordinate format and nonzero elements within each tile using bitmaps. We propose a new partition-based reordering algorithm for aggregating nonzero elements of the graphs into fewer but denser tiles to further exploit sparsity. We carry out extensive theoretical analyses on the graph tensor product primitives for tiles of various density and evaluate their performance on synthetic and real-world datasets. Our solver delivers three to four orders of magnitude speedup over existing CPU-based solvers such as GraKeL and GraphKernels. The capability of the solver enables kernel-based learning tasks at unprecedented scales.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Two transitions in complex eigenvalue statistics: Hermiticity and integrability breaking

Open quantum systems have complex energy eigenvalues which are expected to follow non-Hermitian random matrix statistics, when chaotic, or two-dimensional (2d) Poisson statistics, when integrable. We investigate the spectral properties of a many-body quantum spin chain, i.e., the Hermitian Heisenberg model with imaginary disorder. Its rich complex eigenvalue statistics is found to separately break both Hermiticity and integrability at different scales of the disorder strength. With no disorder, the system is integrable and Hermitian, with spectral statistics corresponding to the 1d Poisson point process. At very small disorder, we find a transition from 1d Poisson statistics to an effective D -dimensional Poisson point process, showing Hermiticity breaking. At intermediate disorder, we find integrability breaking, as inferred from the statistics matching that of non-Hermitian complex symmetric random matrices in class AI † . For large disorder, as the spins align, we recover the expected integrability (now in the non-Hermitian setup), indicated by 2d Poisson statistics. These conclusions are based on fitting the spin-chain data of numerically generated nearest- and next-to-nearest-neighbor spacing distributions to an effective 2d Coulomb gas description at inverse temperature β . We confirm that such an effective description of random matrices also applies in classes AI † and AII † up to next-to-nearest-neighbor spacings. Published by the American Physical Society 2025

Akemann, Gernot (ORCID:0000000217104258)↗
DOE OSTI2023

Parallel Memory-Independent Communication Bounds for SYRK

In this paper, we focus on the parallel communication cost of multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK). SYRK requires half the computation of general matrix multiplication because of the symmetry of the output matrix. Recent work (Beaumont et al., SPAA '22) has demonstrated that the sequential I/O complexity of SYRK is also a constant factor smaller than that of general matrix multiplication. Inspired by this progress, we establish memory-independent parallel communication lower bounds for SYRK with smaller constants than general matrix multiplication, and we show that these constants are tight by presenting communication-optimal algorithms. The crux of the lower bound proof relies on extending a key geometric inequality to symmetric computations and analytically solving a constrained nonlinear optimization problem. Here, the optimal algorithms use a triangular blocking scheme for parallel distribution of the symmetric output matrix and corresponding computation.

Communication costs↗
NASA NTRS1976

Symmetric stiffness matrix for incompressible hyperelastic materials

Symmetric structure matrices are derived for solving plane strain and axisymmetric problems involving incompressible hyperelastic materials. An infinite hollow cylinder subjected to internal pressure is considered as an example. Displacement and hydrostatic pressure profiles are calculated using the Newton-Raphson iteration technique. The results are in good agreement with the exact curves.

Takamatsu, T.↗
NASA NTRS1984

Finite Element Prediction of Acoustic Scattering and Radiation from Submerged Elastic Structures

A finite element formulation is derived for the scattering and radiation of acoustic waves from submerged elastic structures. The formulation uses as fundamental unknowns the displacement in the structure and a velocity potential in the field. Symmetric coefficient matrices result. The outer boundary of the fluid region is terminated with an approximate local wave-absorbing boundary condition which assumes that outgoing waves are locally planar. The finite element model is capable of predicting only the near-field acoustic pressures. Far-field sound pressure levels may be determined by integrating the surface pressures and velocities over the wet boundary of the structure using the Helmholtz integral. Comparison of finite element results with analytic results show excellent agreement. The coupled fluid-structure problem may be solved with general purpose finite element codes by using an analogy between the equations of elasticity and the wave equation of linear acoustics.

Everstine, G. C.↗
NASA NTRS1992

Design of dissipative low-authority controllers using an eigensystem assignment technique

A novel method for the design of dissipative, low-authority controllers has been developed. The method uses a sequential approach along with eigensystem assignment to compute rate and position gain matrices that assign a number of closed-loop poles of the system to desired locations. Because the feedback gain matrices are symmetric and nonnegative definite, the closed-loop stability is always guaranteed regardless of the model order or parameter inaccuracies. The resulting (nominal) closed-loop system can have specified damping ratios for m modes, which makes the plant amenable to high-authority controller design, using methods such as LQG/LTR or H-infinity. A numerical example is worked out for a flexible structure in order to demonstrate the proposed technique.

Maghami, P. G.↗
NASA NTRS1992

Applications of multiple-constraint matrix updates to the optimal control of large structures

Low-authority control or vibration suppression in large, flexible space structures can be formulated as a linear feedback control problem requiring computation of displacement and velocity feedback gain matrices. To ensure stability in the uncontrolled modes, these gain matrices must be symmetric and positive definite. In this paper, efficient computation of symmetric, positive-definite feedback gain matrices is accomplished through the use of multiple-constraint matrix update techniques originally developed for structural identification applications. Two systems were used to illustrate the application: a simple spring-mass system and a planar truss. From these demonstrations, use of this multiple-constraint technique is seen to provide a straightforward approach for computing the low-authority gains.

Smith, S. W.↗
NASA NTRS1990

A Shifted Block Lanczos Algorithm 1: The Block Recurrence

In this paper we describe a block Lanczos algorithm that is used as the key building block of a software package for the extraction of eigenvalues and eigenvectors of large sparse symmetric generalized eigenproblems. The software package comprises: a version of the block Lanczos algorithm specialized for spectrally transformed eigenproblems; an adaptive strategy for choosing shifts, and efficient codes for factoring large sparse symmetric indefinite matrices. This paper describes the algorithmic details of our block Lanczos recurrence. This uses a novel combination of block generalizations of several features that have only been investigated independently in the past. In particular new forms of partial reorthogonalization, selective reorthogonalization and local reorthogonalization are used, as is a new algorithm for obtaining the M-orthogonal factorization of a matrix. The heuristic shifting strategy, the integration with sparse linear equation solvers and numerical experience with the code are described in a companion paper.

Grimes, Roger G.↗
NASA NTRS2012

A New and General Formulation of the Parametric HFGMC Micromechanical Method for Three-Dimensional Multi-Phase Composites

The recent two-dimensional (2-D) parametric formulation of the high fidelity generalized method of cells (HFGMC) reported by the authors is generalized for the micromechanical analysis of three-dimensional (3-D) multiphase composites with periodic microstructure. Arbitrary hexahedral subcell geometry is developed to discretize a triply periodic repeating unit-cell (RUC). Linear parametric-geometric mapping is employed to transform the arbitrary hexahedral subcell shapes from the physical space to an auxiliary orthogonal shape, where a complete quadratic displacement expansion is performed. Previously in the 2-D case, additional three equations are needed in the form of average moments of equilibrium as a result of the inclusion of the bilinear terms. However, the present 3-D parametric HFGMC formulation eliminates the need for such additional equations. This is achieved by expressing the coefficients of the full quadratic polynomial expansion of the subcell in terms of the side or face average-displacement vectors. The 2-D parametric and orthogonal HFGMC are special cases of the present 3-D formulation. The continuity of displacements and tractions, as well as the equilibrium equations, are imposed in the average (integral) sense as in the original HFGMC formulation. Each of the six sides (faces) of a subcell has an independent average displacement micro-variable vector which forms an energy-conjugate pair with the transformed average-traction vector. This allows generating symmetric stiffness matrices along with internal resisting vectors for the subcells which enhances the computational efficiency. The established new parametric 3-D HFGMC equations are formulated and solution implementations are addressed. Several applications for triply periodic 3-D composites are presented to demonstrate the general capability and varsity of the present parametric HFGMC method for refined micromechanical analysis by generating the spatial distributions of local stress fields. These applications include triply periodic composites with inclusions in the form of a cavity, spherical inclusion, ellipsoidal inclusion, discontinuous aligned short fiber. A 3-D repeating unit-cell for foam material composite is simulated.

Haj-Ali, Rami↗
NASA NTRS1989

Communication requirements of sparse Cholesky factorization with nested dissection ordering

Load distribution schemes for minimizing the communication requirements of the Cholesky factorization of dense and sparse, symmetric, positive definite matrices on multiprocessor systems are presented. The total data traffic in factoring an n x n sparse symmetric positive definite matrix representing an n-vertex regular two-dimensional grid graph using n exp alpha, alpha not greater than 1, processors are shown to be O(n exp 1 + alpha/2). It is O(n), when n exp alpha, alpha not smaller than 1, processors are used. Under the conditions of uniform load distribution, these results are shown to be asymptotically optimal.

Naik, Vijay K.↗
NASA NTRS1988

Data traffic reduction schemes for sparse Cholesky factorizations

Load distribution schemes are presented which minimize the total data traffic in the Cholesky factorization of dense and sparse, symmetric, positive definite matrices on multiprocessor systems with local and shared memory. The total data traffic in factoring an n x n sparse, symmetric, positive definite matrix representing an n-vertex regular 2-D grid graph using n (sup alpha), alpha is equal to or less than 1, processors are shown to be O(n(sup 1 + alpha/2)). It is O(n(sup 3/2)), when n (sup alpha), alpha is equal to or greater than 1, processors are used. Under the conditions of uniform load distribution, these results are shown to be asymptotically optimal. The schemes allow efficient use of up to O(n) processors before the total data traffic reaches the maximum value of O(n(sup 3/2)). The partitioning employed within the scheme, allows a better utilization of the data accessed from shared memory than those of previously published methods.

Naik, Vijay K.↗