Results 101 to 110 of about 539,466 (113)

Stable Computation of the CS Decomposition: Simultaneous Bidiagonalization

SIAM Journal on Matrix Analysis and Applications, 2012
Since 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

Accurate computations of matrices with bidiagonal decomposition using methods for totally positive matrices

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

An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition

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

ROBUST REFERENCE-WATERMARKING SCHEME USING WAVELET PACKET TRANSFORM AND BIDIAGONAL-SINGULAR VALUE DECOMPOSITION

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

Matrices with Bidiagonal Decomposition, Accurate Computations and Corner Cutting Algorithms

2013
Some 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

Augmented Lanczos bidiagonalization by small singular value decompositions for face recognition and image compression

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

Dual quaternion singular value decomposition based on bidiagonalization to a dual number matrix using dual quaternion householder transformations

Applied Mathematics Letters
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wenxv Ding, Ying Li 0003, Tao Wang, Musheng Wei   +3 more
openaire   +2 more sources

Accurate bidiagonal decomposition of collocation matrices of weighted ϕ‐transformed systems

Numerical Linear Algebra With Applications, 2020
Beatriz Rubio-Serrano, Esmeralda Mainar, Juan Manuel Pena   +2 more
exaly  

Accurate computations of matrices with bidiagonal decomposition using methods for totally positive matrices

Numerical Linear Algebra With Applications, 2013
Alvaro Barreras, Juan Manuel Pena
exaly  

A Divide-and-Conquer Algorithm for the Bidiagonal SVD

SIAM Journal on Matrix Analysis and Applications, 1995
exaly