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 253 records · Page 14

A flux-split solution procedure for unsteady flow calculations

The solution of reduced Navier Stokes (RNS) equations is considered using a flux-split procedure. Unsteady flow in a two dimensional engine inlet is computed. The problems of unstart and restart are investigated. A sparse matrix direct solver combined with domain decomposition strategy is used to compute the unsteady flow field at each instant of time. Strong shock-boundary layer interaction, time varying shocks and time varying recirculation regions are efficiently captured.

Pordal, H. S.↗

A restricted signature normal form for Hermitian matrices, quasi-spectral decompositions, and applications

In recent years, a number of results on the relationships between the inertias of Hermitian matrices and the inertias of their principal submatrices appeared in the literature. We study restricted congruence transformation of Hermitian matrices M which, at the same time, induce a congruence transformation of a given principal submatrix A of M. Such transformations lead to concept of the restricted signature normal form of M. In particular, by means of this normal form, we obtain short proofs of most of the known inertia theorems and also derive some new results of this type. For some applications, a special class of almost unitary restricted congruence transformations turns out to be useful. We show that, with such transformations, M can be reduced to a quasi-diagonal form which, in particular, displays the eigenvalues of A. Finally, applications of this quasi-spectral decomposition to generalize inverses and Hermitian matrix pencils are discussed.

Freund, Roland W.↗

Internal Alignment of the SLD Vertex Detector

The tracking resolution and vertex finding capabilities of the SLD experiment depended upon a precise knowledge of the location and orientation of the elements of the SLD pixel vertex detector (VXD3) in 3D space. At the heart of the procedure described here to align the 96 CCDs is the matrix inversion technique of singular value decomposition (SVD). This tool was employed to unfold the detector geometry corrections from the track data in the VXD3. The algorithm was adapted to perform an optimal {chi}{sup 2} minimization by careful treatment of the track hit residual measurement errors. The tracking resolution obtained with the aligned geometry achieved the design performance. Comments are given on how this method could be used for other trackers.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Fast truncated SVD of sparse and dense matrices on graphics processors

We investigate the solution of low-rank matrix approximation problems using the truncated singular value decomposition (SVD). For this purpose, we develop and optimize graphics processing unit (GPU) implementations for the randomized SVD and a blocked variant of the Lanczos approach. Our work takes advantage of the fact that the two methods are composed of very similar linear algebra building blocks, which can be assembled using numerical kernels from existing high-performance linear algebra libraries. Furthermore, the experiments with several sparse matrices arising in representative real-world applications and synthetic dense test matrices reveal a performance advantage of the block Lanczos algorithm when targeting the same approximation accuracy.

Computer Science↗

Detecting False Data Injection Attacks Against Power System State Estimation With Fast Go-Decomposition Approach

State estimation is a fundamental function in modern energy management system, but its results may be vulnerable to false data injection attacks (FDIAs). FDIA is able to change the estimation results without being detected by the traditional bad data detection algorithms. In this paper, we propose an accurate and computational attractive approach for FDIA detection. In this work, we first rely on the low rank characteristic of the measurement matrix and the sparsity of the attack matrix to reformulate the FDIA detection as a matrix separation problem. Then, four algorithms that solve this problem are presented and compared, including the traditional augmented Lagrange multipliers (ALMs), double-noise-dual-problem (DNDP) ALM, the low rank matrix factorization, and the proposed new “Go Decomposition (GoDec).” Numerical simulation results show that our GoDec algorithm outperforms the other three alternatives and demonstrates a much higher computational efficiency. Furthermore, GoDec is shown to be able to handle measurement noise and applicable for large-scale attacks.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners

This study presents a parallel preconditioning method for distributed sparse linear systems, based on an approximate inverse of the original matrix, that adopts a general framework of distributed sparse matrices and exploits domain decomposition (DD) and low-rank corrections. The DD approach decouples the matrix and, once inverted, a low-rank approximation is applied by exploiting the Sherman--Morrison--Woodbury formula, which yields two variants of the preconditioning methods. The low-rank expansion is computed by the Lanczos procedure with reorthogonalizations. Numerical experiments indicate that, when combined with Krylov subspace accelerators, this preconditioner can be efficient and robust for solving symmetric sparse linear systems. Comparisons with pARMS, a DD-based parallel incomplete LU (ILU) preconditioning method, are presented for solving Poisson's equation and linear elasticity problems.

97 MATHEMATICS AND COMPUTING↗

An iterative method for computing a symplectic SVD-like decomposition

In this paper, we present an effective iterative method for computing symplectic SVD-like decomposition for a 2n-by-m rectangular real matrix A. The main purpose here is a block-power iterative method with the ortho-symplectic SR decomposition in the normalization step. We compute an k-block symplectic SVD-like decomposition, namely A{sub k}=S{sub k}Σ{sub k}V{sub k}{sup T} where S{sub k}∈ℝ{sup 2n×2k} is symplectic and V{sub k}∈ℝ{sup m×2k} is orthogonal. For large matrices, we usually have to compute only part of eigenvalues. The main interest of the proposed method is to efficiently compute the desired number of ordered in magnitude eigenvalues of structured matrices.

97 MATHEMATICS AND COMPUTING↗

GPU-Accelerated Solution of the Bethe–Salpeter Equation for Large and Heterogeneous Systems

We present a massively parallel GPU-accelerated implementation of the Bethe–Salpeter equation (BSE) for the calculation of the vertical excitation energies (VEEs) and optical absorption spectra of condensed and molecular systems, starting from single-particle eigenvalues and eigenvectors obtained with density functional theory. The algorithms adopted here circumvent the slowly converging sums over empty and occupied states and the inversion of large dielectric matrices through a density matrix perturbation theory approach and a low-rank decomposition of the screened Coulomb interaction, respectively. Further computational savings are achieved by exploiting the nearsightedness of the density matrix of semiconductors and insulators to reduce the number of screened Coulomb integrals. We scale our calculations to thousands of GPUs with a hierarchical loop and data distribution strategy. The efficacy of our method is demonstrated by computing the VEEs of several spin defects in wide-band-gap materials, showing that supercells with up to 1000 atoms are necessary to obtain converged results. We discuss the validity of the common approximation that solves the BSE with truncated sums over empty and occupied states. In conclusion, we then apply our GW-BSE implementation to a diamond lattice with 1727 atoms to study the symmetry breaking of triplet states caused by the interaction of a point defect with an extended line defect.

Absorption spectra↗

Graphical Methods for Quantifying Macromolecules through Bright Field Imaging

Bright ?eld imaging of biological samples stained with antibodies and/or special stains provides a rapid protocol for visualizing various macromolecules. However, this method of sample staining and imaging is rarely employed for direct quantitative analysis due to variations in sample fixations, ambiguities introduced by color composition, and the limited dynamic range of imaging instruments. We demonstrate that, through the decomposition of color signals, staining can be scored on a cell-by-cell basis. We have applied our method to Flbroblasts grown from histologically normal breast tissue biopsies obtained from two distinct populations. Initially, nuclear regions are segmented through conversion of color images into gray scale, and detection of dark elliptic features. Subsequently, the strength of staining is quanti?ed by a color decomposition model that is optimized by a graph cut algorithm. In rare cases where nuclear signal is significantly altered as a result of samplepreparation, nuclear segmentation can be validated and corrected. Finally, segmented stained patterns are associated with each nuclear region following region-based tessellation. Compared to classical non-negative matrix factorization, proposed method (i) improves color decomposition, (ii) has a better noise immunity, (iii) is more invariant to initial conditions, and (iv) has a superior computing performance

60 APPLIED LIFE SCIENCES↗

Graphical methods for quantifying macromolecules through bright field imaging

Bright field imaging of biological samples stained with antibodies and/or special stains provides a rapid protocol for visualizing various macromolecules. However, this method of sample staining and imaging is rarely employed for direct quantitative analysis due to variations in sample fixations, ambiguities introduced by color composition and the limited dynamic range of imaging instruments. We demonstrate that, through the decomposition of color signals, staining can be scored on a cell-by-cell basis. We have applied our method to fibroblasts grown from histologically normal breast tissue biopsies obtained from two distinct populations. Initially, nuclear regions are segmented through conversion of color images into gray scale, and detection of dark elliptic features. Subsequently, the strength of staining is quantified by a color decomposition model that is optimized by a graph cut algorithm. In rare cases where nuclear signal is significantly altered as a result of sample preparation, nuclear segmentation can be validated and corrected. Finally, segmented stained patterns are associated with each nuclear region following region-based tessellation. Compared to classical non-negative matrix factorization, proposed method: (i) improves color decomposition, (ii) has a better noise immunity, (iii) is more invariant to initial conditions and (iv) has a superior computing performance.

59 BASIC BIOLOGICAL SCIENCES↗

Predictability and reduced order modeling in stochastic reaction networks.

Many systems involving chemical reactions between small numbers of molecules exhibit inherent stochastic variability. Such stochastic reaction networks are at the heart of processes such as gene transcription, cell signaling or surface catalytic reactions, which are critical to bioenergy, biomedical, and electrical storage applications. The underlying molecular reactions are commonly modeled with chemical master equations (CMEs), representing jump Markov processes, or stochastic differential equations (SDEs), rather than ordinary differential equations (ODEs). As such reaction networks are often inferred from noisy experimental data, it is not uncommon to encounter large parametric uncertainties in these systems. Further, a wide range of time scales introduces the need for reduced order representations. Despite the availability of mature tools for uncertainty/sensitivity analysis and reduced order modeling in deterministic systems, there is a lack of robust algorithms for such analyses in stochastic systems. In this talk, we present advances in algorithms for predictability and reduced order representations for stochastic reaction networks and apply them to bistable systems of biochemical interest. To study the predictability of a stochastic reaction network in the presence of both parametric uncertainty and intrinsic variability, an algorithm was developed to represent the system state with a spectral polynomial chaos (PC) expansion in the stochastic space representing parametric uncertainty and intrinsic variability. Rather than relying on a non-intrusive collocation-based Galerkin projection [1], this PC expansion is obtained using Bayesian inference, which is ideally suited to handle noisy systems through its probabilistic formulation. To accommodate state variables with multimodal distributions, an adaptive multiresolution representation is used [2]. As the PC expansion directly relates the state variables to the uncertain parameters, the formulation lends itself readily to sensitivity analysis. Reduced order modeling in the time dimension is accomplished using a Karhunen-Loeve (KL) decomposition of the stochastic process in terms of the eigenmodes of its covariance matrix. Subsequently, a Rosenblatt transformation relates the random variables in the KL decomposition to a set of independent random variables, allowing the representation of the system state with a PC expansion in those independent random variables. An adaptive clustering method is used to handle multimodal distributions efficiently, and is well suited for high-dimensional spaces. The spectral representation of the stochastic reaction networks makes these systems more amenable to analysis, enabling a detailed understanding of their functionality, and robustness under experimental data uncertainty and inherent variability.

59 BASIC BIOLOGICAL SCIENCES↗

DECT-MULTRA: Dual-Energy CT Image Decomposition With Learned Mixed Material Models and Efficient Clustering

Dual-energy computed tomography (DECT) imaging plays an important role in advanced imaging applications due to its material decomposition capability. Image-domain decomposition operates directly on CT images using linear matrix inversion, but the decomposed material images can be severely degraded by noise and artifacts. This paper proposes a new method dubbed DECT-MULTRA for image-domain DECT material decomposition that combines conventional penalized weighted-least squares (PWLS) estimation with regularization based on a mixed union of learned transforms (MULTRA) model. Our proposed approach pre-learns a union of common-material sparsifying transforms from patches extracted from all the basis materials, and a union of cross-material sparsifying transforms from multi-material patches. The common-material transforms capture the common properties among different material images, while the cross-material transforms capture the cross-dependencies. The proposed PWLS formulation is optimized efficiently by alternating between an image update step and a sparse coding and clustering step, with both of these steps having closed-form solutions. The effectiveness of our method is validated with both XCAT phantom and clinical head data. The results demonstrate that our proposed method provides superior material image quality and decomposition accuracy compared to other competing methods.

47 OTHER INSTRUMENTATION↗

Unitarity and the Holographic S-Matrix

The bulk S-Matrix can be given a non-perturbative definition in terms of the flat space limit of AdS/CFT. We show that the unitarity of the S-Matrix, ie the optical theorem, can be derived by studying the behavior of the OPE and the conformal block decomposition in the flat space limit. When applied to perturbation theory in AdS, this gives a holographic derivation of the cutting rules for Feynman diagrams. To demonstrate these facts we introduce some new techniques for the analysis of conformal field theories. Chief among these is a method for conglomerating local primary operators O{sub 1} and O{sub 2} to extract the contribution of an individual primary O{sub {Delta},{ell}} in their OPE. This provides a method for isolating the contribution of specific conformal blocks which we use to prove an important relation between certain conformal block coefficients and anomalous dimensions. These techniques make essential use of the simplifications that occur when CFT correlators are expressed in terms of a Mellin amplitude.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

New evidence favoring multilevel decomposition and optimization

A new multilevel optimization technique based on a global sensitivity matrix which uses behavior variables in addition to design variables and constraints to decompose the problem is proposed. The technique simplifies the decomposition of the design problem and the programming task and improves the convergence speed of multilevel optimization compared to conventional optimization. The technique is particularly well suited to problems with large numbers of design variables and with computationally expensive constraints.

Padula, Sharon L.↗

Multiresolution image gathering and restoration

In this paper we integrate multiresolution decomposition with image gathering and restoration. This integration leads to a Wiener-matrix filter that accounts for the aliasing, blurring, and noise in image gathering, together with the digital filtering and decimation in signal decomposition. Moreover, as implemented here, the Wiener-matrix filter completely suppresses the blurring and raster effects of the image-display device. We demonstrate that this filter can significantly improve the fidelity and visual quality produced by conventional image reconstruction. The extent of this improvement, in turn, depends on the design of the image-gathering device.

Fales, Carl L.↗

Efficient Scalable Parallel Higher Order Direct MoM-SIE Method With Hierarchically Semiseparable Structures for 3-D Scattering

A novel fast scalable parallel algorithm is proposed for the solution of large 3-D scattering problems based on: 1) the double (geometrical and current-approximation) higher order (DHO) method of moments (MoM) in the surface integral equation (SIE) formulation and 2) a direct solver for dense linear systems utilizing hierarchically semiseparable (HSS) structures. Namely, an HSS matrix representation is used for compression, factorization, and solution of the system matrix. In addition, a rank-revealing QR decomposition for memory compression is used, with a stopping criterion in terms of the relative rank tolerance value. One method for geometrical preprocessing of the scatterers based on the cobblestone distance sorting technique is employed in order to enhance the HSS algorithm accuracy and parallelization. Numerical examples show how the accuracy of the DHO HSS-MoM-SIE method is easily controllable by using the relative tolerance for the matrix compression. Furthermore, the examples demonstrate low memory consumption, as well as much faster simulation time, when compared to the direct LU decomposition. The method enables dramatically faster monostatic scattering computations than iterative solvers and reduced number of unknowns when compared to low-order discretizations. Finally, great scalability of the algorithm is demonstrated on more than one thousand processes.

97 MATHEMATICS AND COMPUTING↗

Spectral Schur complement techniques for symmetric eigenvalue problems

This paper presents a domain decomposition-type method for solving real symmetric (Hermitian) eigenvalue problems in which we seek all eigenpairs in an interval [α; β] or a few eigenpairs next to a given real shift. Here, a Newton-based scheme is described whereby the problem is converted to one that deals with the interface nodes of the computational domain. This approach relies on the fact that the inner solves related to each local subdomain are relatively inexpensive. This Newton scheme exploits spectral Schur complements, and these lead to so-called eigenbranches, which are rational functions whose roots are eigenvalues of the original matrix. Theoretical and practical aspects of domain decomposition techniques for computing eigenvalues and eigenvectors are discussed. A parallel implementation is presented and its performance on distributed computing environments is illustrated by means of a few numerical examples.

parallel computing↗

Theoretical oxidation state analysis of Ru-(bpy){sub 3}: Influence of water solvation and Hubbard correction in first-principles calculations

Oxidation state is a powerful concept that is widely used in chemistry and materials physics, although the concept itself is arguably ill-defined quantum mechanically. In this work, we present impartial comparison of four, well-recognized theoretical approaches based on Lowdin atomic orbital projection, Bader decomposition, maximally localized Wannier function, and occupation matrix diagonalization, for assessing how well transition metal oxidation states can be characterized. Here, we study a representative molecular complex, tris(bipyridine)ruthenium. We also consider the influence of water solvation through first-principles molecular dynamics as well as the improved electronic structure description for strongly correlated d-electrons by including Hubbard correction in density functional theory calculations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗