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.

  • Robustness of Statistical Tests

    • 1st Edition
    • Takeaki Kariya + 1 more
    • Gerald L. Lieberman + 1 more
    • English
    Robustness of Statistical Tests provides a general, systematic finite sample theory of the robustness of tests and covers the application of this theory to some important testing problems commonly considered under normality. This eight-chapter text focuses on the robustness that is concerned with the exact robustness in which the distributional or optimal property that a test carries under a normal distribution holds exactly under a nonnormal distribution. Chapter 1 reviews the elliptically symmetric distributions and their properties, while Chapter 2 describes the representation theorem for the probability ration of a maximal invariant. Chapter 3 explores the basic concepts of three aspects of the robustness of tests, namely, null, nonnull, and optimality, as well as a theory providing methods to establish them. Chapter 4 discusses the applications of the general theory with the study of the robustness of the familiar Student’s r-test and tests for serial correlation. This chapter also deals with robustness without invariance. Chapter 5 looks into the most useful and widely applied problems in multivariate testing, including the GMANOVA (General Multivariate Analysis of Variance). Chapters 6 and 7 tackle the robust tests for covariance structures, such as sphericity and independence and provide a detailed description of univariate and multivariate outlier problems. Chapter 8 presents some new robustness results, which deal with inference in two population problems. This book will prove useful to advance graduate mathematical statistics students.
  • Introduction to Applied Probability

    • 1st Edition
    • Paul E. Pfeiffer + 1 more
    • English
    Introduction to Applied Probability provides a basis for an intelligent application of probability ideas to a wide variety of phenomena for which it is suitable. It is intended as a tool for learning and seeks to point out and emphasize significant facts and interpretations which are frequently overlooked or confused by the beginner. The book covers more than enough material for a one semester course, enhancing the value of the book as a reference for the student. Notable features of the book are: the systematic handling of combinations of events (Section 3-5); extensive use of the mass concept as an aid to visualization; an unusually careful treatment of conditional probability, independence, and conditional independence (Section 6-4); the resulting clarification facilitates the formulation of many applied problems; the emphasis on events determined by random variables, which gives unity and clarity to many topics important for interpretation; and the utilization of the indicator function, both as a tool for dealing with events and as a notational device in the handling of random variables. Students of mathematics, engineering, biological and physical sciences will find the text highly useful.
  • Picture Languages

    Formal Models for Picture Recognition
    • 1st Edition
    • Azriel Rosenfeld
    • Werner Rheinboldt
    • English
    Computer Science and Applied Mathematics: Picture Languages: Formal Models for Picture Recognition treats pictorial pattern recognition from the formal standpoint of automata theory. This book emphasizes the capabilities and relative efficiencies of two types of automata—array automata and cellular array automata, with respect to various array recognition tasks. The array automata are simple processors that perform sequences of operations on arrays, while the cellular array automata are arrays of processors that operate on pictures in a highly parallel fashion, one processor per picture element. This compilation also reviews a collection of results on two-dimensional sequential and parallel array acceptors. Some of the analogous one-dimensional results and array grammars and their relation to acceptors are likewise covered in this text. This publication is suitable for researchers, professionals, and specialists interested in pattern recognition and automata theory.
  • Advanced Turbo C Programming

    • 1st Edition
    • Keith Weiskamp
    • English
    Advanced Turbo C Programming provides the necessary programming tools for programmers who are interested in learning new skills in developing some useful tools and PC applications using the Turbo C Version 1.5 programming language and environment. This book covers both the advanced programming features of the IBM PC and Turbo C. It is organized into five sections. In Section 1 the proposed ANSI standard features, tips and techniques about C programming style, working with the C preprocessor, and tips for using pointers and managing memory allocation tasks are introduced. Section 2 discusses techniques for constructing useful and reliable data structures from linked lists to binary trees. The third section provides the complete Turbo C I/O system and takes an in-depth look at the many tools that Turbo C provides for accessing files and other I/O devices. Section 4 explains the techniques for interacting with DOS and the special features of Turbo C such as the Borland Graphic Interface (BGI). The final section, Section 5 presents the tools and techniques for developing Turbo C-like user interfaces, such as pop-up windows, pop-up menus, and pulldown menus. Computer programmers will find the text invaluable.
  • Integer Programming

    Theory, Applications, and Computations
    • 1st Edition
    • Hamdy A. Taha
    • J. William Schmidt
    • English
    Integer Programming: Theory, Applications, and Computations provides information pertinent to the theory, applications, and computations of integer programming. This book presents the computational advantages of the various techniques of integer programming. Organized into eight chapters, this book begins with an overview of the general categorization of integer applications and explains the three fundamental techniques of integer programming. This text then explores the concept of implicit enumeration, which is general in a sense that it is applicable to any well-defined binary program. Other chapters consider the branch-and-bound methods, the cutting-plane method, and its closely related asymptotic problem. This book discusses as well several specialized algorithms for certain well-known integer models and provides an alternative approach to the solution of the integer problem. The final chapter deals with a number of observations about the formulations and executions of integer programming models. This book is a valuable resource for industrial engineers and research workers.
  • Social Issues in Computing

    • 1st Edition
    • C. C. Gotlieb + 1 more
    • Werner Rheinboldt
    • English
    Social Issues in Computing provides information pertinent to the social implications of technology. This book presents the highly dynamic interaction between computers and society. Organized into 13 chapters, this book begins with an overview of the problems associated with computers and attempts to indicate some of the viewpoints, assumptions, and biases from which the discussion is undertaken. This text then examines in detail the effects of computers on society ad describes the extent of computer use. Other chapters consider the disparities in computer use between various countries, as well as the degree to which various countries are able to share in the market for computer products and services. This book discusses as well the factors that led to the rapid and widespread adoption of computers. The final chapter deals with the effects of automation, computers, and technology. This book is a valuable resource for computer science students and research workers.
  • Mathematical Aspects of Finite Elements in Partial Differential Equations

    Proceedings of a Symposium Conducted by the Mathematics Research Center, the University of Wisconsin–Madison, April 1 – 3, 1974
    • 1st Edition
    • Carl de Boor
    • English
    Mathematical Aspects of Finite Elements in Partial Differential Equations addresses the mathematical questions raised by the use of finite elements in the numerical solution of partial differential equations. This book covers a variety of topics, including finite element method, hyperbolic partial differential equation, and problems with interfaces. Organized into 13 chapters, this book begins with an overview of the class of finite element subspaces with numerical examples. This text then presents as models the Dirichlet problem for the potential and bipotential operator and discusses the question of non-conforming elements using the classical Ritz- and least-squares-method... Other chapters consider some error estimates for the Galerkin problem by such energy considerations. This book discusses as well the spatial discretization of problem and presents the Galerkin method for ordinary differential equations using polynomials of degree k. The final chapter deals with the continuous-time Galerkin method for the heat equation. This book is a valuable resource for mathematicians.
  • An Introduction to Analytic Geometry and Calculus

    • 1st Edition
    • A. C. Burdette
    • English
    An Introduction to Analytic Geometry and Calculus covers the basic concepts of analytic geometry and the elementary operations of calculus. This book is composed of 14 chapters and begins with an overview of the fundamental relations of the coordinate system. The next chapters deal with the fundamentals of straight line, nonlinear equations and graphs, functions and limits, and derivatives. These topics are followed by a discussion of some applications of previously covered mathematical subjects. This text also considers the fundamentals of the integrals, trigonometric functions, exponential and logarithm functions, and methods of integration. The final chapters look into the concepts of parametric equations, polar coordinates, and infinite series. This book will prove useful to mathematicians and undergraduate and graduate mathematics students.
  • Theories of Probability

    An Examination of Foundations
    • 1st Edition
    • Terrence L. Fine
    • English
    Theories of Probability: An Examination of Foundations reviews the theoretical foundations of probability, with emphasis on concepts that are important for the modeling of random phenomena and the design of information processing systems. Topics covered range from axiomatic comparative and quantitative probability to the role of relative frequency in the measurement of probability. Computational complexity and random sequences are also discussed. Comprised of nine chapters, this book begins with an introduction to different types of probability theories, followed by a detailed account of axiomatic formalizations of comparative and quantitative probability and the relations between them. Subsequent chapters focus on the Kolmogorov formalization of quantitative probability; the common interpretation of probability as a limit of the relative frequency of the number of occurrences of an event in repeated, unlinked trials of a random experiment; an improved theory for repeated random experiments; and the classical theory of probability. The book also examines the origin of subjective probability as a by-product of the development of individual judgments into decisions. Finally, it suggests that none of the known theories of probability covers the whole domain of engineering and scientific practice. This monograph will appeal to students and practitioners in the fields of mathematics and statistics as well as engineering and the physical and social sciences.
  • Identification, Equivalent Models, and Computer Algebra

    Statistical Modeling and Decision Science
    • 1st Edition
    • Paul A. Bekker + 2 more
    • Gerald J. Lieberman + 1 more
    • English
    Identification, Equivalent Models, and Computer Algebra provides information pertinent to computer algebra. This book presents a brief discussion of the commutation matrix, an operator that plays a role when derivatives have to be evaluated involving symmetric matrices. Organized into eight chapters, this book begins with an overview of the link between identification of a parameter and the existence of a consistent estimator, and the link between identification of a model and the rank of a Jacobian matrix. This text then describes an algorithm for the determination of the exact rank of a parametrized matrix. Other chapters consider the identification in the simultaneous equation model. This book discusses as well the identification assessment in confirmatory factor analysis, a problem related to the simultaneous equations model. The final chapter deals with various computer programs that the enclosed diskette contains. This book is a valuable resource for readers who are interested in computer algebra.