國立高雄大學圖資館 |

Language: English

Back

Guaranteed computational methods for self-adjoint differential eigenvalue problems

Record Type:	Electronic resources : Monograph/item
Title/Author:	Guaranteed computational methods for self-adjoint differential eigenvalue problemsby Xuefeng Liu.
Author:	Liu, Xuefeng.
Published:	Singapore :Springer Nature Singapore :2024.
Description:	ix, 131 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
Subject:	Eigenvalues.
Online resource:	https://doi.org/10.1007/978-981-97-3577-8
ISBN:	9789819735778$q(electronic bk.)

Guaranteed computational methods for self-adjoint differential eigenvalue problems
Liu, Xuefeng.

Guaranteed computational methods for self-adjoint differential eigenvalue problems[electronic resource] /by Xuefeng Liu. - Singapore :Springer Nature Singapore :2024. - ix, 131 p. :ill. (some col.), digital ;24 cm. - SpringerBriefs in mathematics,2191-8201. - SpringerBriefs in mathematics..

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 Prager-Synge 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 Poisson's 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 Lehmann-Goerisch theorem for the purpose of high-precision eigenvalue bounds, showing its relationship with previously established theorems, such as Lehmann-Maehly's method and Kato's 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 Birkhoff's result that works for simple eigenvalues to handle clustered eigenvalues, while Algorithm II generalizes the Davis-Kahan 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.

ISBN: 9789819735778$q(electronic bk.)

Standard No.: 10.1007/978-981-97-3577-8doiSubjects--Topical Terms:

185326
Eigenvalues.

LC Class. No.: QA193

Dewey Class. No.: 512.9436

Guaranteed computational methods for self-adjoint differential eigenvalue problems
LDR:03309nmm a2200325 a 4500 001 676144
003 DE-He213
005 20240813124825.0
006 m d
007 cr nn 008maaau
008 250825s2024 si s 0 eng d
020 $a 9789819735778$q(electronic bk.)
020 $a 9789819735761$q(paper)
024 7 $a 10.1007/978-981-97-3577-8 $2 doi
035 $a 978-981-97-3577-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA193
072 7 $a PBK $2 bicssc
072 7 $a MAT034000 $2 bisacsh
072 7 $a PBK $2 thema
082 0 4 $a 512.9436 $2 23
090 $a QA193 $b .L783 2024
100 1 $a Liu, Xuefeng. $3 739732
245 1 0 $a Guaranteed computational methods for self-adjoint differential eigenvalue problems $h [electronic resource] / $c by Xuefeng Liu.
260 $a Singapore : $b Springer Nature Singapore : $b Imprint: Springer, $c 2024.
300 $a ix, 131 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a SpringerBriefs in mathematics, $x 2191-8201
520 $a 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 Prager-Synge 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 Poisson's 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 Lehmann-Goerisch theorem for the purpose of high-precision eigenvalue bounds, showing its relationship with previously established theorems, such as Lehmann-Maehly's method and Kato's 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 Birkhoff's result that works for simple eigenvalues to handle clustered eigenvalues, while Algorithm II generalizes the Davis-Kahan 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.
650 0 $a Eigenvalues. $3 185326
650 1 4 $a Analysis. $3 273775
650 2 4 $a Functional Analysis. $3 274845
650 2 4 $a Computational Mathematics and Numerical Analysis. $3 274020
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a SpringerBriefs in mathematics. $3 558795
856 4 0 $u https://doi.org/10.1007/978-981-97-3577-8
950 $a Mathematics and Statistics (SpringerNature-11649)