Software

Approximate polynomial GCD

Matlab code for fast computation of approximate polynomial GCD. This is an implementation of the fast algorithm described in my thesis and in the paper
A fast algorithm for approximate polynomial gcd based on structured matrix computations (with D.A. Bini).
  • Fastgcd

    • Structured QR

    Fortran 90 code for fast computation of eigenvalues of companion matrices using a structured version of the implicit QR method. This is an implementation of the algorithms described in the paper A Fast Implicit QR Eigenvalue Algorithm for Companion Matrices (with D. A. Bini, Y. Eidelman, L. Gemignani and I. Gohberg).
  • Single shift
  • Double shift

    • Condition geodesics in matrix spaces

    Companion software to the paper The condition metric in the space of rectangular full rank matrices (with J.-P. Dedieu).
  • Condition geodesics.This Matlab code allows to compute condition geodesics in the space of real square nonsingular matrices.
  • Two-by-two positive diagonal condition geodesics.

    		•