Scientific Computation on Mathematical Problems and Conjectures
Scientific Computation on Mathematical Problems and Conjectures

Author: Richard S. Varga

Publisher: SIAM

Published: 1990-01-01

Total Pages: 128

ISBN-13: 9781611970111

DOWNLOAD EBOOK

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. Scientific Computation on Mathematical Problems and Conjectures includes studies of the Bernstein Conjecture of 1913 in polynomial approximation theory, the "1/9" Conjecture of 1977 in rational approximation theory, the famous Riemann Hypothesis of 1859, and the Polya Conjecture of 1927. The emphasis of this monograph rests strongly on the interplay between hard analysis and high-precision calculations.

Scientific Computation on Mathematical Problems and Conjectures
Scientific Computation on Mathematical Problems and Conjectures

Author: Richard S. Varga

Publisher: SIAM

Published: 1990-01-01

Total Pages: 128

ISBN-13: 0898712572

DOWNLOAD EBOOK

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.

Mathematics and Computation
Mathematics and Computation

Author: Avi Wigderson

Publisher: Princeton University Press

Published: 2019-10-29

Total Pages: 434

ISBN-13: 0691189137

DOWNLOAD EBOOK

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

Mathematical Reasoning
Mathematical Reasoning

Author: Raymond Nickerson

Publisher: Taylor & Francis

Published: 2011-02-25

Total Pages: 597

ISBN-13: 1136945393

DOWNLOAD EBOOK

The development of mathematical competence -- both by humans as a species over millennia and by individuals over their lifetimes -- is a fascinating aspect of human cognition. This book explores when and why the rudiments of mathematical capability first appeared among human beings, what its fundamental concepts are, and how and why it has grown into the richly branching complex of specialties that it is today. It discusses whether the ‘truths’ of mathematics are discoveries or inventions, and what prompts the emergence of concepts that appear to be descriptive of nothing in human experience. Also covered is the role of esthetics in mathematics: What exactly are mathematicians seeing when they describe a mathematical entity as ‘beautiful’? There is discussion of whether mathematical disability is distinguishable from a general cognitive deficit and whether the potential for mathematical reasoning is best developed through instruction. This volume is unique in the vast range of psychological questions it covers, as revealed in the work habits and products of numerous mathematicians. It provides fascinating reading for researchers and students with an interest in cognition in general and mathematical cognition in particular. Instructors of mathematics will also find the book’s insights illuminating.

Computer Arithmetic and Validity
Computer Arithmetic and Validity

Author: Ulrich Kulisch

Publisher: Walter de Gruyter

Published: 2013-04-30

Total Pages: 456

ISBN-13: 3110301792

DOWNLOAD EBOOK

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.

Mathematical Constants
Mathematical Constants

Author: Steven R. Finch

Publisher: Cambridge University Press

Published: 2003-08-18

Total Pages: 634

ISBN-13: 9780521818056

DOWNLOAD EBOOK

Steven Finch provides 136 essays, each devoted to a mathematical constant or a class of constants, from the well known to the highly exotic. This book is helpful both to readers seeking information about a specific constant, and to readers who desire a panoramic view of all constants coming from a particular field, for example, combinatorial enumeration or geometric optimization. Unsolved problems appear virtually everywhere as well. This work represents an outstanding scholarly attempt to bring together all significant mathematical constants in one place.

Accuracy and Stability of Numerical Algorithms
Accuracy and Stability of Numerical Algorithms

Author: Nicholas J. Higham

Publisher: SIAM

Published: 2002-01-01

Total Pages: 710

ISBN-13: 9780898718027

DOWNLOAD EBOOK

Accuracy and Stability of Numerical Algorithms gives a thorough, up-to-date treatment of the behavior of numerical algorithms in finite precision arithmetic. It combines algorithmic derivations, perturbation theory, and rounding error analysis, all enlivened by historical perspective and informative quotations. This second edition expands and updates the coverage of the first edition (1996) and includes numerous improvements to the original material. Two new chapters treat symmetric indefinite systems and skew-symmetric systems, and nonlinear systems and Newton's method. Twelve new sections include coverage of additional error bounds for Gaussian elimination, rank revealing LU factorizations, weighted and constrained least squares problems, and the fused multiply-add operation found on some modern computer architectures.

The Great Mathematical Problems
The Great Mathematical Problems

Author: Ian Stewart

Publisher: Profile Books

Published: 2013-03-07

Total Pages: 468

ISBN-13: 1847653510

DOWNLOAD EBOOK

There are some mathematical problems whose significance goes beyond the ordinary - like Fermat's Last Theorem or Goldbach's Conjecture - they are the enigmas which define mathematics. The Great Mathematical Problems explains why these problems exist, why they matter, what drives mathematicians to incredible lengths to solve them and where they stand in the context of mathematics and science as a whole. It contains solved problems - like the Poincaré Conjecture, cracked by the eccentric genius Grigori Perelman, who refused academic honours and a million-dollar prize for his work, and ones which, like the Riemann Hypothesis, remain baffling after centuries. Stewart is the guide to this mysterious and exciting world, showing how modern mathematicians constantly rise to the challenges set by their predecessors, as the great mathematical problems of the past succumb to the new techniques and ideas of the present.