Cantitate/Preț
Produs
Total produse
Vezi coșul
Computer Algebra in Scientific Computing: 20th International Workshop, CASC 2018, Lille, France, September 17–21, 2018, Proceedings de Vladimir P. Gerdt

Computer Algebra in Scientific Computing: 20th International Workshop, CASC 2018, Lille, France, September 17–21, 2018, Proceedings: Lecture Notes in Computer Science, cartea 11077

Editat de Vladimir P. Gerdt, Wolfram Koepf, Werner M. Seiler, Evgenii V. Vorozhtsov
en Limba Engleză Paperback – 24 aug 2018
This book constitutes the proceedings of the 20th International Workshop on Computer Algebra in Scientific Computing, CASC 2018, held in Lille, France, in September 2018.
The 24 full papers of this volume presented with an abstract of an invited talk and one paper corresponding to another invited talk were carefully reviewed and selected from 29 submissions. They deal with cutting-edge research in all major disciplines of computer algebra in sciences such as physics, chemistry, life sciences, and engineering.
Chapter “Positive Solutions of Systems of Signed Parametric Polynomial Inequalities” is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (5) 33164 lei  38-45 zile
  Springer International Publishing – 8 sep 2015 33164 lei  38-45 zile
  Springer International Publishing – 19 aug 2014 33351 lei  6-8 săpt.
  Springer International Publishing – 9 sep 2016 33396 lei  6-8 săpt.
  Springer International Publishing – 24 aug 2018 41064 lei  6-8 săpt.
  Springer International Publishing – 31 aug 2017 46723 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 41064 lei

Preț vechi: 51330 lei
-20% Nou

Puncte Express: 616
Preț estimativ în valută:
7859€ • 8291$ • 6549£

Carte tipărită la comandă

Livrare economică 03-17 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319996387
ISBN-10: 331999638X
Pagini: 372
Ilustrații: XIII, 379 p. 54 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.55 kg
Ediția:1st ed. 2018
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

Proof-of-Work Certificates that Can Be Efficiently Computed in the Cloud (Invited Talk).- On Unimodular Matrices of Difference Operators.- Sparse Polynomial Arithmetic with the BPAS Library.- Computation of Pommaret Bases Using Syzygies.- A Strongly Consistent Finite Difference Scheme for Steady Stokes Flow and its Modified Equations.- Symbolic-Numeric Methods for Nonlinear Integro-Differential Modeling.- A Continuation Method for Visualizing Planar Real Algebraic Curves with Singularities.- From Exponential Analysis to Padé Approximation and Tensor Decomposition, in One and More Dimensions.- Symbolic Algorithm for Generating the Orthonormal Bargmann-Moshinsky Basis for SU(3) Group.- About Some Drinfel'd Associators.- On a Polytime Factorization Algorithm for Multilinear Polynomials over F2.- Tropical Newton-Puiseux Polynomials.- Orthogonal Tropical Linear Prevarieties.- Symbolic-Numerical Algorithms for Solving Elliptic Boundary-Value Problems Using Multivariate Simplex Lagrange Elements.- Symbolic-Numeric Simulation of Satellite Dynamics with Aerodynamic Attitude Control System.- Finding Multiple Solutions in Nonlinear Integer Programming with Algebraic Test-Sets.- Positive Solutions of Systems of Signed Parametric Polynomial Inequalities.- Qualitative Analysis of a Dynamical System with Irrational First Integrals.- Effective Localization Using Double Ideal Quotient and Its Implementation.- A Purely Functional Computer Algebra System Embedded in Haskell.- Splitting Permutation Representations of Finite Groups by Polynomial Algebra Methods.- Factoring Multivariate Polynomials with Many Factors and Huge Coefficients.- Beyond the First Class of Analytic Complexity.- A Theory and an Algorithm for Computing Sparse Multivariate Polynomial Remainder Sequence.- A Blackbox Polynomial System Solver on Parallel Shared Memory Computers.

Textul de pe ultima copertă

Chapter “Positive Solutions of Systems of Signed Parametric Polynomial Inequalities” is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

Caracteristici

Includes supplementary material: sn.pub/extras