Results 91 to 100 of about 539,466 (113)
Studies on a Parallel Algorithm for Bidiagonal Singular Value Decomposition
Studies on a Parallel Algorithm for Bidiagonal Singular Value Decompositionopenaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
More Accurate Bidiagonal Reduction for Computing the Singular Value Decomposition
SIAM Journal on Matrix Analysis and Applications, 2002As a preliminary stage for computing the singular value decomposition of a matrix \(A \in R^{m \times n}\) (\(m \geq n\)) the reduction of \(A\) to a bidiagonal form is discussed, i.e. one has to find orthogonal matrices \(U \in R^{n \times n}\) and \(V \in R^{m \times m}\) such that \(U^T A^T V = (B 0)\) with a bidiagonal \((n \times n)\) matrix \(B\).
Jesse L Barlow
exaly +3 more sources
Singular value decomposition for bidiagonal filter matrices
Applied Mathematics and Computation, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jesus Gutierrez-Gutierrez +1 more
exaly +2 more sources
Dynamical Aspects of the Bidiagonal Singular Value Decomposition
Mathematical Sciences Research Institute Publications, 1991In this paper we describe some striking stability properties of the singular value decomposition (SVD) of a bidiagonal matrix and of the Hamiltonian flow which interpolates the standard SVD algorithm at integer times.
Luen-Chau Li +2 more
exaly +2 more sources
AEU - International Journal of Electronics and Communications, 2016
Abstract Watermarking, means hiding data in digital medium such as image, is a good solution for copyright protection and authentication. Watermarking methods must have a good resistance again various attacks. Wavelet based techniques, due to their compatibility with the human visual system, have been used frequently in this area.
Mohammad Ali Zare Chahooki
exaly +2 more sources
Abstract Watermarking, means hiding data in digital medium such as image, is a good solution for copyright protection and authentication. Watermarking methods must have a good resistance again various attacks. Wavelet based techniques, due to their compatibility with the human visual system, have been used frequently in this area.
Mohammad Ali Zare Chahooki
exaly +2 more sources
Accurate Singular Values of Bidiagonal Matrices
SIAM Journal on Scientific and Statistical Computing, 1990 omputing the singular values of a bidiagonal matrix is the fin al phase of the standard algow rithm for the singular value decomposition of a general matrix.
James Demmel, W Kahan
exaly +1 more source
Computing the Bidiagonal SVD Using Multiple Relatively Robust Representations
SIAM Journal on Matrix Analysis and Applications, 2006 We describe the design and implementation of a new algorithm for computing the singular value decomposition (SVD) of a real bidiagonal matrix. This algorithm uses ideas developed by Grosser and Lang that extend Parlett's and Dhillon's multiple relatively
Bruno Lang, Christof Vomel
exaly +2 more sources
A new stable bidiagonal reduction algorithm [PDF]
Linear Algebra and Its Applications, 2005 A new bidiagonal reduction method is proposed for X∈Rm×n. For m⩾n, it decomposes X into the product X=UBVT where U∈Rm×n has orthonormal columns, V∈Rn×n is orthogonal, and B∈Rn×n is upper bidiagonal.
Zlatko Drmač +2 more
exaly +2 more sources