Books in the Computer Science and Scientific Computing series

Covers the key areas of computer science, including recursive function theory, formal languages, and automata. This book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability. It also covers in a variety of different arrangements automata theory, computational logic, and complexity theory.

This text is concerned primarily with the theory of linear and nonlinear programming, and a number of closely-related problems, and with algorithms appropriate to those problems. The first section discusses the simplex algorithm and the second looks at specific problems and their solutions.

This book is a survey of matrix perturbation theory. In particular, the authors cover perturbation theory of linear systems and least square problems, the eigenvalue problem, and the generalized eigenvalue problem as well as a treatment of vector and matrix norms, including the theory of unitary invariant norms.