A multiplication operator on a Hilbert space may be approximated with finite sections by choosing an orthonormal basis of the Hilbert space. Multiplication operators with nonzero symbols, defined on L2 spaces of functions, are never compact and then such approximations cannot converge in the norm topology. Instead, we consider how well the spectra of the finite sections approximate the spectrum of the multiplication operator whose expression is simply given by the essential range of the symbol (i.e. the multiplier). We discuss the case of real orthogonal polynomial bases and the relations with the classical Fourier basis whose choice leads to the well studied Toeplitz case. Indeed, the asymptotic approximation of the spectrum by the spectra of the associated Toeplitz sections is possible only under precise geometric assumptions on the range of the symbol. Conversely, the use of circulant approximations leads to constructive algorithms, with O(N log(N)) complexity (N = number of sections), working in general and generalizable to the separable multivariate and matrix-valued cases as well.

### The spectral approximation of multiplication operators via asymptotic (structured) linear algebra

#### Abstract

A multiplication operator on a Hilbert space may be approximated with finite sections by choosing an orthonormal basis of the Hilbert space. Multiplication operators with nonzero symbols, defined on L2 spaces of functions, are never compact and then such approximations cannot converge in the norm topology. Instead, we consider how well the spectra of the finite sections approximate the spectrum of the multiplication operator whose expression is simply given by the essential range of the symbol (i.e. the multiplier). We discuss the case of real orthogonal polynomial bases and the relations with the classical Fourier basis whose choice leads to the well studied Toeplitz case. Indeed, the asymptotic approximation of the spectrum by the spectra of the associated Toeplitz sections is possible only under precise geometric assumptions on the range of the symbol. Conversely, the use of circulant approximations leads to constructive algorithms, with O(N log(N)) complexity (N = number of sections), working in general and generalizable to the separable multivariate and matrix-valued cases as well.
##### Scheda breve Scheda completa Scheda completa (DC)
2007
Fourier basis; Multiplication operator; Orthogonal polynomials; Symbol; Toeplitz (and Generalized Locally Toeplitz) sequences
SERRA CAPIZZANO, Stefano
File in questo prodotto:
Non ci sono file associati a questo prodotto.

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: `https://hdl.handle.net/11383/4713`
• ND
• 4
• 4