Computer Algebra in Scientific Computing: 16th International Workshop, CASC 2014, Warsaw, Poland, September 8-12, 2014. Proceedings: Lecture Notes in Computer Science, cartea 8660
Editat de Vladimir P. Gerdt, Wolfram Koepf, Werner M. Seiler, Evgenii V. Vorozhtsoven Limba Engleză Paperback – 19 aug 2014
The papers address issues such as Studies in polynomial algebra are represented by contributions devoted to factoring sparse bivariate polynomials using the priority queue, the construction of irreducible polynomials by using the Newton index, real polynomial root finding by means of matrix and polynomial iterations, application of the eigenvalue method with symmetry for solving polynomial systems arising in the vibration analysis of mechanical structures with symmetry properties, application of Gröbner systems for computing the (absolute) reduction number of polynomial ideals, the application of cylindrical algebraic decomposition for solving the quantifier elimination problems, certification of approximate roots of overdetermined and singular polynomial systems via the recovery of an exact rational univariate representation from approximate numerical data, new parallel algorithms for operations on univariate polynomials (multi-point evaluation, interpolation) based on subproduct tree techniques.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (5) | 330.39 lei 6-8 săpt. | |
Springer International Publishing – 19 aug 2014 | 330.39 lei 6-8 săpt. | |
Springer International Publishing – 9 sep 2016 | 330.84 lei 6-8 săpt. | |
Springer International Publishing – 8 sep 2015 | 331.65 lei 39-44 zile | |
Springer International Publishing – 24 aug 2018 | 406.78 lei 6-8 săpt. | |
Springer International Publishing – 31 aug 2017 | 462.82 lei 6-8 săpt. |
Din seria Lecture Notes in Computer Science
- 20% Preț: 1021.30 lei
- 20% Preț: 337.03 lei
- 20% Preț: 340.22 lei
- 20% Preț: 256.27 lei
- 20% Preț: 324.32 lei
- 20% Preț: 438.69 lei
- 20% Preț: 315.78 lei
- 20% Preț: 327.52 lei
- 20% Preț: 148.66 lei
- 20% Preț: 122.89 lei
- 20% Preț: 557.41 lei
- 20% Preț: 561.37 lei
- 15% Preț: 558.56 lei
- 20% Preț: 238.01 lei
- 20% Preț: 504.57 lei
- 20% Preț: 329.09 lei
- 20% Preț: 563.75 lei
- 20% Preț: 630.24 lei
- 20% Preț: 321.96 lei
- 20% Preț: 1361.10 lei
- 20% Preț: 310.26 lei
- 20% Preț: 607.39 lei
- Preț: 366.90 lei
- 20% Preț: 172.69 lei
- 20% Preț: 315.19 lei
- 20% Preț: 985.59 lei
- 20% Preț: 620.87 lei
- 20% Preț: 436.22 lei
- 20% Preț: 734.34 lei
- 20% Preț: 1034.49 lei
- 17% Preț: 360.19 lei
- 20% Preț: 309.90 lei
- 20% Preț: 573.92 lei
- 20% Preț: 301.95 lei
- 20% Preț: 307.71 lei
- 20% Preț: 369.12 lei
- 20% Preț: 327.52 lei
- 20% Preț: 794.65 lei
- 20% Preț: 569.16 lei
- Preț: 395.43 lei
- 20% Preț: 1138.26 lei
- 20% Preț: 734.34 lei
- 20% Preț: 315.78 lei
- 20% Preț: 330.70 lei
- 20% Preț: 538.29 lei
- 20% Preț: 326.98 lei
Preț: 330.39 lei
Preț vechi: 412.99 lei
-20% Nou
Puncte Express: 496
Preț estimativ în valută:
63.23€ • 66.71$ • 52.69£
63.23€ • 66.71$ • 52.69£
Carte tipărită la comandă
Livrare economică 02-16 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783319105147
ISBN-10: 3319105140
Pagini: 520
Ilustrații: XIV, 502 p. 73 illus.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 0.72 kg
Ediția:2014
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Cham, Switzerland
ISBN-10: 3319105140
Pagini: 520
Ilustrații: XIV, 502 p. 73 illus.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 0.72 kg
Ediția:2014
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Cham, Switzerland
Public țintă
ResearchCuprins
Relation Algebra, RelView, and Plurality Voting .- An Algorithm for Converting Nonlinear Differential Equations to Integral Equations with an Application to Parameter Estimation from Noisy Data.- Truth Table Invariant Cylindrical Algebraic Decomposition by Regular Chains.- Computing the Topology of an Arrangement of Implicit and Parametric Curves Given by Values.- Finding a Deterministic Generic Position for an Algebraic Space Curve.- Computer Algebra Experimentation.- On the Parallelization of Subproduct Tree Techniques Targeting.- Many-core Architectures.- Deterministically Computing Reduction Numbers of Polynomial Ideals.
Textul de pe ultima copertă
This book constitutes the proceedings of the 16th International Workshop on Computer Algebra in Scientific Computing, CASC 2014, held in Warsaw, Poland, in September 2014. The 33 full papers presented were carefully reviewed and selected for inclusion in this book.
The papers address issues such as Studies in polynomial algebra are represented by contributions devoted to factoring sparse bivariate polynomials using the priority queue, the construction of irreducible polynomials by using the Newton index, real polynomial root finding by means of matrix and polynomial iterations, application of the eigenvalue method with symmetry for solving polynomial systems arising in the vibration analysis of mechanical structures with symmetry properties, application of Gröbner systems for computing the (absolute) reduction number of polynomial ideals, the application of cylindrical algebraic decomposition for solving the quantifier elimination problems, certification of approximate roots of overdetermined and singular polynomial systems via the recovery of an exact rational univariate representation from approximate numerical data, new parallel algorithms for operations on univariate polynomials (multi-point evaluation, interpolation) based on subproduct tree techniques.
The papers address issues such as Studies in polynomial algebra are represented by contributions devoted to factoring sparse bivariate polynomials using the priority queue, the construction of irreducible polynomials by using the Newton index, real polynomial root finding by means of matrix and polynomial iterations, application of the eigenvalue method with symmetry for solving polynomial systems arising in the vibration analysis of mechanical structures with symmetry properties, application of Gröbner systems for computing the (absolute) reduction number of polynomial ideals, the application of cylindrical algebraic decomposition for solving the quantifier elimination problems, certification of approximate roots of overdetermined and singular polynomial systems via the recovery of an exact rational univariate representation from approximate numerical data, new parallel algorithms for operations on univariate polynomials (multi-point evaluation, interpolation) based on subproduct tree techniques.
Caracteristici
Includes supplementary material: sn.pub/extras