A definiteness test for Hankel matrices and their lower submatrices
From MaRDI portal
Publication:1086322
DOI10.1007/BF02307710zbMath0608.15012OpenAlexW185408925MaRDI QIDQ1086322
Israel Koltracht, Peter Lancaster
Publication date: 1987
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02307710
Hankel matrixStieltjes moment problemnumerically stable definiteness teststability of real polynomials
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Recursively generated weighted shifts and the subnormal completion problem. II ⋮ An efficient order recursive algorithm with a lattice structure for estimating continuous-time AR process parameters ⋮ Generalized Schur parameters and the effects of perturbations ⋮ Efficient algorithm for Toeplitz plus Hankel matrices ⋮ Moment Information for Probability Distributions, Without Solving the Moment Problem. I: Where is the Mode? ⋮ Recursively generated weighted shifts and the subnormal completion problem
Cites Work
This page was built for publication: A definiteness test for Hankel matrices and their lower submatrices