2011
DOI: 10.3103/s1066369x11110107
|View full text |Cite
|
Sign up to set email alerts
|

Spectra of discrete symplectic eigenvalue problems with separated boundary conditions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…We call n a node of u if u(n) = 0 or a(n)u(n)u(n + 1) > 0 (1. 3) and say that a node n of u lies between m and l if either m < n < l or if n = m and u(m) = 0. The number of nodes of u between m and l is denoted as # (m,l) (u).…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…We call n a node of u if u(n) = 0 or a(n)u(n)u(n + 1) > 0 (1. 3) and say that a node n of u lies between m and l if either m < n < l or if n = m and u(m) = 0. The number of nodes of u between m and l is denoted as # (m,l) (u).…”
Section: Introductionmentioning
confidence: 99%
“…For the case of Dirac operators see Stadler and Teschl in [14]. For extensions to symplectic eigenvalue problems see Elyseeva [3][4][5].…”
Section: Introductionmentioning
confidence: 99%