國立虎尾科技大學 |

Computer Algebra in Scientific Computing = 22nd International Workshop, CASC 2020, Linz, Austria, September 14–18, 2020, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Computer Algebra in Scientific Computing/ edited by François Boulier, Matthew England, Timur M. Sadykov, Evgenii V. Vorozhtsov.
Reminder of title:	22nd International Workshop, CASC 2020, Linz, Austria, September 14–18, 2020, Proceedings /
other author:	Boulier, François.
Description:	XVII, 644 p. 96 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Algorithms. -
Online resource:	https://doi.org/10.1007/978-3-030-60026-6
ISBN:	9783030600266

Computer Algebra in Scientific Computing = 22nd International Workshop, CASC 2020, Linz, Austria, September 14–18, 2020, Proceedings /
Computer Algebra in Scientific Computing22nd International Workshop, CASC 2020, Linz, Austria, September 14–18, 2020, Proceedings /[electronic resource] :edited by François Boulier, Matthew England, Timur M. Sadykov, Evgenii V. Vorozhtsov. - 1st ed. 2020. - XVII, 644 p. 96 illus.online resource. - Theoretical Computer Science and General Issues ;12291. - Theoretical Computer Science and General Issues ;9163.

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 Computations in 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.

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.

ISBN: 9783030600266

Standard No.: 10.1007/978-3-030-60026-6doiSubjects--Topical Terms:

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Computer Algebra in Scientific Computing = 22nd International Workshop, CASC 2020, Linz, Austria, September 14–18, 2020, Proceedings /
LDR:05298nam a22004095i 4500 001 1030582
003 DE-He213
005 20201017210224.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030600266 $9 978-3-030-60026-6
024 7 $a 10.1007/978-3-030-60026-6 $2 doi
035 $a 978-3-030-60026-6
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
245 1 0 $a Computer Algebra in Scientific Computing $h [electronic resource] : $b 22nd International Workshop, CASC 2020, Linz, Austria, September 14–18, 2020, Proceedings / $c edited by François Boulier, Matthew England, Timur M. Sadykov, Evgenii V. Vorozhtsov.
250 $a 1st ed. 2020.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a XVII, 644 p. 96 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 12291
505 0 $a 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 Computations in 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.
520 $a 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.
650 0 $a Algorithms. $3 527865
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Artificial intelligence. $3 559380
650 0 $a Architecture, Computer. $3 1255731
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Mathematics of Computing. $3 669457
650 2 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Computer System Implementation. $3 669803
700 1 $a Boulier, François. $e editor. $1 https://orcid.org/0000-0002-6663-719X $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1327524
700 1 $a England, Matthew. $e editor. $1 https://orcid.org/0000-0001-5729-3420 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1300638
700 1 $a Sadykov, Timur M. $e editor. $1 https://orcid.org/0000-0003-0741-2318 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1300639
700 1 $a Vorozhtsov, Evgenii V. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 675623
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030600259
776 0 8 $i Printed edition: $z 9783030600273
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-60026-6
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)