A General Theory of Optimal Algorithms

A General Theory of Optimal Algorithms
Author :
Publisher :
Total Pages : 376
Release :
ISBN-10 : UCAL:B4407412
ISBN-13 :
Rating : 4/5 ( Downloads)

Book Synopsis A General Theory of Optimal Algorithms by : Joseph Frederick Traub

Download or read book A General Theory of Optimal Algorithms written by Joseph Frederick Traub and published by . This book was released on 1980 with total page 376 pages. Available in PDF, EPUB and Kindle. Book excerpt: The purpose of this monograph is to create a general framework for the study of optimal algorithms for problems that are solved approximately. For generality the setting is abstract, but we present many applications to practical problems and provide examples to illustrate concepts and major theorems. The work presented here is motivated by research in many fields. Influential have been questions, concepts, and results from complexity theory, algorithmic analysis, applied mathematics and numerical analysis, the mathematical theory of approximation (particularly the work on n-widths in the sense of Gelfand and Kolmogorov), applied approximation theory (particularly the theory of splines), as well as earlier work on optimal algorithms. But many of the questions we ask (see Overview) are new. We present a different view of algorithms and complexity and must request the reader's


A General Theory of Optimal Algorithms Related Books

A General Theory of Optimal Algorithms
Language: en
Pages: 376
Authors: Joseph Frederick Traub
Categories: Mathematics
Type: BOOK - Published: 1980 - Publisher:

DOWNLOAD EBOOK

The purpose of this monograph is to create a general framework for the study of optimal algorithms for problems that are solved approximately. For generality th
Elements of the General Theory of Optimal Algorithms
Language: en
Pages: 387
Authors: Ivan V. Sergienko
Categories: Mathematics
Type: BOOK - Published: 2022-01-11 - Publisher: Springer Nature

DOWNLOAD EBOOK

In this monograph, the authors develop a methodology that allows one to construct and substantiate optimal and suboptimal algorithms to solve problems in comput
Elements of the General Theory of Optimal Algorithms
Language: en
Pages:
Authors: Ivan Vasilʹevich Sergienko
Categories: Algorithms
Type: BOOK - Published: 2021 - Publisher:

DOWNLOAD EBOOK

In this monograph, the authors develop a methodology that allows one to construct and substantiate optimal and suboptimal algorithms to solve problems in comput
Essays on the Complexity of Continuous Problems
Language: en
Pages: 112
Authors: Erich Novak
Categories: Computational complexity
Type: BOOK - Published: 2009 - Publisher: European Mathematical Society

DOWNLOAD EBOOK

This book contains five essays on the complexity of continuous problems, written for a wider audience. The first four essays are based on talks presented in 200
General Theory of Optimal Error Algorithms and Analytic Complexity. Part B. Iterative Information Model
Language: en
Pages: 97
Authors: J. F. Traub
Categories:
Type: BOOK - Published: 1978 - Publisher:

DOWNLOAD EBOOK

This is the second of a series of papers in which we construct an information based general theory of optimal error algorithms and analytic computational comple