Abstract
A definiteness test for a Hankel matrixR={r i+j } N i,j =0 and its lower submatrixS={r i+j+1 } N−1 i,j =0 is given. The test allows a description of all extensions ofR which preserve definiteness of bothR andS. This description in turn can be used as a definiteness test and it demonstrates a remarkable numerical stability.
Zusammenfassung
Ein Test auf gleichzeitige Definitheit einer HankelmatrixR={r i+j } N i,j =0 und ihrer UntermatrixS={r i+j+1 } N−1 i,j =0 wird angegeben. Er ermöglicht eine Beschreibung aller Erweiterungen vonR, die die Definitheit vonR undS enthalten. Diese Beschreibung wiederum kann als Definitheitstest benutzt werden. Dieser Test zeigt eine bemerkenswerte numerische Stabilität.
Similar content being viewed by others
References
Akhiezer, N. I.: The Classical Moment Problem. University Mathematical Monographs. Edinburgh and London: Oliver and Boyd 1965.
Gohberg, I., Kailath, T., Koltracht, I.: Efficient solution of linear systems of equations with recursive structure. Linear Algebra with Appl.80, 81–113 (1986).
Gohberg, I., Kailath, T., Koltracht, I., Lancaster, P.: Linear complexity parallel algorithms for linear systems of equations with recursive structure. Linear Algebra and Appl.88, 271–315 (1987).
Gottlieb, D.: Numerical Analysis of Spectral Methods. Lectures, Workshop on Numerical Analysis, IMA, University of Minnesota, August 1986.
Lancaster, P., Tismenetsky, M.: The Theory of Matrices with Applications (2nd edition). Orlando: Academic Press 1985.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Koltracht, I., Lancaster, P. A definiteness test for Hankel matrices and their lower submatrices. Computing 39, 19–26 (1987). https://doi.org/10.1007/BF02307710
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02307710