Book picks similar to
Numerical Methods That Work by Forman S. Acton


mathematics
reference
numerical-methods
comp-sci

Introduction to Topology


Bert Mendelson - 1975
    It provides a simple, thorough survey of elementary topics, starting with set theory and advancing to metric and topological spaces, connectedness, and compactness. 1975 edition.

The Humongous Book of Calculus Problems


W. Michael Kelley - 2007
    Not anymore. The best-selling author of The Complete Idiot's Guide® to Calculus has taken what appears to be a typical calculus workbook, chock full of solved calculus problems, and made legible notes in the margins, adding missing steps and simplifying solutions. Finally, everything is made perfectly clear. Students will be prepared to solve those obscure problems that were never discussed in class but always seem to find their way onto exams.--Includes 1,000 problems with comprehensive solutions--Annotated notes throughout the text clarify what's being asked in each problem and fill in missing steps--Kelley is a former award-winning calculus teacher

Elementary Statistics: A Step by Step Approach


Allan G. Bluman - 1992
    The book is non-theoretical, explaining concepts intuitively and teaching problem solving through worked examples and step-by-step instructions. This edition places more emphasis on conceptual understanding and understanding results. This edition also features increased emphasis on Excel, MINITAB, and the TI-83 Plus and TI 84-Plus graphing calculators, computing technologies commonly used in such courses.

An Introduction to Probability Theory and Its Applications, Volume 1


William Feller - 1968
    Beginning with the background and very nature of probability theory, the book then proceeds through sample spaces, combinatorial analysis, fluctuations in coin tossing and random walks, the combination of events, types of distributions, Markov chains, stochastic processes, and more. The book's comprehensive approach provides a complete view of theory along with enlightening examples along the way.

A New Kind of Science


Stephen Wolfram - 1997
    Wolfram lets the world see his work in A New Kind of Science, a gorgeous, 1,280-page tome more than a decade in the making. With patience, insight, and self-confidence to spare, Wolfram outlines a fundamental new way of modeling complex systems. On the frontier of complexity science since he was a boy, Wolfram is a champion of cellular automata--256 "programs" governed by simple nonmathematical rules. He points out that even the most complex equations fail to accurately model biological systems, but the simplest cellular automata can produce results straight out of nature--tree branches, stream eddies, and leopard spots, for instance. The graphics in A New Kind of Science show striking resemblance to the patterns we see in nature every day. Wolfram wrote the book in a distinct style meant to make it easy to read, even for nontechies; a basic familiarity with logic is helpful but not essential. Readers will find themselves swept away by the elegant simplicity of Wolfram's ideas and the accidental artistry of the cellular automaton models. Whether or not Wolfram's revolution ultimately gives us the keys to the universe, his new science is absolutely awe-inspiring. --Therese Littleton

OpenIntro Statistics


David M. Diez - 2012
    Our inaugural effort is OpenIntro Statistics. Probability is optional, inference is key, and we feature real data whenever possible. Files for the entire book are freely available at openintro.org, and anybody can purchase a paperback copy from amazon.com for under $10.The future for OpenIntro depends on the involvement and enthusiasm of our community. Visit our website, openintro.org. We provide free course management tools, including an online question bank, utilities for creating course quizzes, and many other helpful resources.CERTAIN CONTENT THAT APPEARS ON THIS SITE COMES FROM AMAZON SERVICES LLC. THIS CONTENT IS PROVIDED ‘AS IS’ AND IS SUBJECT TO CHANGE OR REMOVAL AT ANY TIME.Can’t find it here? Search Amazon.com Search: All Products Apparel & AccessoriesBabyBeautyBooksCamera & PhotoCell Phones & ServiceClassical MusicComputersComputer & Video GamesDVDElectronicsGourmet FoodHome & GardenMiscellaneousHealth & Personal CareJewelry & WatchesKitchen & HousewaresMagazine SubscriptionsMusicMusical InstrumentsSoftwareSports & OutdoorsTools & HardwareToys & GamesVHS Keywords:

Challenge And Thrill Of Pre College Mathematics


V. Krishnamurthy - 2009
    It can urge the reader to explore new methodologies to have maximum fun with numbers, and opt for a higher course in mathematics. The book was specifically designed to help the student community, and develop a strong affinity towards problem solving.the book offers many complicated, and interesting challenges for the user, keeping them engaged throughout. A large number of solved problems are also included in challenge and thrill of pre-college mathematics, to give readers an insight into the subject. The book can be an eye-opener for school students of class 7 and above. The materials given in the book are powerful enough to help them develop a strong interest for the subject. The concepts are explained in a simple and comprehensive manner, providing them with a good understanding of mathematical fundamentals.what makes the book distinct is its detailed sections on geometry, that can improve the reasoning skills of students. There are also detailed accounts on algebra and trigonometry, enhancing the competitive ability of the users. The topics such as combinatorics, number theory, and probability are also explained in detail, in the book. Each chapter was designed with the intention of motivating students to appreciate the excitement that mathematical problems can provide. Published in 2003 by new age international publishers, the book is available in paperback. Key features: the book includes a collection of more than 300 solved numerical problems, compiled from various national, as well as international mathematical olympiads.it is widely recommended by students and teachers, alike as an essential preparatory book for those writing competitive examinations.

The Monty Hall Problem: The Remarkable Story of Math's Most Contentious Brain Teaser


Jason Rosenhouse - 2009
    Imagine that you face three doors, behind one of which is a prize. You choose one but do not open it. The host--call him Monty Hall--opens a different door, alwayschoosing one he knows to be empty. Left with two doors, will you do better by sticking with your first choice, or by switching to the other remaining door? In this light-hearted yet ultimately serious book, Jason Rosenhouse explores the history of this fascinating puzzle. Using a minimum ofmathematics (and none at all for much of the book), he shows how the problem has fascinated philosophers, psychologists, and many others, and examines the many variations that have appeared over the years. As Rosenhouse demonstrates, the Monty Hall Problem illuminates fundamental mathematical issuesand has abiding philosophical implications. Perhaps most important, he writes, the problem opens a window on our cognitive difficulties in reasoning about uncertainty.

Algorithms


Sanjoy Dasgupta - 2006
    Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal. Features include: The use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated.Carefully chosen advanced topics that can be skipped in a standard one-semester course, but can be covered in an advanced algorithms course or in a more leisurely two-semester sequence.An accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. An optional chapter on the quantum algorithm for factoring provides a unique peephole into this exciting topic. In addition to the text, DasGupta also offers a Solutions Manual, which is available on the Online Learning Center.Algorithms is an outstanding undergraduate text, equally informed by the historical roots and contemporary applications of its subject. Like a captivating novel, it is a joy to read. Tim Roughgarden Stanford University

Machine Learning for Hackers


Drew Conway - 2012
    Authors Drew Conway and John Myles White help you understand machine learning and statistics tools through a series of hands-on case studies, instead of a traditional math-heavy presentation.Each chapter focuses on a specific problem in machine learning, such as classification, prediction, optimization, and recommendation. Using the R programming language, you'll learn how to analyze sample datasets and write simple machine learning algorithms. "Machine Learning for Hackers" is ideal for programmers from any background, including business, government, and academic research.Develop a naive Bayesian classifier to determine if an email is spam, based only on its textUse linear regression to predict the number of page views for the top 1,000 websitesLearn optimization techniques by attempting to break a simple letter cipherCompare and contrast U.S. Senators statistically, based on their voting recordsBuild a "whom to follow" recommendation system from Twitter data

Algorithm Design


Jon Kleinberg - 2005
    The book teaches a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.

Gödel's Proof


Ernest Nagel - 1958
    Gödel received public recognition of his work in 1951 when he was awarded the first Albert Einstein Award for achievement in the natural sciences--perhaps the highest award of its kind in the United States. The award committee described his work in mathematical logic as "one of the greatest contributions to the sciences in recent times."However, few mathematicians of the time were equipped to understand the young scholar's complex proof. Ernest Nagel and James Newman provide a readable and accessible explanation to both scholars and non-specialists of the main ideas and broad implications of Gödel's discovery. It offers every educated person with a taste for logic and philosophy the chance to understand a previously difficult and inaccessible subject.New York University Press is proud to publish this special edition of one of its bestselling books. With a new introduction by Douglas R. Hofstadter, this book will appeal students, scholars, and professionals in the fields of mathematics, computer science, logic and philosophy, and science.

My Best Mathematical and Logic Puzzles


Martin Gardner - 1994
    He was especially careful to present new and unfamiliar puzzles that had not been included in such classic collections as those by Sam Loyd and Henry Dudeney. Later, these puzzles were published in book collections, incorporating reader feedback on alternate solutions or interesting generalizations.The present volume contains a rich selection of 70 of the best of these brain teasers, in some cases including references to new developments related to the puzzle. Now enthusiasts can challenge their solving skills and rattle their egos with such stimulating mind-benders as The Returning Explorer, The Mutilated Chessboard, Scrambled Box Tops, The Fork in the Road, Bronx vs. Brooklyn, Touching Cigarettes, and 64 other problems involving logic and basic math. Solutions are included.

Operations Research: Applications and Algorithms (with CD-ROM and InfoTrac)


Wayne L. Winston - 1987
    It moves beyond a mere study of algorithms without sacrificing the rigor that faculty desire. As in every edition, Winston reinforces the book's successful features and coverage with the most recent developments in the field. The Student Suite CD-ROM, which now accompanies every new copy of the text, contains the latest versions of commercial software for optimization, simulation, and decision analysis.

Discrete Mathematical Structures


Bernard Kolman - 1995
    It covers areas such as fundamentals, logic, counting, relations and digraphs, trees, topics in graph theory, languages and finite-state machines, and groups and coding.