Sparsity optimized high order finite element functions for H(div) on simplices (Q455677): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
The authors investigate the space of vector valued-functions with square-integrable divergence and conforming \(h_p\) finite element discretization for open bounded Lipschitz domains \(\Omega\subset \mathbb R^d\) with \(d=2,3\). A new set of of basis functions for \(H\)(div)-conforming \(h_p\) finite element spaces, which yields an optimal sparsity pattern for system matrices derived from the discretization of some convenient bilinear form, is introduced. The construction of basis functions relies on some known construction principles in the literature which concerns the sparsity of \(H\)(div))-conforming discretizations. More precise, the construction principles are related to the use of Raviart-Thomas elements, mixed-weighted Jacobi polynomials, and Dubiner basis. This construction implies the \(L_2\) orthogonality of the fluxes of the basis. The proof of sparsity of the mass matrix requires some symbolic computation. The stated finite element basis form a hierarchical set of \(H\)(div)-conforming basis functions and hence are applicable also in general settings on unstructured (curved) simplicial meshes.
Property / review text: The authors investigate the space of vector valued-functions with square-integrable divergence and conforming \(h_p\) finite element discretization for open bounded Lipschitz domains \(\Omega\subset \mathbb R^d\) with \(d=2,3\). A new set of of basis functions for \(H\)(div)-conforming \(h_p\) finite element spaces, which yields an optimal sparsity pattern for system matrices derived from the discretization of some convenient bilinear form, is introduced. The construction of basis functions relies on some known construction principles in the literature which concerns the sparsity of \(H\)(div))-conforming discretizations. More precise, the construction principles are related to the use of Raviart-Thomas elements, mixed-weighted Jacobi polynomials, and Dubiner basis. This construction implies the \(L_2\) orthogonality of the fluxes of the basis. The proof of sparsity of the mass matrix requires some symbolic computation. The stated finite element basis form a hierarchical set of \(H\)(div)-conforming basis functions and hence are applicable also in general settings on unstructured (curved) simplicial meshes. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Abdallah Bradji / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65N30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65N22 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65N50 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 35J25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6097147 / rank
 
Normal rank
Property / zbMATH Keywords
 
finite element methods
Property / zbMATH Keywords: finite element methods / rank
 
Normal rank
Property / zbMATH Keywords
 
sparsity
Property / zbMATH Keywords: sparsity / rank
 
Normal rank
Property / zbMATH Keywords
 
high order finite element functions
Property / zbMATH Keywords: high order finite element functions / rank
 
Normal rank
Property / zbMATH Keywords
 
simplices
Property / zbMATH Keywords: simplices / rank
 
Normal rank
Property / zbMATH Keywords
 
\(H\)(div))-conforming discretizations
Property / zbMATH Keywords: \(H\)(div))-conforming discretizations / rank
 
Normal rank
Property / zbMATH Keywords
 
Raviart-Thomas elements
Property / zbMATH Keywords: Raviart-Thomas elements / rank
 
Normal rank
Property / zbMATH Keywords
 
Jacobi polynomials
Property / zbMATH Keywords: Jacobi polynomials / rank
 
Normal rank
Property / zbMATH Keywords
 
Dubiner basis
Property / zbMATH Keywords: Dubiner basis / rank
 
Normal rank

Revision as of 12:31, 30 June 2023

scientific article
Language Label Description Also known as
English
Sparsity optimized high order finite element functions for H(div) on simplices
scientific article

    Statements

    Sparsity optimized high order finite element functions for H(div) on simplices (English)
    0 references
    0 references
    0 references
    0 references
    22 October 2012
    0 references
    The authors investigate the space of vector valued-functions with square-integrable divergence and conforming \(h_p\) finite element discretization for open bounded Lipschitz domains \(\Omega\subset \mathbb R^d\) with \(d=2,3\). A new set of of basis functions for \(H\)(div)-conforming \(h_p\) finite element spaces, which yields an optimal sparsity pattern for system matrices derived from the discretization of some convenient bilinear form, is introduced. The construction of basis functions relies on some known construction principles in the literature which concerns the sparsity of \(H\)(div))-conforming discretizations. More precise, the construction principles are related to the use of Raviart-Thomas elements, mixed-weighted Jacobi polynomials, and Dubiner basis. This construction implies the \(L_2\) orthogonality of the fluxes of the basis. The proof of sparsity of the mass matrix requires some symbolic computation. The stated finite element basis form a hierarchical set of \(H\)(div)-conforming basis functions and hence are applicable also in general settings on unstructured (curved) simplicial meshes.
    0 references
    finite element methods
    0 references
    sparsity
    0 references
    high order finite element functions
    0 references
    simplices
    0 references
    \(H\)(div))-conforming discretizations
    0 references
    Raviart-Thomas elements
    0 references
    Jacobi polynomials
    0 references
    Dubiner basis
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references