In this second edition, extensive computer projects are added as well as new material throughout.
Reviews of previous edition:
"The well-written monograph is devoted to students at the undergraduate level, but is also useful for practising engineers." (Zentralblatt MATH, 2007)
Relevant mathematical analysis (which might employ vector calculus, Fourier series, nonlinear ODEs, bifurcation theory, perturbation theory, potential theory, control theory, or probability theory) or scientific computing (which might include Newton's method, the method of lines, finite differences, finite elements, finite volumes, boundary elements, projection methods, smoothed particle hydrodynamics, or Lagrangian methods) is developed in context and used to make physically significant predictions. The target audience is advanced undergraduates (who have at least a working knowledge of vector calculus and linear ordinary differential equations) or beginning graduate students.
Readers will gain a solid and exciting introduction to modeling, mathematical analysis, and computation that provides the key ideas and skills needed to enter the wider world of modern applied mathematics.Presents an integrated wealth of modeling, analysis, and numerical methods in one volumeProvides practical and comprehensible introductions to complex subjects, for example, conservation laws, CFD, SPH, BEM, and FEMIncludes a rich set of applications, with more appealing problems and projects suggested
This is the most authoritative and accessible single-volume reference book on applied mathematics. Featuring numerous entries by leading experts and organized thematically, it introduces readers to applied mathematics and its uses; explains key concepts; describes important equations, laws, and functions; looks at exciting areas of research; covers modeling and simulation; explores areas of application; and more.
Modeled on the popular Princeton Companion to Mathematics, this volume is an indispensable resource for undergraduate and graduate students, researchers, and practitioners in other disciplines seeking a user-friendly reference book on applied mathematics.
Exploring related methods that can be utilized in various fields of practice from science and engineering to business, A First Course in Applied Mathematics details how applied mathematics involves predictions, interpretations, analysis, and mathematical modeling to solve real-world problems.
Written at a level that is accessible to readers from a wide range of scientific and engineering fields, the book masterfully blends standard topics with modern areas of application and provides the needed foundation for transitioning to more advanced subjects. The author utilizes MATLAB® to showcase the presented theory and illustrate interesting real-world applications to Google's web page ranking algorithm, image compression, cryptography, chaos, and waste management systems. Additional topics covered include:
Ranking web pages
Ordinary differential equations
Throughout the book, theoretical and applications-oriented problems and exercises allow readers to test their comprehension of the presented material. An accompanying website features related MATLAB® code and additional resources.
A First Course in Applied Mathematics is an ideal book for mathematics, computer science, and engineering courses at the upper-undergraduate level. The book also serves as a valuable reference for practitioners working with mathematical modeling, computational methods, and the applications of mathematics in their everyday work.
The book is designed primarily for readers interested in applications. The level of preparation required corresponds to the equivalent of a first-year graduate course in applied mathematics. No previous exposure to dynamical systems theory or the theory of stochastic processes is required. The theoretical prerequisites and developments are presented in the first part of the book. The second part of the book is devoted to applications, ranging from physics to mechanical engineering, naval architecture, oceanography, nonlinear control, stochastic resonance, and neurophysiology.
This revision is a cover-to-cover expansion and renovation of the third edition. It now includes an introduction to tensor computations and brand new sections on • fast transforms• parallel LU• discrete Poisson solvers• pseudospectra• structured linear equation problems• structured eigenvalue problems• large-scale SVD methods• polynomial eigenvalue problems
Matrix Computations is packed with challenging problems, insightful derivations, and pointers to the literature—everything needed to become a matrix-savvy developer of numerical methods and software.
Mathematics acts as a foundation for new advances, as engineering evolves and develops. This book will be of great interest to postgraduate and senior undergraduate students, and researchers, in engineering and mathematics, as well as to engineers, policy makers, and scientists involved in the application of mathematics in engineering.Covers many mathematical techniques for robotics, computer science, mechanical engineering, HCI and machinabilityDescribes different algorithmsExplains different modeling techniques and simulations
This book is an excellent resource for students and professionals in control theory, robotics, engineering, computer graphics, econometrics, and any area that requires the construction of curves based on sets of raw data.
Rays, Waves, and Scattering is a valuable resource for practitioners, graduate students, and advanced undergraduates in applied mathematics, theoretical physics, and engineering. Bridging the gap between advanced treatments of the subject written for specialists and less mathematical books aimed at beginners, this unique mathematical compendium features problems and exercises throughout that are geared to various levels of sophistication, covering everything from Ptolemy's theorem to Airy integrals (as well as more technical material), and several informative appendixes.
Large-scale dynamical systems are strongly interconnected and consist of interacting subsystems exchanging matter, energy, or information with the environment. The sheer size, or dimensionality, of these systems necessitates decentralized analysis and control system synthesis methods for their analysis and design. Written in a theorem-proof format with examples to illustrate new concepts, this book addresses continuous-time, discrete-time, and hybrid large-scale systems. It develops finite-time stability and finite-time decentralized stabilization, thermodynamic modeling, maximum entropy control, and energy-based decentralized control.
This book will interest applied mathematicians, dynamical systems theorists, control theorists, and engineers, and anyone seeking a fundamental and comprehensive understanding of large-scale interconnected dynamical systems and control.
Defending the Internet is a complex effort, but applying the right techniques from mathematics can make this task more manageable. This book is essential reading for creating useful and replicable methods for analyzing data.Describes mathematical tools for solving cybersecurity problems, enabling analysts to pick the most optimal tool for the task at handContains numerous cybersecurity examples and exercises using real world dataWritten by mathematicians and statisticians with hands-on practitioner experience
The authors deal with linear optimization, nonlinear complementarity problems, semidefinite optimization, and second-order conic optimization problems. The framework also covers large classes of linear complementarity problems and convex optimization. The algorithm considered can be interpreted as a path-following method or a potential reduction method. Starting from a primal-dual strictly feasible point, the algorithm chooses a search direction defined by some Newton-type system derived from the self-regular proximity. The iterate is then updated, with the iterates staying in a certain neighborhood of the central path until an approximate solution to the problem is found. By extensively exploring some intriguing properties of self-regular functions, the authors establish that the complexity of large-update IPMs can come arbitrarily close to the best known iteration bounds of IPMs.
Researchers and postgraduate students in all areas of linear and nonlinear optimization will find this book an important and invaluable aid to their work.
New research covered by the book encompasses skew cyclic codes, decomposition theory of quasi-cyclic codes and related codes and duality over Frobenius rings. Primarily suitable for ring theorists at PhD level engaged in application research and coding theorists interested in algebraic foundations, the work is also valuable to computational scientists and working cryptologists in the area.Consolidates 20+ years of research in one volume, helping researchers save time in the evaluation of disparate literatureDiscusses duality formulas in the context of Frobenius ringsReviews decomposition of quasi-cyclic codes under ring actionEvaluates the ideal and modular structure of skew-cyclic codesSupports applications in data compression, distributed storage, network coding, cryptography and across error-correction
The authors of this book are the same pioneers who for nearly two decades have led the investigation into the traveling salesman problem. They have derived solutions to almost eighty-six thousand cities, yet a general solution to the problem has yet to be discovered. Here they describe the method and computer code they used to solve a broad range of large-scale problems, and along the way they demonstrate the interplay of applied mathematics with increasingly powerful computing platforms. They also give the fascinating history of the problem--how it developed, and why it continues to intrigue us.
The authors begin by developing the general theory of curves over any field, highlighting peculiarities occurring for positive characteristic and requiring of the reader only basic knowledge of algebra and geometry. The special properties that a curve over a finite field can have are then discussed. The geometrical theory of linear series is used to find estimates for the number of rational points on a curve, following the theory of Stöhr and Voloch. The approach of Hasse and Weil via zeta functions is explained, and then attention turns to more advanced results: a state-of-the-art introduction to maximal curves over finite fields is provided; a comprehensive account is given of the automorphism group of a curve; and some applications to coding theory and finite geometry are described. The book includes many examples and exercises. It is an indispensable resource for researchers and the ideal textbook for graduate students.
The authors have made three main kinds of changes. First, they have enlarged on the topics treated in the first edition. Second, they have added many exercises and problems at the end of each chapter. Third, and most important, they have supplied, in new chapters, broad introductory discussions of several classes of stochastic processes not dealt with in the first edition, notably martingales, renewal and fluctuation phenomena associated with random sums, stationary stochastic processes, and diffusion theory.
The book uses classical and ad hoc tools, but a unifying theme is the elementary bidiagonal factorization, which has emerged as the single most important tool for this particular class of matrices. Recent work has shown that bidiagonal factorizations may be viewed in a succinct combinatorial way, leading to many deep insights. Despite slow development, bidiagonal factorizations, along with determinants, now provide the dominant methodology for understanding total nonnegativity. The remainder of the book treats important topics, such as recognition of totally nonnegative or totally positive matrices, variation diminution, spectral properties, determinantal inequalities, Hadamard products, and completion problems associated with totally nonnegative or totally positive matrices. The book also contains sample applications, an up-to-date bibliography, a glossary of all symbols used, an index, and related references.