**Numerical Algorithms: Methods for Computer Vision, Machine Learning, and Graphics**

by Justin Solomon

**Publisher**: CRC Press 2015**ISBN/ASIN**: 1482251884**Number of pages**: 397

**Description**:

This book presents a new approach to numerical analysis for modern computer scientists. Using examples from a broad base of computational tasks, including data processing, computational photography, and animation, the textbook introduces numerical modeling and algorithmic design from a practical standpoint and provides insight into the theoretical tools needed to support these skills.

Download or read it online for free here:

**Download link**

(17MB, PDF)

## Similar books

**A Computational Introduction to Number Theory and Algebra**

by

**Victor Shoup**-

**Cambridge University Press**

This introductory book emphasises algorithms and applications, such as cryptography and error correcting codes. It is accessible to a broad audience. Prerequisites are a typical undergraduate course in calculus and some experience in doing proofs.

(

**41838**views)

**Mathematics for Computer Scientists**

by

**Gareth J. Janacek, Mark L. Close**-

**BookBoon**

In this textbook you will find the basic mathematics needed by computer scientists. It should help you to understand the meaning of mathematical concepts. Subjects as elementary logic, factorization, plotting functions and matrices are explained.

(

**27337**views)

**Algorithmic Mathematics**

by

**Leonard Soicher, Franco Vivaldi**-

**Queen Mary University of London**

This text is a course in mathematical algorithms, intended for second year mathematics students. It introduces the algorithms for computing with integers, polynomials and vector spaces. The course requires no computing experience.

(

**23794**views)

**Mathematics for Algorithm and Systems Analysis**

by

**Edward A. Bender, S. Gill Williamson**-

**Dover Publications**

This text assists undergraduates in mastering the mathematical language to address problems in the field's many applications. It consists of 4 units: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.

(

**31351**views)