Algorithms, approximation, optimization
Author(s)
Bibliographic Information
Algorithms, approximation, optimization
（OT, 166 . Foundations of applied mathematics ; v. 2）
Society for Industrial and Applied Mathematics, c2020
Available at / 2 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references (p. 767-775) and index
Description and Table of Contents
Description
In this second book of what will be a four-volume series, the authors present, in a mathematically rigorous way, the essential foundations of both the theory and practice of algorithms, approximation, and optimization-essential topics in modern applied and computational mathematics. This material is the introductory framework upon which algorithm analysis, optimization, probability, statistics, machine learning, and control theory are built.
This text gives a unified treatment of several topics that do not usually appear together: the theory and analysis of algorithms for mathematicians and data science students; probability and its applications; the theory and applications of approximation, including Fourier series, wavelets, and polynomial approximation; and the theory and practice of optimization, including dynamic optimization.
When used in concert with the free supplemental lab materials, Foundations of Applied Mathematics, Volume 2: Algorithms, Approximation, Optimization teaches not only the theory but also the computational practice of modern mathematical methods. Exercises and examples build upon each other in a way that continually reinforces previous ideas, allowing students to retain learned concepts while achieving a greater depth. The mathematically rigorous lab content guides students to technical proficiency and answers the age-old question "When am I going to use this?"
This textbook is geared toward advanced undergraduate and beginning graduate students in mathematics, data science, or machine learning.
by "Nielsen BookData"
