Computer Algebra in Scientific Computing 14th International Workshop, CASC 2012, Maribor, Slovenia, September 3-6, 2012, Proceedings |
|
| Editor:
| Gerdt, Vladimir P.
Koepf, Wolfram
Mayr, Ernst W.
Vorozhtsov, Evgenii V. |
| Series title: | Lecture Notes in Computer Science / Theoretical Computer Science and General Issues Ser. |
| ISBN: | 978-3-642-32972-2 |
| Publication Date: | Jul 2012 |
| Publisher: | Springer
|
| Book Format: | Paperback |
| List Price: | AUD $116.95 |
Book Description:
|
This book constitutes the proceedings of the 14th International Workshop on Computer Algebra in Scientific Computing, CASC 2012, held in Maribor, Slovenia, in September 2012. The 28 full papers presented were carefully reviewed and selected for inclusion in this book.One of the main themes of the CASC workshop series, namely polynomial algebra, is represented by contributions devoted to new algorithms for computing comprehensive Gröbner and involutive systems,parallelization of the...
More DescriptionThis book constitutes the proceedings of the 14th International Workshop on Computer Algebra in Scientific Computing, CASC 2012, held in Maribor, Slovenia, in September 2012. The 28 full papers presented were carefully reviewed and selected for inclusion in this book.One of the main themes of the CASC workshop series, namely polynomial algebra, is represented by contributions devoted to new algorithms for computing comprehensive Gröbner and involutive systems,parallelization of the Gröbner bases computation, the study of quasi-stable polynomial ideals, new algorithms to compute the Jacobson form of a matrix of Ore polynomials, a recursive Leverrier algorithm for inversion of dense matrices whose entries are monic polynomials, root isolation of zero-dimensional triangular polynomial systems, optimal computation of the third power of a long integer, investigation of the complexity of solving systems with few independent monomials, the study of ill-conditioned polynomial systems, a method for polynomial root-finding via eigen-solving and randomization, an algorithm for fast dense polynomial multiplication with Java using the new opaque typed method, and sparse polynomial powering using heaps.