Modular Algorithms in Symbolic Summation and Symbolic Integration (Paperback, 2005 ed.)

This work brings together two streams in computer algebra: symbolic integration and summation on the one hand, and fast algorithmics on the other hand. In many algorithmically oriented areas of computer science, theanalysisof- gorithms-placedintothe limelightbyDonKnuth'stalkat the 1970ICM -provides a crystal-clear criterion for success. The researcher who designs an algorithmthat is faster (asymptotically, in the worst case) than any previous method receives instant grati?cation: her result will be recognized as valuable. Alas, the downside is that such results come along quite infrequently, despite our best efforts. An alternative evaluation method is to run a new algorithm on examples; this has its obvious problems, but is sometimes the best we can do. George Collins, one of the fathers of computer algebra and a great experimenter,wrote in 1969: "I think this demonstrates again that a simple analysis is often more revealing than a ream of empirical data (although both are important). " Within computer algebra, some areas have traditionally followed the former methodology, notably some parts of polynomial algebra and linear algebra. Other areas, such as polynomial system solving, have not yet been amenable to this - proach. The usual "input size" parameters of computer science seem inadequate, and although some natural "geometric" parameters have been identi?ed (solution dimension, regularity), not all (potential) major progress can be expressed in this framework. Symbolic integration and summation have been in a similar state.

General

Imprint:	Springer-Verlag
Country of origin:	Germany
Series:	Lecture Notes in Computer Science, 3218
Release date:	December 2004
First published:	2005
Authors:	Jurgen Gerhard
Dimensions:	235 x 155 x 12mm (L x W x T)
Format:	Paperback
Pages:	228
Edition:	2005 ed.
ISBN-13:	978-3-540-24061-7
Categories:	Books > Science & Mathematics > Mathematics > Numerical analysis Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Books > Science & Mathematics > Mathematics > Applied mathematics > Mathematics for scientists & engineers Promotions
LSN:	3-540-24061-6
Barcode:	9783540240617

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!