2017
DOI: 10.1016/j.jat.2017.04.002
|View full text |Cite
|
Sign up to set email alerts
|

Coefficient stripping in the matricial Nehari problem

Abstract: This note deals with a matricial Schur function arising from a completely indeterminate Nehari problem. The Schur algorithm is characterized by a unilateral shift for a Nehari sequence.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(7 citation statements)
references
References 15 publications
0
7
0
Order By: Relevance
“…The implication (v) ⇒ (iv) can be fully proved by using the authors' results in . Let γ=(γ1,γ2,) be a Nehari sequence.…”
Section: Proof and Relevant Resultsmentioning
confidence: 90%
See 4 more Smart Citations
“…The implication (v) ⇒ (iv) can be fully proved by using the authors' results in . Let γ=(γ1,γ2,) be a Nehari sequence.…”
Section: Proof and Relevant Resultsmentioning
confidence: 90%
“…So, it is associated with a Schur function fn, via a measure μn satisfying . Then, by [, Theorem 1.1], the functions f0,f1,f2, obey Schur's algorithm with a constraint κnLhLfalse(0false)>0,hRfalse(0false)κnR>0.As before, κnL and κnR are the leading coefficients of the orthonormal polynomials φnL and φnR for μ=μ0, and the constraint uniquely determines ρnL and ρnR. By simple computation, the formula can be inverted as fn=ρnR*1true(zfn+1ζn*true)(1ζnzfn+1)1ρnL,where ζn=ρnLαn*{(ρnR)*}1={(ρnL)…”
Section: Proof and Relevant Resultsmentioning
confidence: 99%
See 3 more Smart Citations