Rectangular eigenvalue problems

DOI10.1007/S10444-022-09994-8MaRDI QIDQ6386792arXivFDO

Authors Behnam Hashemi, Yuji Nakatsukasa, Lloyd N. Trefethen

Publication date 27 December 2021

Published in arXiv

Full work available at URL https://doi.org/10.1007/S10444-022-09994-8

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Spectral, collocation and related methods for boundary value problems involving PDEs (65N35)

arXiv classification

cs.NAmath.NA

Abstract: Often the easiest way to discretize an ordinary or partial differential equation is by a rectangular numerical method, in which n basis functions are sampled at m>>n collocation points. We show how eigenvalue problems can be solved in this setting by QR reduction to square matrix generalized eigenvalue problems. The method applies equally in the limit "m=infinity" of eigenvalue problems for quasimatrices. Numerical examples are presented as well as pointers to some related literature.

This page was built for publication: Rectangular eigenvalue problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6386792)