Ching, W.K., University of Southampton, UK
Iterative Methods for Queuing and Manufacturing Systems
2001. XV, 160 pp. 17 figs. Hardcover
1-85233-416-9
Iterative Methods for Queuing and Manufacturing Systems introduces the recent advances
and developments in iterative methods for solving Markovian queuing and manufacturing problems.
Key highlights include:
- an introduction to simulation and simulation software packages;
- Markovian models with applications in inventory control and supply chains; future research directions.
With numerous exercises and fully-worked examples, this book will be essential reading for anyone
interested in the formulation and computation of queuing and manufacturing systems but it will be of
particular interest to students, practitioners and researchers in Applied Mathematics, Scientific
Computing and Operational Research.
Contents: Introduction and Overview.- Toeplitz-Circulant Preconditioners for Queuing Systems with
Batch Arrivals.- Circulant Based Preconditioners for Queuing Systems with Markov Modulated Poisson
Processes Inputs.- Application of MMPP to Manufacturing Systems of Multiple Unreliable Machines.-
Manufacturing Systems with Batch Arrivals.- Flexible Manufacturing Systems of Unreliable Machines.-
Manufacturing Systems of Two Machines in Tandem.- Manufacturing Systems with Delivery Time
Guarantee.- Multi-Location and Two-Echelon Inventory Systems.- References.
Series: Springer Monographs in Mathematics.
Jungnickel, D., University of Augsburg, Germany
Niederreiter, H., Austrian Academy of Sciences, Vienna, Austria
(Eds.)
Finite Fields and Applications
2001. IX, 490 pp. Hardcover
3-540-41109-7
The Fifth International Conference on Finite Fields and Applications Fq5 held at the University of
Augsburg, Germany, from August 2-6, 1999 continued a series of biennial international conferences on
finite fields. The proceedings document the steadily increasing interest in this topic. Finite fields have an
inherently fascinating structure and are important tools in discrete mathematics. Their applications
range from combinatorial design theory, finite geometries, and algebraic geometry to coding theory,
cryptology, and scientific computing. A particularly fruitful aspect is the interplay between theory and
applications which has led to many new perspectives in research on finite fields. This interplay has always
been a dominant theme in Fq conferences and was very much in evidence at Fq5. The proceedings
reflect this, and offer an up-to-date collection of surveys and original research articles by leading
experts in the area.
Keywords: Finite fields, Galois field, cryptography, Galois geometry, coding theory
ields: Combinatorial Mathematics/Graph Theory and Discrete Mathematics; Data
Structures, Cryptology and Information Theory; Rings, Fields, Modules
Written for: Researchers and graduate students in mathematics, computer science,
communication sciences
Book category: Proceedings
Publication language: English
Atkinson, K., University of Iowa, Iowa City, IA, USA
Han, W., University of Iowa, Iowa City, IA, USA
Theoretical Numerical Analysis
A Functional Analysis Framework
2001. Approx. 495 pp. 25 figs. Hardcover
0-387-95142-3
This book gives an introduction to functional analysis for graduate students pursuing research involving
numerical analysis. The text covers basic results of functional analysis as well as additional topics needed
in theoretical numerical analysis. Applications of this functional analysis are given by considering
numerical methods for solving partial differential equations and integral equations. Extensive exercises
are included at the end of each section along with recommendations for additional reading. This book is
especially suited to students interested in the numerical solution of differential and/or integral
equations, but it will appeal to numerical analysts and mathematically-oriented students and researchers
in engineering, physics, and related areas.
Contents: Preface.- 1 Linear Spaces.- 2 Linear Operators on Normed Spaces.- 3 Approximation
Theory.- 4 Nonlinear Equations and Their Solution by Iteration.- 5 Finite Difference Method.- 6
Sobolev Spaces.- 7 Variational Formulations of Elliptic Boundary Value Problems.- 8 The Galerkin
Method and Its Variants.- 9 Finite Element Analysis.- 10 Elliptic Variational Inequalities and Their
Numerical Approximations.- 11 Numerical Solution of Fredholm Integral Equations of the Second
Kind.- 12 Boundary Integral Equations.- References.- Index.
Series: Texts in Applied Mathematics.VOL. 39
Betounes, D., University of Southern Mississippi, Hattiesburg, MS, USA
Differential Equations: Theory and Applications With Maple
2001. Approx. 740 pp. 195 figs., with CD-ROM. Hardcover
0-387-95140-7
This book provides a comprehensive introduction to the theory of ordinary differential equations with a
focus on mechanics and dynamical systems as important applications of the theory. The text is written
to be used in the traditional way (emphasis on the theory with the computer component as optional) or
in a more applied way (emphasis on the applications and the computer material). The accompanying CD
contains Maple worksheets to use in working the exercises and extending the examples. The disk also
contains special Maple code for performing various tasks.
In addition to its use in a traditional one- or two- (there is enough material for two) semester graduate
course in mathematics, the book is organized to be used for interdisciplinary courses in applied
mathematics, physics, and engineering. Researchers and professionals may also find the supplementary
material on the disk on discrete dynamical systems, theory of iterated maps, and code for performing
specific tasks on the disks particularly useful.
Contents: Introduction.- Techniques, Concepts & Examples.- Existence & Uniqueness-The Flow
Map.- One Dimensional Systems.- Linear Systems.- Linearization & Transformation.- Stability
Theory.- Integrable Systems.- Newtonian Mechanics.- Motion on a Submanifold.- Hamiltonian
Systems.- Appendix A: Elementary Analysis.- Appendix B: Lipschitz Maps and Linearization.-
Appendix C: Linear Algebra.
System requirements: IBM PC or 100% compatible, CPU: Pentium, 64 MB RAM, Mouse, CD-ROM
player, Operating System: Microsoft Windows 95 (or higher), Windows NT 4.0, Unix, or Mac. Software:
Maple V Release 5 or Maple 6.
Fishman, G.S., University of North Carolina at Chapel Hill, NC, USA
Discrete-Event Simulation
Modeling, Programming, and Analysis
2001. Approx. 500 pp. Hardcover
0-387-95160-1
Discrete-event simulation consists of a collection of techniques that when applied to a discrete-event
dynamical system, generates sequences called sample paths that characterize its behavior. The collection
includes modelling concepts for abstracting the essential features of a system, using specially designed
software for converting these relationships into computer executable code capable of generating the
requisite sample-path data; outlining procedures for converting these data into estimates of systems
performances; and then illustrating methods for assessing how well these estimates approximate true,
but unknown system behavior.
This book is intended for upper level undergraduate and graduate students in operations research and
management science, mathematics, industrial engineering, computer science, and business and features
extensive exercises throughout. This concept of modelling complex sytems allows a relatively low-cost
way of gathering information for decision-making.
Principally offered are four problems for student exercises; each is progressively brought forward
through the modelling, programming, and analysis chapters, providing continuity to the learning
process.
Contents: Preface.- Simulation in Perspective.- Modeling Concepts Data Collection and Averages.-
Programming and Execution.- Search, Space, and Time.- Output Analysis.- Making Sense of Output
and Increasing Efficiency.- Sampling from Probability Distributions.- Pseudorandom Number
Generation.- Preparing the Input.- Appendices.- Index.
Series: Springer Series in Operations Research.