Computer Algebra in Scientific Computing: Lecture Notes in Computer Science, cartea 12291
Editat de François Boulier, Matthew England, Timur M. Sadykov, Evgenii V. Vorozhtsoven Limba Engleză Paperback – 18 oct 2020
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (3) | 496.81 lei 3-5 săpt. | +29.59 lei 4-10 zile |
| Springer – 12 aug 2022 | 496.81 lei 3-5 săpt. | +29.59 lei 4-10 zile |
| Springer – 17 aug 2021 | 578.67 lei 6-8 săpt. | |
| Springer – 18 oct 2020 | 642.53 lei 6-8 săpt. |
Din seria Lecture Notes in Computer Science
- 20%
Preț: 558.53 lei - 20%
Preț: 571.88 lei - 20%
Preț: 675.83 lei - 20%
Preț: 1020.28 lei - 20%
Preț: 620.33 lei - 20%
Preț: 560.93 lei - 20%
Preț: 633.70 lei - 20%
Preț: 678.21 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 560.93 lei - 20%
Preț: 733.68 lei - 20%
Preț: 793.92 lei - 15%
Preț: 558.12 lei - 20%
Preț: 793.92 lei - 20%
Preț: 560.93 lei - 20%
Preț: 748.63 lei - 20%
Preț: 562.49 lei - 20%
Preț: 1246.46 lei - 20%
Preț: 449.81 lei - 20%
Preț: 556.96 lei - 20%
Preț: 562.49 lei - 20%
Preț: 851.78 lei - 20%
Preț: 313.10 lei - 18%
Preț: 945.44 lei - 20%
Preț: 314.86 lei - 20%
Preț: 560.93 lei - 20%
Preț: 313.87 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 563.29 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1137.10 lei - 20%
Preț: 735.28 lei - 20%
Preț: 1079.23 lei - 20%
Preț: 560.11 lei - 20%
Preț: 791.54 lei - 15%
Preț: 672.87 lei - 20%
Preț: 1032.47 lei - 20%
Preț: 617.17 lei - 20%
Preț: 1022.15 lei - 20%
Preț: 984.64 lei - 20%
Preț: 620.33 lei - 20%
Preț: 979.25 lei - 20%
Preț: 402.28 lei - 20%
Preț: 316.28 lei - 20%
Preț: 636.06 lei - 20%
Preț: 320.24 lei - 20%
Preț: 328.94 lei
Preț: 642.53 lei
Preț vechi: 803.16 lei
-20%
Puncte Express: 964
Preț estimativ în valută:
113.55€ • 131.05$ • 99.03£
113.55€ • 131.05$ • 99.03£
Carte tipărită la comandă
Livrare economică 18 mai-01 iunie
Specificații
ISBN-13: 9783030600259
ISBN-10: 3030600254
Pagini: 664
Ilustrații: XVII, 644 p. 96 illus.
Dimensiuni: 155 x 235 x 36 mm
Greutate: 0.99 kg
Ediția:1st edition 2020
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 3030600254
Pagini: 664
Ilustrații: XVII, 644 p. 96 illus.
Dimensiuni: 155 x 235 x 36 mm
Greutate: 0.99 kg
Ediția:1st edition 2020
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
Cuprins
Tropical Geometry of Biological Systems (Invited Talk).- Algebraic and Geometric Analysis of Singularities of Implicit Differential Equations (Invited Talk).- On the Complexity of Computing Integral Bases of Function Fields.- Truncated and Infinite Power Series in the Role of Coefficients of Linear Ordinary Differential Equations.- On Periodic Approximate Solutions of the Three-Body Problem Found by Conservative Difference Schemes.- Univariate Polynomials With Long Unbalanced Coefficients as Bivariate Balanced Ones: a Toom–Cook Multiplication Approach.- Power Series Arithmetic with the BPAS Library.- Enhancements to Lazard's Method for Cylindrical Algebraic Decomposition.- The Complexity and Parallel Implementation of two Sparse Multivariate Hensel Lifting Algorithms for Polynomial Factorization.- The GPGCD Algorithm with the Bézout Matrix.- On Parametric Linear System Solving.- Symbolic-Numeric Algorithm for Computing Orthonormal Basis of O(5) Χ SU(1,1) Group.- Symbolic-Numeric Study of Geometric Properties of Adiabatic Waveguide Modes.- Intrinsic Complexity for Constructing Zero-Dimensional Gröbner Bases.- On the Study of the Motion of a System of Two Connected Rigid Bodies by Computer Algebra Methods.- Complexity Estimates for Fourier-Motzkin Elimination.- Progress Report on the Scala Algebra System.- Routh – Hurwitz Stability of a Polynomial Matrix Family. Real Perturbations.- Hermite Rational Function Interpolation with Error Correction.- Good Pivots for Small Sparse Matrices.- Nullstellensatz-Proofs for Multiplier Verification.- "Mathemachines" via LEGO, GeoGebra and CindyJS.- Balanced NUCOMP.- Contact Linearizability of Scalar Ordinary Differential Equations of Arbitrary Order.- Faster Numerical Univariate Polynomial Root-Finding by Means of Subdivision Iterations.- Computing Parametric Standard bases for Semi-weighted Homogeneous Isolated Hypersurface Singularities.- Acceleration of Subdivision Root-Finding for Sparse Polynomials.- Analytical Computationsin Studying Translational-Rotational Motion of a Non-Stationary Triaxial Body in the Central Gravitational Field.- A Linear Algebra Approach for Detecting Binomiality of Steady State Ideals of Reversible Chemical Reaction Networks.- First-Order Tests for Toricity.- Looking for Compatible Routes in the Railway Interlocking System of an Overtaking Station Using a Computer Algebra System.- Computing Logarithmic Vector Fields along an ICIS Germ via Matlis Duality.- Robust Numerical Tracking of One Path of a Polynomial Homotopy on Parallel Shared Memory Computers.- Symbolic-Numeric Computation of the Bernstein Coefficients of a Polynomial from Those of One of Its Partial Derivatives and of the Product of Two Polynomials.- Comparative Study of the Accuracy of Higher-order Difference Schemes for Molecular Dynamics Problems Using the Computer Algebra Means.- Characterizing Triviality of the Exponent Lattice of a Polynomial through Galois and Galois-Like Groups.
Recenzii
“Strong interplay between the abstract exposition, which includes the relevant theorems as well as their proofs, and the practical utilization of those concepts in Mathematica is certainly a remarkable feature of this textbook. … Overall, the book is very well written and the approach to provide examples as actual Mathematica sessions is commendable.” (Andreas Maletti, zbMATH 1484.68004, 2022)