Andere Kunden interessierten sich auch für
![Symbolic Integration I]( "Symbolic Integration I")
Symbolic Integration I88,99 €![Symbolic and Numerical Scientific Computation]( "Symbolic and Numerical Scientific Computation")
Symbolic and Numerical Scientific Computation39,99 €![Computer Algebra and Parallelism]( "Computer Algebra and Parallelism")
Computer Algebra and Parallelism39,99 €![Integrating Symbolic Mathematical Computation and Artificial Intelligence]( "Integrating Symbolic Mathematical Computation and Artificial Intelligence")
Integrating Symbolic Mathematical Computation and Artificial Intelligence39,99 €![Applied Algebra, Algorithmics and Error-Correcting Codes]( "Applied Algebra, Algorithmics and Error-Correcting Codes")
Applied Algebra, Algorithmics and Error-Correcting Codes39,99 €![Design and Implementation of Symbolic Computation Systems]( "Design and Implementation of Symbolic Computation Systems")
Design and Implementation of Symbolic Computation Systems39,99 €![Primality Testing in Polynomial Time]( "Primality Testing in Polynomial Time")
Primality Testing in Polynomial Time39,99 €
This book brings together two streams of computer algebra: symbolic summation and integration on the one hand, and fast algorithmics on the other hand.
In symbolic integration and summation, not too many algorithms with analyzed run times are known, and until now the mathematically oriented world of integration and summation and the computer science world of algorithm analysis have not had much to say to each other.
The progress presented in this work towards overcoming this situation is threefold:
- a clear framework for algorithm analysis with the appropriate parameters is provided,
- modular algorithmic techniques are introduced in this area, and
- almost optimal algorithms are presented for the basic problems.
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.
In symbolic integration and summation, not too many algorithms with analyzed run times are known, and until now the mathematically oriented world of integration and summation and the computer science world of algorithm analysis have not had much to say to each other.
The progress presented in this work towards overcoming this situation is threefold:
- a clear framework for algorithm analysis with the appropriate parameters is provided,
- modular algorithmic techniques are introduced in this area, and
- almost optimal algorithms are presented for the basic problems.
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.