Robust Geometric Computation
by Kurt Mehlhorn, Chee Yap
Publisher: New York University 2004
Contents: Introduction to Geometric Nonrobustness; Modes of Numerical Computation; Geometric Computation; Arithmetic Approaches; Geometric Approaches; Exact Geometric Computation; Perturbation; Filters; Algebraic Background; Zero Bounds; Numerical Algebraic Computing; Newton Methods; Curves; Surfaces.
Home page url
Download or read it online for free here:
by Solomon I. Khmelnik, Inna S. Doubson - MiC
Hardware algorithms for computing of all elementary complex variable functions are proposed. Contents: A method 'digit-by-digit'; Decomposition; Compositions; Two-step-by-step operations; Taking the logarithm; Potentiation; and more.
by Ian Craw - University of Aberdeen
The book describes the simplex algorithm and shows how it can be used to solve real problems. It shows how previous results in linear algebra give a framework for understanding the simplex algorithm and describes other optimization algorithms.
by Bertrand Mercier - Tata Institute of Fundamental Research
Contents: Sobolev Spaces; Abstract Variational Problems and Examples; Conforming Finite Element Methods; Computation of the Solution of the Approximate Problem; Problems with an Incompressibility Constraint; Mixed Finite Element Methods; etc.
by C.T. Kelley - SIAM
This book focuses on a small number of methods and treats them in depth. The author provides a complete analysis of the conjugate gradient and generalized minimum residual iterations as well as recent advances including Newton-Krylov methods.