Fr. 140.40

Greedy Approximation

English · Hardback

Shipping usually within 1 to 3 weeks (not available at short notice)


Read more

Klappentext Provides the theoretical foundations for algorithms widely used in numerical mathematics. Includes classical results! as well as the latest advances. Zusammenfassung Vladimir Temlyakov guides the reader through the fundamental results and introduces two other hot topics in numerical mathematics: learning theory and compressed sensing. Researchers will welcome this first book on the subject. It is ideal for graduate courses and includes many important open problems that provide ideas for further research.

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.