Recursive relations for block Hankel and Toeplitz systems. Part I: Direct recursions
From MaRDI portal
In Math. Comput. 35, 875-892 (1980; Zbl 0442.41017) the author described a number of recursive algorithms for the matrix Padé table. In this paper he gives formulas for taking arbitrary steps in these tables. In particular, a set of formulas is given for the relations that exist between the first and last block row or column of a block Hankel or Toeplitz matrix and their relation to a matrix Padé table.
Recommendations
Cited in
(6)- Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems
- Multivariate homogeneous two-point Padé approximants and continued fractions
- scientific article; zbMATH DE number 4050856 (Why is no real title available?)
- Matrix interpretation of multiple orthogonality
- Recursive relations for block Hankel and Toeplitz systems. II: Dual recursions
- Parallel and superfast algorithms for Hankel systems of equations
This page was built for publication: Recursive relations for block Hankel and Toeplitz systems. Part I: Direct recursions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q794136)