Skip to main content

2011 | OriginalPaper | Buchkapitel

2. Classifications of Recurrence Relations via Subclasses of (H, m)-quasiseparable Matrices

verfasst von : T. Bella, V. Olshevsky, P. Zhlobich

Erschienen in: Numerical Linear Algebra in Signals, Systems and Control

Verlag: Springer Netherlands

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

The results on characterization of orthogonal polynomials and Szegö polynomials via tridiagonal matrices and unitary Hessenberg matrices, respectively, are classical. In a recent paper we observed that tridiagonal matrices and unitary Hessenberg matrices both belong to a wider class of \((H,1)\)-quasiseparable matrices and derived a complete characterization of the latter class via polynomials satisfying certain EGO-type recurrence relations. We also established a characterization of polynomials satisfying three-term recurrence relations via \((H,1)\)-well-free matrices and of polynomials satisfying the Szegö-type two-term recurrence relations via \((H,1)\)-semiseparable matrices. In this paper we generalize all of these results from \(scalar\) (H,1) to the block (H, m) case. Specifically, we provide a complete characterization of \((H,\,m)\)-quasiseparable matrices via polynomials satisfying \(block\) EGO-type two-term recurrence relations. Further, \((H,\,m)\)-semiseparable matrices are completely characterized by the polynomials obeying \(block\) Szegö-type recurrence relations. Finally, we completely characterize polynomials satisfying m-term recurrence relations via a new class of matrices called \((H,\,m)\)-well-free matrices.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
More details on the meaning of these numbers will be provided in Sect. 2.2.1.
 
2
\(A_{12}=A(1:k,k+1:n), k=1,\ldots, n-1\) in the MATLAB notation.
 
3
The parameters \(\mu_k\) associated with the Szegö polynomials are defined by \(\mu_k=\sqrt{1-|\rho_k|^2}\) for \(0\leq|\rho_k|<1\) and \(\mu_k=1\) for \(|\rho_k|=1,\) and since \(|\rho_k|\leq1\) for all \(k,\) we always have \(\mu_k\neq0.\)
 
4
Every \(i\)-th row of B equals the row number \((i-1)\) times \( \rho_{i-1}^{*} / \rho_{i-2}^{*} \mu_{i-1}. \)
 
5
The invertibility of \(b_k\) implies that all \(b_k\) are square \(m\times m\) matrices.
 
Literatur
1.
Zurück zum Zitat Ammar G, Calvetti D, Reichel L (1993) Computing the poles of autoregressive models from the reflection coefficients. In: Proceedings of the Thirty-First Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, October, pp 255–264 Ammar G, Calvetti D, Reichel L (1993) Computing the poles of autoregressive models from the reflection coefficients. In: Proceedings of the Thirty-First Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, October, pp 255–264
2.
3.
Zurück zum Zitat Bakonyi M, Constantinescu T (1992) Schur’s algorithm and several applications. Pitman Research Notes in Mathematics Series, vol 61, Longman Scientific and Technical, Harlow Bakonyi M, Constantinescu T (1992) Schur’s algorithm and several applications. Pitman Research Notes in Mathematics Series, vol 61, Longman Scientific and Technical, Harlow
5.
Zurück zum Zitat Bella T, Eidelman Y, Gohberg I, Koltracht I, Olshevsky V (2007) A Björck-Pereyra-type algorithm for Szegö-Vandermonde matrices based on properties of unitary Hessenberg matrices. Linear Algebra and its Applications (to appear) Bella T, Eidelman Y, Gohberg I, Koltracht I, Olshevsky V (2007) A Björck-Pereyra-type algorithm for Szegö-Vandermonde matrices based on properties of unitary Hessenberg matrices. Linear Algebra and its Applications (to appear)
6.
Zurück zum Zitat Bella T, Eidelman Y, Gohberg I, Koltracht I, Olshevsky V. A fast Björck-Pereyra-like algorithm for solving Hessenberg-quasiseparable-Vandermonde systems (submitted) Bella T, Eidelman Y, Gohberg I, Koltracht I, Olshevsky V. A fast Björck-Pereyra-like algorithm for solving Hessenberg-quasiseparable-Vandermonde systems (submitted)
7.
Zurück zum Zitat Bella T, Eidelman Y, Gohberg I, Olshevsky V, Tyrtyshnikov E. Fast inversion of Hessenberg-quasiseparable Vandermonde matrices (submitted) Bella T, Eidelman Y, Gohberg I, Olshevsky V, Tyrtyshnikov E. Fast inversion of Hessenberg-quasiseparable Vandermonde matrices (submitted)
8.
Zurück zum Zitat Bella T, Eidelman Y, Gohberg I, Olshevsky V. Classifications of three-term and two-term recurrence relations and digital filter structures via subclasses of quasiseparable matrices. SIAM J Matrix Anal (SIMAX) (submitted) Bella T, Eidelman Y, Gohberg I, Olshevsky V. Classifications of three-term and two-term recurrence relations and digital filter structures via subclasses of quasiseparable matrices. SIAM J Matrix Anal (SIMAX) (submitted)
9.
Zurück zum Zitat Bunse-Gerstner A, He CY (1995) On a Sturm sequence of polynomials for unitary Hessenberg matrices. (English summary) SIAM J Matrix Anal Appl 16(4):1043–1055MathSciNetMATHCrossRef Bunse-Gerstner A, He CY (1995) On a Sturm sequence of polynomials for unitary Hessenberg matrices. (English summary) SIAM J Matrix Anal Appl 16(4):1043–1055MathSciNetMATHCrossRef
10.
Zurück zum Zitat Bruckstein A, Kailath T (1986) Some matrix factorization identities for discrete inverse scattering. Linear Algebra Appl 74:157–172MathSciNetMATHCrossRef Bruckstein A, Kailath T (1986) Some matrix factorization identities for discrete inverse scattering. Linear Algebra Appl 74:157–172MathSciNetMATHCrossRef
12.
Zurück zum Zitat Bruckstein A, Kailath T (1987) An inverse scattering framework for several problems in signal processing. IEEE ASSP Mag 4(1):6–20CrossRef Bruckstein A, Kailath T (1987) An inverse scattering framework for several problems in signal processing. IEEE ASSP Mag 4(1):6–20CrossRef
14.
Zurück zum Zitat Eidelman Y, Gohberg I (1999) Linear complexity inversion algorithms for a class of structured matrices. Integr Equ Oper Theory 35:28–52MathSciNetMATHCrossRef Eidelman Y, Gohberg I (1999) Linear complexity inversion algorithms for a class of structured matrices. Integr Equ Oper Theory 35:28–52MathSciNetMATHCrossRef
15.
Zurück zum Zitat Eidelman Y, Gohberg I (2002) A modification of the Dewilde-van der Veen method for inversion of finitestructured matrices. Linear Algebra Appl 343–344:419–450MathSciNetCrossRef Eidelman Y, Gohberg I (2002) A modification of the Dewilde-van der Veen method for inversion of finitestructured matrices. Linear Algebra Appl 343–344:419–450MathSciNetCrossRef
17.
Zurück zum Zitat Eidelman Y, Gohberg I, Olshevsky V (2005) Eigenstructure of Order-One-Quasiseparable Matrices. Three-term and two-term Recurrence Relations. Linear Algebra Appl 405:1–40MathSciNetMATHCrossRef Eidelman Y, Gohberg I, Olshevsky V (2005) Eigenstructure of Order-One-Quasiseparable Matrices. Three-term and two-term Recurrence Relations. Linear Algebra Appl 405:1–40MathSciNetMATHCrossRef
18.
Zurück zum Zitat Geronimus LY (1954) Polynomials orthogonal on a circle and their applications. Amer Math Transl 3:1–78 (Russian original 1948) Geronimus LY (1954) Polynomials orthogonal on a circle and their applications. Amer Math Transl 3:1–78 (Russian original 1948)
19.
Zurück zum Zitat Gragg WB (1982) Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle (in Russian). In : Nikolaev ES (ed) Numerical methods in Linear Algebra. pp. 16–32, Moskow University Press, 1982; English translation: (1993) J Comput Appl Math 46:183–198 Gragg WB (1982) Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle (in Russian). In : Nikolaev ES (ed) Numerical methods in Linear Algebra. pp. 16–32, Moskow University Press, 1982; English translation: (1993) J Comput Appl Math 46:183–198
20.
Zurück zum Zitat Grenader U, Szegö G (1958) Toeplitz forms and Applications. University of California Press, Berkeley Grenader U, Szegö G (1958) Toeplitz forms and Applications. University of California Press, Berkeley
21.
Zurück zum Zitat Kailath T, Porat B (1983) State-space generators for orthogonal polynomials. Prediction theory and harmonic analysis, pp 131–163, North-Holland, Amsterdam-New York Kailath T, Porat B (1983) State-space generators for orthogonal polynomials. Prediction theory and harmonic analysis, pp 131–163, North-Holland, Amsterdam-New York
22.
Zurück zum Zitat Lev-Ari H, Kailath T (1984) Lattice filter parameterization and modeling of nonstationary processes. IEEE Trans Inf Theory 30:2–16MathSciNetMATHCrossRef Lev-Ari H, Kailath T (1984) Lattice filter parameterization and modeling of nonstationary processes. IEEE Trans Inf Theory 30:2–16MathSciNetMATHCrossRef
23.
Zurück zum Zitat Lev-Ari H, Kailath T (1986) Triangular factorization of structured Hermitian matrices. In: Gohberg I (ed) Operator Theory: Advances and Applications, vol. 18. Birkhäuser, Boston, pp 301–324 Lev-Ari H, Kailath T (1986) Triangular factorization of structured Hermitian matrices. In: Gohberg I (ed) Operator Theory: Advances and Applications, vol. 18. Birkhäuser, Boston, pp 301–324
24.
25.
Zurück zum Zitat Olshevsky V (1998) Eigenvector computation for almost unitary Hessenberg matrices and inversion of Szego-Vandermonde matrices via discrete transmission lines. Linear Algebra Appl 285:37–67MathSciNetMATHCrossRef Olshevsky V (1998) Eigenvector computation for almost unitary Hessenberg matrices and inversion of Szego-Vandermonde matrices via discrete transmission lines. Linear Algebra Appl 285:37–67MathSciNetMATHCrossRef
26.
Zurück zum Zitat Olshevsky V (2001) Associated polynomials, unitary Hessenberg matrices and fast generalized Parker-Traub and Bjorck-Pereyra algorithms for Szego-Vandermonde matrices. In: Bini D, Tyrtyshnikov E, Yalamov P (eds) Structured Matrices: Recent Developments in Theory and Computation. NOVA Science Publishers, USA, pp 67–78 Olshevsky V (2001) Associated polynomials, unitary Hessenberg matrices and fast generalized Parker-Traub and Bjorck-Pereyra algorithms for Szego-Vandermonde matrices. In: Bini D, Tyrtyshnikov E, Yalamov P (eds) Structured Matrices: Recent Developments in Theory and Computation. NOVA Science Publishers, USA, pp 67–78
27.
Zurück zum Zitat Regalia PA (1995) Adaptive IIR filtering in signal processing and control. Marcel Dekker, New YorkMATH Regalia PA (1995) Adaptive IIR filtering in signal processing and control. Marcel Dekker, New YorkMATH
28.
Zurück zum Zitat Schur I (1917) Uber potenzreihen, die in Innern des Einheitskrises Beschrnkt Sind. J Reine Angew Math 147:205–232; English translation: Schur I (1986) Methods in Operator Theory and Signal Processing, Gohberg I (ed) Birkhuser, pp 31–89 Schur I (1917) Uber potenzreihen, die in Innern des Einheitskrises Beschrnkt Sind. J Reine Angew Math 147:205–232; English translation: Schur I (1986) Methods in Operator Theory and Signal Processing, Gohberg I (ed) Birkhuser, pp 31–89
29.
Zurück zum Zitat Simon B (2005) Orthogonal polynomials on the unit circle. Part 2. Spectral theory. American Mathematical Society Colloquium Publications, 54, Parts 1 & 2. American Mathematical Society, Providence, RI Simon B (2005) Orthogonal polynomials on the unit circle. Part 2. Spectral theory. American Mathematical Society Colloquium Publications, 54, Parts 1 & 2. American Mathematical Society, Providence, RI
30.
Zurück zum Zitat Stoer J, Bulirsch R (1992) Introduction to numerical analysis. Springer-Verlag, New York, pp 277–301 Stoer J, Bulirsch R (1992) Introduction to numerical analysis. Springer-Verlag, New York, pp 277–301
31.
Zurück zum Zitat Teplyaev AV (1992) The pure point spectrum of random orthogonal polynomials on the circle. Soviet Math Dokl 44:407–411MathSciNet Teplyaev AV (1992) The pure point spectrum of random orthogonal polynomials on the circle. Soviet Math Dokl 44:407–411MathSciNet
Metadaten
Titel
Classifications of Recurrence Relations via Subclasses of (H, m)-quasiseparable Matrices
verfasst von
T. Bella
V. Olshevsky
P. Zhlobich
Copyright-Jahr
2011
Verlag
Springer Netherlands
DOI
https://doi.org/10.1007/978-94-007-0602-6_2

Neuer Inhalt