Computer Algebra in Scientific Computing: 12th International Workshop, CASC 2010, Tsakhadzor, Armenia, September 6-12, 2010, Proceedings: Lecture Notes in Computer Science, cartea 6244
Editat de Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, Evgenii V. Vorozhtsoven Limba Engleză Paperback – 18 aug 2010
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (4) | 321.81 lei 22-36 zile | |
| Springer Berlin, Heidelberg – 18 aug 2010 | 321.81 lei 22-36 zile | |
| Springer Berlin, Heidelberg – 26 aug 2011 | 323.41 lei 43-57 zile | |
| Springer – 26 iul 2012 | 325.25 lei 43-57 zile | |
| Springer – 11 sep 2013 | 329.35 lei 43-57 zile |
Din seria Lecture Notes in Computer Science
- 20%
Preț: 390.18 lei - 20%
Preț: 461.65 lei - 20%
Preț: 461.32 lei - 20%
Preț: 461.77 lei - 20%
Preț: 527.36 lei - 20%
Preț: 497.04 lei - 20%
Preț: 461.52 lei - 20%
Preț: 390.35 lei - 20%
Preț: 496.64 lei - 20%
Preț: 461.52 lei - 20%
Preț: 391.14 lei - 15%
Preț: 461.85 lei - 20%
Preț: 389.72 lei - 20%
Preț: 461.06 lei - 20%
Preț: 390.69 lei - 20%
Preț: 252.15 lei - 20%
Preț: 391.14 lei - 20%
Preț: 532.54 lei - 20%
Preț: 461.83 lei - 20%
Preț: 255.91 lei - 20%
Preț: 498.46 lei - 20%
Preț: 497.55 lei - 20%
Preț: 499.36 lei - 20%
Preț: 390.12 lei - 20%
Preț: 391.20 lei - 20%
Preț: 390.35 lei - 20%
Preț: 391.20 lei - 20%
Preț: 392.64 lei - 20%
Preț: 389.90 lei - 20%
Preț: 639.72 lei - 20%
Preț: 461.65 lei - 20%
Preț: 462.05 lei - 15%
Preț: 388.50 lei - 5%
Preț: 516.27 lei - 20%
Preț: 390.94 lei - 20%
Preț: 391.86 lei - 20%
Preț: 389.85 lei - 20%
Preț: 498.32 lei - 20%
Preț: 462.67 lei - 20%
Preț: 460.98 lei - 20%
Preț: 424.26 lei - 20%
Preț: 535.77 lei - 15%
Preț: 535.92 lei - 20%
Preț: 532.28 lei - 20%
Preț: 400.17 lei - 20%
Preț: 403.00 lei - 20%
Preț: 461.57 lei - 20%
Preț: 498.50 lei - 20%
Preț: 461.83 lei - 20%
Preț: 249.95 lei
Preț: 321.81 lei
Preț vechi: 402.26 lei
-20% Nou
Puncte Express: 483
Preț estimativ în valută:
56.94€ • 66.33$ • 49.72£
56.94€ • 66.33$ • 49.72£
Carte disponibilă
Livrare economică 29 decembrie 25 - 12 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642152733
ISBN-10: 3642152732
Pagini: 318
Ilustrații: XIV, 304 p. 48 illus.
Greutate: 0.48 kg
Ediția:2010
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642152732
Pagini: 318
Ilustrații: XIV, 304 p. 48 illus.
Greutate: 0.48 kg
Ediția:2010
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Construction of Irreducible Polynomials over Finite Fields.- Factorization of Polynomials and GCD Computations for Finding Universal Denominators.- A Role of Symbolic Computations in Beam Physics.- Thomas Decomposition of Algebraic and Differential Systems.- On Multivariate Homogeneous Polynomial Decomposition.- Computing Matrix Representations of Filiform Lie Algebras.- Type Specialization in Aldor.- An Algebraic Implicitization and Specialization of Minimum KL-Divergence Models.- On Sufficient Conditions for Integrability of a Planar System of ODEs Near a Degenerate Stationary Point.- Symbolic-Numeric Algorithms for Computer Analysis of Spheroidal Quantum Dot Models.- On Reduction of Lagrange Systems.- Series Transformations to Improve and Extend Convergence.- Differential Resultant, Computer Algebra and Completely Integrable Dynamical Systems.- Generic, Type-Safe and Object Oriented Computer Algebra Software.- Implementing Data Parallel Rational Multiple-Residue Arithmetic in Eden.- Fast Generalized Bruhat Decomposition.- Computational Science in Armenia (Invited Talk).- From Petri Nets to Polynomials: Modeling, Algorithms, and Complexity (Abstract) (Invited Talk).- Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests.- Term Cancellations in Computing Floating-Point Gröbner Bases.- One Class of Third-Order Linear ODE’s.- GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials.- Derivation of Explicit Difference Schemes for Ordinary Differential Equations with the Aid of Lagrange–Burmann Expansions.- Parametric Qualitative Analysis of Ordinary Differential Equations: Computer Algebra Methods for Excluding Oscillations (Extended Abstract) (Invited Talk).- An Analytical Model forthe Probability Characteristics of a Crack Hitting an Encapsulated Self-healing Agent in Concrete.- Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases.
Textul de pe ultima copertă
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.
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.
Caracteristici
Fast-track conference proceedings State-of-the-art research Up-to-date results