Skip to search
Skip to main content
Search in
Keyword
Title (keyword)
Author (keyword)
Subject (keyword)
Title starts with
Subject (browse)
Author (browse)
Author (sorted by title)
Call number (browse)
search for
Search
Advanced Search
Bookmarks
(
0
)
Princeton University Library Catalog
Start over
Cite
Send
to
SMS
Email
EndNote
RefWorks
RIS
Printer
Bookmark
Algorithms from THE BOOK / Kenneth Lange.
Author
Lange, Kenneth
[Browse]
Format
Book
Language
English
Published/Created
Philadelphia, Pennsylvania : Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104), [2020]
Description
XI, 214 p. ; 26 cm.
Details
Subject(s)
Algorithms
[Browse]
Computer algorithms
[Browse]
Computer science
—
Mathematics
[Browse]
Publisher
Society for Industrial and Applied Mathematics
[Browse]
Series
Other titles in applied mathematics.
[More in this series]
Restrictions note
Restricted to subscribers or individual electronic text purchasers.
Summary note
Algorithms are a dominant force in modern culture, and every indication is that they will become more pervasive, not less. The best algorithms are undergirded by beautiful mathematics. This text cuts across discipline boundaries to highlight some of the most famous and successful algorithms. Readers are exposed to the principles behind these examples and guided in assembling complex algorithms from simpler building blocks. Algorithms from THE BOOK incorporates Julia code for easy experimentation, is written in clear, concise prose consistent with mathematical rigor, includes a large number of classroom-tested exercises at the end of each chapter, and covers background material, often omitted from undergraduate courses, in the appendices. This textbook is aimed at first-year graduate and advanced undergraduate students. It will also serve as a convenient reference for professionals throughout the mathematical sciences, physical sciences, engineering, and the quantitative sectors of the biological and social sciences.
Bibliographic references
Includes bibliographical references (pages 203-208) and index.
System details
Mode of access: World Wide Web.
System requirements: Adobe Acrobat Reader.
Source of description
Description based on title page of print version.
Contents
Ancient algorithms
Sorting
Graph algorithms
Primality testing
Solution of linear equations
Newton's method
Linear programming
Eigenvalues and eigenvectors
MM algorithms
Data mining
The fast Fourier transform
Monte Carlo methods
Mathematical review.
Show 10 more Contents items
Other format(s)
Also available in print version.
ISBN
1-61197-617-0
Publisher no.
OT168
LCCN
2019059041
OCLC
1138997661
Doi
10.1137/1.9781611976175
Statement on language in description
Princeton University Library aims to describe library materials in a manner that is respectful to the individuals and communities who create, use, and are represented in the collections we manage.
Read more...
Other views
Staff view
Ask a Question
Suggest a Correction
Report Harmful Language
Supplementary Information