Skip to search formSkip to main contentSkip to account menu

Wilkinson matrix

In linear algebra, Wilkinson matrices are symmetric, tridiagonal, order-N matrices with pairs of nearly, but not exactly, equal eigenvalues. It is… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
Linear algebraList of numerical analysis topicsSignal processing

Broader (1)

Numerical linear algebra

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Performance Improvement of Orthogonal Matching Pursuit Based on Wilkinson Matrix for Block Compressive Sensing
Compressed sensing is a new paradigm to sample compressible signals below the Nyquist rate, whilst still allowing near optimal… 
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… 
2010
2010
A NOTE ON CONVERGENCE OF WILKINSON MATRIX WITH PROJECTION METHOD
An attempt has made in this paper to describe an efficient method for solving a system of linear equations with non-zero rows… 
1995
1995
On close eigenvalues of tridiagonal matrices
  • Q. Ye
  • 1995
  • Corpus ID: 123908355
Summary. A symmetric tridiagonal matrix with a multiple eigenvalue must have a zero subdiagonal element $\beta_i$ and must be a… 
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)