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.

  • Exploring Artificial Intelligence

    Survey Talks from the National Conferences on Artificial Intelligence
    • 1st Edition
    • Howard E. Shrobe
    • English
    Exploring Artificial Intelligence: Survey Talks from the National Conference on Artificial Intelligence provides information pertinent to the distinct subareas of artificial intelligence research. This book discusses developments in machine learning techniques. Organized into six parts encompassing 16 chapters, this book begins with an overview of intelligent tutoring systems, which describes how to guide a student to learn new concepts. This text then links closely with one of the concerns of intelligent tutoring systems, namely how to interact through the utilization of natural language. Other chapters consider the various aspects of natural language understanding and survey the huge body of work that tries to characterize heuristic search programs. This book discusses as well how computer programs can create plans to satisfy goals. The final chapter deals with computational facilities that support. This book is a valuable resource for cognitive scientists, psychologists, domain experts, computer scientists, instructional designers, expert teachers, and research workers.

  • Computer Programming

    A Mixed Language Approach
    • 3rd Edition
    • Marvin L. Stein + 1 more
    • English
    Computer Programming: A Mixed Language Approach describes computer programming from a mixed language perspective. More specifically, it examines how to make effective use of the hardware and software aspects of the total system using the mixed languages that are a composite of the absolute machine languages and the more facile problem-oriented languages. In addition to the absolute machine language required by the computer "hardware" and the problem-oriented language provided by the "software" of symbolic assembly programs and compilers, a third kind of programming language is considered, namely, the symbolic machine language. Comprised of nine chapters, this book illustrates mixed language programming using Fortran and the Fortran Symbolic Assembly Program. The discussion begins by describing a modern digital computer and introducing the general theory of number systems. Subsequent chapters focus on the way in which computing machines are organized to perform their functions; how a computer executes the sequence of instructions and performs a given calculation, a process known as coding; and non-arithmetic instructions used on computers. Subroutines, input-output, and assembly of complete programs are also explored. The final chapter is devoted to Fortran and programs written completely in Fortran, as well as executive programs and programs in mixed languages. This monograph is intended for both professional programmers-to-be and non-professionals in computer programming.

  • NonEuclidean Geometry

    • 1st Edition
    • Herbert Meschkowski
    • D. Allan Bromley + 2 more
    • English
    Noneuclidean Geometry focuses on the principles, methodologies, approaches, and importance of noneuclidean geometry in the study of mathematics. The book first offers information on proofs and definitions and Hilbert's system of axioms, including axioms of connection, order, congruence, and continuity and the axiom of parallels. The publication also ponders on lemmas, as well as pencil of circles, inversion, and cross ratio. The text examines the elementary theorems of hyperbolic geometry, particularly noting the value of hyperbolic geometry in noneuclidian geometry, use of the Poincaré model, and numerical principles in proving hyperparallels. The publication also tackles the issue of construction in the Poincaré model, verifying the relations of sides and angles of a plane through trigonometry, and the principles involved in elliptic geometry. The publication is a valuable source of data for mathematicians interested in the principles and applications of noneuclidean geometry.

  • A Course of Higher Mathematics

    Integration and Functional Analysis, Volume 5
    • 1st Edition
    • V. I. Smirnov
    • A. J. Lohwater
    • English
    A Course of Higher Mathematics, Volume V focuses on the theory of integration and elements of functional analysis. This book is organized into five chapters. Chapter I discusses the theory of the classical Stieltjes integral and space C of continuous functions, while Chapter II deals with the foundations of the metric theory of functions of a real variable and Lebesgue-Stieltjes integral. The theory of completely additive set functions and case of the one-dimensional Hellinger integral are analyzed in Chapter III. Chapter IV contains an exposition of the foundations of the general theory of metric and normed spaces. The general theory of Hilbert space is covered in Chapter V. This volume is suitable for engineers, physicists, and students of pure mathematics.

  • Entire Functions

    • 1st Edition
    • A. I. Markushevich
    • English
    Entire Functions focuses on complex numbers and the algebraic operations on them and the basic principles of mathematical analysis. The book first elaborates on the concept of an entire function, including the natural generalization of the concept of a polynomial and power series. The text then takes a look at the maximum absolute value and the order of an entire function, as well as calculations for the coefficients of power series representing a given function, use of integrals, and complex numbers. The publication elaborates on the zeros of an entire function and the fundamental theorem of algebra and Picard’s little theorem. Calculations for the zeros of an entire function and numerical representations of Liouville's theorem and Picard’s little theorem are presented. The book also examines algebraic relationships and addition theorems, including an explanation of Weierstrass' theorem and Picard’s little theorem. The manuscript is a vital reference for students interested in the numerical approaches involved in entire functions.

  • L. E. J. Brouwer Collected Works

    Geometry, Analysis, Topology and Mechanics
    • 1st Edition
    • Hans Freudenthal
    • English
    L. E. J. Brouwer Collected Works, Volume 2: Geometry, Analysis, Topology, and Mechanics focuses on the contributions and principles of Brouwer on geometry, topology, analysis, and mechanics, including non-Euclidean spaces, integrals, and surfaces. The publication first ponders on non-Euclidean spaces and integral theorems, lie groups, and plane transition theorem. Discussions focus on remarks on multiple integrals, force field of the non-Euclidean spaces with negative curvature, difference quotients and differential quotients, characterization of the Euclidean and non-Euclidean motion groups, and continuous one-one transformations of surfaces in themselves. The book also takes a look at vector fields on surfaces and new methods in topology, including continuous vector distributions on surfaces and orthogonal trajectories of the orbits of a one parameter plane projective group. The book then ponders on mechanics and topology of surfaces, as well as the motion of a particle on the bottom of a rotating vessel under the influence of gravitational force. The publication is a valuable reference for researchers interested in geometry, topology, analysis, and mechanics.

  • Modern Data Analysis

    • 1st Edition
    • Robert L. Launer + 1 more
    • English
    Modern Data Analysis contains the proceedings of a Workshop on Modern Data Analysis held in Raleigh, North Carolina, on June 2-4, 1980 under the auspices of the United States Army Research Office. The papers review theories and methods of data analysis and cover topics ranging from single and multiple quantile-quantile (Q-Q) plotting procedures to biplot display and pencil-and-paper exploratory data analysis methods. Projection pursuit methods for data analysis are also discussed. Comprised of nine chapters, this book begins with an introduction to styles of data analysis techniques, followed by an analysis of single and multiple Q-Q plotting procedures. Problems involving extreme-value data and the behavior of sample averages are considered. Subsequent chapters deal with the use of smelting in guiding re-expression; geometric data analysis; and influence functions and regression diagnostics. The final chapter examines the use and interpretation of robust analysis of variance for the general non-full-rank linear model. The procedures are described in terms of their mathematical structure, which leads to efficient computational algorithms. This monograph should be of interest to mathematicians and statisticians.

  • Discrete Computational Structures

    • 1st Edition
    • Robert R. Korfhage
    • Werner Rheinboldt
    • English
    Discrete Computational Structures describes discrete mathematical concepts that are important to computing, covering necessary mathematical fundamentals, computer representation of sets, graph theory, storage minimization, and bandwidth. The book also explains conceptual framework (Gorn trees, searching, subroutines) and directed graphs (flowcharts, critical paths, information network). The text discusses algebra particularly as it applies to concentrates on semigroups, groups, lattices, propositional calculus, including a new tabular method of Boolean function minimization. The text emphasizes combinatorics and probability. Examples show different techniques of the general process of enumerating objects. Combinatorics cover permutations, enumerators for combinations, Stirling numbers, cycle classes of permutations, partitions, and compositions. The book cites as example the interplay between discrete mathematics and computing using a system of distinct representatives (SDR) problem. The problem, originating from group theory, graph theory, and set theory can be worked out by the student with a network model involving computers to generate and analyze different scenarios. The book is intended for sophomore or junior level, corresponding to the course B3, "Introduction to Discrete Structures," in the ACM Curriculum 68, as well as for mathematicians or professors of computer engineering and advanced mathematics.

  • A First Course in Stochastic Processes

    • 1st Edition
    • Samuel Karlin
    • English
    A First Course in Stochastic Processes focuses on several principal areas of stochastic processes and the diversity of applications of stochastic processes, including Markov chains, Brownian motion, and Poisson processes. The publication first takes a look at the elements of stochastic processes, Markov chains, and the basic limit theorem of Markov chains and applications. Discussions focus on criteria for recurrence, absorption probabilities, discrete renewal equation, classification of states of a Markov chain, and review of basic terminologies and properties of random variables and distribution functions. The text then examines algebraic methods in Markov chains and ratio theorems of transition probabilities and applications. The manuscript elaborates on the sums of independent random variables as a Markov chain, classical examples of continuous time Markov chains, and continuous time Markov chains. Topics include differentiability properties of transition probabilities, birth and death processes with absorbing states, general pure birth processes and Poisson processes, and recurrence properties of sums of independent random variables. The book then ponders on Brownian motion, compounding stochastic processes, and deterministic and stochastic genetic and ecological processes. The publication is a valuable source of information for readers interested in stochastic processes.

  • Graph Theory and Computing

    • 1st Edition
    • Ronald C. Read
    • English
    Graph Theory and Computing focuses on the processes, methodologies, problems, and approaches involved in graph theory and computer science. The book first elaborates on alternating chain methods, average height of planted plane trees, and numbering of a graph. Discussions focus on numbered graphs and difference sets, Euclidean models and complete graphs, classes and conditions for graceful graphs, and maximum matching problem. The manuscript then elaborates on the evolution of the path number of a graph, production of graphs by computer, and graph-theoretic programming language. Topics include FORTRAN characteristics of GTPL, design considerations, representation and identification of graphs in a computer, production of simple graphs and star topologies, and production of stars having a given topology. The manuscript examines the entropy of transformed finite-state automata and associated languages; counting hexagonal and triangular polyominoes; and symmetry of cubical and general polyominoes. Graph coloring algorithms, algebraic isomorphism invariants for graphs of automata, and coding of various kinds of unlabeled trees are also discussed. The publication is a valuable source of information for researchers interested in graph theory and computing.

Related subjects