On computing nearest singular Hankel matrices

DOI10.1145/1073884.1073909zbMATH Open1360.65124OpenAlexW2091177168MaRDI QIDQ5262759FDOQ5262759

M. Hitz

Publication date: 16 July 2015

Published in: Proceedings of the 2005 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1073884.1073909

Recommendations

• scientific article
• On the Nearest Singular Matrix Pencil
• scientific article; zbMATH DE number 1974611
• Solving Hankel matrix approximation problem using semidefinite programming
• Nearest rank deficient matrix polynomials

zbMATH Keywords

Toeplitz matrixHankel matrixnearest singular matrixparametric minimizationhybrid symbolic/numeric computing

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cited In (1)

• On the Nearest Singular Matrix Pencil

This page was built for publication: On computing nearest singular Hankel matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262759)