2019
DOI: 10.1553/etna_vol51s363
|View full text |Cite
|
Sign up to set email alerts
|

On the construction of real non-selfadjoint tridiagonal matrices with prescribed three spectra

Abstract: Non-selfadjoint tridiagonal matrices play a role in the discretization and truncation of the Schrödinger equation in some extensions of quantum mechanics, a research field particularly active in the last two decades. In this article, we consider an inverse eigenvalue problem that consists of the reconstruction of such a real nonselfadjoint matrix from its prescribed eigenvalues and those of two complementary principal submatrices. Necessary and sufficient conditions under which the problem has a solution are p… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
4
0

Year Published

2021
2021
2025
2025

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 13 publications
0
4
0
Order By: Relevance
“…Let us take a typical example of clustered eigenvalues to illustrate. Let α 0 be a 200 × 1 vector and α 0 (i) = i(i ∈ [1,200]) and then construct α ← [ f lip(α 0 ); 0; α 0 ]. Then, repeat α ← [α; α 0 ] by eight times totally.…”
Section: Computing Severely Clustered Eigenvectorsmentioning
confidence: 99%
See 2 more Smart Citations
“…Let us take a typical example of clustered eigenvalues to illustrate. Let α 0 be a 200 × 1 vector and α 0 (i) = i(i ∈ [1,200]) and then construct α ← [ f lip(α 0 ); 0; α 0 ]. Then, repeat α ← [α; α 0 ] by eight times totally.…”
Section: Computing Severely Clustered Eigenvectorsmentioning
confidence: 99%
“…Note these extreme points may not be exactly the same as the envelope vector. We show |γ k |(k ∈ [1,2001]) of Φ in Figure 1. A logarithmic scale on the y-axis has been used to emphasize the small entries.…”
Section: Computing Severely Clustered Eigenvectorsmentioning
confidence: 99%
See 1 more Smart Citation
“…The symmetric tridiagonal matrices often arise as primary data in many computational quantum physical [1,2], mathematical [3][4][5], dynamical [6,7], computational quantum chemical [8,9], signal processing [10], or even medical [11] problems and hence are important. The current software reduces the generalized and the standard symmetric eigenproblems to a symmetric tridiagonal eigenproblem as a common practice [10,12,13].…”
Section: Introductionmentioning
confidence: 99%