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.

  • Geometry with Trigonometry

    • 1st Edition
    • Patrick D Barry
    • English
    This book addresses a neglected mathematical area where basic geometry underpins undergraduate and graduate courses. Its interdisciplinary portfolio of applications includes computational geometry, differential geometry, mathematical modelling, computer science, computer-aided design of systems in mechanical, structural and other engineering, and architecture. Professor Barry, from his long experience of teaching and research, here delivers a modern and coherent exposition of this subject area for varying levels in mathematics, applied mathematics, engineering mathematics and other areas of application. Euclidean geometry is neglected in university courses or scattered over a number of them. This text emphasises a systematic and complete build-up of material, moving from pure geometrical reasoning aided by algebra to a blend of analytic geometry and vector methods with trigonometry, always with a view to efficiency. The text starts with a selection of material from the essentials of Euclidean geometry at A level, and ends with an introduction to trigonometric functions in calculus.Very many geometric diagrams are provided for a clear understanding of the text, with abundant Problem Exercises for each chapter. Students, researchers and industrial practitioners would benefit from this sustained mathematisation of shapes and magnitude from the real world of science which can raise and help their mathematical awareness and ability.

  • Introduction to Feedback Control

    • 1st Edition
    • Kirsten A. Morris
    • English
    What is often referred to as industrial mathematics is becoming a more important focus of applied mathematics. An increased interest in undergraduate control theory courses for mathematics students is part of this trend. This is due to the fact that control theory is both quite mathematical and very important in applications. Introduction to Feedback Control provides a rigorous introduction to input/output, controller design for linear systems to junior/senior level engineering and mathematics students. All explanations and most examples are single-input, single-output for ease of exposition. The student is assumed to have knowledge of linear ordinary differential equations and complex variables.

  • A Mathematical Introduction to Logic

    • 2nd Edition
    • Herbert B. Enderton
    • English
    A Mathematical Introduction to Logic, Second Edition, offers increased flexibility with topic coverage, allowing for choice in how to utilize the textbook in a course. The author has made this edition more accessible to better meet the needs of today's undergraduate mathematics and philosophy students. It is intended for the reader who has not studied logic previously, but who has some experience in mathematical reasoning. Material is presented on computer science issues such as computational complexity and database queries, with additional coverage of introductory material such as sets.

  • Interpolation and Extrapolation

    • 1st Edition
    • Volume 2
    • C. Brezinski
    • English
    /homepage/sac/cam/na... Set now available at special set price!This volume is dedicated to two closely related subjects: interpolation and extrapolation. The papers can be divided into three categories: historical papers, survey papers and papers presenting new developments.Interpo... is an old subject since, as noticed in the paper by M. Gasca and T. Sauer, the term was coined by John Wallis in 1655. Interpolation was the first technique for obtaining an approximation of a function. Polynomial interpolation was then used in quadrature methods and methods for the numerical solution of ordinary differential equations.Extrapolat... is based on interpolation. In fact, extrapolation consists of interpolation at a point outside the interval containing the interpolation points. Usually, this point is either zero or infinity. Extrapolation is used in numerical analysis to improve the accuracy of a process depending of a parameter or to accelerate the convergence of a sequence. The most well-known extrapolation processes are certainly Romberg's method for improving the convergence of the trapezoidal rule for the computation of a definite integral and Aiken's &Dgr;2 process which can be found in any textbook of numerical analysis.Obviously, all aspects of interpolation and extrapolation have not been treated in this volume. However, many important topics have been covered.

  • Homology

    The Hierarchical Basis of Comparative Biology
    • 1st Edition
    • Brian K. Hall
    • English
    The application of homology varies depending on the data being examined. This volume represents a state-of-the-art treatment of the different applications of this unifying concept. Chapters deal with homology on all levels, from molecules to behavior, and are authored by leading contributors to systematics, natural history, and evolutionary, developmental, and comparative biology. This paperback reprint of the original hardbound edition continues to commemorate the 150th anniversary of Sir Richard Owen's seminal paper distinguishing homology from analogy.

  • A Matlab Companion for Multivariable Calculus

    • 1st Edition
    • Jeffery Cooper
    • English
    Offering a concise collection of MatLab programs and exercises to accompany a third semester course in multivariable calculus, A MatLab Companion for Multivariable Calculus introduces simple numerical procedures such as numerical differentiation, numerical integration and Newton's method in several variables, thereby allowing students to tackle realistic problems. The many examples show students how to use MatLab effectively and easily in many contexts. Numerous exercises in mathematics and applications areas are presented, graded from routine to more demanding projects requiring some programming. Matlab M-files are provided on the Harcourt/Academic Press web site at http://www.harcourt-...

  • Theory of Relations

    • 1st Edition
    • Volume 145
    • R. Fraisse
    • English
    Relation theory originates with Hausdorff (Mengenlehre 1914) and Sierpinski (Nombres transfinis, 1928) with the study of order types, specially among chains = total orders = linear orders. One of its first important problems was partially solved by Dushnik, Miller 1940 who, starting from the chain of reals, obtained an infinite strictly decreasing sequence of chains (of continuum power) with respect to embeddability. In 1948 I conjectured that every strictly decreasing sequence of denumerable chains is finite. This was affirmatively proved by Laver (1968), in the more general case of denumerable unions of scattered chains (ie: which do not embed the chain Q of rationals), by using the barrier and the better orderin gof Nash-Williams (1965 to 68).Another important problem is the extension to posets of classical properties of chains. For instance one easily sees that a chain A is scattered if the chain of inclusion of its initial intervals is itself scattered (6.1.4). Let us again define a scattered poset A by the non-embedding of Q in A. We say that A is finitely free if every antichain restriction of A is finite (antichain = set of mutually incomparable elements of the base). In 1969 Bonnet and Pouzet proved that a poset A is finitely free and scattered iff the ordering of inclusion of initial intervals of A is scattered. In 1981 Pouzet proved the equivalence with the a priori stronger condition that A is topologically scattered: (see 6.7.4; a more general result is due to Mislove 1984); ie: every non-empty set of initial intervals contains an isolated elements for the simple convergence topology.In chapter 9 we begin the general theory of relations, with the notions of local isomorphism, free interpretability and free operator (9.1 to 9.3), which is the relationist version of a free logical formula. This is generalized by the back-and-forth notions in 10.10: the (k,p)-operator is the relationist version of the elementary formula (first order formula with equality).Chapter 12 connects relation theory with permutations: theorem of the increasing number of orbits (Livingstone, Wagner in 12.4). Also in this chapter homogeneity is introduced, then more deeply studied in the Appendix written by Norbert Saucer.Chapter 13 connects relation theory with finite permutation groups; the main notions and results are due to Frasnay. Also mention the extension to relations of adjacent elements, by Hodges, Lachlan, Shelah who by this mean give an exact calculus of the reduction threshold.The book covers almost all present knowledge in Relation Theory, from origins (Hausdorff 1914, Sierpinski 1928) to classical results (Frasnay 1965, Laver 1968, Pouzet 1981) until recent important publications (Abraham, Bonnet 1999).All results are exposed in axiomatic set theory. This allows us, for each statement, to specify if it is proved only from ZF axioms of choice, the continuum hypothesis or only the ultrafilter axiom or the axiom of dependent choice, for instance.

  • Game Theory

    Mathematical Models of Conflict
    • 1st Edition
    • A. J. Jones
    • English
    Written engagingly and with agreeable humour, this book balances a light touch with a rigorous yet economical account of the theory of games and bargaining models. It provides a precise interpretation, discussion and mathematical analysis for a wide range of “game-like” problems in economics, sociology, strategic studies and war.There is first an informal introduction to game theory, which can be understood by non-mathematicians, which covers the basic ideas of extensive form, pure and mixed strategies and the minimax theorem. The general theory of non-cooperative games is then given a detailed mathematical treatment in the second chapter. Next follows a “first class” account of linear programming, theory and practice, terse, rigorous and readable, which is applied as a tool to matrix games and economics from duality theory via the equilibrium theorem, with detailed explanations of computational aspects of the simplex algorithm.The remaining chapters give an unusually comprehensive but concise treatment of cooperative games, an original account of bargaining models, with a skillfully guided tour through the Shapley and Nash solutions for bimatrix games and a carefully illustrated account of finding the best threat strategies.

  • Topological Algebras

    • 1st Edition
    • Volume 185
    • V.K. Balachandran
    • English
    This book consists of nine chapters. Chapter 1 is devoted to algebraic preliminaries. Chapter 2 deals with some of the basic definition and results concerning topological groups, topological linear spaces and topological algebras. Chapter 3 considered some generalizations of the norm. Chapter 4 is concerned with a generalization of the notion of convexity called p-convexity. In Chapter 5 some differential and integral analysis involving vector valued functions is developed. Chapter 6 is concerned with spectral analysis and applications. The Gelfand representation theory is the subject-matter of Chapter 7. Chapter 8 deals with commutative topological algebras. Finally in Chapter 9 an exposition of the norm uniqueness theorems of Gelfand and Johnson (extended to p-Banach algebras) is given.

  • From Peirce to Skolem

    A Neglected Chapter in the History of Logic
    • 1st Edition
    • Volume 4
    • Geraldine Brady
    • English
    This book is an account of the important influence on the development of mathematical logic of Charles S. Peirce and his student O.H. Mitchell, through the work of Ernst Schröder, Leopold Löwenheim, and Thoralf Skolem. As far as we know, this book is the first work delineating this line of influence on modern mathematical logic.

Related subjects