2020
DOI: 10.1002/nla.2302
|View full text |Cite
|
Sign up to set email alerts
|

Spectral analysis of Pk Finite Element matrices in the case of Friedrichs–Keller triangulations via Generalized Locally Toeplitz technology

Abstract: SummaryIn the present article, we consider a class of elliptic partial differential equations with Dirichlet boundary conditions and where the operator is div(−a(x)∇·), with a continuous and positive over , Ω being an open and bounded subset of , d≥1. For the numerical approximation, we consider the classical Finite Elements, in the case of Friedrichs–Keller triangulations, leading, as usual, to sequences of matrices of increasing size. The new results concern the spectral analysis of the resulting matrix‐se… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
7
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(7 citation statements)
references
References 43 publications
0
7
0
Order By: Relevance
“…In particular, block GLT sequences are encountered in the discretization of vectorial DEs (systems of scalar DEs) as well as in the higher-order finite element or discontinuous Galerkin approximation of scalar DEs. We refer the reader to [50,Section 10.5], [51,Section 7.3], and [20,49,75,76] for applications of the theory of GLT sequences in the context of finite difference (FD) discretizations of DEs; to [50,Section 10.6], [51,Section 7.4], and [10,20,42,49,57,67,76] for the finite element (FE) case; to [12] for the finite volume (FV) case; to [50,Section 10.7], [51,, and [36,45,46,47,48,52,57,68] for the case of isogeometric analysis (IgA) discretizations, both in the collocation and Galerkin frameworks; and to [40] for a further application to fractional DEs. We also refer the reader to [50,Section 10.4] and [1,72] for a look at the GLT approach for sequences of matrices arising from IE discretizations.…”
mentioning
confidence: 99%
“…In particular, block GLT sequences are encountered in the discretization of vectorial DEs (systems of scalar DEs) as well as in the higher-order finite element or discontinuous Galerkin approximation of scalar DEs. We refer the reader to [50,Section 10.5], [51,Section 7.3], and [20,49,75,76] for applications of the theory of GLT sequences in the context of finite difference (FD) discretizations of DEs; to [50,Section 10.6], [51,Section 7.4], and [10,20,42,49,57,67,76] for the finite element (FE) case; to [12] for the finite volume (FV) case; to [50,Section 10.7], [51,, and [36,45,46,47,48,52,57,68] for the case of isogeometric analysis (IgA) discretizations, both in the collocation and Galerkin frameworks; and to [40] for a further application to fractional DEs. We also refer the reader to [50,Section 10.4] and [1,72] for a look at the GLT approach for sequences of matrices arising from IE discretizations.…”
mentioning
confidence: 99%
“…Furthermore, a generalization of the previous result in higher dimension is given in [8] and is reported in the subsequent theorem.…”
Section: Structure Of the Matrices And Spectral Analysismentioning
confidence: 60%
“…We remind that a similar analysis is carried out in [8] for the finite approximations P k for k ≥ 2 and for d = 2: the analysis for d = 1 is contained in [3] trivially because Q k ≡ P k for every k ≥ 1, while, for d = 2, and even more for d ≥ 3, the situation is greatly complicated by the fact that we do not encounter a tensor structure. Nevertheless, the picture is quite similar and the obtained information in terms of spectral symbol is sufficient for deducing a quite accurate analysis concerning the distribution and the extremal behavior of the eigenvalues of the resulting matrix-sequences.…”
Section: Introductionmentioning
confidence: 98%
See 1 more Smart Citation
“…Experience reveals that virtually any kind of numerical method for the discretization of PDEs gives rise to structured matrices A n whose asymptotic spectral distribution, as the meshfineness parameter n tends to infinity, can be computed through the theory of GLT sequences. We refer the reader to [40,Section 10.5], [41,Section 7.3], and [16,62,63] for applications of the theory of GLT sequences in the context of finite difference (FD) discretizations of PDEs; to [40,Section 10.6], [41,Section 7.4], and [11,16,33,55,63] for the finite element (FE) case; to [13] for the finite volume (FV) case; to [40,Section 10.7], [41,, and [27,35,36,37,38,56] for the case of isogeometric analysis (IgA) discretizations, both in the collocation and Galerkin frameworks; and to [31] for a further application to fractional differential equations. We also refer the reader to [40,Section 10.4] and [1,59] for a look at the GLT approach for sequences of matrices arising from IE discretizations.…”
mentioning
confidence: 99%