Skip to main content

Books in Mathematics

The Mathematics collection presents a range of foundational and advanced research content across applied and discrete mathematics, including fields such as Computational Mathematics; Differential Equations; Linear Algebra; Modelling & Simulation; Numerical Analysis; Probability & Statistics.

  • Linear Programs and Related Problems

    • 1st Edition
    • October 12, 1992
    • Evar D. Nering + 1 more
    • English
    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. In the first part of the book, the authors introduce the concept of duality which serves as a unifying concept throughout the book. The simplex algorithm is presented along with modifications and adaptations to problems with special structures. Two alternative algorithms, the ellipsoidal algorithm and Karmarker's algorithm, are also discussed, along with numerical considerations. the second part of the book looks at specific types of problems and methods for their solution. This book is designed as a textbook for mathematical programming courses, and each chapter contains numerous exercises and examples.
  • HP 48SX Engineering Mathematics Library

    An Introduction to Symbolic and Complex Computation with Applications
    • 1st Edition
    • October 12, 1992
    • John F. Holland
    • English
    When surveying the computer technology available for working out mathematical problems, one fact quickly becomes apparent-most personal and super- computers are not designed for computation. Without the aid of costly and often only partially compatible software programs, most computer operating systems cannot perform mathematical computations. Mathematics textbooks and handbooks provide useful equations, but they do not offer accessible means for evaluation. The HP48SX, an object-oriented computer containing a custom CPU and operating system, is designed specifically for this task. With a low-cost computer chip and an inexpensive calculator, the HP 48SX Engineering Mathematics Library: An Introduction to Symbolic and Complex Computation with Applications package offers users an affordable and versatile alternative for solving simple and complex problems.
  • Regenerative Stochastic Simulation

    • 1st Edition
    • October 1, 1992
    • Gerald S. Shedler
    • English
    Simulation is a controlled statistical sampling technique that can be used to study complex stochastic systems when analytic and/or numerical techniques do not suffice. The focus of this book is on simulations of discrete-event stochastic systems; namely, simulations in which stochastic state transitions occur only at an increasing sequence of random times. The discussion emphasizes simulations on a finite or countably infinite state space.
  • Academic Press Dictionary of Science and Technology

    • 1st Edition
    • August 27, 1992
    • Christopher G. Morris
    • English
    The Academic Press Dictionary of Science and Technology is the most comprehensive, authoritative dictionary of science available. Covering 124 fields of science, the Dictionary will make a handsome addition to your reference collection.
  • Combinatorics '90

    Recent Trends and Applications
    • 1st Edition
    • Volume 52
    • August 17, 1992
    • A. Barlotti + 3 more
    • English
    This volume forms a valuable source of information on recent developments in research in combinatorics, with special regard to the geometric point of view. Topics covered include: finite geometries (arcs, caps, special varieties in a Galois space; generalized quadrangles; Benz planes; foundation of geometry), partial geometries, Buekenhout geometries, transitive permutation sets, flat-transitive geometries, design theory, finite groups, near-rings and semifields, MV-algebras, coding theory, cryptography and graph theory in its geometric and design aspects.
  • Real Reductive Groups II

    • 1st Edition
    • Volume 132II
    • August 6, 1992
    • English
  • Group Representations Volume 1 Part B

    Introduction to Group Representations and Characters
    • 1st Edition
    • Volume 1
    • July 9, 1992
    • English
    <
  • Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity

    • 1st Edition
    • Volume 51
    • June 26, 1992
    • J. NeÅ¡etril + 1 more
    • English
    This volume in the Annals of Discrete Mathematics brings together contributions by renowned researchers in combinatorics, graphs and complexity. The conference on which this book is based was the fourth in a series which began in 1963, which was the first time specialists from East and West were able to come together. The 1990 meeting attracted 170 mathematicians and computer scientists from around the world, so this book represents an international, detailed view of recent research.
  • Differential Topology

    • 1st Edition
    • Volume 173
    • June 2, 1992
    • J. Margalef-Roig + 1 more
    • English
    ...there are reasons enough to warrant a coherent treatment of the main body of differential topology in the realm of Banach manifolds, which is at the same time correct and complete. This book fills the gap: whenever possible the manifolds treated are Banach manifolds with corners. Corners add to the complications and the authors have carefully fathomed the validity of all main results at corners. Even in finite dimensions some results at corners are more complete and better thought out here than elsewhere in the literature. The proofs are correct and with all details. I see this book as a reliable monograph of a well-defined subject; the possibility to fall back to it adds to the feeling of security when climbing in the more dangerous realms of infinite dimensional differential geometry.Peter W. Michor
  • Recursive Functionals

    • 1st Edition
    • Volume 131
    • May 18, 1992
    • L.E. Sanchis
    • English
    This work is a self-contained elementary exposition of the theory of recursive functionals, that also includes a number of advanced results. Although aiming basically at a theory of higher order computability, attention is restricted to second order functionals, where the arguments are numerical functions and the values, when defined, are natural numbers. This theory is somewhat special, for to some extent it can be reduced to first order theory, but when properly extended and relativized it requires the full machinery of higher order computations. In the theory of recursive monotonic functionals the author formulates a reasonable notion of computation which provides the right frame for what appears to be a convincing form of the extended Church's thesis. At the same time, the theory provides sufficient room to formulate the classical results that are usually derived in terms of singular functionals. Presented are complete proofs of Gandy's selector theorem, Kleene's theorem on hyperarithmetical predicates, and Grilliot's theorem on effectively discontinuous functionals.