Guaranteed Computational Methods for Self-Adjoint Differential Eigenvalue Problems (Paperback)

Lingua: inglese

Editore: Springer Verlag, Singapore, Singapore, 2024

9819735769 / 9789819735761

Da: Grand Eagle Retail, Bensenville, IL, U.S.A.Grand Eagle Retail

Venditore con 5 stelle

Venditore AbeBooks dal 12 ottobre 2005

Brossura

Condizione: Nuovo

EUR 72,76

 Spedizione gratuita 
Spedito in U.S.A.

Quantità: 1 disponibile

Aggiungi al carrello
Resi gratuiti per 30 giorni

Descrizione dell’articolo da parte del venditore

Paperback. 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 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 LehmannGoerisch theorem for the purpose of high-precision eigenvalue bounds, showing its relationship with previously established theorems, such as LehmannMaehly'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 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

Codice articolo 9789819735761

Titolo
Guaranteed Computational Methods for Self-Adjoint Differential Eigenvalue Problems (Paperback)
Autore
Xuefeng Liu
Editore
Springer Verlag, Singapore, Singapore
Anno di pubblicazione
2024
Condizione
new
Rilegatura
Paperback
Lingua
inglese
ISBN 10
9819735769
ISBN 13
9789819735761

Grand Eagle Retail

Bensenville, IL, U.S.A.

Venditore con 5 stelle

Venditore AbeBooks dal 12 ottobre 2005

Tariffe di spedizione nazionale per U.S.A.

ArticoloDa 6 a 14 giorni lavorativiDa 6 a 16 giorni lavorativi
Primo articoloEUR 0,00EUR 0,00
I tempi di consegna sono stabiliti dai venditori e variano in base al corriere e al paese. Gli ordini che devono attraversare una dogana possono subire ritardi e spetta agli acquirenti pagare eventuali tariffe o dazi associati. I venditori possono contattarti in merito ad addebiti aggiuntivi dovuti a eventuali maggiorazioni dei costi di spedizione dei tuoi articoli.

Metodi di pagamento

  • Visa
  • Mastercard
  • American Express
  • Carte Bleue
  • Apple Pay
  • Google Pay

Informazioni sull’azienda del venditore

APOLLO ONLINE CORP.

605 Geddes Street
Wilmington, DE U.S.A. 19805