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.

  • Programming Language Structures

    • 1st Edition
    • Elliott I. Organick + 2 more
    • English
    Programming Language Structures deals with the structures of programming languages and introduces the reader to five important programming languages: Algol, Fortran, Lisp, Snobol, and Pascal. The fundamental similarities and differences among these languages are discussed. A unifying framework is constructed that can be used to study the structure of other languages, such as Cobol, PL/I, and APL. Several of the tools and methodologies needed to construct large programs are also considered. Comprised of 10 chapters, this book begins with a summary of the relevant concepts and principles about algorithms, flowcharts, and computation that a student is expected to know from the first course. The discussion then turns to the semantics of procedure and function call as well as argument-parameter matching with various kinds of parameters; recursion and its relation to tree traversal; syntax formalism for context-free languages; and ALGOL 60 and block structuring. Case study programs are presented to reinforce the reader's understanding of ALGOL 60 and Fortran semantics. The remaining chapters deal with Lisp, Snobol, and Pascal. This monograph is intended for working programmers and students in computer science who have an interest in the subject of programming.

  • Combinatorial Algorithms

    For Computers and Calculators
    • 2nd Edition
    • Albert Nijenhuis + 1 more
    • Werner Rheinboldt
    • English
    Combinatorial Algorithms for Computers and Calculators, Second Edition deals with combinatorial algorithms for computers and calculators. Topics covered range from combinatorial families such as the random subset and k-subset of an n-set and Young tableaux, to combinatorial structures including the cycle structure of a permutation and the spanning forest of a graph. Newton forms of a polynomial and the composition of power series are also discussed. Comprised of 30 chapters, this volume begins with an introduction to combinatorial algorithms by considering the generation of all of the 2n subsets of the set {1, 2,...,n}. The discussion then turns to the random subset and k-subset of an n-set; next composition of n into k parts; and random composition of n into k parts. Subsequent chapters focus on sequencing, ranking, and selection algorithms in general combinatorial families; renumbering rows and columns of an array; the cycle structure of a permutation; and the permanent function. Sorting and network flows are also examined, along with the backtrack method and triangular numbering in partially ordered sets. This book will be of value to both students and specialists in the fields of applied mathematics and computer science.

  • Algebra for College Students

    • 1st Edition
    • Bernard Kolman + 1 more
    • English
    Algebra for College Students, Revised and Expanded Edition is a complete and self-contained presentation of the fundamentals of algebra which has been designed for use by the student. The book provides sufficient materials for use in many courses in college algebra. It contains chapters that are devoted to various mathematical concepts, such as the real number system, sets and set notation, matrices and their application in solving linear systems, and notation of functions. The theory of polynomial equations, formulas for factoring a sum and a difference of cubes, roots of polynomials, and the geometric definition of each conic are likewise included in the book. College students will find the book very useful and invaluable.

  • Introductory Complex and Analysis Applications

    • 1st Edition
    • William R. Derrick
    • English
    Introductory Complex and Analysis Applications provides an introduction to the functions of a complex variable, emphasizing applications. This book covers a variety of topics, including integral transforms, asymptotic expansions, harmonic functions, Fourier transformation, and infinite series. Organized into eight chapters, this book begins with an overview of the theory of functions of a complex variable. This text then examines the properties of analytical functions, which are all consequences of the differentiability of the function. Other chapters consider the converse of Taylor's Theorem, namely that convergent power series are analytical functions in their domain of convergence. This book discusses as well the Residue Theorem, which is of fundamental significance in complex analysis and is the core concept in the development of the techniques. The final chapter deals with the method of steepest descent, which is useful in determining the asymptotic behavior of integral representations of analytic functions. This book is a valuable resource for undergraduate students in engineering and mathematics.

  • Programming for the Newton®

    Software Development with Newtonscript™
    • 1st Edition
    • Julie McKeehan + 1 more
    • English
    Programming for the Newton: Software Development with NewtonScript focuses on the processes, approaches, operations, and principles involved in software development with NewtonScript. The publication first elaborates on Newton application design, views on the Newton, and protos. Discussions focus on system protos, creating and using user protos, linking and naming templates, creating the views of WaiterHelper, Newton application designs, and life cycle of an application. The text then elaborates on the fundamentals of NewtonScript, inheritance in NewtonScript, and view system and messages. Topics include InstallScript and RemoveScript, adding code to WaiterHelper, proto and parent inheritance, combining proto and parent inheritance, frames, arrays, and symbols and path expressions. The book ponders on debugging and Newton data storage, including description of methods and functions, handling soups in application, printing, tracking, and debugging functions. The publication is a vital reference for computer programmers and researchers interested in NewtonScript.

  • A Fête of Topology

    Papers Dedicated to Itiro Tamura
    • 1st Edition
    • Y. Matsumoto + 2 more
    • English
    A Fête of Topology: Papers Dedicated to Itiro Tamura focuses on the progress in the processes, methodologies, and approaches involved in topology, including foliations, cohomology, and surface bundles. The publication first takes a look at leaf closures in Riemannian foliations and differentiable singular cohomology for foliations. Discussions focus on differentiable singular chains restricted to leaves, differentiable singular cohomology for foliations, covering of pseudogroups and fundamental group, normal type of an orbit closure, and construction of a global model. The text then takes a look at measure of exceptional minimal sets of codimension one foliations, examples of exceptional minimal sets, foliations transverse to non-singular Morse-Smale flows, and Chern character for discrete groups. The manuscript ponders on characteristic classes of surface bundles and bounded cohomology, Hill's equation, isomonodromy deformation and characteristic classes, and topology of folds, cusps, and Morin singularities. Topics include system of Hill's equations, Lagrange-Grassman manifold, positive curves, Morse theory, bounded cohomology, and characteristic classes of surface bundles. The publication is a vital source of information for researchers interested in topology.

  • High Performance Computing Demystified

    • 1st Edition
    • David Loshin
    • English
    High Performance Computing Demystified provides an overview of high performance resources and their applications across many disciplines. This book is organized into five parts encompassing 16 chapters that cover the principles, mode of operation, and practical aspects of supercomputers. The first and second parts provide a brief history of high performance computing and describe the “basic” parts needed to build high performance computers, including high performance microprocessors and network topologies. The third part examines the features of multiprocessor architectures of high performance, such as the large number crunchers, massively parallel processing machines, and networks of workstations. The fourth part deals with the software paradigms for high performance, while the fifth part looks into the high performance computing resources that are available to the public, with some guide to accessing those resources. This book is intended primarily for engineers and business managers who have a basic understanding of computers and would like to learn about high performance computing.

  • Generative Modeling for Computer Graphics and Cad

    Symbolic Shape Design Using Interval Analysis
    • 1st Edition
    • John M. Snyder
    • English
    Generative Modeling for Computer Graphics and Cad: Symbolic Shape Design Using Interval Analysis presents a symbolic approach to shape representation that is useful to the CAD/CAM and computer graphics communities. This book discusses the kinds of operators useful in a geometric modeling system, including arithmetic operators, vector and matrix operators, integration, differentiation, constraint solution, and constrained minimization. Associated with each operator are several methods that compute properties about the parametric functions represented with the operators. This text also elaborates how numerous rendering and analytical operations can be supported with only three methods—evaluation of the parametric function at a point, symbolic differentiation of the parametric function, and evaluation of an inclusion function for the parametric function. This publication is intended for people working in the area of computational geometry who are interested in a robust class of algorithms for manipulating shapes and those who want to know how human beings can specify and manipulate shape.

  • Computer Science and Scientific Computing

    Proceedings of the Third ICASE Conference on Scientific Computing, Williamsburg, Virginia, April 1 and 2, 1976
    • 1st Edition
    • James M. Ortega
    • English
    Computer Science and Scientific Computing contains the proceedings of the Third ICASE Conference on Scientific Computing held in Williamsburg, Virginia, on April l and 2, 1976, under the auspices of the Institute for Computer Applications in Systems Engineering at the NASA Langley Research Center. The conference provided a forum for reviewing all the aspects of scientific computing and covered topics ranging from computer-aided design (CAD) and computer science technology to the design of large hydrodynamics codes. Case studies in reliable computing are also presented. Comprised of 13 chapters, this book begins with an introduction to the use of the hierarchical family concept in the development of scientific programming systems. The discussion then turns to the data structures of scientific computing and their representation and management; some important CAD capabilities required to support aerospace design in the areas of interactive support, information management, and computer hardware advances as well as some computer science developments which may contribute significantly to making such capabilities possible; and the use of symbolic computation systems for problem solving in scientific research. Subsequent chapters deal with computer applications in astrophysics; the possibility of computing turbulence and numerical wind tunnels; and the basis for a general-purpose program for finite element analysis. Software tools for computer graphics are also considered. This monograph will be of value to scientists, systems designers and engineers, and students in computer science who have an interest in the subject of scientific computing.

  • Algebra Review

    • 2nd Edition
    • Charles Denlinger + 1 more
    • English
    Algebra Review serves as a background supplement to Howard Anton and Bernard Kolman’s books on finite mathematics—Applied Finite Mathematics and Applied Finite Mathematics with Calculus. This book discusses the number systems of algebra, algebraic notation, exponents and radicals, and fractional exponents. The polynomials and factoring, binomial theorem, and rational expressions are also elaborated. This text covers equations such as linear equations, quadratic equations, and higher degree equations. The Cartesian coordinate system, graphing equations in two variables, and some special functions are likewise deliberated. This publication is a good source for mathematicians and students interested in finite mathematics and how to perform algebraic manipulations.

Related subjects