9789819735761 - guaranteed computational methods for self-adjoint differential eigenvalue problems (springerbriefs in mathematics) von liu, xuefeng (5 Ergebnisse)
- Softcover
Anbieter: Books From California, Simi Valley, CA, USABooks From California
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Gebraucht - Sehr gut
EUR 50,49
EUR 4,37 VersandVersand innerhalb von USAAnzahl: 1 verfügbar
paperback. Zustand: Fine.
- Softcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 59,79
EUR 14,10 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In.
- Softcover
Anbieter: Brook Bookstore, Milano, MI, ItalienBrook Bookstore
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 49,49
EUR 27,99 VersandVersand von Italien nach USAAnzahl: 20 verfügbar
Zustand: new.
Weitere Bilder- Softcover
Anbieter: preigu, Osnabrück, Deutschlandpreigu
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 59,40
EUR 70,00 VersandVersand von Deutschland nach USAAnzahl: 5 verfügbar
Taschenbuch. Zustand: Neu. Guaranteed Computational Methods for Self-Adjoint Differential Eigenvalue Problems | Xuefeng Liu | Taschenbuch | SpringerBriefs in Mathematics | ix | Englisch | 2024 | Springer | EAN 9789819735761 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[do…t]hartmann[at]springer[dot]com | Anbieter: preigu.
- Softcover
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 69,27
EUR 61,15 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 esti…mations 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.
