Skip to search formSkip to main contentSkip to account menu

Bidiagonal matrix

In mathematics, a bidiagonal matrix is a matrix with non-zero entries along the main diagonal and either the diagonal above or the diagonal below… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
BidiagonalizationLAPACKList of numerical analysis topicsQR algorithm

Broader (1)

Linear algebra

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Analysis and Design of a New Dispersion Relation Preserving Alternate Direction Bidiagonal Compact Scheme
In the present work bidiagonal schemes have been analyzed first by using global spectral analysis for wave propagation problem… 
2012
2012
Error analysis of the mdLVs algorithm for computing bidiagonal singular values
Some of the authors show in Iwasaki and Nakamura (Inverse Probl 20:553–563, 2004) that the integrable discrete Lotka–Volterra… 
2011
2011
The inverse eigenvalue problem for symmetric quasi anti-bidiagonal matrices
2011
2011
Implementation and performance evaluation of new inverse iteration algorithm with Householder transformation in terms of the compact WY representation
A new inverse iteration algorithm that can be used to compute all the eigenvectors of a real symmetric tridiagonal matrix on… 
2009
2009
2-D FIR discrete bidiagonal filters: Minimal circuit and state space realization
In this paper 2-D circuit and state space realizations are presented for FIR bidiagonal discrete 2-D filters/systems. The… 
2009
2009
Robust Reference-Watermarking Scheme Using Wavelet Packet Transform and Bidiagonal-Singular Value Decomposition
This paper presents a new robust reference watermarking scheme based on wavelet packet transform (WPT) and bidiagonal singular… 
2005
2005
On Symmetric Eigenproblems Induced by the Bidiagonal SVD
The relatively robust representations (RRR) algorithm is the method of choice to compute highly accurate eigenvector… 
1995
1995
An efficient and accurate parallel algorithm for the singular value problem of bidiagonal matrices
Summary. In this paper we propose an algorithm based on Laguerre's iteration, rank two divide-and-conquer technique and a hybrid… 
1994
1994
Parallel Tri- and Bi-Diagonalization of Bordered Bidiagonal Matrices
1989
1989
Bidiagonal factorization of Fourier matrices and systolic algorithms for computing discrete Fourier transforms
An algorithm is presented for factoring Fourier matrices into products of bidiagonal matrices. These factorizations have the same… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)