Analytic Computational Complexity

Analytic Computational Complexity

Analytic Computational Complexity contains the proceedings of the Symposium on Analytic Computational Complexity held by the Computer Science Department, Carnegie-Mellon University, Pittsburgh, Pennsylvania, on April 7-8, 1975. The symposium provided a forum for assessing progress made in analytic computational complexity and covered topics ranging from strict lower and upper bounds on iterative computational complexity to numerical stability of iterations for solution of nonlinear equations and large linear systems. Comprised of 14 chapters, this book begins with an introduction to analytic computational complexity before turning to proof techniques used in analytic complexity. Subsequent chapters focus on the complexity of obtaining starting points for solving operator equations by Newton's method; maximal order of multipoint iterations using n evaluations; the use of integrals in the solution of nonlinear equations in N dimensions; and the complexity of differential equations. Algebraic constructions in an analytic setting are also discussed, along with the computational complexity of approximation operators. This monograph will be of interest to students and practitioners in the fields of applied mathematics and computer science.

Applied and Computational Complex Analysis, Volume 3

Presents applications as well as the basic theory of analytic functions of one or several complex variables. The first volume discusses applications and basic theory of conformal mapping and the solution of algebraic and transcendental equations. Volume Two covers topics broadly connected with ordinary differental equations: special functions, integral transforms, asymptotics and continued fractions. Volume Three details discrete fourier analysis, cauchy integrals, construction of conformal maps, univalent functions, potential theory in the plane and polynomial expansions.

Topics in Computational Complexity and the Analysis of Algorithms