Cantitate/Preț
Produs
Total produse
Vezi coșul
Computer Algebra in Scientific Computing de Vladimir P. Gerdt

Computer Algebra in Scientific Computing: Lecture Notes in Computer Science, cartea 10490

Editat de Vladimir P. Gerdt, Wolfram Koepf, Werner M. Seiler, Evgenii V. Vorozhtsov
en Limba Engleză Paperback – 31 aug 2017
This book constitutes the proceedings of the 19th International Workshop on Computer Algebra in Scientific Computing, CASC 2017, held in Beijing, China, in September 2017.

The 28 full papers presented in this volume were carefully reviewed and selected from 33 submissions. They deal with cutting-edge research in all major disciplines of Computer Algebra.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (5) 33324 lei  6-8 săpt.
  Springer – 19 aug 2014 33324 lei  6-8 săpt.
  Springer – 9 sep 2016 33382 lei  6-8 săpt.
  Springer – 8 sep 2015 36392 lei  38-44 zile
  Springer – 24 aug 2018 40937 lei  6-8 săpt.
  Springer – 31 aug 2017 46565 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 46565 lei

Preț vechi: 58206 lei
-20%

Puncte Express: 698
Preț estimativ în valută:
8227€ • 9458$ • 7144£

Carte tipărită la comandă

Livrare economică 13-27 mai

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783319663197
ISBN-10: 3319663194
Pagini: 424
Ilustrații: XIII, 407 p. 75 illus.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.64 kg
Ediția:1st edition 2017
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Caracteristici

Includes supplementary material: sn.pub/extras

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.

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.