A proof via finite elements for Schiffer's conjecture on a regular pentagon (Q827006): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q114228269, #quickstatements; #temporary_batch_1707303357582
RedirectionBot (talk | contribs)
Removed claims
Property / author
 
Property / author: Bartłomiej A. Siudeja / rank
Normal rank
 
Property / author
 
Property / author: Benjamin J. Young / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Călin-Ioan Gheorghiu / rank
Normal rank
 

Revision as of 01:23, 13 February 2024

scientific article
Language Label Description Also known as
English
A proof via finite elements for Schiffer's conjecture on a regular pentagon
scientific article

    Statements

    A proof via finite elements for Schiffer's conjecture on a regular pentagon (English)
    0 references
    0 references
    6 January 2021
    0 references
    The authors show that there exists a Neumann eigenfunction on a regular pentagon that is positive on the boundary and not identically constant. The proof of this result consists in blending ideas from analysis, optimization and numerical analysis (approximation theory techniques), and it is an interesting contribution in its own right. The proof itself is human-readable and fully analytic except for the matrix eigenvalue computations on 20 large matrices from the strategy for computing discrete eigenvalues and from the lower bound estimation for the smallest eigenvalue of a sparse matrix. The excepted part is of course a computed assisted proof. The authors have found a rather short proof certificate for this computed proof, show that it is checkable and adaptable.
    0 references
    Laplacian
    0 references
    2D domain
    0 references
    Neumann eigenproblem
    0 references
    nonconforming finite element
    0 references
    eigenvalue bound
    0 references
    nodal line
    0 references
    learning algorithm
    0 references
    computer proof
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references