Search NASA⌕ Search

SEARCH · Search NASA

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 127 records · Page 7

Noise suppression for dual-energy CT via penalized weighted least-square optimization with similarity-based regularization

Purpose: Dual-energy CT (DECT) expands applications of CT imaging in its capability to decompose CT images into material images. However, decomposition via direct matrix inversion leads to large noise amplification and limits quantitative use of DECT. Their group has previously developed a noise suppression algorithm via penalized weighted least-square optimization with edge-preservation regularization (PWLS-EPR). In this paper, the authors improve method performance using the same framework of penalized weighted least-square optimization but with similarity-based regularization (PWLS-SBR), which substantially enhances the quality of decomposed images by retaining a more uniform noise power spectrum (NPS). Methods: The design of PWLS-SBR is based on the fact that averaging pixels of similar materials gives a low-noise image. For each pixel, the authors calculate the similarity to other pixels in its neighborhood by comparing CT values. Using an empirical Gaussian model, the authors assign high/low similarity value to one neighboring pixel if its CT value is close/far to the CT value of the pixel of interest. These similarity values are organized in matrix form, such that multiplication of the similarity matrix to the image vector reduces image noise. The similarity matrices are calculated on both high- and low-energy CT images and averaged. In PWLS-SBR, the authors include a regularization term to minimize the L-2 norm of the difference between the images without and with noise suppression via similarity matrix multiplication. By using all pixel information of the initial CT images rather than just those lying on or near edges, PWLS-SBR is superior to the previously developed PWLS-EPR, as supported by comparison studies on phantoms and a head-and-neck patient. Results: On the line-pair slice of the Catphan{sup ©}600 phantom, PWLS-SBR outperforms PWLS-EPR and retains spatial resolution of 8 lp/cm, comparable to the original CT images, even at 90% reduction in noise standard deviation (STD). Similar performance on spatial resolution is observed on an anthropomorphic head phantom. In addition, results of PWLS-SBR show substantially improved image quality due to preservation of image NPS. On the Catphan{sup ©}600 phantom, NPS using PWLS-SBR has a correlation of 93% with that via direct matrix inversion, while the correlation drops to −52% for PWLS-EPR. Electron density measurement studies indicate high accuracy of PWLS-SBR. On seven different materials, the measured electron densities calculated from the decomposed material images using PWLS-SBR have a root-mean-square error (RMSE) of 1.20%, while the results of PWLS-EPR have a RMSE of 2.21%. In the study on a head-and-neck patient, PWLS-SBR is shown to reduce noise STD by a factor of 3 on material images with image qualities comparable to CT images, whereas fine structures are lost in the PWLS-EPR result. Additionally, PWLS-SBR better preserves low contrast on the tissue image. Conclusions: The authors propose improvements to the regularization term of an optimization framework which performs iterative image-domain decomposition for DECT with noise suppression. The regularization term avoids calculation of image gradient and is based on pixel similarity. The proposed method not only achieves a high decomposition accuracy, but also improves over the previous algorithm on NPS as well as spatial resolution.

60 APPLIED LIFE SCIENCES↗

Final Report - Summer Visit 2010

During my visit to LLNL during the summer of 2010, I worked on algebraic multilevel solvers for large sparse systems of linear equations arising from discretizations of partial differential equations. The particular solver of interest is based on ILU decomposition. The setup phase for this AMG solve is just the single ILU decomposition, and its corresponding error matrix. Because the ILU uses a minimum degree or similar sparse matrix ordering, most of the fill-in, and hence most of the error, is concentrated in the lower right corner of the factored matrix. All of the major multigrid components - the smoother, the coarse level correction matrices, and the fine-to-coarse and coarse-to-fine rectangular transfer matrices, are defined in terms of various blocks of the ILU factorization. Although such a strategy is not likely to be optimal in terms of convergence properties, it has a relatively low setup cost, and therefore is useful in situations where setup costs for more traditional AMG approaches cannot be amortized over the solution of many linear systems using the same matrix. Such a situation arises in adaptive methods, where often just one linear system is solved at each step of an adaptive feedback loop, or in solving nonlinear equations by approximate Newton methods, where the approximate Jacobian might change substantially from iteration to iteration. In general terms, coarse levels are defined in terms of successively smaller lower right blocks of the matrix, typically decreasing geometrically in order. The most difficult issue was the coarse grid correction matrix. The preconditioner/smoother for a given level is just the corresponding lower right blocks of the ILU factorization. The coarse level matrix itself is just the Schur complement; this matrix is not known exactly using just the ILU decomposition in the setup phase. Thus we approximate this matrix using various combinations of the preconditioning matrix and the error matrix. During my visit, several approximations of this type were implemented and tested. While some improved the convergence rate of the overall method, these gains had to be balanced against the additional costs involved in creating and applying these matrices. By this more stringent criterion, none of the improved approximations could be characterized as an unqualified success.

97 MATHEMATICS AND COMPUTING↗

Effects of laser irradiation on the self-assembly of MnAs nanoparticles in a GaAs matrix

We investigate the effects of laser irradiation on the self-assembly of MnAs nanoparticles during solid-phase decomposition in a GaAs matrix. It is found that laser irradiation suppresses the growth of MnAs nanoparticles from small to large size, and that the median diameter D{sub 1} in the size distribution of small MnAs nanoparticles depends on the incident photon energy E following D{sub 1} {approx} E{sup -1/5}. We explain this behavior by the desorption of Mn atoms on the MnAs nanoparticle surface due to resonant optical absorption, in which incident photons excite intersubband electronic transitions between the quantized energy levels in the MnAs nanoparticles.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

GSoFa: Scalable Sparse Symbolic LU Factorization on GPUs

Decomposing a matrix $\mathbf {A}$ into a lower matrix $\mathbf {L}$ and an upper matrix $\mathbf {U}$, which is also known as LU decomposition, is an essential operation in numerical linear algebra. For a sparse matrix, LU decomposition often introduces more nonzero entries in the $\mathbf {L}$ and $\mathbf {U}$ factors than in the original matrix. A symbolic factorization step is needed to identify the nonzero structures of $\mathbf {L}$ and $\mathbf {U}$ matrices. Attracted by the enormous potentials of the Graphics Processing Units (GPUs), an array of efforts have surged to deploy various LU factorization steps except for the symbolic factorization, to the best of our knowledge, on GPUs. This article introduces gSoFa, the first GPU-based symbolic factorization design with the following three optimizations to enable scalable LU symbolic factorization for nonsymmetric pattern sparse matrices on GPUs. First, here we introduce a novel fine-grained parallel symbolic factorization algorithm that is well suited for the Single Instruction Multiple Thread (SIMT) architecture of GPUs. Second, we tailor supernode detection into a SIMT friendly process and strive to balance the workload, minimize the communication and saturate the GPU computing resources during supernode detection. Third, we introduce a three-pronged optimization to reduce the excessive space consumption problem faced by multi-source concurrent symbolic factorization. Taken together, gSoFa achieves up to 31× speedup from 1 to 44 Summit nodes (6 to 264 GPUs) and outperforms the state-of-the-art CPU project, on average, by 5×. Notably, gSoFa also achieves up to 47 percent of the peak memory throughput of a V100 GPU in the Summit Supercomputer.

97 MATHEMATICS AND COMPUTING↗

Eigensolver performance comparison on Cray XC systems

Summary Hermitian (symmetric) eigenvalue solvers are the core constituents of electronic structure, quantum‐chemistry, and other HPC applications such as Quantum ESPRESSO, VASP, CP2K, and NWChem to name a few. Our understanding of the performance of symmetric eigenvalue algorithms on various hardware is clearly important to the quantum chemistry or condensed matter physics community but in fact goes beyond that community. For instance, big data analytics is increasingly utilizing eigenvalues solvers, in the study of randomized singular value decomposition (SVD) or principal component analysis (PCA). Noise, vibration, and harshness (NVH) is another field where fast and efficient eigenvalue solvers are required. Most eigenvalue solver packages feature numerous different parameters which can be tuned for performance, eg, the number of nodes, number of total ranks, the decomposition of the matrix, etc. In this paper, we investigate the performance of different packages as well as the influence of these knobs on the solver performance.

Cook, Brandon↗

PyAlbany: A Python interface to the C++ multiphysics solver Albany

Albany is a parallel C++ finite element library for solving forward and inverse problems involving partial differential equations (PDEs). In this paper we introduce PyAlbany, a newly developed Python interface to the Albany library. PyAlbany can be used to effectively drive Albany enabling fast and easy analysis and post-processing of applications based on PDEs that are pre-implemented in Albany. PyAlbany relies on the library PyBind11 to bind Python with C++ Albany code. Here we detail the implementation of PyAlbany and showcase its capabilities through a number of examples targeting a heat-diffusion problem. In particular we consider the following: (1) the generation of samples for a Monte Carlo application, (2) a scalability study, (3) a study of parameters on the performance of a linear solver, and finally (4) a tool for performing eigenvalue decompositions of matrix-free operators for a Bayesian inference application.

97 MATHEMATICS AND COMPUTING↗

Eigenmode analysis of the sheared-flow Z-pinch

Experiments have demonstrated that a Z-pinch can persist for thousands of times longer than the growth time of global magnetohydrodynamic (MHD) instabilities such as the m=0 sausage and m=1 kink modes. These modes have growth times on the order of ta=a/vi, where vi is the ion thermal speed and a is the pinch radius. Axial flows with duz/dr ≲ vi/a have been measured during the stable period, and the commonly accepted theory is that this amount of shear is sufficient to stabilize these modes as predicted by numerical studies using the ideal MHD equations. However, these studies only consider specific equilibrium profiles that typically have a modest magnitude for the logarithmic pressure gradient, qP≡d ln P/d ln r, and may not represent experimental conditions. Linear stability of the sheared-flow Z-pinch is studied here via a direct eigen-decomposition of the matrix operator obtained from the linear ideal MHD equations. Several equilibrium profiles with a large variation of qP are examined. Considering a practical range of k, 1/3 ≲ ka ≲ 10, it is shown that the shear required to stabilize m=0 modes can be expressed as duz/dr≥Cγ0/(ka)α. Here, γ0=γ0(ka) is the profile-specific growth rate in the absence of shear, which scales approximately with |qP|. Both C and α are profile-specific constants, but C is order unity and α≈1. It is further demonstrated that even a large value of shear, duz/dr=3vi/a, is not sufficient to provide linear stabilization of the m=1 kink mode for all profiles considered. This result is in contrast to the currently accepted theory predicting stabilization at much lower shear, duz/dr=0.1vi/a, and suggests that the experimentally observed stability cannot be explained within the linear ideal-MHD model.

Angus, J. R. (ORCID:0000000314740002)↗

Instant form of Poincaré-invariant quantum mechanics and description of the structure of composite systems

The survey of works in which we develop the relativistic formalism for description of composite systems is given. The basis of the formalism is the procedure of decomposition of the matrix elements of local currents using the analogue of the Wigner-Eckart theorem for the Poincaré group. The impulse approximation is formulated without violation of Lorentz-covariance and conservation law. Some results of application of the method for description of the electroweak structure of composite systems are presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simplified Universal Equations for Ionic Conductivity and Transference Number

Nernst-Einstein equation can provide a reasonable estimate of the ionic conductivity of dilute solutions. For concentrated solutions, alternate methods such as Green–Kubo relations and Einstein relations are more suitable to account for ion-ion interactions. Such computations can be expensive for multicomponent systems. Simplified mathematical expressions like the Nernst-Einstein equation do not exist for concentrated multicomponent mixtures. Newman’s treatment of multicomponent concentrated solutions yields a conductivity relation in terms of species concentration and Onsager phenomenological coefficients. However, the estimation of these phenomenological coefficients is not straightforward. Here, mathematical formulations that relate the phenomenological coefficients with the friction coefficients are developed, leading to simplified, ready-to-use expressions of conductivity and transference numbers that can be used for a wide range of ionic mixtures. This approach involves spectral decomposition of the matrix of Onsager phenomenological coefficients. The general analytical expressions for conductivity and transference number are simplified for binary electrolytes, and numerical solutions are provided for ternary and quaternary mixtures with ion dissociation.

Electrochemistry↗

EVIDENCE OF SPREADING LAYER EMISSION IN A THERMONUCLEAR SUPERBURST

When a neutron star (NS) accretes matter from a companion star in a low-mass X-ray binary, the accreted gas settles onto the stellar surface through a boundary/spreading layer. On rare occasions the accumulated gas undergoes a powerful thermonuclear superburst powered by carbon burning deep below the NS atmosphere. In this paper, we apply the non-negative matrix factorization spectral decomposition technique to show that the spectral variations during a superburst from 4U 1636–536 can be explained by two distinct components: (1) the superburst emission characterized by a variable temperature blackbody radiation component and (2) a quasi-Planckian component with a constant, ∼2.5 keV, temperature varying by a factor of ∼15 in flux. The spectrum of the quasi-Planckian component is identical in shape and characteristics to the frequency-resolved spectra observed in the accretion/persistent spectrum of NS low-mass X-ray binaries and agrees well with the predictions of the spreading layer model by Inogamov and Sunyaev. Our results provide yet more observational evidence that superbursts—and possibly also normal X-ray bursts—induce changes in the disc–star boundary.

79 ASTRONOMY AND ASTROPHYSICS↗

Descriptions of the polarization states of vector processes - Applications to ULF magnetic fields

In recent years a wide variety of methods has been used to describe the polarization characteristics of ULF (.001 to 1 Hz) magnetic fields. This paper gives a detailed outline of some of the descriptions derived from the spectral matrices of n-variate stochastic processes. The matrices are expanded in three different, standard sets of matrices in order to add some simplification to the interpretation of the polarizations. One set is composed of n-squared trace-orthogonal, hermitean matrices and leads directly to a generalization of the Stokes parameters and the degree of polarization for n-variate processes. The second set is developed from the dyad expansion, which in particular cases is analogous to the spectral decomposition of the matrix. The third set is composed of n commuting idempotent matrices and proves to be the most useful set when the stochastic process is not strictly polarized.

Samson, J. C.↗

Parallel Methods on Large-Scale Structural Analysis and Physics Applications; Symposium, Hampton, VA, Feb. 5, 6, 1991, Selected Papers

Recent advances in parallel methods and algorithms integrated into large-scale codes are presented. Consideration is given to problem decomposition (substructuring), efficient matrix solution algorithms for shared memory architectures, dynamic and transient analysis algorithms for shared memory architectures, and algorithms for distributed and massively parallel architectures. Particular attention is given to partitioning of unstructured problems for parallel processing, parallel-vector computation for linear-structural analysis and nonlinear unconstraint optimization problems, a parallel-vector equation solver for unsymmetric matrices on supercomputers, parallel nonlinear finite element dynamic response, multigrid algorithms for solving structural mechanics problems on supercomputers, structural analysis on massively parallel computers, explicit finite element methods with contact-impact on SIMD computers, and the impact of mapping and sparsity on parallelized finite element method modules.

Storaasli, Olaf O.↗

An Optimal Orthogonal Decomposition Method for Kalman Filter-Based Turbofan Engine Thrust Estimation

A new linear point design technique is presented for the determination of tuning parameters that enable the optimal estimation of unmeasured engine outputs such as thrust. The engine s performance is affected by its level of degradation, generally described in terms of unmeasurable health parameters related to each major engine component. Accurate thrust reconstruction depends upon knowledge of these health parameters, but there are usually too few sensors to be able to estimate their values. In this new technique, a set of tuning parameters is determined which accounts for degradation by representing the overall effect of the larger set of health parameters as closely as possible in a least squares sense. The technique takes advantage of the properties of the singular value decomposition of a matrix to generate a tuning parameter vector of low enough dimension that it can be estimated by a Kalman filter. A concise design procedure to generate a tuning vector that specifically takes into account the variables of interest is presented. An example demonstrates the tuning parameters ability to facilitate matching of both measured and unmeasured engine outputs, as well as state variables. Additional properties of the formulation are shown to lend themselves well to diagnostics.

Litt, Jonathan S.↗

An Optimal Orthogonal Decomposition Method for Kalman Filter-Based Turbofan Engine Thrust Estimation

A new linear point design technique is presented for the determination of tuning parameters that enable the optimal estimation of unmeasured engine outputs, such as thrust. The engine s performance is affected by its level of degradation, generally described in terms of unmeasurable health parameters related to each major engine component. Accurate thrust reconstruction depends on knowledge of these health parameters, but there are usually too few sensors to be able to estimate their values. In this new technique, a set of tuning parameters is determined that accounts for degradation by representing the overall effect of the larger set of health parameters as closely as possible in a least-squares sense. The technique takes advantage of the properties of the singular value decomposition of a matrix to generate a tuning parameter vector of low enough dimension that it can be estimated by a Kalman filter. A concise design procedure to generate a tuning vector that specifically takes into account the variables of interest is presented. An example demonstrates the tuning parameters ability to facilitate matching of both measured and unmeasured engine outputs, as well as state variables. Additional properties of the formulation are shown to lend themselves well to diagnostics.

Litt, Jonathan S.↗

An Optimal Orthogonal Decomposition Method for Kalman Filter-Based Turbofan Engine Thrust Estimation

A new linear point design technique is presented for the determination of tuning parameters that enable the optimal estimation of unmeasured engine outputs, such as thrust. The engine's performance is affected by its level of degradation, generally described in terms of unmeasurable health parameters related to each major engine component. Accurate thrust reconstruction depends on knowledge of these health parameters, but there are usually too few sensors to be able to estimate their values. In this new technique, a set of tuning parameters is determined that accounts for degradation by representing the overall effect of the larger set of health parameters as closely as possible in a least squares sense. The technique takes advantage of the properties of the singular value decomposition of a matrix to generate a tuning parameter vector of low enough dimension that it can be estimated by a Kalman filter. A concise design procedure to generate a tuning vector that specifically takes into account the variables of interest is presented. An example demonstrates the tuning parameters ability to facilitate matching of both measured and unmeasured engine outputs, as well as state variables. Additional properties of the formulation are shown to lend themselves well to diagnostics.

Litt, Jonathan S.↗

Flexible Ablators Char Depths LHMEL Test Results

Char and pyrolysis zone depths give physical evidence of peak temperature reached in depth: The pyrolyzing material acts as a temperature indicator within its characteristic thermal decomposition range. A matrix of novel flexible ablators were laser tested in one component of material screening for NASA Entry, Descent and Landing research for future Mars missions. LHMEL tests were run both on virgin materials, and on previously charred materials for a dual pulse simulation of the heating due to aerocapture followed by atmospheric entry. The test models were machined to expose the cross-sections. Char measurements were made at three locations near the center of the exposed area. Data are presented showing the char depths developed in these flexible materials, grouped by reinforcing fiber and pyrolyzing material type.

White, Susan↗

Mechanism Analysis of Wind Turbine Var Oscillations

Electromagnetic transient simulation of parallel connected 4-MW type-3 wind turbines based on original equipment manufacturer's real-code turbine model shows 1.2-Hz turbine-turbine oscillations in reactive power. This letter reveals why such oscillations occur in the individual var measurement, while being insignificant in the total var measurement, regardless of the varying grid impedance. We adopt two analysis approaches: open-loop single-input single-output analysis and network decomposition. The two approaches differ in their treatment of turbine-network interaction. The open-loop analysis shows that the turbine-turbine oscillation mode is due to an open-loop system pole being attracted to an open-loop system zero. Furthermore, we use network decomposition method to explain why this mode is observable in individual vars while not observable in the total var. The entire system of n -turbines can be viewed as n decoupled circuits. For the two-turbine case, the system has an aggregated mode and a turbine-turbine oscillation mode. Here, the aggregated mode is associated with a circuit associated with the total var, while the turbine-turbine oscillation mode is associated with the var difference and is insensitive to the grid parameters.

17 WIND ENERGY↗

Perturbative approach to covariance matrix of the matter power spectrum

Here, we evaluate the covariance matrix of the matter power spectrum using perturbation theory up to dominant terms at 1-loop order and compare it to numerical simulations. We decompose the covariance matrix into the disconnected (Gaussian) part, trispectrum from the modes outside the survey (beat coupling or super-sample variance), and trispectrum from the modes inside the survey, and show how the different components contribute to the overall covariance matrix. We find the agreement with the simulations is at a 10\% level up to $k \sim 1 h {\rm Mpc^{-1}}$. We also show that all the connected components are dominated by the large-scale modes ($k<0.1 h {\rm Mpc^{-1}}$), regardless of the value of the wavevectors $k,\, k'$ of the covariance matrix, suggesting that one must be careful in applying the jackknife or bootstrap methods to the covariance matrix. We perform an eigenmode decomposition of the connected part of the covariance matrix, showing that at higher $k$ it is dominated by a single eigenmode. Furthermore, the full covariance matrix can be approximated as the disconnected part only, with the connected part being treated as an external nuisance parameter with a known scale dependence, and a known prior on its variance for a given survey volume. Finally, we provide a prescription for how to evaluate the covariance matrix from small box simulations without the need to simulate large volumes.

79 ASTRONOMY AND ASTROPHYSICS↗