Results 81 to 90 of about 34,257 (101)
Some of the next articles are maybe not open access.
Stable Computation of the CS Decomposition: Simultaneous Bidiagonalization
SIAM Journal on Matrix Analysis and Applications, 2012Since its discovery in 1977, the CS decomposition (CSD) has resisted computation, even though it is a sibling of the well-understood eigenvalue and singular value decompositions. Several algorithms have been developed for the reduced 2-by-1 form of the decomposition, but none have been extended to the complete 2-by-2 form of the decomposition in ...
openaire +2 more sources
Dynamical Aspects of the Bidiagonal Singular Value Decomposition
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.
Percy Deift +3 more
openaire +1 more source
A fast GPU based bidiagonal solver for computational aeroacoustics
Computer Methods in Applied Mechanics and Engineering, 2015 In this work a computational aeroacoustic (CAA) solver used for sound propagation in engineering practice is accelerated on Graphics Processing Units (GPUs).
Zhang Xin +2 more
exaly +2 more sources
One-sided reduction to bidiagonal form [PDF]
Linear Algebra and Its Applications, 2003 We present an idea for reducing a rectangular matrix A to bidiagonal form which is based on the implicit reduction of the symmetric positive semidefinite matrix AtA to tridiagonal form. In other papers we have shown that a method based upon this idea may
Rui Rälhä
exaly +2 more sources
Numerical Linear Algebra with Applications, 2012
SUMMARYA class of sign‐symmetric P‐matrices including all nonsingular totally positive matrices and their inverses as well as tridiagonal nonsingular H‐matrices is presented and analyzed. These matrices present a bidiagonal decomposition that can be used to obtain algorithms to compute with high relative accuracy their singular values, eigenvalues ...
Alvaro Barreras, Juan Manuel Peña 0001
openaire +3 more sources
SUMMARYA class of sign‐symmetric P‐matrices including all nonsingular totally positive matrices and their inverses as well as tridiagonal nonsingular H‐matrices is presented and analyzed. These matrices present a bidiagonal decomposition that can be used to obtain algorithms to compute with high relative accuracy their singular values, eigenvalues ...
Alvaro Barreras, Juan Manuel Peña 0001
openaire +3 more sources
SIAM Journal on Matrix Analysis and Applications, 2003
Summary: The bidiagonalization Lanczos method can be used for computing a few of the largest or smallest singular values and corresponding singular vectors of a large matrix, but the method may encounter some convergence problems. In this paper the convergence of the method is analyzed, showing why it may converge erratically and perhaps fail to ...
Zhongxiao Jia, Datian Niu
openaire +1 more source
Summary: The bidiagonalization Lanczos method can be used for computing a few of the largest or smallest singular values and corresponding singular vectors of a large matrix, but the method may encounter some convergence problems. In this paper the convergence of the method is analyzed, showing why it may converge erratically and perhaps fail to ...
Zhongxiao Jia, Datian Niu
openaire +1 more source
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.
Malihe Mardanpour +1 more
openaire +1 more source
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.
Malihe Mardanpour +1 more
openaire +1 more source
International Journal of Image and Graphics, 2009
This paper presents a new robust reference watermarking scheme based on wavelet packet transform (WPT) and bidiagonal singular value decomposition (bSVD) for copyright protection and authenticity. A small gray scale logo is used as watermark instead of randomly generated Gaussian noise type watermark.
Gaurav Bhatnagar, Balasubramanian Raman
openaire +2 more sources
This paper presents a new robust reference watermarking scheme based on wavelet packet transform (WPT) and bidiagonal singular value decomposition (bSVD) for copyright protection and authenticity. A small gray scale logo is used as watermark instead of randomly generated Gaussian noise type watermark.
Gaurav Bhatnagar, Balasubramanian Raman
openaire +2 more sources
Matrices with Bidiagonal Decomposition, Accurate Computations and Corner Cutting Algorithms
2013Some important classes of matrices admit a factorization known as bidiagonal decomposition. Bidiagonal decompositions can provide natural parameters to perform computations with high relative accuracy.
A. Barreras, J. M. Peña
openaire +1 more source
Optik, 2014
Abstract A new method for face recognition and image compression is presented here. In this method, Lanczos bidiagonalization is combined with sequences of small singular value decompositions. The goal of this method is to perform the truncated singular value decomposition for large matrices.
Xuansheng Wang, Zheqi Lin, Zhen Chen
openaire +1 more source
Abstract A new method for face recognition and image compression is presented here. In this method, Lanczos bidiagonalization is combined with sequences of small singular value decompositions. The goal of this method is to perform the truncated singular value decomposition for large matrices.
Xuansheng Wang, Zheqi Lin, Zhen Chen
openaire +1 more source