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

From MaRDI portal
scientific article
Language Label Description Also known as
English
The spectral approximation of multiplication operators via asymptotic (structured) linear algebra
scientific article

    Statements

    The spectral approximation of multiplication operators via asymptotic (structured) linear algebra (English)
    0 references
    6 June 2007
    0 references
    Suppose \(\phi\) is a bounded function defined on a compact set \(K\) of \(\mathbb R^d\), \(d\geq 1\). Consider the multiplication operator \(M[\phi]\) defined on \(L_w^2(K)\) by \(M[\phi]h=\phi h\), \(h\in L_w^2(K)\), where \(w\) is a suitable weight function. The problem under consideration is to know how well the spectrum of \(M[\phi]\) is approximated by the eigenspectrum of its finite section, namely the \(N\times N\) matrix \(M_N[\phi]:=(\langle M[\phi]e_j, e_i\rangle)\) based on an orthonormal basis \(\{e_j\}\) of \(L_w^2(K)\). Using the classical Fourier complex exponential basis, the problem is reduced to the Toeplitz case. The author discusses how the case of a general real orthonormal basis on \(K=[-1, 1]\) can be reduced to the Fourier case and how the resulting Toeplitz case can be reduced to the so called circulant case in which that transform is the fast Fourier transform, and thus, the general case can be translated into a problem of (asymptotic) structured numerical linear algebra for wich an accurate solution can be determined with a low computational cost, namely, with \(O(N \log(N))\) complexity where \(N\) being the number of sections.
    0 references
    0 references
    0 references
    0 references
    0 references
    multiplication operator
    0 references
    orthogonal polynomials
    0 references
    Fourier basis
    0 references
    Toeplitz (and generalized locally Toeplitz) sequences
    0 references
    symbol
    0 references
    eigenspectrum
    0 references
    finite section
    0 references
    fast Fourier transform
    0 references
    complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references