Can the a.c.s. notion and the GLT theory handle approximated PDEs/FDEs with either moving or unbounded domains?
Andrea Adriani, Alec Jacopo Almo Schiavoni-Piazza, Stefano, Serra-Capizzano, Cristina Tablino-Possio

TL;DR
This paper investigates the use of the a.c.s. notion and GLT theory to analyze approximated PDEs and FDEs on moving or unbounded domains, providing theoretical results, examples, and numerical tests.
Contribution
It extends the a.c.s. concept to handle approximations of PDEs/FDEs on unbounded or moving domains, linking spectral distribution and domain exhaustion.
Findings
Results on spectral distribution of matrix sequences with symbols on unbounded domains.
Extension of a.c.s. concept to sequences with different dimensions.
Numerical tests illustrating the theoretical developments.
Abstract
In the current note we consider matrix-sequences of increasing sizes depending on and equipped with a parameter . For every fixed , we assume that each possesses a canonical spectral/singular values symbol defined on of finite measure, . Furthermore, we assume that is an approximating class of sequences (a.c.s.) for and that with . Under such assumptions and via the notion of a.c.s, we prove results on the canonical distributions of , whose symbol, when it exists, can be defined on the, possibly unbounded, domain of finite or even infinite measure. We then extend the concept of a.c.s. to the case where the approximating sequence has possibly a different dimension than the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsModeling, Simulation, and Optimization
