This unique book provides a comprehensive introduction to computational mathematics, which forms an essential part of contemporary numerical algorithms, scientific computing and optimization. It uses a theorem-free approach with just the right balance between mathematics and numerical algorithms. This edition covers all major topics in computational mathematics with a wide range of carefully selected numerical algorithms, ranging from the root-finding algorithm, numerical integration, numerical methods of partial differential equations, finite element methods, optimization algorithms, stochastic models, nonlinear curve-fitting to data modelling, bio-inspired algorithms and swarm intelligence. This book is especially suitable for both undergraduates and graduates in computational mathematics, numerical algorithms, scientific computing, mathematical programming, artificial intelligence and engineering optimization. Thus, it can be used as a textbook and/or reference book.
Computational Mathematics: Models, Methods, and Analysis with MATLAB and MPI explores and illustrates this process. Each section of the first six chapters is motivated by a specific application. The author applies a model, selects a numerical method, implements computer simulations, and assesses the ensuing results. These chapters include an abundance of MATLAB code. By studying the code instead of using it as a "black box, " you take the first step toward more sophisticated numerical modeling. The last four chapters focus on multiprocessing algorithms implemented using message passing interface (MPI). These chapters include Fortran 9x codes that illustrate the basic MPI subroutines and revisit the applications of the previous chapters from a parallel implementation perspective. All of the codes are available for download from www4.ncsu.edu./~white. This book is not just about math, not just about computing, and not just about applications, but about all three--in other words, computational science. Whether used as an undergraduate textbook, for self-study, or for reference, it builds the foundation you need to make numerical modeling and simulation integral parts of your investigational toolbox.
The essential introduction to computational science—now fully updated and expanded Computational science is an exciting new field at the intersection of the sciences, computer science, and mathematics because much scientific investigation now involves computing as well as theory and experiment. This textbook provides students with a versatile and accessible introduction to the subject. It assumes only a background in high school algebra, enables instructors to follow tailored pathways through the material, and is the only textbook of its kind designed specifically for an introductory course in the computational science and engineering curriculum. While the text itself is generic, an accompanying website offers tutorials and files in a variety of software packages. This fully updated and expanded edition features two new chapters on agent-based simulations and modeling with matrices, ten new project modules, and an additional module on diffusion. Besides increased treatment of high-performance computing and its applications, the book also includes additional quick review questions with answers, exercises, and individual and team projects. The only introductory textbook of its kind—now fully updated and expanded Features two new chapters on agent-based simulations and modeling with matrices Increased coverage of high-performance computing and its applications Includes additional modules, review questions, exercises, and projects An online instructor's manual with exercise answers, selected project solutions, and a test bank and solutions (available only to professors) An online illustration package is available to professors
This book introduces the mathematics that supports advanced computer programming and the analysis of algorithms. The primary aim of its well-known authors is to provide a solid and relevant base of mathematical skills - the skills needed to solve complex problems, to evaluate horrendous sums, and to discover subtle patterns in data. It is an indispensable text and reference not only for computer scientists - the authors themselves rely heavily on it! - but for serious users of mathematics in virtually every discipline. Concrete Mathematics is a blending of CONtinuous and disCRETE mathematics. "More concretely," the authors explain, "it is the controlled manipulation of mathematical formulas, using a collection of techniques for solving problems." The subject matter is primarily an expansion of the Mathematical Preliminaries section in Knuth's classic Art of Computer Programming, but the style of presentation is more leisurely, and individual topics are covered more deeply. Several new topics have been added, and the most significant ideas have been traced to their historical roots. The book includes more than 500 exercises, divided into six categories. Complete answers are provided for all exercises, except research problems, making the book particularly valuable for self-study. Major topics include: Sums Recurrences Integer functions Elementary number theory Binomial coefficients Generating functions Discrete probability Asymptotic methods This second edition includes important new material about mechanical summation. In response to the widespread use of the first edition as a reference book, the bibliography and index have also been expanded, and additional nontrivial improvements can be found on almost every page. Readers will appreciate the informal style of Concrete Mathematics. Particularly enjoyable are the marginal graffiti contributed by students who have taken courses based on this material. The authors want to convey not only the importance of the techniques presented, but some of the fun in learning and using them.
The book contains the methods and bases of functional analysis that are directly adjacent to the problems of numerical mathematics and its applications; they are what one needs for the understand ing from a general viewpoint of ideas and methods of computational mathematics and of optimization problems for numerical algorithms. Functional analysis in mathematics is now just the small visible part of the iceberg. Its relief and summit were formed under the influence of this author's personal experience and tastes. This edition in English contains some additions and changes as compared to the second edition in Russian; discovered errors and misprints had been corrected again here; to the author's distress, they jump incomprehensibly from one edition to another as fleas. The list of literature is far from being complete; just a number of textbooks and monographs published in Russian have been included. The author is grateful to S. Gerasimova for her help and patience in the complex process of typing the mathematical manuscript while the author corrected, rearranged, supplemented, simplified, general ized, and improved as it seemed to him the book's contents. The author thanks G. Kontarev for the difficult job of translation and V. Klyachin for the excellent figures.
From the winner of the Turing Award and the Abel Prize, an introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy Mathematics and Computation provides a broad, conceptual overview of computational complexity theory—the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field’s insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered. Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation. Comprehensive coverage of computational complexity theory, and beyond High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline Historical accounts of the evolution and motivations of central concepts and models A broad view of the theory of computation's influence on science, technology, and society Extensive bibliography
This is a book on the basics of mathematics and computation and their uses in economics for modern day students and practitioners. The reader is introduced to the basics of numerical analysis as well as the use of computer programs such as Matlab and Excel in carrying out involved computations. Sections are devoted to the use of Maple in mathematical analysis. Examples drawn from recent contributions to economic theory and econometrics as well as a variety of end of chapter exercises help to illustrate and apply the presented concepts.
This book differs from traditional numerical analysis texts in that it focuses on the motivation and ideas behind the algorithms presented rather than on detailed analyses of them. It presents a broad overview of methods and software for solving mathematical problems arising in computational modeling and data analysis, including proper problem formulation, selection of effective solution algorithms, and interpretation of results.? In the 20 years since its original publication, the modern, fundamental perspective of this book has aged well, and it continues to be used in the classroom. This Classics edition has been updated to include pointers to Python software and the Chebfun package, expansions on barycentric formulation for Lagrange polynomial interpretation and stochastic methods, and the availability of about 100 interactive educational modules that dynamically illustrate the concepts and algorithms in the book. Scientific Computing: An Introductory Survey, Second Edition is intended as both a textbook and a reference for computationally oriented disciplines that need to solve mathematical problems.
Unique in content and approach, this book covers all the topics that are usually covered in an introduction to scientific computing--but folds in graphics and matrix-vector manipulation in a way that gets readers to appreciate the "connection" between continuous mathematics and computing. "MATLAB 5" is used "throughout" to encourage experimentation, and each chapter focuses on a different important theorem--allowing readers to appreciate the rigorous side of scientific computing. In addition to standard topical coverage, each chapter includes 1) a sketch of a "hard" problem that involves ill-conditioning, high dimension, etc.; 2)at least one theorem with both a rigorous proof and a "proof by MATLAB" experiment to bolster intuition; 3)at least one recursive algorithm; and 4)at least one connection to a real-world application. The book revolves around examples that are packaged in 200+ M-files, which, collectively, communicate all the key mathematical ideas and an appreciation for the subtleties of numerical computing. Power Tools of the Trade. Polynomial Interpolation. Piecewise Polynomial Interpolation. Numerical Integration. Matrix Computations. Linear Systems. The QR and Cholesky Factorizations. Nonlinear Equations and Optimization. The Initial Value Problem. For engineers and mathematicians.
This course text fills a gap for first-year graduate-level students reading applied functional analysis or advanced engineering analysis and modern control theory. Containing 100 problem-exercises, answers, and tutorial hints, the first edition is often cited as a standard reference. Making a unique contribution to numerical analysis for operator equations, it introduces interval analysis into the mainstream of computational functional analysis, and discusses the elegant techniques for reproducing Kernel Hilbert spaces. There is discussion of a successful ''hybrid'' method for difficult real-life problems, with a balance between coverage of linear and non-linear operator equations. The authors successful teaching philosophy: ''We learn by doing'' is reflected throughout the book. - Contains 100 problem-exercises, answers and tutorial hints for students reading applied functional analysis - Introduces interval analysis into the mainstream of computational functional analysis
