Paper

On computing nearest singular hankel matrices

2005

Created by Alysson Bolognesi Prado at 2019-03-27 14:52:18.0.

Simplified Graph of Associations

Word Cloud

Bibliographic Sets

1

Research Paradigm

Authors

1

Venue

1

Proceedings of the 2005 international symposium on Symbolic and algebraic computation - ISSAC ’05

References

11

Structured Perturbations Part I: Normwise Distances

On Approximate GCDs of Univariate Polynomials

Approximate polynomial greatest common divisors and nearest singular polynomials

Efficient algorithms for computing the nearest polynomial with a real root and related problems

Efficient algorithms for computing the nearest polynomial with constrained roots

Volume I and II)