We propose a fast and numerically robust algorithm based on structured numerical linear algebra technology for the computation of the zeros of an analytic function inside the unit circle in the complex plane. At the core of our method there are two matrix algorithms: (a) a fast reduction of a certain linearization of the zerofinding problem to a matrix eigenvalue computation involving a perturbed CMV--like matrix and (b) a fast variant of the QR eigenvalue algorithm suited to exploit the structural properties of this latter matrix. We illustrate the reliability of the proposed method by several numerical examples.

Zerofinding of analytic functions by structured matrix methods

GEMIGNANI, LUCA
2016

Abstract

We propose a fast and numerically robust algorithm based on structured numerical linear algebra technology for the computation of the zeros of an analytic function inside the unit circle in the complex plane. At the core of our method there are two matrix algorithms: (a) a fast reduction of a certain linearization of the zerofinding problem to a matrix eigenvalue computation involving a perturbed CMV--like matrix and (b) a fast variant of the QR eigenvalue algorithm suited to exploit the structural properties of this latter matrix. We illustrate the reliability of the proposed method by several numerical examples.
File in questo prodotto:
File Dimensione Formato  
anal_1_rev.pdf

accesso aperto

Tipologia: Documento in Post-print
Licenza: Creative commons
Dimensione 372.34 kB
Formato Adobe PDF
372.34 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11568/750896
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact