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 91 records · Page 5

G W calculations using the spectral decomposition of the dielectric matrix: Verification, validation, and comparison of methods

In a recent paper we presented an approach to evaluate quasiparticle energies based on the spectral decomposition of the static dielectric matrix. This method does not require the calculation of unoccupied electronic states or the direct diagonalization of large dielectric matrices, and it avoids the use of plasmon-pole models. The numerical accuracy of the approach is controlled by a single parameter, i.e., the number of eigenvectors used in the spectral decomposition of the dielectric matrix. Here we present a comprehensive validation of the method, encompassing calculations of ionization potentials and electron affinities of various molecules and of band gaps for several crystalline and disordered semiconductors. Lastly, we demonstrate the efficiency of our approach by carrying out G W calculations for systems with several hundred valence electrons.

36 MATERIALS SCIENCE↗

Assessing the quality of curvilinear coordinate meshes by decomposing the Jacobian matrix

An algebraic decomposition of the Jacobian matrix which relates physical and computational variables is presented. This invertible decomposition parameterizes the mesh by the physically intuitive qualities of cell orientation, cell orthogonality, cell volume, and cell aspect ratio. The decomposition can be used to analyze numerically generated curvilinear coordinate meshes and to assess the contribution of the mesh to the truncation error for any specific differential operator and algorithm. This is worked out in detail for Laplace's equation in nonconservative and conservative forms. The analysis is applied to the solution of the full potential code TAIR, showing grid plots, carpet plots, and truncation error for a NACA 0012 airfoil.

Kerlick, G. D.↗

Analysis of multiloop, multirate sampled-data systems

Based upon new identities between z-transforms at a basis rate, z-transforms at faster rates, and modified z-transforms, the equivalence between the frequency decomposition method and the switch decomposition method is precisely presented so that results of one method are easily obtained from results of the other. Next, a method is developed for determining the closed loop transfer function of multiloop, multirate sampled-data systems with noninteger ratio sampling rates. Previously, this process involved solving a complex system of equations with rational polynomial coefficients. Herein, this is avoided by introducing a systematic decomposition of matrix operators which naturally arise from the switch decomposition method. The matrix operators are simplified by introducing the shifted transforms of signals sampled at one of the faster rates.

Boykin, W. H.↗

Surface-peaked medium effects in the interaction of nucleons with finite nuclei

We investigate the asymptotic separation of the optical model potential for nucleon-nucleus scattering in momentum space, where the potential is split into a medium-independent term and another depending exclusively on the gradient of the density-dependent g matrix. This decomposition confines the medium sensitivity of the nucleon-nucleus coupling to the surface of the nucleus. We examine this feature in the context of proton-nucleus scattering at beam energies between 30 and 100 MeV and find that the pn coupling accounts for most of this sensitivity. Additionally, based on this general structure of the optical potential we are able to treat both, the medium dependence of the effective interaction and the full mixed density as described by single-particle shell models. The calculated scattering observables agree within 10% with those obtained by Arellano, Brieva, and Love in their momentum-space g-folding approach.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Nonlinear Matrix Approximation with Radial Basis Function Components

We introduce and investigate matrix approximation by decomposition into a sum of radial basis function (RBF) components. An RBF component is a generalization of the outer product between a pair of vectors, where an RBF function replaces the scalar multiplication between individual vector elements. Even though the RBF functions are positive definite, the summation across components is not restricted to convex combinations and allows us to compute the decomposition for any real matrix that is not necessarily symmetric or positive definite. We formulate the problem of seeking such a decomposition as an optimization problem with a nonlinear and non-convex loss function. Several modern versions of the gradient descent method, including their scalable stochastic counterparts, are used to solve this problem. We provide extensive empirical evidence of the effectiveness of the RBF decomposition and that of the gradient-based fitting algorithm. While being conceptually motivated by singular value decomposition (SVD), our proposed nonlinear counterpart outperforms SVD by drastically reducing the memory required to approximate a data matrix with the same L2 error for a wide range of matrix types. For example, it leads to 2 to 6 times memory save for Gaussian noise, graph adjacency matrices, and kernel matrices. Moreover, this proximity-based decomposition can offer additional interpretability in applications that involve, e.g., capturing the inner low-dimensional structure of the data, retaining graph connectivity structure, and preserving the acutance of images.

Rebrova, Elizaveta↗

Iterative image-domain decomposition for dual-energy CT

Purpose: Dual energy CT (DECT) imaging plays an important role in advanced imaging applications due to its capability of material decomposition. Direct decomposition via matrix inversion suffers from significant degradation of image signal-to-noise ratios, which reduces clinical values of DECT. Existing denoising algorithms achieve suboptimal performance since they suppress image noise either before or after the decomposition and do not fully explore the noise statistical properties of the decomposition process. In this work, the authors propose an iterative image-domain decomposition method for noise suppression in DECT, using the full variance-covariance matrix of the decomposed images. Methods: The proposed algorithm is formulated in the form of least-square estimation with smoothness regularization. Based on the design principles of a best linear unbiased estimator, the authors include the inverse of the estimated variance-covariance matrix of the decomposed images as the penalty weight in the least-square term. The regularization term enforces the image smoothness by calculating the square sum of neighboring pixel value differences. To retain the boundary sharpness of the decomposed images, the authors detect the edges in the CT images before decomposition. These edge pixels have small weights in the calculation of the regularization term. Distinct from the existing denoising algorithms applied on the images before or after decomposition, the method has an iterative process for noise suppression, with decomposition performed in each iteration. The authors implement the proposed algorithm using a standard conjugate gradient algorithm. The method performance is evaluated using an evaluation phantom (Catphan©600) and an anthropomorphic head phantom. The results are compared with those generated using direct matrix inversion with no noise suppression, a denoising method applied on the decomposed images, and an existing algorithm with similar formulation as the proposed method but with an edge-preserving regularization term. Results: On the Catphan phantom, the method maintains the same spatial resolution on the decomposed images as that of the CT images before decomposition (8 pairs/cm) while significantly reducing their noise standard deviation. Compared to that obtained by the direct matrix inversion, the noise standard deviation in the images decomposed by the proposed algorithm is reduced by over 98%. Without considering the noise correlation properties in the formulation, the denoising scheme degrades the spatial resolution to 6 pairs/cm for the same level of noise suppression. Compared to the edge-preserving algorithm, the method achieves better low-contrast detectability. A quantitative study is performed on the contrast-rod slice of Catphan phantom. The proposed method achieves lower electron density measurement error as compared to that by the direct matrix inversion, and significantly reduces the error variation by over 97%. On the head phantom, the method reduces the noise standard deviation of decomposed images by over 97% without blurring the sinus structures. Conclusions: The authors propose an iterative image-domain decomposition method for DECT. The method combines noise suppression and material decomposition into an iterative process and achieves both goals simultaneously. By exploring the full variance-covariance properties of the decomposed images and utilizing the edge predetection, the proposed algorithm shows superior performance on noise suppression with high image spatial resolution and low-contrast detectability.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

TU-F-18A-02: Iterative Image-Domain Decomposition for Dual-Energy CT

Purpose: Dual energy CT (DECT) imaging plays an important role in advanced imaging applications due to its material decomposition capability. Direct decomposition via matrix inversion suffers from significant degradation of image signal-to-noise ratios, which reduces clinical value. Existing de-noising algorithms achieve suboptimal performance since they suppress image noise either before or after the decomposition and do not fully explore the noise statistical properties of the decomposition process. We propose an iterative image-domain decomposition method for noise suppression in DECT, using the full variance-covariance matrix of the decomposed images. Methods: The proposed algorithm is formulated in the form of least-square estimation with smoothness regularization. It includes the inverse of the estimated variance-covariance matrix of the decomposed images as the penalty weight in the least-square term. Performance is evaluated using an evaluation phantom (Catphan 600) and an anthropomorphic head phantom. Results are compared to those generated using direct matrix inversion with no noise suppression, a de-noising method applied on the decomposed images, and an existing algorithm with similar formulation but with an edge-preserving regularization term. Results: On the Catphan phantom, our method retains the same spatial resolution as the CT images before decomposition while reducing the noise standard deviation of decomposed images by over 98%. The other methods either degrade spatial resolution or achieve less low-contrast detectability. Also, our method yields lower electron density measurement error than direct matrix inversion and reduces error variation by over 97%. On the head phantom, it reduces the noise standard deviation of decomposed images by over 97% without blurring the sinus structures. Conclusion: We propose an iterative image-domain decomposition method for DECT. The method combines noise suppression and material decomposition into an iterative process and achieves both goals simultaneously. The proposed algorithm shows superior performance on noise suppression with high image spatial resolution and low-contrast detectability. This work is supported by a Varian MRA grant.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Sparsity of Radiating Characteristic Modes on Infinite Periodic Structures

Characteristic modes on infinite periodic structures are studied using spectral dyadic Green’s functions. This formulation demonstrates that, in contrast to the modal analysis of finite structures, the number of radiating characteristic modes is limited by unit cell size and incident wave vector (i.e., scan angle or phase shift per unit cell). Here, the reflection tensor is decomposed into modal contributions from radiating modes, indicating that characteristic modes are a predictably sparse basis in which to study reflection phenomena.

42 ENGINEERING↗

Thermal and Mechanical Properties of CO{sub 2}-Based Biodegradable Poly(cyclohexene carbonate)/Organically Modified Layered Zinc Phenylphosphonate Nanocomposites

A new sustainable composite material was fabricated using CO{sub 2}-based poly(cyclohexene carbonate) (PCHC) and organically modified layered zinc phenylphosphonate (m-PPZn) via a solution mixing process. Analysis by wide-angle X-ray diffraction (WAXD) showed that the interlayer spacing of the m-PPZn was enlarged to 30.4 Å. The morphology of the PCHC/m-PPZn nanocomposites was characterized by transmission electron microscopy and WAXD, which revealed that the layered materials were partially delaminated and randomly dispersed in the PCHC matrix. The enhancement of the dynamic mechanical properties of the 1 wt% PCHC/m-PPZn nanocomposite at 80 °C was approximately 114% relative to those of the neat PCHC matrix. The thermal properties of the PCHC/m-PPZn nanocomposites characterized using thermogravimetric analysis were substantially improved upon incorporation of m-PPZn. With the addition of 0.25 wt% m-PPZn into the PCHC matrix, the decomposition temperature associated with 10 wt% loss of the nanocomposites was substantially increased by approximately 24 °C compared with that of the PCHC matrix. The isothermal degradation data demonstrated that the activation energy of the composites was higher than that of the PCHC. This finding was attributed to the addition of m-PPZn to PCHC increasing the thermal energy required for degradation, thus inducing a reduction in the degradation rate and an increase in the residual weight for the PCHC/m-PPZn nanocomposites.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Effects of Tantalum on the Temporal Evolution of a Model Ni-Al-Cr Superalloy During Phase Decomposition

The effects of a 2.0 at.% addition of Ta to a model Ni-10.0Al-8.5Cr (at.%) superalloy aged at 1073 K are assessed using scanning electron microscopy and atom-probe tomography. The gamma'(Ll2)-precipitate morphology that develops as a result of gamma-(fcc)matrix phase decomposition is found to evolve from a bimodal distribution of spheroidal precipitates, to {001}-faceted cuboids and parallelepipeds aligned along the elastically soft {001}-type directions. The phase compositions and the widths of the gamma'-precipitate/gamma-matrix heterophase interfaces evolve temporally as the Ni-Al-Cr-Ta alloy undergoes quasi-stationary state coarsening after 1 h of aging. Tantalum is observed to partition preferentially to the gamma'-precipitate phase, and suppresses the mobility of Ni in the gamma-matrix sufficiently to cause an accumulation of Ni on the gamma-matrix side of the gamma'/gamma interface. Additionally, computational modeling, employing Thermo-Calc, Dictra and PrecipiCalc, is employed to elucidate the kinetic pathways that lead to phase decomposition in this concentrated Ni-Al-Cr-Ta alloy.

Booth, Morrison, Christopher↗

Solving Large Systems of Normal Equations

SOLVE II program combines any number of sets of normal equations and obtains solution vector and related statistics. Normal equations of square, nonnegative definite matrix form. Program utilizes only upper symmetric portion of matrix. Program uses partitioned Cholesky decomposition method for matrix inversion to accommodate large parameter systems.

Putney, B.↗

Fluctuation studies in the infinite interval matrix representations of operator products and their decompositions

In this work a study on finite dimensional matrix approximations to products of quantum mechanical operators is conducted. It is emphasized that the matrix representation of the product of two operators is equal to the product of the matrix representation of each of the operators when all the fluctuation terms are ignored. The calculation of the elements of the matrices corresponding to the matrix representation of various operators, based on three terms recursive relation is defined. Finally it is shown that the approximation quality depends on the choice of higher values of n, namely the dimension of Hilbert space.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Wind Farm Flow Modeling using an Input-Output Reduced-Order Model

Wind turbines in a wind farm operate individually to maximize their own power regardless of the impact of aerodynamic interactions on neighboring turbines. There is the potential to increase power and reduce overall structural loads by properly coordinating turbines. To perform control design and analysis, a model needs to be of low computational cost, but retains the necessary dynamics seen in high-fidelity models. The objective of this work is to obtain a reduced-order model that represents the full-order flow computed using a high-fidelity model. A variety of methods, including proper orthogonal decomposition and dynamic mode decomposition, can be used to extract the dominant flow structures and obtain a reduced-order model. In this paper, we combine proper orthogonal decomposition with a system identification technique to produce an input-output reduced-order model. This technique is used to construct a reduced-order model of the flow within a two-turbine array computed using a large-eddy simulation.

17 WIND ENERGY↗

Observables for scattering on targets with arbitrary spin

Starting from the Weinberg formalism for fields of arbitrary spin, we discuss a method for the decomposition of matrix elements of QCD operators (local currents, quark/gluon bilinears) for targets with arbitrary spin. This procedure is advantageous for the systematic study of the structure of hadrons and nuclei, particularly in the case of spin-dependent observables. As higher spin targets exhibit new features in their hadronic structure, the investigation of these properties can enhance our understanding of the strong force. The construction allows for a unified framework to discuss spin > 1/2 very similar to the spin 1/2 case, without subsidiary conditions for the wave functions. Different types of spinors (canonical, helicity, light-front helicity) can be easily accommodated. Its numerical implementation is simple and can be entirely reduced to objects familiar from the rotation group. A natural sl(2,C) multipole decomposition emerges, enabling a physical interpretation of non-perturbative objects that multiply spinor bilinears as Generalized Form Factors. To demonstrate the efficacy of this method, we apply it to the description of a spin 1 target, such as the deuteron. We discuss extensions of the formalism to hard exclusive processes on the deuteron and beyond.

Vera, Frank↗

Mechanical and Thermal Properties of Green Thermoplastic Elastomer Vulcanizate Nanocomposites Based on Poly (vinyl chloride) and Nitrile Butadiene Rubber Containing Organoclay and Rice Straw Natural Fibers

Green thermoplastic elastomer vulcanizates (GTPV) nanocomposites using poly (vinyl chloride) (PVC) and nitrile butadiene rubber (NBR) containing 5 wt% Cloisite 30B as an organoclay and various concentrations of rice straw natural fibers were made by melt mixing process and compression molding. The effect of used organoclay and various loadings of rice straw was monitored through using scanning electron microscopy (SEM), thermogravimetric analysis (TGA), tensile tests and rheological measurements. The morphological investigations revealed that the GTPV nanocomposites reinforced by rice straw natural fiber show a more rough fracture surfaces indicated the existence of some interactions between the natural fiber and polymer matrix. Thermal decomposition measurements revealed a higher thermal stability for GTPV nanocomposites containing higher rice straw natural fibers. The tensile test analysis suggested that there is an optimum value for the weight fraction of rice straw to enhance the Young’s modulus and tensile strength of the prepared GTPV nanocomposites up to 9 MPa and 35 MPa, respectively. The effect of rice straw loading on the Young’s modulus of the PVC/NBR/organoclay GTPV nanocomposites was predicted through using the parallel and series equations of modified Ji’s model. The results show that the theoretical model can precisely predict the variation of Young’s modulus with respect to the rice straw loading.

36 MATERIALS SCIENCE↗

Tensor renormalization group for fermions

Abstract We review the basic ideas of the tensor renormalization group method and show how they can be applied for lattice field theory models involving relativistic fermions and Grassmann variables in arbitrary dimensions. We discuss recent progress for entanglement filtering, loop optimization, bond-weighting techniques and matrix product decompositions for Grassmann tensor networks. The new methods are tested with two-dimensional Wilson–Majorana fermions and multi-flavor Gross–Neveu models. We show that the methods can also be applied to the fermionic Hubbard model in 1+1 and 2+1 dimensions.

Physics↗

Tucker-1 Boolean Tensor Factorization with Quantum Annealers

Quantum annealers are an emerging computational architecture that have the potential to address some challenging computational issues that will be left unresolved as we approach the end of the Moore's Law era of computing. D-Wave quantum annealers are designed to solve a challenging set of problems - quadratic unconstrained binary optimization problems. This makes them a natural fit for solving problems with binary or Boolean variables. Here, we explore the use of a quantum annealer to solve Boolean tensor factorization. The goal of Boolean tensor factorization is to represent a high-dimensional tensor filled with Boolean values as a product of Boolean matrices and a Boolean core tensor. We show that a particular Boolean tensor factorization problem (called Tucker-1 factorization) can be decomposed into a sequence of quadratic unconstrained binary optimization problems that can be solved with a D-Wave 2000Q quantum annealer. While quantum annealers specifically and quantum computers in general are at a fairly early stage in their development, they are currently capable of solving these Boolean tensor factorization problems. Importantly, our results show that for fairly small tensors, we are frequently able to obtain an accurate (sometimes exact) factorization using quantum annealing.

97 MATHEMATICS AND COMPUTING↗