Guaranteed Computational Methods for Self-Adjoint Differential Eigenvalue Problems

Name: Guaranteed Computational Methods for Self-Adjoint Differential Eigenvalue Problems
Brand: Springer Nature Singapore
SKU: 04764512

Cargando comentarios…

$1,191

$1,072

Envío gratis siempre.

Recíbelo de 2 a 4 días hábiles.

Consulta los términos y condiciones aquí

Comentarios

Cargando el resumen…

Por favor, inicia sesión para escribir un comentario.

Cargando comentarios…

5033547Guaranteed Computational Methods for Self-Adjoint Differential Eigenvalue Problemshttps://www.gandhi.com.mx/guaranteed-computational-methods-for-self-adjoint-differential-eigenvalue-problems-9789819735778/phttps://gandhi.vtexassets.com/arquivos/ids/4579384/image.jpg?v=63854979608537000010721191MXNSpringer Nature SingaporeInStock/Ebooks/This monograph presents a study of newly developed guaranteed computational methodologies for eigenvalue problems of self-adjoint differential operators. It focuses on deriving explicit lower and upper bounds for eigenvalues, as well as explicit estimations for eigenfunction approximations. Such explicit error estimations rely on the finite element method (FEM) along with a new theory of explicit quantitative error estimation, diverging from traditional studies that primarily focus on qualitative results.To achieve quantitative error estimation, the monograph begins with an extensive analysis of the hypercircle method, that is, the PragerSynge theorem. It introduces a novel a priori error estimation technique based on the hypercircle method. This facilitates the explicit estimation of Galerkin projection errors for equations such as Poissons and Stokes, which are crucial for obtaining lower eigenvalue bounds via conforming FEMs.A thorough exploration of the fundamental theory of projection-based explicit lower eigenvalue bounds under a general setting of eigenvalue problems is also offered. This theory is extensively detailed when applied to model eigenvalue problems associated with the Laplace, biharmonic, Stokes, and Steklov differential operators, which are solved by either conforming or non-conforming FEMs.Moreover, there is a detailed discussion on the LehmannGoerisch theorem for the purpose of high-precision eigenvalue bounds, showing its relationship with previously established theorems, such as LehmannMaehlys method and Katos bound. The implementation details of this theorem with FEMs, a topic rarely covered in existing literature, are also clarified.Lastly, the monograph introduces three new algorithms to estimate eigenfunction approximation errors, revealing the potency of classical theorems. Algorithm I extends Birkhoffs result that works for simple eigenvalues to handle clustered eigenvalues, while Algorithm II generalizes the DavisKahan theorem, initially designed for strongly formulated eigenvalue problems, to address weakly formulated eigenvalue problems. Algorithm III utilizes the explicit Galerkin projection error estimation to efficiently handle Galerkin projection-based approximations....4764512Guaranteed Computational Methods for Self-Adjoint Differential Eigenvalue Problems10721191https://www.gandhi.com.mx/guaranteed-computational-methods-for-self-adjoint-differential-eigenvalue-problems-9789819735778/phttps://gandhi.vtexassets.com/arquivos/ids/4579384/image.jpg?v=638549796085370000InStockMXN99999DIEbook20249789819735778_W3siaWQiOiJmN2RmY2EzZi1jNTdkLTRjMTctOGJmNi1jOWI5MWQxMDRmYjQiLCJsaXN0UHJpY2UiOjExOTIsImRpc2NvdW50IjoxMTksInNlbGxpbmdQcmljZSI6MTA3MywiaW5jbHVkZXNUYXgiOnRydWUsInByaWNlVHlwZSI6Ildob2xlc2FsZSIsImN1cnJlbmN5IjoiTVhOIiwiZnJvbSI6IjIwMjUtMDgtMjdUMDY6MDA6MDBaIiwidG8iOiIyMDI1LTA5LTMwVDIzOjU5OjU5WiIsInJlZ2lvbiI6Ik1YIiwiaXNQcmVvcmRlciI6ZmFsc2V9LHsiaWQiOiI0YTQyZDE1Zi1kNGMzLTQ4MDMtYmQ1Ni1lOWU5MmFhZDIyNzIiLCJsaXN0UHJpY2UiOjExOTEsImRpc2NvdW50IjoxMTksInNlbGxpbmdQcmljZSI6MTA3MiwiaW5jbHVkZXNUYXgiOnRydWUsInByaWNlVHlwZSI6Ildob2xlc2FsZSIsImN1cnJlbmN5IjoiTVhOIiwiZnJvbSI6IjIwMjUtMTAtMDFUMDA6MDA6MDBaIiwicmVnaW9uIjoiTVgiLCJpc1ByZW9yZGVyIjpmYWxzZX1d9789819735778_This monograph presents a study of newly developed guaranteed computational methodologies for eigenvalue problems of self-adjoint differential operators. It focuses on deriving explicit lower and upper bounds for eigenvalues, as well as explicit estimations for eigenfunction approximations. Such explicit error estimations rely on the finite element method (FEM) along with a new theory of explicit quantitative error estimation, diverging from traditional studies that primarily focus on qualitative results.To achieve quantitative error estimation, the monograph begins with an extensive analysis of the hypercircle method, that is, the PragerSynge theorem. It introduces a novel a priori error estimation technique based on the hypercircle method. This facilitates the explicit estimation of Galerkin projection errors for equations such as Poissons and Stokes, which are crucial for obtaining lower eigenvalue bounds via conforming FEMs.A thorough exploration of the fundamental theory of projection-based explicit lower eigenvalue bounds under a general setting of eigenvalue problems is also offered. This theory is extensively detailed when applied to model eigenvalue problems associated with the Laplace, biharmonic, Stokes, and Steklov differential operators, which are solved by either conforming or non-conforming FEMs.Moreover, there is a detailed discussion on the LehmannGoerisch theorem for the purpose of high-precision eigenvalue bounds, showing its relationship with previously established theorems, such as LehmannMaehlys method and Katos bound. The implementation details of this theorem with FEMs, a topic rarely covered in existing literature, are also clarified.Lastly, the monograph introduces three new algorithms to estimate eigenfunction approximation errors, revealing the potency of classical theorems. Algorithm I extends Birkhoffs result that works for simple eigenvalues to handle clustered eigenvalues, while Algorithm II generalizes the DavisKahan theorem, initially designed for strongly formulated eigenvalue problems, to address weakly formulated eigenvalue problems. Algorithm III utilizes the explicit Galerkin projection error estimation to efficiently handle Galerkin projection-based approximations....9789819735778_Springer Nature Singaporelibro_electonico_9789819735778_9789819735778Xuefeng LiuInglésMéxico2024-06-25T00:00:00+00:00Springer Nature Singapore