Scientific Computation On Mathematical Problems And Conjectures

This book studies the use of scientific computation as a tool in attacking a number of mathematical problems and conjectures. In this case, scientific computation refers primarily to computations that are carried out with a large number of significant digits, for calculations associated with a variety of numerical techniques such as the (second) Remez algorithm in polynomial and rational approximation theory, Richardson extrapolation of sequences of numbers, the accurate finding of zeros of polynomials of large degree, and the numerical approximation of integrals by quadrature techniques. The goal of this book is not to delve into the specialized field dealing with the creation of robust and reliable software needed to implement these high-precision calculations, but rather to emphasize the enormous power that existing software brings to the mathematician's arsenal of weapons for attacking mathematical problems and conjectures.

Many interesting behaviors of real physical, biological, economical, and chemical systems can be described by ordinary differential equations (ODEs). Scientific Computing with Mathematica for Ordinary Differential Equations provides a general framework useful for the applications, on the conceptual aspects of the theory of ODEs, as well as a sophisticated use of Mathematica software for the solutions of problems related to ODEs. In particular, a chapter is devoted to the use ODEs and Mathematica in the Dynamics of rigid bodies. Mathematical methods and scientific computation are dealt with jointly to supply a unified presentation. The main problems of ordinary differential equations such as, phase portrait, approximate solutions, periodic orbits, stability, bifurcation, and boundary problems are covered in an integrated fashion with numerous worked examples and computer program demonstrations using Mathematica. Topics and Features:*Explains how to use the Mathematica package ODE.m to support qualitative and quantitative problem solving *End-of- chapter exercise sets incorporating the use of Mathematica programs *Detailed description and explanation of the mathematical procedures underlying the programs written in Mathematica *Appendix describing the use of ten notebooks to guide the reader through all the exercises. This book is an essential text/reference for students, graduates and practitioners in applied mathematics and engineering interested in ODE's problems in both the qualitative and quantitative description of solutions with the Mathematica program. It is also suitable as a self-

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.

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

A New Approach to Scientific Computation is a collection of papers delivered at a symposium held at the IBM Thomas J. Watson Research Center on August 3, 1982. The symposium provided a forum for reviewing various aspects of an approach to scientific computation based on a systematic theory of computer arithmetic. Computer demonstration packages for standard problems of numerical mathematics are considered. Comprised of 12 chapters, this volume begins by summarizing an extensive research activity in scientific computation as well as the experience gained through various implementations of a new approach to arithmetic on diverse processors, including even microprocessors. A complete listing of the spaces that occur in numerical computations is presented, followed by a discussion of aspects of traditional computer arithmetic and a new definition of computer arithmetic. The properties of semimorphisms are also considered. Subsequent chapters focus on potential applications of programming packages to standard problems in numerical analysis implemented on a Z80 based minicomputer, with a PASCAL extension called PASCAL-SC as the programming language; methods for solving algebraic problems with high accuracy; and the use of a computer with floating-point arithmetic to obtain guaranteed sharp bounds for the value of an arithmetic expression. An extension of FORTRAN which satisfies contemporary requirements of numerical computation is also described. This book will be helpful to students and practitioners in the fields of computer science and applied mathematics.

This book introduces students with diverse backgrounds to various types of mathematical analysis that are commonly needed in scientific computing. The subject of numerical analysis is treated from a mathematical point of view, offering a complete analysis of methods for scientific computing with appropriate motivations and careful proofs. In an engaging and informal style, the authors demonstrate that many computational procedures and intriguing questions of computer science arise from theorems and proofs. Algorithms are presented in pseudocode, so that students can immediately write computer programs in standard languages or use interactive mathematical software packages. This book occasionally touches upon more advanced topics that are not usually contained in standard textbooks at this level.

This is the revised and extended second edition of the successful basic book on computer arithmetic. It is consistent with the newest recent standard developments in the field. The book shows how the arithmetic and mathematical capability of the digital computer can be enhanced in a quite natural way. The work is motivated by the desire and the need to improve the accuracy of numerical computing and to control the quality of the computed results (validity). The accuracy requirements for the elementary floating-point operations are extended to the customary product spaces of computations including interval spaces. The mathematical properties of these models are extracted into an axiomatic approach which leads to a general theory of computer arithmetic. Detailed methods and circuits for the implementation of this advanced computer arithmetic on digital computers are developed in part two of the book. Part three then illustrates by a number of sample applications how this extended computer arithmetic can be used to compute highly accurate and mathematically verified results. The book can be used as a high-level undergraduate textbook but also as reference work for research in computer arithmetic and applied mathematics.

The book contains some of the most important results on the analysis of polynomials and their derivatives. Besides the fundamental results which are treated with their proofs, the book also provides an account of the most recent developments concerning extremal properties of polynomials and their derivatives in various metrics with an extensive analysis of inequalities for trigonometric sums and algebraic polynomials, as well as their zeros. The final chapter provides some selected applications of polynomials in approximation theory and computer aided geometric design (CAGD). One can also find in this book several new research problems and conjectures with sufficient information concerning the results obtained to date towards the investigation of their solution. Contents:PrefaceGeneral Concept of Algebraic PolynomialsSelected Polynomial InequalitiesZeros of PolynomialsInequalities Connected with Trigonometric SumsExtremal Problems for PolynomialsExtremal Problems of Markov-Bernstein TypeSome Applications of PolynomialsSymbol IndexName IndexSubject Index Readership: Mathematicians and mathematical physicists. keywords:Algebraic Polynomials;Trigonometric Polynomials;Zeros;Extremal Problems;Trigonometric Sums;Positivity and Monotonicity;Distribution of Zeros;Bounds for Polynomial Zeros;Incomplete Polynomials;Polynomials with Minimal Norm;Markov-Bernstein Inequalities;Approximation;Symmetric Functions;Orthogonal Polynomials;Nonnegative Polynomials “The topics are tastefully selected and the results are easy to find. Although this book is not really planned as a textbook to teach from, it is excellent for self-study or seminars. This is a very useful reference book with many results which have not appeared in a book form yet. It is an important addition to the literature.” Journal of Approximation Theory “I find the book to be well written and readable. The authors have made an attempt to present the material in an integrated and self-contained fashion and, in my opinion, they have been greatly successful. The book would be useful not only for the specialist mathematician, but also for those researchers in the applied and computational sciences who use polynomials as a tool.” Mathematical Reviews “This is a remarkable book, offering a cornucopia of results, all connected by their involvement with polynomials. The scope of the volume can be conveyed by citing some statistics: there are 821 pages, 7 chapters, 20 sections, 108 subsections, 95 pages of references (distributed throughout the book), a name index of 16 pages, and a subject index of 19 pages … The book is written in a gentle style: one can open it anywhere and begin to understand, without encountering unfamiliar notation and terminology. It is strongly recommended to individuals and to libraries.” Mathematics of Computation “This book contains some of the most important results on the analysis of polynomials and their derivatives … is intended, not only for the specialist mathematician, but also for those researchers in the applied sciences who use polynomials as a tool.” Sever S Dragomir “This is a well-written book on a widely useful topic. It is strongly recommended not only to the mathematical specialist, but also to all those researchers in the applied and computational sciences who make frequent use of polynomials as a tool. Of course, libraries will also benefit greatly by including this book in their cherished collection.” Mathematics Abstracts “There is no doubt that this is a very useful work compiling enormous researches carried out on the subject … This is a well-written book on a widely useful topic.” Zentralblatt für Mathematik