Skip to main content
Elsevier

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.

  • Surveys in Applied Mathematics

    Essays Dedicated to S.M. Ulam
    • 1st Edition
    • N. Metropolis + 2 more
    • English
    Surveys in Applied Mathematics: Essays Dedicated to S.M. Ulam covers the proceedings of the First Los Alamos Symposium on Mathematics in the Natural Sciences. The book focuses on the processes, principles, methodologies, and applications of mathematics in the natural sciences. The selection first offers information on the role of applied mathematics, shape of a curve, and biased versus unbiased estimation. Discussions focus on the James-Stein estimator, automorphic forms and Poincaré series, Poincaré metrics, Schottky space and augmented Schottky space, and Schottky groups and Riemann surfaces. The text then examines algorithms, Whitney numbers of geometric lattices, and continued fraction expansion of algebraic numbers. The book takes a look at bifurcations in reaction-diffusion problems, survey of some finite element methods proposed for treating the Dirichlet problem, and mathematics of quantum fields. Topics include Dirichlet problem, chemical waves and reaction-diffusion equations, and bifurcation theorems. The text then ponders on almost periodic behavior of nonlinear waves, turbulence theory, and renormalization group methods. The selection is a valuable source of information for mathematicians and researchers interested in applied mathematics.

  • Combinatorics

    • 1st Edition
    • N. Ya. Vilenkin
    • English
    Combinatorics deals with simple combinatorial problems, recurrence relations, and generating functions, particularly the binomial expansions. The book expounds on the general rules of combinatorics, the rule of sum, the rule of product, samples, permutations, combinations, and arrangements of subjects with various restrictions. The text also explains ordered or unordered partitions of numbers, geometric methods, random walk problems, and variants of the arithmetical triangle. One example of the use of combinatorics is the choice of the number 3 in the genetic code. Another example involves the choice of crew for a spaceship where it is necessary to consider the psychological conditions of the applicants for space travel. The text also investigates the sieve of Erastothenes whose problem concerns finding all the primes in the sequence of natural numbers from 1 to N. The book also tackles the application of power series to proof of identities, the binomial series expansion, decomposition into elementary fractions, and nonlinear recurrence relation. The book can be highly educational and interesting to students or academicians involved in mathematics, algebra, and statistics.

  • Computational Geometry

    Curve and Surface Modeling
    • 1st Edition
    • Su Bu-qing + 1 more
    • English
    Computational Geometry: Curve and Surface Modeling provides information pertinent to the fundamental aspects of computational geometry. This book discusses the geometric properties of parametric polynomial curves by using the theory of affine invariants for algebraic curves. Organized into eight chapters, this book begins with an overview of the objects studies in computational geometry, namely surfaces and curves. This text then explores the developments in the theory and application of spline functions, which began with cubic spline functions. Other chapters consider the mechanical background of the cubic spline functions, which is the wooden spline with small deflection. This book discusses as well that in mathematical lofting the information of a geometric shape is given by a set of data points, while in geometric design other ways of representations are available. The final chapter deals with the concepts in the theory of algebraic curves. This book is a valuable resource for mathematicians.

  • Surveys in General Topology

    • 1st Edition
    • George M. Reed
    • English
    Surveys in General Topology presents topics relating to general topology ranging from closed mappings and ultrafilters to covering and separation properties of box products. Ordered topological spaces and the use of combinatorial techniques in functional analysis are also considered, along with product spaces and weakly compact subsets of Banach spaces. Applications of stationary sets in topology are presented as well. Comprised of 15 chapters, this volume begins with an analysis of some of the techniques and results in the area of closed mappings, followed by a discussion on the theory of ultrafilters. The reader is then introduced to the question of when a box product of compact spaces is paracompact, and how badly a box product of compact or metrizable spaces can fail to be normal. Subsequent chapters focus on the transfinite dimension; the properties of metacompactness, submetacompactness, and subparacompactness; the dimension of ordered topological spaces; the use of combinatorial techniques for the treatment and solution of fundamental problems in functional analysis, particularly in the isomorphic theory of Banach spaces; and order-theoretic base axioms. This monograph will be of significant value both to researchers in general topology and to mathematicians outside the field who wish an overview of current topics and techniques.

  • Discrete Algorithms and Complexity

    Proceedings of the Japan-US Joint Seminar, June 4 – 6, 1986, Kyoto, Japan
    • 1st Edition
    • David S. Johnson + 2 more
    • English
    Perspectives in Computing, Volume 15: Discrete Algorithms and Complexity provides an understanding of discrete algorithms and complexity. This book covers a variety of topics, including discrete logarithm algorithms, parallel bubbling, electronic prototyping, number theoretic complexity, and linear programming. Organized into 27 chapters, this volume begins with an overview of the basic solutions of the primal and dual that can be characterized in graph-theoretic terms. This text then explores the principal partition of vertex-weighted graphs, which is utilized to solve certain assignment problems or flow problems that are formulated using such graphs. Other chapters consider a polynomial-time algorithm for finding the geodesic center of a simple polygon. This book discusses as well the three efficient algorithms for the routing problems around a rectangle. The final chapter deals with a snoopy cache multiprocessor system wherein each processor has a cache in which it stores blocks of data. This book is a valuable resource for mathematicians and researchers.

  • Computability, Complexity, and Languages

    Fundamentals of Theoretical Computer Science
    • 1st Edition
    • Martin D. Davis + 1 more
    • Werner Rheinboldt
    • English
    Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science provides an introduction to the various aspects of theoretical computer science. Theoretical computer science is the mathematical study of models of computation. This text is composed of five parts encompassing 17 chapters, and begins with an introduction to the use of proofs in mathematics and the development of computability theory in the context of an extremely simple abstract programming language. The succeeding parts demonstrate the performance of abstract programming language using a macro expansion technique, along with presentations of the regular and context-free languages. Other parts deal with the aspects of logic that are important for computer science and the important theory of computational complexity, as well as the theory of NP-completeness. The closing part introduces the advanced recursion and polynomial-time computability theories, including the priority constructions for recursively enumerable Turing degrees. This book is intended primarily for undergraduate and graduate mathematics students.

  • Data Structures

    Theory and Practice
    • 1st Edition
    • A. T. Berztiss
    • Werner Rheinboldt
    • English
    Computer Science and Applied Mathematics: Data Structures: Theory and Practice focuses on the processes, methodologies, principles, and approaches involved in data structures, including algorithms, decision trees, Boolean functions, lattices, and matrices. The book first offers information on set theory, functions, and relations, and graph theory. Discussions focus on linear formulas of digraphs, isomorphism of digraphs, basic definitions in the theory of digraphs, Boolean functions and forms, lattices, indexed sets, algebra of sets, and order pair and related concepts. The text then examines strings, trees, and paths and cycles in digraphs. Topics include algebra of strings, Markov algorithms, algebraic structures, languages and grammars, decision trees and decision tables, trees as grammatic markers, shortest path problems, and representation of prefix formulas. The publication ponders on digraphs of programs, arrays, pushdown stores, lists, and list structures, and organization of files. Concerns include scatter storage techniques, files and secondary storage, representation of digraphs as list structures, storage of arrays, and sparse matrices. The text is a valuable reference for computer science experts, mathematicians, and researchers interested in data structures.

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

  • Mathematical Techniques of Applied Probability

    Discrete Time Models: Basic Theory
    • 1st Edition
    • Jeffrey J. Hunter
    • J. William Schmidt
    • English
    Mathematical Techniques of Applied Probability, Volume 1: Discrete Time Models: Basic Theory provides information pertinent to the basic theory of discrete time models. This book introduces the tools of generating functions and matrix theory to facilitate a detailed study of such models. Organized into five chapters, this volume begins with an overview of the elementary theory of probability for discrete random variables. This text then reviews the concepts of convergence, absolute convergence, uniform convergence, continuity, differentiation, and integration. Other chapters consider the occurrence of general patterns of successes and failures in Bernoulli trials. This book discusses as well the matrix theory, which is used in the study of stochastic processes, particularly in the analysis of the behavior of Markov chains. The final chapter deals with the properties of a special class of discrete time chains. This book is a valuable resource for students and teachers.

  • Study Guide to Accompany Computers Data and Processing

    • 1st Edition
    • Harvey M. Deitel + 1 more
    • English
    Study Guide to Accompany Computer and Data Processing provides information pertinent to the fundamental aspects of computers and computer technology. This book presents the key benefits of using computers. Organized into five parts encompassing 19 chapters, this book begins with an overview of the evolution of modern computing systems from the earliest mechanical calculating devices to microchips. This text then introduces computer hardware and describes the processor. Other chapters describe how microprocessors are made and describe the physical operation of computers. This book discusses as well how computers present their outputs and explains the storage and retrieval of massive amounts of computer-accessible information from secondary storage devices. The final chapter discusses the use of computers in the transportation systems and the ways in which they make possible other innovations in transportation. This book is a valuable resource for computer scientists, systems analysts, computer programmers, mathematicians, historians, computer specialists, and students.

Related subjects