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 163 records · Page 9

Non-singlet quark helicity $\mathrm{PDF}$s of the nucleon from pseudo-distributions

The non-singlet helicity quark parton distribution functions (PDFs) of the nucleon are determined from lattice QCD, by jointly leveraging pseudo-distributions and the distillation spatial smearing paradigm. A Lorentz decomposition of appropriately isolated space-like matrix elements reveals pseudo-distributions that contain information on the leading-twist helicity PDFs, as well as an invariant amplitude that induces an additional z 2 contamination of the leading-twist signal. An analysis of the short-distance behavior of the space-like matrix elements using matching coefficients computed to next-to-leading order (NLO) exposes the desired PDF up to this additional z 2 contamination. Due to the non-conservation of the axial current, we elect to isolate the helicity PDFs normalized by the nucleon axial charge at the same scale μ 2 . The leading-twist helicity PDFs as well as several sources of systematic error, including higher-twist effects, discretization errors, and the aforementioned z 2 contaminating amplitude are jointly determined by characterizing the computed pseudo-distribution in a basis of Jacobi polynomials. The Akaike Information Criterion is exploited to effectively average over distinct model parameterizations and cuts on the pseudo-distribution. Encouraging agreement is observed with recent global analyses of each non-singlet quark helicity PDF, notably a rather small non-singlet anti-quark helicity PDF for all quark momentum fractions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Structural response reconstruction using a system-equivalent singular vector basis

Here, this paper develops a novel method for reconstructing the full-field response of structural dynamic systems using sparse measurements. The singular value decomposition is applied to a frequency response matrix relating the structural response to physical loads, base motion, or modal loads. The left singular vectors form a non-physical reduced basis that can be used for response reconstruction with far fewer sensors than existing methods. The contributions of the singular vectors to measured response are termed singular-vector loads (SVLs) and are used in a regularized Bayesian framework to generate full-field response estimates and confidence intervals. The reconstruction framework is applicable to the estimation of single data records and power spectral densities from multiple records. Reconstruction is successfully performed in configurations where the number of SVLs to identify is less than, equal to, and greater than the number of sensors used for reconstruction. In a simulation featuring a seismically excited shear structure, SVL reconstruction significantly outperforms modal FRF-based reconstruction and successfully estimates full-field responses with as few as two uniaxial accelerometers. SVL reconstruction is further verified in a simulation featuring an acoustically excited cylinder. Finally, response reconstruction and uncertainty quantification are performed on an experimental structure with three shaker inputs and 27 triaxial accelerometer outputs.

42 ENGINEERING↗

ATEQ: Adaptive toroidal equilibrium code

A radially adaptive numerical scheme is developed to solve the Grad–Shafranov equation for axisymmetric magnetohydrodynamic equilibrium. Here, a decomposition with independent solutions is employed in the radial direction, and Fourier decomposition is used in the poloidal direction. The independent solutions are then obtained using an adaptive shooting scheme together with the multi-region matching technique in the radial direction. Accordingly, the adaptive toroidal equilibrium (ATEQ) code is constructed for axisymmetric equilibrium studies. The adaptive numerical scheme in the radial direction improves considerably the accuracy of the equilibrium solution. The decomposition with independent solutions effectively reduces the matrix size in solving the magnetohydrodynamic equilibrium problem. The reduction of the matrix size is about an order of magnitude as compared with the conventional radially grid-based numerical schemes. Also, in this ATEQ numerical scheme, no matter how accuracy in the radial direction is imposed, the size of matrices basically does not change. The small matrix size scheme gives ATEQ more flexibility to address the requirement of the number of Fourier components in the poloidal direction in tough equilibrium problems. These two unique features, the adaptive shooting and small matrix size, make ATEQ useful to improve tokamak equilibrium solutions.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Randomized low-rank decompositions of nuclear three-body interactions

First-principles simulations of many-fermion systems are commonly limited by the computational requirements of processing large data objects. As a remedy, we propose the use of low-rank approximations of three-body interactions, which are the dominant such limitation in nuclear physics. We introduce a randomized decomposition technique to handle the excessively large matrix dimensions and study the sensitivity of low-rank properties to interaction details. The developed low-rank three-nucleon interactions are benchmarked in ab initio simulations of few- and many-body systems. Exploiting low-rank properties provides a promising route to extend the microscopic description of atomic nuclei to large systems where storage requirements exceed the computational capacities of the most advanced high-performance computing facilities.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Parallel pivoting combined with parallel reduction

Parallel algorithms for triangularization of large, sparse, and unsymmetric matrices are presented. The method combines the parallel reduction with a new parallel pivoting technique, control over generations of fill-ins and a check for numerical stability, all done in parallel with the work being distributed over the active processes. The parallel technique uses the compatibility relation between pivots to identify parallel pivot candidates and uses the Markowitz number of pivots to minimize fill-in. This technique is not a preordering of the sparse matrix and is applied dynamically as the decomposition proceeds.

Alaghband, Gita↗

An approach to solving large reliability models

This paper describes a unified approach to the problem of solving large realistic reliability models. The methodology integrates behavioral decomposition, state trunction, and efficient sparse matrix-based numerical methods. The use of fault trees, together with ancillary information regarding dependencies to automatically generate the underlying Markov model state space is proposed. The effectiveness of this approach is illustrated by modeling a state-of-the-art flight control system and a multiprocessor system. Nonexponential distributions for times to failure of components are assumed in the latter example. The modeling tool used for most of this analysis is HARP (the Hybrid Automated Reliability Predictor).

Boyd, Mark A.↗

Efficient eigenvalue assignment for large space structures

A novel and efficient approach for the eigenvalue assignment of large first-order time-invariant systems is developed using full-state feedback and output feedback. First, a Schur decomposition is applied to triangularize the state matrix. Second, a series of coordinate rotations (Givens rotations) are used to move the eigenvalue to be reassigned to the end of the diagonal of its Schur form. Third, the eigenvalue is moved to the desired location by a full-state feedback, without affecting the remaining eigenvalues. The second and third step can be repeated until all the assignable eigenvalues are moved to the desired locations. Given the freedom of multiple inputs, the feedback gain matrix is calculated to minimize an objective function composed of a gain matrix norm and/or a robustness index of the closed-loop system. Numerical examples are given to demonstrate the feasibility of the proposed approach.

Maghami, Peiman G.↗

General linear codes for fault-tolerant matrix operations on processor arrays

Various checksum codes have been suggested for fault-tolerant matrix computations on processor arrays. Use of these codes is limited due to potential roundoff and overflow errors. Numerical errors may also be misconstrued as errors due to physical faults in the system. In this a set of linear codes is identified which can be used for fault-tolerant matrix operations such as matrix addition, multiplication, transposition, and LU-decomposition, with minimum numerical error. Encoding schemes are given for some of the example codes which fall under the general set of codes. With the help of experiments, a rule of thumb for the selection of a particular code for a given application is derived.

Nair, V. S. S.↗

Parallel pivoting combined with parallel reduction and fill-in control

Parallel algorithms for triangularization of large, sparse, and unsymmetric matrices are presented. The method combines the parallel reduction with a new parallel pivoting technique, control over generation of fill-ins and check for numerical stability, all done in parallel with the work being distributed over the active processes. The parallel pivoting technique uses the compatibility relation between pivots to identify parallel pivot candidates and uses the Markowitz number of pivots to minimize fill-in. This technique is not a preordering of the sparse matrix and is applied dynamically as the decomposition proceeds.

Alaghband, Gita↗

Sparse Gaussian elimination with controlled fill-in on a shared memory multiprocessor

It is shown that in sparse matrices arising from electronic circuits, it is possible to do computations on many diagonal elements simultaneously. A technique for obtaining an ordered compatible set directly from the ordered incompatible table is given. The ordering is based on the Markowitz number of the pivot candidates. This technique generates a set of compatible pivots with the property of generating few fills. A novel heuristic algorithm is presented that combines the idea of an order-compatible set with a limited binary tree search to generate several sets of compatible pivots in linear time. An elimination set for reducing the matrix is generated and selected on the basis of a minimum Markowitz sum number. The parallel pivoting technique presented is a stepwise algorithm and can be applied to any submatrix of the original matrix. Thus, it is not a preordering of the sparse matrix and is applied dynamically as the decomposition proceeds. Parameters are suggested to obtain a balance between parallelism and fill-ins. Results of applying the proposed algorithms on several large application matrices using the HEP multiprocessor (Kowalik, 1985) are presented and analyzed.

Alaghband, Gita↗

Transient behavior of supersonic flow through inlets

A solution technique to compute inlet flow behavior is presented. The phenomena of inlet unstart and restart are investigated using a flux-split procedure applied to the Euler and Reduced Navier Stokes (RNS) equations. A time consistent direct sparse matrix solver in conjunction with a domain decomposition strategy is applied to compute the transient flow behavior both internal and external to the inlet. Time varying shocks and time varying recirculation regions are efficiently analyzed. The code is quite general and is suitable for the computation of flow for a wide variety of geometries and over a wide range of Mach and Reynolds numbers.

Pordal, H. S.↗

Rapid design of aerospace vehicle

This document presents in viewgraph form techniques for the optimal design of aerospace vehicles which take into account vehicle shape, aerodynamic performance, and weight minimization. Methods include multilevel optimization with linear decomposition, multi-constraint optimization, global sensitivity matrix, and calculation of sensitivity derivatives using both first and second order derivatives. The effects of including flexibility in the optimization is discussed.

Abdi, Frank↗

An Efficient and Robust Singular Value Method for Star Pattern Recognition and Attitude Determination

A new star pattern recognition method is developed using singular value decomposition of a measured unit column vector matrix in a measurement frame and the corresponding cataloged vector matrix in a reference frame. It is shown that singular values and right singular vectors are invariant with respect to coordinate transformation and robust under uncertainty. One advantage of singular value comparison is that a pairing process for individual measured and cataloged stars is not necessary, and the attitude estimation and pattern recognition process are not separated. An associated method for mission catalog design is introduced and simulation results are presented.

Juang, Jer-Nan↗

Interface instabilities in hafnium hydride entrained iron metal matrix composites

The chemical interactions in Fe–HfH 2 metal matrix composites (MMCs) are studied across multiple length scales to elucidate the decomposition of the parent phases and corresponding reaction zone physics during direct current sintering. Fe–HfH 2 composites were synthesized with increasing as-mixed hydride contents of Fe–25% HfH 2 , Fe–40% HfH 2 , Fe–55% HfH 2 , and Fe–70% HfH 2 (all in vol. %) to demonstrate the ability to achieve sintered MMCs with target hydride contents. Samples were probed across multiple length scales through a multi-modal workflow employing x-ray diffraction, scanning electron microscopy and segmentation analysis, and synchrotron techniques including hard x-ray fluorescence mapping and nanoprobe x-ray absorption near-edge structure measurements. Under the selected sintering temperature and pressure conditions, hydrogen evolution is seen to evolve through parallel paths: thermal decomposition from during the transformation of HfH 2 to HfH x<2 and through subsequent reaction with the Fe matrix leading to intermetallic phase formation. Specifically, HfFe and HfFe 2 intermetallic formation accelerates the release of hydrogen with a subsequent HfO 2 phase forming at grain boundaries. For this MMC, the consumption or loss of hydrogen can be considerable in compacts with initial hydride loading of 25%–40% HfH 2 approaching 83% hydrogen loss for the lower volume fraction composites. Increasing the volume fraction of HfH 2 to 70% enhanced the retained hydrogen content to 53% and attributed to the reduced interfacial area intrinsic to the increased HfH 2 loading in this MMC.

36 MATERIALS SCIENCE↗

Spinor representations for fields with any spin: Lorentz tensor basis for operators and covariant multipole decomposition

This paper discusses a framework to parametrize and decompose operator matrix elements for particles with higher spin (j > 1/2) using chiral representations of the Lorentz group, i.e. the (j, 0) and (0, j) representations and their parity-invariant direct sum. Unlike traditional approaches that require imposing constraints to eliminate spurious degrees of freedom, these chiral representations contain exactly the 2j + 1 components needed to describe a spin-j particle. The central objects in the construction are the t-tensors, which are generalizations of the Pauli four-vector σ μ for higher spin. For the generalized spinors of these representations, we demonstrate how the algebra of the t-tensors allows to formulate a generalization of the Dirac matrix basis for any spin. For on-shell bilinears, we show that a set consisting exclusively of covariant multipoles of order 0 ≤ m ≤ 2j forms a complete basis. We provide explicit expressions for all bilinears of the generalized Dirac matrix basis, which are valid for any spin value. As a byproduct of our derivations we present an efficient algorithm to compute the t-tensor matrix elements. The formalism presented here paves the way to use a more unified approach to analyze the non-perturbative QCD structure of hadrons and nuclei across different spin values, with clear physical interpretation of the resulting distributions as covariant multipoles.

Angular momentum of light↗

Polar decomposition for attitude determination from vector observations

This work treats the problem of weighted least squares fitting of a 3D Euclidean-coordinate transformation matrix to a set of unit vectors measured in the reference and transformed coordinates. A closed-form analytic solution to the problem is re-derived. The fact that the solution is the closest orthogonal matrix to some matrix defined on the measured vectors and their weights is clearly demonstrated. Several known algorithms for computing the analytic closed form solution are considered. An algorithm is discussed which is based on the polar decomposition of matrices into the closest unitary matrix to the decomposed matrix and a Hermitian matrix. A somewhat longer improved algorithm is suggested too. A comparison of several algorithms is carried out using simulated data as well as real data from the Upper Atmosphere Research Satellite. The comparison is based on accuracy and time consumption. It is concluded that the algorithms based on polar decomposition yield a simple although somewhat less accurate solution. The precision of the latter algorithms increase with the number of the measured vectors and with the accuracy of their measurement.

Bar-Itzhack, Itzhack Y.↗

Angular-Rate Estimation Using Star Tracker Measurements

This paper presents algorithms for estimating the angular-rate vector of satellites using quaternion measurements. Two approaches are compared, one that uses differentiated quatemion measurements to yield coarse rate measurements which are then fed into two different estimators. In the other approach the raw quatemion measurements themselves are fed directly into the two estimators. The two estimators rely on the ability to decompose the non-linear rate dependent part of the rotational dynamics equation of a rigid body into a product of an angular-rate dependent matrix and the angular-rate vector itself This decomposition, which is not unique, enables the treatment of the nonlinear spacecraft dynamics model as a linear one and, consequently, the application of a Pseudo-Linear Kalman Filter (PSELIKA). It also enables the application of a special Kalman filter which is based on the use of the solution of the State Dependent Algebraic Riccati Equation (SDARE) in order to compute the Kalman gain matrix and thus eliminates the need to propagate and update the filter covariance matrix. The replacement of the elaborate rotational dynamics by a simple first order Markov model is also examined. In this paper a special consideration is given to the problem of delayed quatemion measurements. Two solutions to this problem are suggested and tested. Real Rossi X-Ray Timing Explorer (RXTE) data is used to test these algorithms, and results of these tests are presented.

Azor, R.↗

Angular-Rate Estimation using Star Tracker Measurements

This paper presents algorithms for estimating the angular-rate vector of satellites using quaternion measurements. Two approaches are compared, one that uses differentiated quaternion measurements to yield coarse rate measurements which are then fed into two different estimators. In the other approach the raw quaternion measurements themselves are fed directly into the two estimators. The two estimators rely on the ability to decompose the non-linear rate dependent part of the rotational dynamics equation of a rigid body into a product of an angular-rate dependent matrix and the angular-rate vector itself. This decomposition, which is not unique, enables the treatment of the nonlinear spacecraft dynamics model as a linear one and, consequently, the application of a Pseudo-Linear Kalman Filter (PSELIKA). It also enables the application of a special Kalman filter which is based on the use of the solution of the State Dependent Algebraic Riccati Equation (SDARE) in order to compute the Kalman gain matrix and thus eliminates the need to propagate and update the filter covariance matrix. The replacement of the elaborate rotational dynamics by a simple first order Markov model is also examined. In this paper a special consideration is given to the problem of delayed quaternion measurements. Two solutions to this problem are suggested and tested. Real Rossi X-Ray Timing Explorer (RXTE) data is used to test these algorithms, and results of these tests are presented.

Azor, R.↗