Results 61 to 70 of about 475,064 (272)
On tridiagonalization of matrices
Linear Algebra and its Applications, 1988 AbstractWe consider the question: Is every n×n complex matrix unitarily similar to a tridiagonal one? It is shown that the answer is negative if n⩾6, and is affirmative if n=3. Additionally, some positive partial answers and related results are given. For example, (1) every pair of (Hermitian) projections is simultaneously unitarily similar to a pair ...
openaire +2 more sources
Stability of Spectral Types for Jacobi Matrices Under Decaying Random Perturbations [PDF]
, 2007 We study stability of spectral types for semi-infinite self-adjoint tridiagonal matrices under random decaying perturbations. We show that absolutely continuous spectrum associated with bounded eigenfunctions is stable under Hilbert-Schmidt random ...
Breuer, Jonathan, Last, Yoram
core +4 more sources
AIMS Mathematics, 2023 We consider the preconditioned iterative methods for the linear systems arising from the finite volume discretization of spatial balanced fractional diffusion equations where the fractional differential operators are comprised of both Riemann-Liouville ...
Xiaofeng Guo, Jianyu Pan
doaj +1 more source
Eigenvector matrices of symmetric tridiagonals [PDF]
Numerische Mathematik, 1984 A simple test is given for determining whether a given matrix is the eigenvector matrix of an (unknown) unreduced symmetric tridiagonal matrix. A list of known necessary conditions is also provided. A lower bound on the separation between eigenvalues of tridiagonals follows from our Theorem 3.
PARLETT, B.N., Wu, W.-D.
openaire +1 more source
Non-Hermitian β-ensemble with real eigenvalues
AIP Advances, 2013 By removing the Hermitian condition of the so-called β-ensemble of tridiagonal matrices, an ensemble of non-Hermitian random matrices is constructed whose eigenvalues are all real.
O. Bohigas, M. P. Pato
doaj +1 more source
A characterization of tridiagonal matrices
Linear Algebra and its Applications, 1969 The purpose of this paper is to prove that symmetric irreducible tridiagonal matrices and their permutations are the only symmetric matrices (of order n > 2) the rank of which cannot be diminished to less than n - 1 by any change of diagonal elements. The main part of the proof was obtained as a byproduct of a minimum problem solution (cf. [l]).
openaire +2 more sources
The eigenvalues of tridiagonal sign matrices are dense in the spectra of periodic tridiagonal sign operators [PDF]
, 2015 Chandler-Wilde, Chonchaiya and Lindner conjectured that the set of eigenvalues of finite tridiagonal sign matrices ($\pm 1$ on the first sub- and superdiagonal, $0$ everywhere else) is dense in the set of spectra of periodic tridiagonal sign operators on
Böttcher +12 more
core +2 more sources
Quarterly Journal of the Royal Meteorological Society, EarlyView.We study the impact of observation‐error correlations in data assimilation using both a simple idealised system and a more realistic configuration. A spectral analysis of data assimilation in the idealised system allows us to gain insights on the effect of observation‐error correlations, which are then validated using the realistic configuration.
Olivier Goux +4 more
wiley +1 more source
Combined Matrix of a Tridiagonal Toeplitz Matrix
AxiomsIn this work, combined matrices of tridiagonal Toeplitz matrices are studied. The combined matrix is known as the Relative Gain Array in control theory.
Begoña Cantó +2 more
doaj +1 more source
Inversion of tridiagonal matrices
Numerische Mathematik, 1982 This paper presents a simple algorithm for inverting nonsymmetric tridiagonal matrices that leads immediately to closed forms when they exist. Ukita's theorem is extended to characterize the class of matrices that have tridiagonal inverses.
openaire +2 more sources