Search NASA⌕ Search

SEARCH · Search NASA

Results for “singular value 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 19 records

Denoising atomic resolution 4D scanning transmission electron microscopy data with tensor singular value decomposition

Tensor singular value decomposition (SVD) is a method to find a low-dimensional representation of data with meaningful structure in three or more dimensions. Here, tensor SVD has been applied to denoise atomic-resolution 4D scanning transmission electron microscopy (4D STEM) data. On data simulated from a SrTiO 3 [100] perfect crystal and a Si [110] edge dislocation, tensor SVD achieved an average peak signal-to-noise ratio (PSNR) of ~40 dB, which matches or exceeds the performance of other denoising methods, with processing times at least 100 times shorter. On experimental data from SrTiO 3 [100] and LiZnSb [11 2 ¯ 0]/GaSb [110] samples, tensor SVD denoises multiple GB 4D STEM data sets in ten minutes on a typical personal computer. Denoising with tensor SVD improves both convergent beam electron diffraction patterns and virtual-aperture annular dark field images.

36 MATERIALS SCIENCE↗

Data-driven acceleration of thermal radiation transfer calculations with the dynamic mode decomposition and a sequential singular value decomposition

In this work, we present a method for accelerating discrete ordinates radiative transfer calculations for radiative transfer. Our method works with nonlinear positivity fixes, in contrast to most acceleration schemes. The method is based on the dynamic mode decomposition (DMD) and using a sequence of rank-one updates to compute the singular value decomposition needed for DMD. Using a sequential method allows us to automatically determine the number of solution vectors to include in the DMD acceleration. We present results for slab geometry discrete ordinates calculations with the standard temperature linearization. Compared with positive source iteration, our results demonstrate that our acceleration method reduces the number of transport sweeps required to solve the problem by a factor of about 3 on a standard diffusive Marshak wave problem, a factor of several thousand on a cooling problem where the effective scattering ratio approaches unity, and a factor of 20 improvement in a realistic, multimaterial radiating shock problem.

97 MATHEMATICS AND COMPUTING↗

Application of singular value decomposition to structural dynamics systems with constraints

Singular value decomposition is used to construct a coordinate transformation for a linear dynamic system subject to linear, homogeneous constraint equations. The method is compared with two commonly used methods, namely classical Gaussian elimination and Walton-Steeves approach. Although the classical method requires fewer numerical operations, the singular value decomposition method is more accurate and convenient in eliminating the dependent coordinates. Numerical examples are presented to demonstrate the application of the method.

Juang, J.-N.↗

Randomized algorithms for generalized singular value decomposition with application to sensitivity analysis

The generalized singular value decomposition (GSVD) is a valuable tool that has many applications in computational science. However, computing the GSVD for large-scale problems is challenging. Motivated by applications in hyper-differential sensitivity analysis (HDSA), in this work we propose new randomized algorithms for computing the GSVD which use randomized subspace iteration and weighted QR factorization. Detailed error analysis is given which provides insight into the accuracy of the algorithms and the choice of the algorithmic parameters. We demonstrate the performance of our algorithms on test matrices and a large-scale model problem where HDSA is used to study subsurface flow.

97 MATHEMATICS AND COMPUTING↗

A Survey of Singular Value Decomposition Methods for Distributed Tall/Skinny Data

The Singular Value Decomposition (SVD) is one of the most important matrix factorizations, enjoying a wide variety of applications across numerous application domains. In statistics and data analysis, the common applications of SVD inclue Principal Components Analysis (PCA) and regression. Usually these applications arise on data that has far more rows than columns, so-called "tall/skinny" matrices. In the big data analytics context, this may take the form of hundreds of millions to billions of rows with only a few hundred columns. There is a need, therefore, for fast, accurate, and scalable tall/skinny SVD implementations which can fully utilize modern computing resources. To that end, we present a survey of three different algorithms for computing the SVD for these kinds of tall/skinny data layouts using MPI for communication. We contextualize these with common big data analytics techniques. Finally, we present both CPU and GPU timing results from the Summit supercomputer, and discuss possible alternative approaches.

Schmidt, Drew↗

Singular value decomposition with systolic arrays

Systolic arrays for determining the singular value decomposition of a mxn, m n, matrix A of bandwidth w are presented. After A has been reduced to bidiagonal form B by means of Givens plane rotations, the singular values of B are computed by the Golub-Reinsch iteration. The products of plane rotations form the matrices of left and right singular vectors. Assuming each processor can compute or supply a plane rotation, O(wn) processors accomplish the reduction to bidiagonal form in O(np) steps, where p is the number of superdiagonals. A constant number of processors then determines each singular value in about 6n steps. The singular vectors are computed by rerouting the rotations through the arrays used for the reduction to bidiagonal form, or else along the way by employing another rectangular array of O(wm) processors.

Ipsen, I. C. F.↗

Singular value decomposition with systolic arrays

Systolic arrays for determining the singular value decomposition of a mxn, m greater than or equal to n, matrix A of bandwidth w are presented. After A has been reduced to bidiagonal form B by means of Givens plane rotations, the singular values of B are computed by the Golub-Reinsch iteration. The products of plane rotations form the matrices of left and right singular vectors. Assuming each processor can compute or supply a plane rotation, O(wn) processors accomplish the reduction to bidiagonal form in O(np) steps, where p is the number of superdiagonals. A constant number of processors then determines each singular value in about 6n steps. The singular vectors are computed by rerouting the rotations through the arrays used for the reduction to bidiagonal form, or else along the way by employing another rectangular array of O(wm) processors.

Ipsen, I.↗

A Singular Value Decomposition Framework for Retrievals with Vertical Distribution Information from Greenhouse Gas Column Absorption Spectroscopy Measurements

We review the singular value decomposition (SVD) framework and use it for quantifying and discerning vertical information in greenhouse gas retrievals from column integrated absorption measurements. While the commonly used traditional Bayesian optimal estimation (OE) assumes a prior distribution in order to regularize the inversion problem, the SVD approach identifies principal components that can be retrieved from the measurement without explicitly specifying a prior mean and prior covariance matrix. We review the SVD method, explicitly recognize the use of an uninformative prior and show it to incur no bias from the choice of the prior. We also make the connection between the SVD method and the pseudo-inverse, which makes it more intuitive and easy to understand. We illustrate the use of the SVD method on an integrated path differential absorption CO2 lidar measurement model and verify our derivations and bias-free properties versus optimal estimation using numerical simulations. In contrast, traditional OE retrievals exhibit bias when the prior mean used in the retrieval differs from the true mean. Hence, the SVD method is particularly useful for situations in which knowledge of the prior mean and prior covariance of the true state (e.g., greenhouse gas profiles) is inadequate.

Ramanathan, Anand K.↗

A Survey of Singular Value Decomposition Methods and Performance Comparison of Some Available Serial Codes

This contractor report describes a performance comparison of available alternative complete Singular Value Decomposition (SVD) methods and implementations which are suitable for incorporation into point spread function deconvolution algorithms. The report also presents a survey of alternative algorithms, including partial SVD's special case SVD's, and others developed for concurrent processing systems.

Plassman, Gerald E.↗

Synchrophasor Data Compression Under Disturbance Conditions via Cross-Entropy-Based Singular Value Decomposition

The increasing deployment of phasor measurement units and the advances of their reporting rates are challenging the present data centers in terms of storing and analyzing large-volume data. Under power system disturbance conditions, it is difficult to retain critical information while compressing the synchrophasor data effectively. This article combines the cross entropy and the singular value decomposition, proposing a novel model to compress the synchrophasor data to an extremely small size yet keep superior accuracy. The proposed model is extensively tested and compared with the state-of-the-art algorithms using the simulated and the FNET/GridEye field-collected data. The result indicates that the proposed algorithm has superior performance in compressing the data while retaining critical information under disturbance conditions.

42 ENGINEERING↗

Force prediction using singular-value decomposition

Results of a preliminary investigation into a method which can be used to improve the results of an experimental force prediction analysis is presented. The method uses a singular value decomposition technique to reduce measurement noise present in the measured input data matrix. The fundamental theory for the method along with an experimental example is shown. The method is shown to provide encouraging force prediction improvements when the input data matrix contains high levels of measurement noise.

Elliott, K. B.↗

A Singular Value Decomposition Framework for Retrievals with Vertical Distribution Information from Greenhouse Gas Column Absorption Spectroscopy Measurements

We describe a variation of the Optimal Estimation (OE) method for greenhouse gas remote sensing retrievals using a singular value decomposition (SVD) and an uninformative prior. The SVD method is capable of discerning vertical information in column integrated absorption measurements. While traditional Bayesian optimal estimation (OE) assumes a prior distribution in order to regularize the inversion problem, the SVD approach identifies principal components that can be retrieved from the measurement without explicitly specifying a prior mean and prior covariance matrix. We discuss the method, illustrate its use on an integrated path differential absorption CO2 lidar measurement model, and compare it to traditional optimal estimation using numerical simulations. In the absence of forward model error, the mathematics behind the SVD method guarantee it to be bias-free, which is confirmed by the numerical simulations. In contrast, traditional OE retrievals exhibit bias when the prior mean used in the retrieval differs from the true mean. While the SVD approach can be used for most trace gas retrievals, it is particularly useful for situations where prior knowledge of the trace gas profile is poor. The SVD analysis is also useful in illustrating how vertical information is treated by the traditional OE approach.

Ramanathan, Anand K.↗

Singular value decomposition and similarity renormalization group evolution of nuclear interactions

One of the main challenges for ab initio nuclear many-body theory is the growth of computational and storage costs as calculations are extended to heavy, exotic, and structurally complex nuclei. Here, we investigate the factorization of nuclear interactions as a means to address this issue. We perform Singular Value Decompositions of nucleon-nucleon interactions in partial wave representation and study the dependence of the singular value spectrum on interaction characteristics like regularization scheme and resolution scales. We develop and implement the Similarity Renormalization Group (SRG) evolution of the factorized interaction, and demonstrate that this SVD-SRG approach accurately preserves two-nucleon observables. We find that low-resolution interactions allow the truncation of the SVD at low rank, and that a small number of relevant components is sufficient to capture the nuclear interaction and perform an accurate SRG evolution, while the Coulomb interaction requires special consideration. The rank is uniform across all partial waves, and almost independent of the basis choice in the tested cases. This suggests an interpretation of the relevant singular components as mere representations of a small set of abstract operators that can describe the interaction and its SRG flow. Following the traditional workflow for nuclear interactions, we discuss how the transformation between the center-of-mass and laboratory frames creates redundant copies of the partial wave components when implemented in matrix representation, and we discuss strategies for mitigation. Lastly, we test the low-rank approximation to the SRG-evolved interactions in many-body calculations using the In-Medium SRG. By including nuclear radii in our analysis, we verify that the implementation of the SRG using the singular vectors of the interaction does not spoil the evolution of other observables.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Inversion of imaging spectrometry data using singular value decomposition

The use of imaging spectrometers, which acquire data that are both spectrally contiguous images and spatially contiguous spectra, for quantitative remote sensing of the earth is addressed. Such data sets cannot be analyzed fully using either existing spectroscopic or image techniques. Singular value decomposition (SVD) is used here for spectral unmixing and determination of the spatial scales of mixing. It is shown that when it is used to invert the mixing endmember library, SVD allows more insight into library characteristics and more control of the inversion process than other commonly used matrix inversion techniques.

Boardman, Joe W.↗

Eigenvector derivatives of repeated eigenvalues using singular value decomposition

An explicit formula is obtained for the first-order eigenvector derivative that corresponds to the eigenvector of a repeated eigenvalue, in the case of the nonself-adjoint eigenvalue problem. This method applies to the class of nondefective problems whose first eigenvalue derivatives of the repeated eigenvalues are distinct. A singular-value decomposition approach is used to compute four requisite bases for eigenspaces, as well as to keep track of the dimensions of state variables and the conditioning of the state equations.

Lim, Kyong B.↗

Quantum Solver Using Singular Value Decomposition for Computational Fluid Dynamics

Numerical solutions for fluid flow problems are challenging and have been focus of Computational Fluid Dynamics (CFD) research for past several decades. The advent of quantum computing promises exponential speedup in comparison to existing classical methods and alleviate computational constraints posed by CFD problems. Although solutions for most problems of interest in fluid dynamics using quantum computing are distant, recent advances in algorithms, software and hardware provide a path towards realizing this goal. Quantum linear solver algorithms (QLSA) such as Harrow–Hassidim–Lloyd (HHL) and Variational Quantum Linear Solver (VQLS) have been successfully implemented to solve for canonical problems such as Hele-Shaw flow. However, these algorithms still suffer to scale and address problems with ill-conditioned Jacobians. In the current paper, we alleviate these restrictions with a new quantum solver based on Singular Value Decomposition (SVD) and simulate flow past a 2D cylinder. The fidelity of the SVD based quantum solver in predicting the flow past 2D cylinder is computed along with an assessment of errors. Classical and quantum solutions for the flow are compared for different resolutions. Finally, we discuss variation in the solutions based on number of shots used.

Gottiparthi, Kalyan [ORNL] (ORCID:0000000213540255↗

Efficient load measurements using singular value decomposition

Various basic research was performed on efficient load measurement estimation techniques for aircraft structure analysis. An overview is presented of the load measurement problem. Two basic equivalent approaches to load measurement evaluations were considered. Under approach 1, the load values are modeled as depending linearly on the measured values. Under approach 2, the measured values depend linearly on the load values. By using the modern Singular Value Decomposition method, it was shown that under all conditions of the number of loads and number of gages, approach 1 is equivalent to approach 2. By using the conventional normal equation (linear regression) approach, approach 1 is only valid when the number of loads is equal to or greater than the number of gages, while approach 2 is the reverse. Furthermore, except for the case of the number of loads equals the number of gages, the load prediction formulas under the two approaches are not equivalent.

Yao, Kung↗

A multi-point force appropriation method based upon a singular value decomposition approach

Force appropriation methods aim to provide an estimate for the force pattern required to excite a 'pure' normal mode in a vibration test where multiple exciters are available. In this paper, a new method based upon a Singular Value Decompositon approach is presented. The appropriated force vector which minimizes the in-plane response components while maximizing the required quadrature components is found, subject to a fixed force norm. The method can accommodate more transducers than exciters and also more exciters than effective degrees of freedom. The method is demonstrated upon a six degree of freedom theoretical model and it is shown that an estimate for the effective degrees of freedom can be obtained.

Juang, Jer-Nan↗