| book details |

Guaranteed Computational Methods for Self-Adjoint Differential Eigenvalue Problems

By (author) Xuefeng Liu

| on special |

normal price: R 1 857.95

Price: R 1 764.95

| add to trolley |

| book description |

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. Â

| product details |

| other options |

Normally shipped | Available from overseas. Usually dispatched in 14 days
Readership Age |

Normal Price | R 2 473.95
Price | R 2 349.95 | on special |

| add to trolley |

| back |

| your trolley |

To view the items in your trolley please sign in.

| sign in |

| specials |

The Order of Time

Carlo Rovelli
Paperback / softback
224 pages
was: R 295.95
now: R 265.95
Available from overseas. Usually dispatched in 3 to 6 weeks

Originally published in Italian: L'ordine del tempo (Milan: Adelphi Edizioni, 2017).

| more |

| add to trolley |

Helgoland: The Strange and Beautiful Story of Quantum Physics

Carlo Rovelli
Paperback / softback
208 pages
was: R 295.95
now: R 265.95
Available from overseas. Usually dispatched in 3 to 6 weeks

| more |

| add to trolley |

The Coming Wave: AI, Power and Our Future

Mustafa Suleyman
Paperback / softback
352 pages
was: R 295.95
now: R 265.95
Stock is usually dispatched in 6-12 days from date of order

| more |

| add to trolley |