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.

  • Business Continuity and Disaster Recovery Planning for IT Professionals

    • 1st Edition
    • Susan Snedaker
    • English
    Powerful Earthquake Triggers Tsunami in Pacific. Hurricane Katrina Makes Landfall in the Gulf Coast. Avalanche Buries Highway in Denver. Tornado Touches Down in Georgia. These headlines not only have caught the attention of people around the world, they have had a significant effect on IT professionals as well. As technology continues to become more integral to corporate operations at every level of the organization, the job of IT has expanded to become almost all-encompassing. These days, it’s difficult to find corners of a company that technology does not touch. As a result, the need to plan for potential disruptions to technology services has increased exponentially. That is what Business Continuity Planning (BCP) is: a methodology used to create a plan for how an organization will recover after a disaster of various types. It takes into account both security and corporate risk management tatics.There is a lot of movement around this initiative in the industry: the British Standards Institute is releasing a new standard for BCP this year. Trade shows are popping up covering the topic.

  • Mathematical Modeling

    • 3rd Edition
    • Mark Meerschaert
    • English
    Mathematical Modeling, Third Edition is a general introduction to an increasingly crucial topic for today's mathematicians. Unlike textbooks focused on one kind of mathematical model, this book covers the broad spectrum of modeling problems, from optimization to dynamical systems to stochastic processes. Mathematical modeling is the link between mathematics and the rest of the world. Meerschaert shows how to refine a question, phrasing it in precise mathematical terms. Then he encourages students to reverse the process, translating the mathematical solution back into a comprehensible, useful answer to the original question. This textbook mirrors the process professionals must follow in solving complex problems.Each chapter in this book is followed by a set of challenging exercises. These exercises require significant effort on the part of the student, as well as a certain amount of creativity. Meerschaert did not invent the problems in this book--they are real problems, not designed to illustrate the use of any particular mathematical technique. Meerschaert's emphasis on principles and general techniques offers students the mathematical background they need to model problems in a wide range of disciplines.

  • Advances in Computers

    • 1st Edition
    • Volume 70
    • Marvin Zelkowitz
    • English
    Advances in Computers covers new developments in computer technology. Most chapters present an overview of a current subfield within computers, with many citations, and often include new developments in the field by the authors of the individual chapters. Topics include hardware, software, theoretical underpinnings of computing, and novel applications of computers. This current volume includes six chapters on hardware development in the educational market, intelligent search strategies, domain specific languages and trustworthiness and risks in computer technology. The book series is a valuable addition to university courses that emphasize the topics under discussion in that particular volume as well as belonging on the bookshelf of industrial practitioners who need to implement many of the technologies that are described.

  • Viability, Invariance and Applications

    • 1st Edition
    • Volume 207
    • Ovidiu Carja + 2 more
    • English
    The book is an almost self-contained presentation of the most important concepts and results in viability and invariance. The viability of a set K with respect to a given function (or multi-function) F, defined on it, describes the property that, for each initial data in K, the differential equation (or inclusion) driven by that function or multi-function) to have at least one solution. The invariance of a set K with respect to a function (or multi-function) F, defined on a larger set D, is that property which says that each solution of the differential equation (or inclusion) driven by F and issuing in K remains in K, at least for a short time.The book includes the most important necessary and sufficient conditions for viability starting with Nagumo’s Viability Theorem for ordinary differential equations with continuous right-hand sides and continuing with the corresponding extensions either to differential inclusions or to semilinear or even fully nonlinear evolution equations, systems and inclusions. In the latter (i.e. multi-valued) cases, the results (based on two completely new tangency concepts), all due to the authors, are original and extend significantly, in several directions, their well-known classical counterparts.

  • Numerical Methods for Roots of Polynomials - Part I

    • 1st Edition
    • Volume 14
    • J.M. McNamee
    • English
    Numerical Methods for Roots of Polynomials - Part I (along with volume 2 covers most of the traditional methods for polynomial root-finding such as Newton’s, as well as numerous variations on them invented in the last few decades. Perhaps more importantly it covers recent developments such as Vincent’s method, simultaneous iterations, and matrix methods. There is an extensive chapter on evaluation of polynomials, including parallel methods and errors. There are pointers to robust and efficient programs. In short, it could be entitled “A Handbook of Methods for Polynomial Root-finding”. This book will be invaluable to anyone doing research in polynomial roots, or teaching a graduate course on that topic.

  • Security+ Study Guide

    • 2nd Edition
    • Ido Dubrawsky + 1 more
    • English
    Over 700,000 IT Professionals Have Prepared for Exams with Syngress Authored Study GuidesThe Security+ Study Guide & Practice Exam is a one-of-a-kind integration of text and and Web-based exam simulation and remediation. This system gives you 100% coverage of official CompTIA Security+ exam objectives plus test preparation software for the edge you need to achieve certification on your first try! This system is comprehensive, affordable, and effective!* Completely Guaranteed Coverage of All Exam ObjectivesAll five Security+ domains are covered in full: General Security Concepts, Communication Security, Infrastructure Security, Basics of Cryptography, and Operational / Organizational Security * Fully Integrated LearningThis package includes a Study Guide and one complete practice exam. * Each chapter starts by explaining the exam objectives covered in the chapterYou will always know what is expected of you within each of the exam’s domains.* Exam-Specific Chapter ElementsNotes, Tips, Alerts, Exercises, Exam’s Eyeview, and Self Test with fully explained answers. * Test What You LearnedHundreds of self-test review questions test your knowledge of specific exam objectives. A Self Test Appendix features answers to all questions with complete explanations of correct and incorrect answers.

  • Handbook of Differential Equations: Stationary Partial Differential Equations

    • 1st Edition
    • Volume 4
    • Michel Chipot
    • English
    A collection of self contained state-of-the art surveys. The authors have made an effort to achieve readability for mathematicians and scientists from other fields, for this series of handbooks to be a new reference for research, learning and teaching.

  • Advances in Computers

    Architectural Advances
    • 1st Edition
    • Volume 69
    • Marvin Zelkowitz
    • English
    The series covers new developments in computer technology. Most chapters present an overview of a current subfield within computers, with many citations, and often include new developments in the field by the authors of the individual chapters. Topics include hardware, software, theoretical underpinnings of computing, and novel applications of computers. This current volume emphasizes architectural advances and includes five chapters on hardware development, games for mobile devices such as cell phones, and open source software development. The book series is a valuable addition to university courses that emphasize the topics under discussion in that particular volume as well as belonging on the bookshelf of industrial practitioners who need to implement many of the technologies that are described.

  • Residuated Lattices: An Algebraic Glimpse at Substructural Logics

    • 1st Edition
    • Volume 151
    • Nikolaos Galatos + 3 more
    • English
    The book is meant to serve two purposes. The first and more obvious one is to present state of the art results in algebraic research into residuated structures related to substructural logics. The second, less obvious but equally important, is to provide a reasonably gentle introduction to algebraic logic. At the beginning, the second objective is predominant. Thus, in the first few chapters the reader will find a primer of universal algebra for logicians, a crash course in nonclassical logics for algebraists, an introduction to residuated structures, an outline of Gentzen-style calculi as well as some titbits of proof theory - the celebrated Hauptsatz, or cut elimination theorem, among them. These lead naturally to a discussion of interconnections between logic and algebra, where we try to demonstrate how they form two sides of the same coin. We envisage that the initial chapters could be used as a textbook for a graduate course, perhaps entitled Algebra and Substructural Logics. As the book progresses the first objective gains predominance over the second. Although the precise point of equilibrium would be difficult to specify, it is safe to say that we enter the technical part with the discussion of various completions of residuated structures. These include Dedekind-McNeille completions and canonical extensions. Completions are used later in investigating several finiteness properties such as the finite model property, generation of varieties by their finite members, and finite embeddability. The algebraic analysis of cut elimination that follows, also takes recourse to completions. Decidability of logics, equational and quasi-equational theories comes next, where we show how proof theoretical methods like cut elimination are preferable for small logics/theories, but semantic tools like Rabin's theorem work better for big ones. Then we turn to Glivenko's theorem, which says that a formula is an intuitionistic tautology if and only if its double negation is a classical one. We generalise it to the substructural setting, identifying for each substructural logic its Glivenko equivalence class with smallest and largest element. This is also where we begin investigating lattices of logics and varieties, rather than particular examples. We continue in this vein by presenting a number of results concerning minimal varieties/maximal logics. A typical theorem there says that for some given well-known variety its subvariety lattice has precisely such-and-such number of minimal members (where values for such-and-such include, but are not limited to, continuum, countably many and two). In the last two chapters we focus on the lattice of varieties corresponding to logics without contraction. In one we prove a negative result: that there are no nontrivial splittings in that variety. In the other, we prove a positive one: that semisimple varieties coincide with discriminator ones. Within the second, more technical part of the book another transition process may be traced. Namely, we begin with logically inclined technicalities and end with algebraically inclined ones. Here, perhaps, algebraic rendering of Glivenko theorems marks the equilibrium point, at least in the sense that finiteness properties, decidability and Glivenko theorems are of clear interest to logicians, whereas semisimplicity and discriminator varieties are universal algebra par exellence. It is for the reader to judge whether we succeeded in weaving these threads into a seamless fabric.

  • Open Problems in Topology II

    • 1st Edition
    • Elliott M. Pearl
    • English
    This volume is a collection of surveys of research problems in topology and its applications. The topics covered include general topology, set-theoretic topology, continuum theory, topological algebra, dynamical systems, computational topology and functional analysis.

Related subjects