Computer Algebra in Scientific Computing: 22nd International Workshop, CASC 2020, Linz, Austria, September 14–18, 2020, ProceedingsFrançois Boulier, Matthew England, Timur M. Sadykov, Evgenii V. Vorozhtsov Springer Nature, 17 d’oct. 2020 - 644 pàgines This book constitutes the refereed proceedings of the 22nd International Workshop on Computer Algebra in Scientific Computing, CASC 2020, held in Linz, Austria, in September 2020. The conference was held virtually due to the COVID-19 pandemic. The 34 full papers presented together with 2 invited talks were carefully reviewed and selected from 41 submissions. They deal with cutting-edge research in all major disciplines of computer algebra. The papers cover topics such as polynomial algebra, symbolic and symbolic-numerical computation, applications of symbolic computation for investigating and solving ordinary differential equations, applications of CAS in the investigation and solution of celestial mechanics problems, and in mechanics, physics, and robotics. |
Continguts
| 1 | |
| 14 | |
On the Complexity of Computing Integral Bases of Function Fields | 42 |
Truncated and Infinite Power Series in the Role of Coefficients of Linear Ordinary Differential Equations | 63 |
On Periodic Approximate Solutions of the ThreeBody Problem Found by Conservative Difference Schemes | 77 |
A ToomCook Multiplication Approach | 91 |
Power Series Arithmetic with the BPAS Library | 108 |
Enhancements to Lazards Method for Cylindrical Algebraic Decomposition | 129 |
Good Pivots for Small Sparse Matrices | 358 |
NullstellensatzProofs for Multiplier Verification | 368 |
Mathemachines via LEGO GeoGebra and CindyJS | 390 |
Balanced NUCOMP | 402 |
Contact Linearizability of Scalar Ordinary Differential Equations of Arbitrary Order | 421 |
Faster Numerical Univariate Polynomial RootFinding by Means of Subdivision Iterations | 431 |
Computing Parametric Standard Bases for Semiweighted Homogeneous Isolated Hypersurface Singularities | 447 |
Acceleration of Subdivision RootFinding for Sparse Polynomials | 461 |
The Complexity and Parallel Implementation of Two Sparse Multivariate Hensel Lifting Algorithms for Polynomial Factorization | 150 |
The GPGCD Algorithm with the Bézout Matrix | 170 |
On Parametric Linear System Solving | 188 |
SymbolicNumeric Algorithm for Computing Orthonormal Basis of O5SU11 Group | 206 |
SymbolicNumeric Study of Geometric Properties of Adiabatic Waveguide Modes | 228 |
Intrinsic Complexity for Constructing ZeroDimensional Gröbner Bases | 245 |
On the Study of the Motion of a System of Two Connected Rigid Bodies by Computer Algebra Methods | 266 |
Complexity Estimates for FourierMotzkin Elimination | 282 |
Progress Report on the Scala Algebra System | 307 |
Routh Hurwitz Stability of a Polynomial Matrix Family Real Perturbations | 316 |
Hermite Rational Function Interpolation with Error Correction | 335 |
Analytical Computations in Studying TranslationalRotational Motion of a Nonstationary Triaxial Body in the Central Gravitational Field | 478 |
A Linear Algebra Approach for Detecting Binomiality of Steady State Ideals ofReversibleChemicalReactionNetworks | 492 |
FirstOrder Tests for Toricity | 510 |
Looking for Compatible Routes in the Railway Interlocking System of an Overtaking Station Using a Computer Algebra System | 528 |
Computing Logarithmic Vector Fields Along an ICIS Germ via Matlis Duality | 543 |
Robust Numerical Tracking of One Path of a Polynomial Homotopy on Parallel Shared Memory Computers | 563 |
SymbolicNumeric Computation of the Bernstein Coefficients of a Polynomial from Those of One of Its Partial Derivatives and of the Product of Two... | 583 |
Comparative Study of the Accuracy of HigherOrder Difference Schemes for Molecular Dynamics Problems Using the Computer Algebra Means | 600 |
Characterizing Triviality of the Exponent Lattice of a Polynomial Through Galois and GaloisLike Groups | 621 |
| 642 | |
Altres edicions - Mostra-ho tot
Computer Algebra in Scientific Computing: 22nd International Workshop, CASC ... François Boulier,Matthew England,Timur M. Sadykov,Evgenii V. Vorozhtsov Previsualització no disponible - 2020 |
Frases i termes més freqüents
addition algebraic algorithm analysis applied approach approximate arithmetic assume bases basis binomial body bound calculations called coefficients complexity compute consider constant construction contains corresponding cost curves defined Definition denote derivatives described determined differential equations divisor efficient elements elimination equal error evaluation example exists extended factor False field finite function geometric given Gröbner ideal implementation input integral irreducible leading Lemma linear Math matrix means method multiplication Note obtain operations output parameters performed polynomial positive power series present problem projection proof Proposition reaction reduced relations representation represented respectively roots satisfies scheme Sect shows singularities solution solve space Springer standard basis step symbolic Table Theorem theory True truncated values variables vector zero