Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “matrix decomposition”

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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
NASA NTRS1994

A simple suboptimal least-squares algorithm for attitude determination with multiple sensors

Three-axis attitude determination is equivalent to finding a coordinate transformation matrix which transforms a set of reference vectors fixed in inertial space to a set of measurement vectors fixed in the spacecraft. The attitude determination problem can be expressed as a constrained optimization problem. The constraint is that a coordinate transformation matrix must be proper, real, and orthogonal. A transformation matrix can be thought of as optimal in the least-squares sense if it maps the measurement vectors to the reference vectors with minimal 2-norm errors and meets the above constraint. This constrained optimization problem is known as Wahba's problem. Several algorithms which solve Wahba's problem exactly have been developed and used. These algorithms, while steadily improving, are all rather complicated. Furthermore, they involve such numerically unstable or sensitive operations as matrix determinant, matrix adjoint, and Newton-Raphson iterations. This paper describes an algorithm which minimizes Wahba's loss function, but without the constraint. When the constraint is ignored, the problem can be solved by a straightforward, numerically stable least-squares algorithm such as QR decomposition. Even though the algorithm does not explicitly take the constraint into account, it still yields a nearly orthogonal matrix for most practical cases; orthogonality only becomes corrupted when the sensor measurements are very noisy, on the same order of magnitude as the attitude rotations. The algorithm can be simplified if the attitude rotations are small enough so that the approximation sin(theta) approximately equals theta holds. We then compare the computational requirements for several well-known algorithms. For the general large-angle case, the QR least-squares algorithm is competitive with all other know algorithms and faster than most. If attitude rotations are small, the least-squares algorithm can be modified to run faster, and this modified algorithm is faster than all but a similarly specialized version of the QUEST algorithm. We also introduce a novel measurement averaging technique which reduces the n-measurement case to the two measurement case for our particular application, a star tracker and earth sensor mounted on an earth-pointed geosynchronous communications satellite. Using this technique, many n-measurement problems reduce to less than or equal to 3 measurements; this reduces the amount of required calculation without significant degradation in accuracy. Finally, we present the results of some tests which compare the least-squares algorithm with the QUEST and FOAM algorithms in the two-measurement case. For our example case, all three algorithms performed with similar accuracy.

Brozenec, Thomas F.↗
DOE OSTI2022

A Micro-Mechanical Constitutive Model to Predict Hygrothermal Aging of Cross-Linked Polymers

Abstract A multi-physics material model is presented to describe the effects of temperature, oxygen, and humidity on the constitutive response of cross-linked polymers. The effect of hygrothermal damage on the mechanical integrity of the polymer matrix can be considered as the result of damage accumulation of two independent aging mechanism namely, i) thermo-oxidative, and ii) hydrolytic aging. In order to capture the mutual effects of thermo-oxidative and hydrolytic aging, an assumption has been made that each of the aging phenomenon can be superposed to each other. In fact, each of them works independently and as a result, they can compete with each other. Utilizing the theory of network decomposition, all phenomena and their correlation were modeled and thus, the strain energy function of the polymer matrix is written with respect to four independent mechanisms, i) the shrinking original matrix that has neither been attacked by water nor oxygen, ii) conversion of the first network to two new network due to the reduction and formation of cross-links, and iii) energy loss from network degradation due to attack of the water molecules to polymer active agents. Moreover, the proposed model is micro-mechanically based and is mainly relevant on thin samples due to our underlying assumption of homogeneous diffusion of oxygen and water throughout the matrix. The model has been validated against extensive data-sets obtained from experiments we specifically designed for concept validation.

Bahrololoumi, Amir↗
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 OSTI2022

First-Principles Elucidation of Initial Dehydrogenation Pathways in Mg(BH 4 ) 2

Complex borohydrides such as Mg(BH 4 ) 2 offer one of highest capacities to chemically store hydrogen for onboard applications; however, it suffers greatly from kinetic constraints that prevent realization of full capacity and reversibility. Understanding these kinetic limitations solely from experiments is extremely challenging due to the unusual complexity of various competing elemental reaction steps involved during the de/rehydrogenation reaction. This work aims to map out the energetics associated with initial dehydrogenation of Mg(BH 4 ) 2 from first-principles simulations and to identify the preferred reaction pathways. Our calculations suggest the rate-limiting step during BH 4 – –B 3 H 8 – conversion is the formation of the B 2 H 7 – intermediate. We further emphasize and clarify that the B 3 H 8 – and H – intermediates, formed during initial Mg(BH 4 ) 2 decomposition, appear as molecular species that are embedded in the Mg–BH 4 –Mg matrix as evidenced in the nuclear magnetic resonance measurements and not as bulk MgH 2 and Mg(B 3 H 8 ) 2 as previously assumed in theoretical predictions of the thermodynamics.

08 HYDROGEN↗
NASA NTRS1990

Numerical simulation of spatially-evolving instability

A computational study of the spatial stability of plane Poiseuille flow is presented. The numerical scheme employs a time-splitting method to integrate the full Navier-Stokes equations using spectral collocation/finite-difference discretization on a non-staggered mesh. The eigenvalue decomposition procedure is applied for the solution of the Poisson equations using the capacitance matrix technique. The buffer domain method is incorporated for the outflow boundary conditions. The input perturbation velocities are obtained by solving the Orr-Sommerfeld equation for the nonlinear eigenvalue problem employing the companion matrix method. Computational results are compared with the linear theory for two-dimensional disturbances.

Danabasoglu, G.↗
NASA NTRS2010

A Framework for Propagation of Uncertainties in the Kepler Data Analysis Pipeline

The Kepler space telescope is designed to detect Earth-like planets around Sun-like stars using transit photometry by simultaneously observing 100,000 stellar targets nearly continuously over a three and a half year period. The 96-megapixel focal plane consists of 42 charge-coupled devices (CCD) each containing two 1024 x 1100 pixel arrays. Cross-correlations between calibrated pixels are introduced by common calibrations performed on each CCD requiring downstream data products access to the calibrated pixel covariance matrix in order to properly estimate uncertainties. The prohibitively large covariance matrices corresponding to the ~75,000 calibrated pixels per CCD preclude calculating and storing the covariance in standard lock-step fashion. We present a novel framework used to implement standard propagation of uncertainties (POU) in the Kepler Science Operations Center (SOC) data processing pipeline. The POU framework captures the variance of the raw pixel data and the kernel of each subsequent calibration transformation allowing the full covariance matrix of any subset of calibrated pixels to be recalled on-the-fly at any step in the calibration process. Singular value decomposition (SVD) is used to compress and low-pass filter the raw uncertainty data as well as any data dependent kernels. The combination of POU framework and SVD compression provide downstream consumers of the calibrated pixel data access to the full covariance matrix of any subset of the calibrated pixels traceable to pixel level measurement uncertainties without having to store, retrieve and operate on prohibitively large covariance matrices. We describe the POU Framework and SVD compression scheme and its implementation in the Kepler SOC pipeline.

Clarke, Bruce D.↗
DOE OSTI2020

Mechanisms of Asymmetric Membrane Formation in Nonsolvent-Induced Phase Separation

We report the first simulations of nonsolvent-induced phase separation (NIPS) that predict membrane microstructures with graded asymmetric pore size distribution. In NIPS, a polymer solution film is immersed in a nonsolvent bath, enriching the film in nonsolvent, and leading to phase separation that forms a solid polymer-rich membrane matrix and polymer-poor membrane pores. We demonstrate how mass-transfer-induced spinodal decomposition, thermal fluctuations, and glass-transition dynamics implemented with mobility contrast between the polymer-rich and polymer-poor phases are essential to the formation of asymmetric membrane microstructures. Specifically, we show that the competition between the propagation of the phase-separation and glass-transition fronts determines the degree of pore-size asymmetry. In conclusion, we also explore the sensitivity of these microstructures to the initial film composition, and compare their formation in 2D and 3D.

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

Code for the manuscript "Mori-Zwanzig Modal Decomposition"

We would like to create an open source repository in LANL's github on code written in Julia, in which we implement and extend the data-driven Mori-Zwanzig method for extracting large-scale spatio-temporal structures from data, which we call MZMD. This method is an extension of Dynamic Mode Decomposition (DMD) in which Mori-Zwanzig memory kernels are included into the associated companion matrix. In the code we would like to release, we apply MZMD to a flow over a cylinder with Reynolds number 100 rather than the much larger data set used in the associated manuscript. DMD is used extensively in the fluid dynamics community mainly for extracting large scale spatio-temporal structures (patters) from flow data. This is useful for understanding the key mechanisms that generate certain complex dynamical process relevant in engineering design. In MZMD, we improve upon DMD by adding the Mori-Zwanzig memory kernels, and show this improvement is especially important in strongly nonlinear regions of the flow.

Woodward, Michael↗
DOE OSTI2024

Jacobian-based Model Diagnostics and Application to Equation Oriented Modeling of a Carbon Capture System

Equation-oriented (EO) modeling has the potential to enable the effective design and optimization of the operation of advanced energy systems. However, advanced modeling of energy systems results in a large number of variables and non-linear equations, and it can be difficult to search through these to identify the culprit(s) responsible for convergence issues. The Institute for the Design of Advanced Energy Systems Integrated Platform (IDAES-IP) contains a tool to identify poorly scaled constraints and variables by searching for rows and columns of the Jacobian matrix with small L2-norms so they can be rescaled. A further singular value decomposition can be per-formed to identify degenerate sets of equations and remaining scaling issues. This work presents an EO model of a flowsheet developed for post-combustion carbon capture using a monoethanolamine (MEA) solvent system as a case study. The IDAES diagnostics tools were successfully applied to this flowsheet to identify problems to improve model robustness and enable the optimization of process design and operating conditions of a carbon capture system.

Allan, Douglas↗
NASA NTRS1989

A knowledge-based tool for multilevel decomposition of a complex design problem

Although much work has been done in applying artificial intelligence (AI) tools and techniques to problems in different engineering disciplines, only recently has the application of these tools begun to spread to the decomposition of complex design problems. A new tool based on AI techniques has been developed to implement a decomposition scheme suitable for multilevel optimization and display of data in an N x N matrix format.

Rogers, James L.↗
NASA NTRS1998

Parallel Domain Decomposition Preconditioning for Computational Fluid Dynamics

This viewgraph presentation gives an overview of the parallel domain decomposition preconditioning for computational fluid dynamics. Details are given on some difficult fluid flow problems, stabilized spatial discretizations, and Newton's method for solving the discretized flow equations. Schur complement domain decomposition is described through basic formulation, simplifying strategies (including iterative subdomain and Schur complement solves, matrix element dropping, localized Schur complement computation, and supersparse computations), and performance evaluation.

Barth, Timothy J.↗
DOE OSTI2025

Modular-Invariant Random Matrix Theory and AdS 3 Wormholes

We develop a nonperturbative definition of RMT 2 : a generalization of random matrix theory that is compatible with the symmetries of two-dimensional conformal field theory. Given any random matrix ensemble, its 𝑛-point spectral correlations admit a prescribed modular-invariant lift to RMT 2 , which moreover reduce to the original random matrix correlators in a near-extremal limit. Central to the prescription is a presentation of random matrix theory in Mellin space, which lifts to two dimensions via the SL⁡(2,ℤ) spectral decomposition employed in previous work. As a demonstration we perform the explicit RMT 2 lift of two-point correlations of the GUE Airy model. We propose that in AdS 3 pure gravity, semiclassical amplitudes for off-shell 𝑛-boundary torus wormholes with topology Σ 0,𝑛 × 𝑆 1 are given by the RMT 2 lift of JT gravity wormhole amplitudes. For the three-boundary case, we identify a gravity calculation which matches the RMT 2 result.

conformal field theory↗
DOE OSTI2025

SymProp: Scaling Sparse Symmetric Tucker Decomposition via Symmetry Propagation

Sparse symmetric tensors are an important class of tensors, and their decompositions serve as powerful tools for revealing low-rank structures. This paper introduces SymProp, a novel approach for scaling sparse symmetric Tucker decomposition by propagating symmetry through intermediate computations. SymProp optimizes two key computational kernels: Sparse Symmetric Tensor Times Same Matrix chain (S3 TTMc) for Higher-Order Orthogonal Iteration (HOOI) and Sparse Symmetric Tensor Times Same Matrix chain Times Core (S3 TTMcTC) for Higher-Order QR Iteration (HOQRI). Our method employs a metaprogramming-based index iteration approach to efficiently handle the upper triangular parts of intermediate dense symmetric tensors. SymProp achieves up to 50.9× speedup over SPLATT and up to 360.8× over Compressed Sparse Symmetric (CSS) format on the S3 TTMc operation. Moreover, our S3 TTMc and S3 TTMcTC implementations support tensor orders four levels higher than state-of-the-art methods. Our HOQRI demonstrates superior scalability and up to a 33.6× speedup over optimized HOOI. By enabling more scalable Tucker decompositions for higher orders, decomposition ranks, and dimension sizes, SymProp opens new possibilities for analyzing complex hypergraph structures in fields such as network science, data mining, and machine learning.

Li, Zecheng [North Carolina State University]↗
DOE OSTI2024

Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation

Multiple tensor-times-matrix (Multi-TTM) is a key computation in algorithms for computing and operating with the Tucker tensor decomposition, which is frequently used in multidimensional data analysis. Here, we establish communication lower bounds that determine how much data movement is required (under mild conditions) to perform the Multi-TTM computation in parallel. The crux of the proof relies on analytically solving a constrained, nonlinear optimization problem. We also present a parallel algorithm to perform this computation that organizes the processors into a logical grid with twice as many modes as the input tensor. We show that, with correct choices of grid dimensions, the communication cost of the algorithm attains the lower bounds and is therefore communication optimal. Finally, we show that our algorithm can significantly reduce communication compared to the straightforward approach of expressing the computation as a sequence of tensor-times-matrix operations when the input and output tensors vary greatly in size.

HBL-inequalities↗
NASA NTRS1986

Multi-color incomplete Cholesky conjugate gradient methods for vector computers

In this research, we are concerned with the solution on vector computers of linear systems of equations, Ax = b, where A is a larger, sparse symmetric positive definite matrix. We solve the system using an iterative method, the incomplete Cholesky conjugate gradient method (ICCG). We apply a multi-color strategy to obtain p-color matrices for which a block-oriented ICCG method is implemented on the CYBER 205. (A p-colored matrix is a matrix which can be partitioned into a pXp block matrix where the diagonal blocks are diagonal matrices). This algorithm, which is based on a no-fill strategy, achieves O(N/p) length vector operations in both the decomposition of A and in the forward and back solves necessary at each iteration of the method. We discuss the natural ordering of the unknowns as an ordering that minimizes the number of diagonals in the matrix and define multi-color orderings in terms of disjoint sets of the unknowns. We give necessary and sufficient conditions to determine which multi-color orderings of the unknowns correpond to p-color matrices. A performance model is given which is used both to predict execution time for ICCG methods and also to compare an ICCG method to conjugate gradient without preconditioning or another ICCG method. Results are given from runs on the CYBER 205 at NASA's Langley Research Center for four model problems.

Poole, E. L.↗
NASA NTRS1988

An invariant asymptotic formula for solutions of second-order linear ODE's

An invariant-matrix technique for the approximate solution of second-order ordinary differential equations (ODEs) of form y-double-prime = phi(x)y is developed analytically and demonstrated. A set of linear transformations for the companion matrix differential system is proposed; the diagonalization procedure employed in the final stage of the asymptotic decomposition is explained; and a scalar formulation of solutions for the ODEs is obtained. Several typical ODEs are analyzed, and it is shown that the Liouville-Green or WKB approximation is a special case of the present formula, which provides an approximation which is valid for the entire interval (0, infinity).

Gingold, H.↗
NASA NTRS1991

Partitioning of unstructured problems for parallel processing

Many large-scale computational problems are based on unstructured computational domains. Primary examples are unstructured grid calculations based on finite volume methods in computational fluid dynamics, or structural analysis problems based on finite element approximations. The question of how to distribute such unstructured computational domains over a large number of processors in a MIMD machine with distributed memory is addressed. A graph theoretical framework for these problems is established. Based on this framework three decomposition algorithms are introduced. In particular a new decomposition algorithm is discussed, which is based on the computation of an eigenvector of the Laplacian matrix associated with the graph. Numerical comparisons on large-scale two- and three-dimensional problems demonstrate the superiority of the new spectral bisection algorithm.

Simon, H. D.↗
DOE OSTI2022

Status on lattice calculations of the proton spin decomposition

Abstract Lattice calculations of the proton spin components is reviewed. The lattice results of the quark spin from the axial-vector current matrix element at ∼ 0.3−0.4 is smaller than those from the constituent quark models. This is largely due to the fact that the vacuum polarization contribution from the disconnected insertion is negative. Its connection with the anomalous Ward identity is clarified and verified numerically. This resolves the contentious issue in the “proton spin crisis.” The glue spin and angular momentum are found to be large and there is notable contribution from the quark orbital angular momentum. Renormalization, mixing, and normalization of the quark and glue angular momenta are discussed. With sufficient precision, they can be compared with more precise experimental measurements when the electron-ion collider facility is available.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗