Computer Algebra in Scientific Computing | 14th International Workshop, CASC 2012, Maribor, Slovenia, September 3-6, 2012, Proceedings | ISBN 9783642329739

Computer Algebra in Scientific Computing

14th International Workshop, CASC 2012, Maribor, Slovenia, September 3-6, 2012, Proceedings

herausgegeben von Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr und Evgenii V. Vorozhtsov
Mitwirkende
Herausgegeben vonVladimir P. Gerdt
Herausgegeben vonWolfram Koepf
Herausgegeben vonErnst W. Mayr
Herausgegeben vonEvgenii V. Vorozhtsov
Buchcover Computer Algebra in Scientific Computing  | EAN 9783642329739 | ISBN 3-642-32973-X | ISBN 978-3-642-32973-9

Computer Algebra in Scientific Computing

14th International Workshop, CASC 2012, Maribor, Slovenia, September 3-6, 2012, Proceedings

herausgegeben von Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr und Evgenii V. Vorozhtsov
Mitwirkende
Herausgegeben vonVladimir P. Gerdt
Herausgegeben vonWolfram Koepf
Herausgegeben vonErnst W. Mayr
Herausgegeben vonEvgenii V. Vorozhtsov
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 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.