Skip to main content
Elsevier
View Cart
My account

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.

BooksJournals

    • An Introduction to Measure-theoretic Probability

      • 1st Edition
      • October 19, 2004
      • George G. Roussas
      • English
      • Paperback
        9 7 8 0 1 2 3 9 5 4 6 9 5
      • eBook
        9 7 8 0 0 8 0 5 7 5 3 0 8
      This book provides in a concise, yet detailed way, the bulk of the probabilistic tools that a student working toward an advanced degree in statistics,probabili... and other related areas, should be equipped with. The approach is classical, avoiding the use of mathematical tools not necessary for carrying out the discussions. All proofs are presented in full detail.

    • Actuaries' Survival Guide

      • 1st Edition
      • February 23, 2004
      • Fred Szabo
      • English
      • Paperback
        9 7 8 0 1 2 6 8 0 1 4 6 0
      • eBook
        9 7 8 0 0 8 0 5 2 4 2 4 5
      This unique book is a guide for students and graduates of mathematics, statistics, economics, finance, and other number-based disciplines contemplating a career in actuarial science. Given the comprehensive range of the cases that are analyzed in the book, the Actuaries' Survival Guide can serve as a companion to existing study material for all courses designed to prepare students for actuarial examinations.

    • Algorithmic Graph Theory and Perfect Graphs

      • 2nd Edition
      • Volume 57
      • February 4, 2004
      • Martin Charles Golumbic
      • English
      • Hardback
        9 7 8 0 4 4 4 5 1 5 3 0 8
      • eBook
        9 7 8 0 0 8 0 5 2 6 9 6 6
      Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping stone from which the reader may embark on one of many fascinating research trails. The past twenty years have been an amazingly fruitful period of research in algorithmic graph theory and structured families of graphs. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. These have lead to new families of perfect graphs and many algorithmic results. These are surveyed in the new Epilogue chapter in this second edition.

    • Non-Self-Adjoint Boundary Eigenvalue Problems

      • 1st Edition
      • Volume 192
      • June 26, 2003
      • R. Mennicken + 1 more
      • English
      • Paperback
        9 7 8 0 4 4 4 5 5 1 9 2 4
      • Hardback
        9 7 8 0 4 4 4 5 1 4 4 7 9
      • eBook
        9 7 8 0 0 8 0 5 3 7 7 3 3
      This monograph provides a comprehensive treatment of expansion theorems for regular systems of first order differential equations and n-th order ordinary differential equations.In 10 chapters and one appendix, it provides a comprehensive treatment from abstract foundations to applications in physics and engineering. The focus is on non-self-adjoint problems. Bounded operators are associated to these problems, and Chapter 1 provides an in depth investigation of eigenfunctions and associated functions for bounded Fredholm valued operators in Banach spaces. Since every n-th order differential equation is equivalentto a first order system, the main techniques are developed for systems. Asymptotic fundamentalsystems are derived for a large class of systems of differential equations. Together with boundaryconditions, which may depend polynomially on the eigenvalue parameter, this leads to the definition of Birkhoff and Stone regular eigenvalue problems. An effort is made to make the conditions relatively easy verifiable; this is illustrated with several applications in chapter 10.The contour integral method and estimates of the resolvent are used to prove expansion theorems.For Stone regular problems, not all functions are expandable, and again relatively easy verifiableconditions are given, in terms of auxiliary boundary conditions, for functions to be expandable.Chapter 10 deals exclusively with applications; in nine sections, various concrete problems such asthe Orr-Sommerfeld equation, control of multiple beams, and an example from meteorology are investigated.Key features:• Expansion Theorems for Ordinary Differential Equations• Discusses Applications to Problems from Physics and Engineering• Thorough Investigation of Asymptotic Fundamental Matrices and Systems• Provides a Comprehensive Treatment• Uses the Contour Integral Method• Represents the Problems as Bounded Operators• Investigates Canonical Systems of Eigen- and Associated Vectors for Operator Functions

    • Mathematics for Multimedia

      • 1st Edition
      • September 9, 2003
      • Mladen Victor Wickerhauser
      • English
      • eBook
        9 7 8 0 0 8 0 5 3 5 9 4 4
      Mathematics for Multimedia explains the mathematics behind multimedia applications such as compression, signal processing, and image/video processing. This timely and thoroughly modern text is a rigorous survey of selected results from algebra and analysis, requiring only undergraduate math skills. More specifically, it focuses on when and why modern robust methods provide more accurate results. The topics are 'gems' chosen for their usefulness in understanding and creating application software for multimedia signal processing and communication. The course Mathematics for Multimedia has been offered biennially at Washington University since 1997. It has proved popular with students from sophomores to beginning graduate students who seek an innovative course of rigorous contemporary mathematics with practical applications. For the instructor, the material is divided into six chapters that may be presented in six lecture hours each. Thus, the entire text may be covered in one semester, with time left for examinations and student projects. For the student, there are more than 100 exercises with complete solutions, and numerous example programs in Standard C. Each chapter ends with suggestions for further reading. The book also describes and illustrates easy-to-use software for applying cutting-edge techniques. This book is aimed at a wide audience, including computer science and multimedia students and professors as well as those interested in employing mathematics in multimedia design and implementation.

    • Discrete Optimization

      • 1st Edition
      • Volume 11
      • March 19, 2003
      • E. Boros + 1 more
      • English
      • Hardback
        9 7 8 0 4 4 4 5 1 2 9 5 6
      • eBook
        9 7 8 0 0 8 0 9 3 0 2 8 2
      One of the most frequently occurring types of optimization problems involves decision variables which have to take integer values. From a practical point of view, such problems occur in countless areas of management, engineering, administration, etc., and include such problems as location of plants or warehouses, scheduling of aircraft, cutting raw materials to prescribed dimensions, design of computer chips, increasing reliability or capacity of networks, etc. This is the class of problems known in the professional literature as "discrete optimization" problems. While these problems are of enormous applicability, they present many challenges from a computational point of view. This volume is an update on the impressive progress achieved by mathematicians, operations researchers, and computer scientists in solving discrete optimization problems of very large sizes. The surveys in this volume present a comprehensive overview of the state of the art in discrete optimization and are written by the most prominent researchers from all over the world.This volume describes the tremendous progress in discrete optimization achieved in the last 20 years since the publication of Discrete Optimization '77, Annals of Discrete Mathematics, volumes 4 and 5, 1979 (Elsevier). It contains surveys of the state of the art written by the most prominent researchers in the field from all over the world, and covers topics like neighborhood search techniques, lift and project for mixed 0-1 programming, pseudo-Boolean optimization, scheduling and assignment problems, production planning, location, bin packing, cutting planes, vehicle routing, and applications to graph theory, mechanics, chip design, etc.Key features:• state of the art surveys• comprehensiveness• prominent authors• theoretical, computational and applied aspects.This book is a reprint of Discrete Applied Mathematics Volume 23, Numbers 1-3

    • Differential Equations, Dynamical Systems, and an Introduction to Chaos

      • 2nd Edition
      • October 22, 2003
      • Morris W. Hirsch + 2 more
      • English
      • Hardback
        9 7 8 0 1 2 3 4 9 7 0 3 1
      • eBook
        9 7 8 0 0 8 0 4 9 1 1 4 1
      Differential Equations, Dynamical Systems, and an Introduction to Chaos, Second Edition, provides a rigorous yet accessible introduction to differential equations and dynamical systems. The original text by three of the world's leading mathematicians has become the standard textbook for graduate courses in this area. Thirty years in the making, this Second Edition brings students to the brink of contemporary research, starting from a background that includes only calculus and elementary linear algebra. The book explores the dynamical aspects of ordinary differential equations and the relations between dynamical systems and certain fields outside pure mathematics. It presents the simplification of many theorem hypotheses and includes bifurcation theory throughout. It contains many new figures and illustrations; a simplified treatment of linear algebra; detailed discussions of the chaotic behavior in the Lorenz attractor, the Shil'nikov systems, and the double scroll attractor; and increased coverage of discrete dynamical systems. This book will be particularly useful to advanced students and practitioners in higher mathematics.

    • C<INF>o</INF>-Semigroups and Applications

      • 1st Edition
      • Volume 191
      • March 21, 2003
      • Ioan I. Vrabie
      • English
      • Hardback
        9 7 8 0 4 4 4 5 1 2 8 8 8
      • eBook
        9 7 8 0 0 8 0 5 3 0 0 4 8
      The book contains a unitary and systematic presentation of both classical and very recent parts of a fundamental branch of functional analysis: linear semigroup theory with main emphasis on examples and applications. There are several specialized, but quite interesting, topics which didn't find their place into a monograph till now, mainly because they are very new. So, the book, although containing the main parts of the classical theory of Co-semigroups, as the Hille-Yosida theory, includes also several very new results, as for instance those referring to various classes of semigroups such as equicontinuous, compact, differentiable, or analytic, as well as to some nonstandard types of partial differential equations, i.e. elliptic and parabolic systems with dynamic boundary conditions, and linear or semilinear differential equations with distributed (time, spatial) measures. Moreover, some finite-dimensional-l... methods for certain semilinear pseudo-parabolic, or hyperbolic equations are also disscussed. Among the most interesting applications covered are not only the standard ones concerning the Laplace equation subject to either Dirichlet, or Neumann boundary conditions, or the Wave, or Klein-Gordon equations, but also those referring to the Maxwell equations, the equations of Linear Thermoelasticity, the equations of Linear Viscoelasticity, to list only a few. Moreover, each chapter contains a set of various problems, all of them completely solved and explained in a special section at the end of the book.The book is primarily addressed to graduate students and researchers in the field, but it would be of interest for both physicists and engineers. It should be emphasised that it is almost self-contained, requiring only a basic course in Functional Analysis and Partial Differential Equations.

    • Encyclopedia of General Topology

      • 1st Edition
      • November 18, 2003
      • K.P. Hart + 2 more
      • English
      • Hardback
        9 7 8 0 4 4 4 5 0 3 5 5 8
      • eBook
        9 7 8 0 0 8 0 5 3 0 8 6 4
      This book is designed for the reader who wants to get a general view of the terminology of General Topology with minimal time and effort. The reader, whom we assume to have only a rudimentary knowledge of set theory, algebra and analysis, will be able to find what they want if they will properly use the index. However, this book contains very few proofs and the reader who wants to study more systematically will find sufficiently many references in the book.Key features:• More terms from General Topology than any other book ever published• Short and informative articles• Authors include the majority of top researchers in the field• Extensive indexing of terms

    • On Growth, Form and Computers

      • 1st Edition
      • October 3, 2003
      • Sanjeev Kumar + 1 more
      • English
      • Hardback
        9 7 8 0 1 2 4 2 8 7 6 5 5
      • Paperback
        9 7 8 0 1 2 3 9 0 9 3 6 7
      • eBook
        9 7 8 0 0 8 0 4 9 7 5 8 7
      Conceived for both computer scientists and biologists alike, this collection of 22 essays highlights the important new role that computers play in developmental biology research. Essays show how through computer modeling, researchers gain further insight into developmental processes. Featured essays also cover their use in designing computer algorithms to tackle computer science problems in areas like neural network design, robot control, evolvable hardware, and more. Peter Bentley, noted for his prolific research on evolutionary computation, and Sanjeev Kumar head up a respected team to guide readers through these very complex and fascinating disciplines.

Related subjects

Mathematics and applied mathematics

Statistics and probability