Resolution enhancement of deconvolved ground penetrating radar images using singular value decomposition
Not Available
Downs, Christine↗
SEARCH · Engineering Papers
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.
Fault diagnosis on railway vehicle bearing based on fast extended singular value decomposition packet
Not Available
Huang, Yan (ORCID:0000000202260928)↗
Solving Transient MIMO Control Inverse Problems using Randomized Truncated Singular Value Decomposition
Explore the source record for details and available documents.
Smith, Chandler Baldwin↗
Regularizing the satellite temperature-retrieval problem through singular-value decomposition of the radiative transfer physics
A new technique is derived for retrieving atmospheric temperature profiles from satellite-measured spectral radiance that appears, in first tests, to effectively circumvent certain difficulties of other well-known and implemented techniques. This method provides an effective manner to avoid numerical instability without having to force the algorithm toward adherence to a priori statistics not dependent on the radiance measurements. This provides the opportunity to obtain more information from satellite sounding instruments, without encountering instabilities owing to overlapping weighting functions.
Thompson, Owen E.↗
Evaluation of a Singular Value Decomposition Approach for Impact Dynamic Data Correlation
Impact dynamic tests are used in the automobile and aircraft industries to assess survivability of occupants during crash, to assert adequacy of the design, and to gain federal certification. Although there is no substitute for experimental tests, analytical models are often developed and used to study alternate test conditions, to conduct trade-off studies, and to improve designs. To validate results from analytical predictions, test and analysis results must be compared to determine the model adequacy. The mathematical approach evaluated in this paper decomposes observed time responses into dominant deformation shapes and their corresponding contribution to the measured response. To correlate results, orthogonality of test and analysis shapes is used as a criterion. Data from an impact test of a composite fuselage is used and compared to finite element predictions. In this example, the impact response was decomposed into multiple shapes but only two dominant shapes explained over 85% of the measured response
Horta, Lucas G.↗
Applications of singular value analysis and partial-step algorithm for nonlinear orbit determination
An adaptive method in which cruise and nonlinear orbit determination problems can be solved using a single program is presented. It involves singular value decomposition augmented with an extended partial step algorithm. The extended partial step algorithm constrains the size of the correction to the spacecraft state and other solve-for parameters. The correction is controlled by an a priori covariance and a user-supplied bounds parameter. The extended partial step method is an extension of the update portion of the singular value decomposition algorithm. It thus preserves the numerical stability of the singular value decomposition method, while extending the region over which it converges. In linear cases, this method reduces to the singular value decomposition algorithm with the full rank solution. Two examples are presented to illustrate the method's utility.
Ryne, Mark S.↗
Spreading Sequence System for Full Connectivity Relay Network
Fully connected uplink and downlink fully connected relay network systems using pseudo-noise spreading and despreading sequences subjected to maximizing the signal-to-interference-plus-noise ratio. The relay network systems comprise one or more transmitting units, relays, and receiving units connected via a communication network. The transmitting units, relays, and receiving units each may include a computer for performing the methods and steps described herein and transceivers for transmitting and/or receiving signals. The computer encodes and/or decodes communication signals via optimum adaptive PN sequences found by employing Cholesky decompositions and singular value decompositions (SVD). The PN sequences employ channel state information (CSI) to more effectively and more securely computing the optimal sequences.
Kwon, Hyuck M.↗
Computationally Efficient Decompositions of Oblique Projection Matrices
Oblique projection matrices arise in problems in weighted least squares, signal processing, and optimization. While these matrices can be potentially very large, their low-rank structure can be exploited for efficient computation. Here, we propose fast and scalable algorithms for computing their eigendecomposition and singular value decomposition (SVD). Numerical experiments that compare our proposed approaches to existing methods, including randomized SVD, are presented. In addition, we test their accuracy on linear systems from equality constrained optimization problems.
97 MATHEMATICS AND COMPUTING↗
Input/output system identification - Learning from repeated experiments
The paper describes three approaches and possible variations for the determination of the Markov parameters for forced response data using general inputs. It is shown that, when the parameters in the solution procedure are bootstrapped, the results can be obtained very efficiently, but the errors propagate throughout all parameters. By arranging the data in a different form and using singular value decomposition, the resulting identified parameters are more accurate, in the least number of successive experiments, at the expense of a large matrix singular value decomposition. When a recursive procedure is employed, the calculations can be performed very efficiently, but the number of repetitions of the experiments is much greater for a given accuracy than for any of the previous approaches. An alternative formulation is proposed to combine the advantages of each of the approaches.
Juang, Jer-Nan↗
CP decomposition for tensors via alternating least squares with QR decomposition
The CP tensor decomposition is used in applications such as machine learning and signal processing to discover latent low-rank structure in multidimensional data. Computing a CP decomposition via an alternating least squares (ALS) method reduces the problem to several linear least squares problems. The standard way to solve these linear least squares subproblems is to use the normal equations, which inherit special tensor structure that can be exploited for computational efficiency. However, the normal equations are sensitive to numerical ill-conditioning, which can compromise the results of the decomposition. In this paper, we develop versions of the CP-ALS algorithm using the QR decomposition and the singular value decomposition, which are more numerically stable than the normal equations, to solve the linear least squares problems. Our algorithms utilize the tensor structure of the CP-ALS subproblems efficiently, have the same complexity as the standard CP-ALS algorithm when the input is dense and the rank is small, and are shown via examples to produce more stable results when ill-conditioning is present. Our MATLAB implementation achieves the same running time as the standard algorithm for small ranks, and we show that the new methods can obtain lower approximation error.
97 MATHEMATICS AND COMPUTING↗
Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition
This report demonstrates satisfactory data compression of SOLPS-ITER simulation output ranging from 2D fields, 1D profiles, and 0D scalar variables with a novel matrix decomposition approach. The singular value decomposition (SVD) scales poorly for large matrix sizes and is unsuited to the application on high dimensional data common to fusion plasma physics simulation. In this work, we employ the columns-submatrix-rows (CUR) matrix factorization technique in order to compute a low-rank approximation up to two orders of magnitude faster than the SVD, but within a nominal L2-norm relative error of ε = 10 –2 . In addition, the CUR approach maintains the original format of the data, in its extracted columns and rows, allowing for interpretable data storage at the original resolution of the simulation. We utilize an iterative algorithm to compute the CUR decomposition of simulation output by maximizing the volume, or linearly independent information content, of a low-rank submatrix contained within the data. Experiments over $\textit{n} × \textit{n}$ randomized test matrices with embedded rank-deficient features show that this maximum volume implementation of CUR matrix approximation has reduced asymptotic computational complexity on the order of n compared to the SVD, which scales approximately as $n^3$. These results show that the CUR technique can be used to effectively select time step snapshots (columns) of over 140 SOLPS-ITER output variables and the associated discretized coordinate timeseries (rows) allowing for reconstruction of the complete simulation dynamics.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
A new technique for deconvolution of data from instruments that make integral measurements, e.g. RIMS on DE-1
A general method for deconvolving an unknown function from integral measurements is described and applied to data from the instrument Retarding Ion Mass Spectrometer (RIMS) aboard the spacecraft Dynamics Explorer 1 (DE-1). The principal features of the method are: (1) it uses objective criteria based upon fundamental statistical principles, i.e. Bayesian statistics; (2) it provides for insertion of prior knowledge in a non-prejudicial, explicit manner through the choice of breakpoints that determine the bicubic spline expansion functions; (3) it prevents random fluctuations from controlling the fit to the data through the use of singular value decomposition and the elimination of small singular values; and (4) it guards agianst the introduction of spurious features into the result by including a penalty function and using the principle of generalized cross validation. Illustrative examples from RIMS data for H(+) and O(+) show that the method provides enhanced accuracy and detail in deconvolving the ion phase space density.
Perez, J. D.↗
A parallel hierarchical blocked adaptive cross approximation algorithm
This article presents a low-rank decomposition algorithm based on subsampling of matrix entries. The proposed algorithm first computes rank-revealing decompositions of submatrices with a blocked adaptive cross approximation (BACA) algorithm, and then applies a hierarchical merge operation via truncated singular value decompositions (H-BACA). The proposed algorithm significantly improves the convergence of the baseline ACA algorithm and achieves reduced computational complexity compared to the traditional decompositions such as rank-revealing QR. Numerical results demonstrate the efficiency, accuracy, and parallel scalability of the proposed algorithm.
97 MATHEMATICS AND COMPUTING↗
CORRLA-RS
The CORRLA-RS package provides a suite of statistical methods for sampling multidimensional distributions and to conduct sensitivity and correlation analysis of large scale data in the Rust programming language. The software provides a unique solution to multidimensional constrained sampling problems utilizing a combination of parallelized Markov Chain Monte Carlo methods and traditional rejection sampling. The sensitivity and correlation analysis methods are backed by a high performance randomized singular value decomposition implementation which enables datasets larger than the random access memory (RAM) size to be analyzed. Additionally, CORRLA-RS implements the active subspace identification method using a KD-Tree and the randomized singular value decomposition acting in concert.
Gurecky, William [Oak Ridge National Laboratory (O↗
Design of Multi-Parameter Steerable Functions Using Cascade Basis Reduction
A new cascade basis reduction method of computing the optimal least-squares set of basis functions steering a given function is presented. The method combines the Lie group-theoretic and the singular value decomposition approaches in such a way that their respective strengths complement each other. Since the Lie group-theoretic approach is used, the set of basis and steering functions computed can be expressed analytically. Because the singular value decomposition method is used, this set of basis and steering functions is optimal in the least-squares sense. Furthermore, the computational complexity in designing basis functions for transformation groups with large numbers of parameters is significantly reduced. The efficiency of the cascade basis reduction method is demonstrated by designing a set of basis functions that steers a Gabor function under the four-parameter linear transformation group.
Teo, P.↗
Active Thermography Based on Tensor Rank Decomposition
Principal Component Thermography applies Singular Value Decomposition (SVD) to post-process data that are derived from active thermographic inspections. SVD provides useful compression of the data and allows for better understanding of substructure and indications of potential damage. In the standard approach, SVD is applied to a certain reshaping of a three-dimensional data stack into a two-dimensional array. This work applies the CANDECOMP-PARAFAC (CP) tensor rank decomposition directly to the three-dimensional data to avoid the initial reshaping step in order to begin to develop an inspection method that can more accurately detect defects in non-homogeneous and anisotropic materials. Tests against simulated data that compare the CP decomposition method with traditional Principal Component Thermography based on SVD are described. Finally, the method of Proper Generalized Decomposition (PGD) is used to derive the CP decomposition, and its performance against other algorithms is also discussed.
Thermography↗
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↗
Accelerating multigrid with streaming chiral SVD for Wilson fermions in lattice QCD
A modification to the setup algorithm for the multigrid preconditioner of Wilson fermions in lattice QCD is presented. A larger basis of test vectors than that used in regular multigrid is calculated by the smoother and truncated by singular value decomposition on the chiral components of the test vectors. The truncated basis is used to form the prolongation and restriction matrices of the multigrid hierarchy. This modification of the setup method is demonstrated to increase the convergence of linear solvers on an anisotropic lattice with m π ≈ 239 MeV from the Hadron Spectrum Collaboration and an isotropic lattice with m π ≈ 220 MeV from the MILC Collaboration. The lattice volume dependence of the method is also examined. Increasing the number of test vectors improves speedup up to a point, but storing these vectors becomes impossible in limited memory resources such as GPUs. To address storage cost, we implement a streaming singular value decomposition of the basis of test vectors on the chiral components and demonstrate a decrease in the number of fine level iterations by a factor of 1.7 for m q ≈ m crit
Iterative methods↗