Computer Algebra in Scientific Computing: 18th International Workshop, CASC 2016, Bucharest, Romania, September 19-23, 2016, Proceedings: Lecture Notes in Computer Science, cartea 9890
Editat de Vladimir P. Gerdt, Wolfram Koepf, Werner M. Seiler, Evgenii V. Vorozhtsoven Limba Engleză Paperback – 9 sep 2016
The 32 papers presented in this volume were carefully reviewed and selected from 39 submissions. They deal with cutting-edge research in all major disciplines of Computer Algebra.
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (5) | 330.23 lei 43-57 zile | |
| Springer International Publishing – 19 aug 2014 | 330.23 lei 43-57 zile | |
| Springer International Publishing – 9 sep 2016 | 330.68 lei 43-57 zile | |
| Springer International Publishing – 8 sep 2015 | 358.89 lei 38-44 zile | |
| Springer International Publishing – 24 aug 2018 | 406.54 lei 43-57 zile | |
| Springer International Publishing – 31 aug 2017 | 462.50 lei 43-57 zile |
Din seria Lecture Notes in Computer Science
- 20%
Preț: 461.83 lei - 20%
Preț: 461.57 lei - 20%
Preț: 424.26 lei - 20%
Preț: 390.69 lei - 20%
Preț: 498.50 lei - 15%
Preț: 388.50 lei - 20%
Preț: 390.35 lei - 20%
Preț: 460.98 lei - 20%
Preț: 461.52 lei - 20%
Preț: 497.55 lei - 20%
Preț: 389.72 lei - 20%
Preț: 461.83 lei - 20%
Preț: 389.90 lei - 20%
Preț: 497.04 lei - 20%
Preț: 462.05 lei - 20%
Preț: 391.14 lei - 20%
Preț: 389.85 lei - 20%
Preț: 461.32 lei - 20%
Preț: 498.32 lei - 20%
Preț: 496.64 lei - 20%
Preț: 532.28 lei - 20%
Preț: 527.36 lei - 20%
Preț: 498.46 lei - 15%
Preț: 461.85 lei - 20%
Preț: 390.12 lei - 20%
Preț: 532.41 lei - 20%
Preț: 462.24 lei - 20%
Preț: 391.14 lei - 20%
Preț: 461.77 lei - 20%
Preț: 390.35 lei - 20%
Preț: 461.06 lei - 20%
Preț: 461.65 lei - 20%
Preț: 390.18 lei - 20%
Preț: 392.64 lei - 20%
Preț: 252.15 lei - 20%
Preț: 390.94 lei - 20%
Preț: 461.52 lei - 20%
Preț: 391.86 lei - 20%
Preț: 532.54 lei - 20%
Preț: 462.67 lei - 20%
Preț: 461.65 lei - 20%
Preț: 639.72 lei - 20%
Preț: 255.91 lei - 15%
Preț: 535.92 lei - 20%
Preț: 535.77 lei - 5%
Preț: 516.27 lei - 20%
Preț: 499.36 lei - 20%
Preț: 391.20 lei - 20%
Preț: 391.20 lei - 20%
Preț: 249.95 lei
Preț: 330.68 lei
Preț vechi: 413.35 lei
-20% Nou
Puncte Express: 496
Preț estimativ în valută:
58.52€ • 68.63$ • 51.31£
58.52€ • 68.63$ • 51.31£
Carte tipărită la comandă
Livrare economică 26 ianuarie-09 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783319456409
ISBN-10: 3319456407
Pagini: 516
Ilustrații: XIII, 513 p. 61 illus.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.73 kg
Ediția:1st ed. 2016
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: 3319456407
Pagini: 516
Ilustrații: XIII, 513 p. 61 illus.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.73 kg
Ediția:1st ed. 2016
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Cham, Switzerland
Cuprins
On the Differential and Full Algebraic Complexities of Operator Matrices Transformations.- Resolving Decompositions for Polynomial Modules.- Setup of Order Conditions for Splitting Methods.- Symbolic Manipulation of Flows of Nonlinear Evolution Equations, with Application in the Analysis of Split-Step Time Integrators.- Improved Computation of Involutive Bases.- Computing all Space Curve Solutions of Polynomial Systems by Polyhedral Methods.- Algorithmic Computation of Polynomial Amoebas.- Sparse Gaussian Elimination Modulo p: an Update.- MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures.- Incompleteness, Undecidability and Automated Proofs (Invited Talk).- A Numerical Method for Computing Border Curves of Bi-Parametric Real Polynomial Systems and Applications.- The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree.- Efficient Simplification Techniques for Special Real Quantifier Elimination with Applications to the Synthesis of Optimal Numerical Algorithms.- Symbolic-Numeric Algorithms for Solving BVPs for a System of ODEs of the Second Order: Multichannel Scattering and Eigenvalue Problems.- Symbolic Algorithm for Generating Irreducible Rotational-Vibrational Bases of Point Groups.- A Symbolic Investigation of the Influence of Aerodynamic Forces on Satellite Equilibria.- Computer Algebra in High-Energy Physics (Invited Talk).- A Note on Dynamic Gröbner Bases Computation.- Qualitative Analysis of the Reyman-Semenov-Tian-Shansky Integrable Case of the Generalized Kowalewski Top.- On Multiple Eigenvalues of a Matrix Dependent on a Parameter.- A Generalised Branch-and-Bound Approach and its Application in SAT Modulo Nonlinear Integer Arithmetic.- Computing Characteristic Polynomials of Matrices of Structured Polynomials.- Computing Sparse Representations of Systems of Rational Fractions.- On the General Analytical Solution of the Kinematic Cosserat Equations.- Using Sparse Interpolation in Hensel Lifting.- A Surveyof Satisfiability Modulo Theory.- Quadric Arrangement in Classifying Rigid Motions of a 3D Digital Image.- A Lower Bound for Computing Lagrange's Real Root Bound.- Enhancing the Extended Hensel Construction by Using Gröbner Bases.- Symbolic-Numerical Optimization and Realization of the Method of Collocations and Least Residuals for Solving the Navier-Stokes Equations.- Pruning Algorithms for Pretropisms of Newton Polytopes.- Computational Aspects of a Bound of Lagrange.
Caracteristici
Includes supplementary material: sn.pub/extras
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.