國立虎尾科技大學 |

Computer Algebra in Scientific Computing = 18th International Workshop, CASC 2016, Bucharest, Romania, September 19-23, 2016, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Computer Algebra in Scientific Computing/ edited by Vladimir P. Gerdt, Wolfram Koepf, Werner M. Seiler, Evgenii V. Vorozhtsov.
其他題名:	18th International Workshop, CASC 2016, Bucharest, Romania, September 19-23, 2016, Proceedings /
其他作者:	Gerdt, Vladimir P.
面頁冊數:	XIII, 513 p. 61 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Algorithms. -
電子資源:	https://doi.org/10.1007/978-3-319-45641-6
ISBN:	9783319456416

Computer Algebra in Scientific Computing = 18th International Workshop, CASC 2016, Bucharest, Romania, September 19-23, 2016, Proceedings /
Computer Algebra in Scientific Computing18th International Workshop, CASC 2016, Bucharest, Romania, September 19-23, 2016, Proceedings /[electronic resource] :edited by Vladimir P. Gerdt, Wolfram Koepf, Werner M. Seiler, Evgenii V. Vorozhtsov. - 1st ed. 2016. - XIII, 513 p. 61 illus.online resource. - Theoretical Computer Science and General Issues ;9890. - Theoretical Computer Science and General Issues ;9163.

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 Survey of 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.

This book constitutes the proceedings of the 18th International Workshop on Computer Algebra in Scientific Computing, CASC 2016, held in Bucharest, Romania, in September 2016. The 32 papers presented in this volume were carefully reviewed and selected from 39 submissions. They deal with cutting-edge research in all major disciplines of Computer Algebra.

ISBN: 9783319456416

Standard No.: 10.1007/978-3-319-45641-6doiSubjects--Topical Terms:

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Computer Algebra in Scientific Computing = 18th International Workshop, CASC 2016, Bucharest, Romania, September 19-23, 2016, Proceedings /
LDR:04377nam a22004095i 4500 001 981008
003 DE-He213
005 20200704054404.0
007 cr nn 008mamaa
008 201211s2016 gw | s |||| 0|eng d
020 $a 9783319456416 $9 978-3-319-45641-6
024 7 $a 10.1007/978-3-319-45641-6 $2 doi
035 $a 978-3-319-45641-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 18th International Workshop, CASC 2016, Bucharest, Romania, September 19-23, 2016, Proceedings / $c edited by Vladimir P. Gerdt, Wolfram Koepf, Werner M. Seiler, Evgenii V. Vorozhtsov.
250 $a 1st ed. 2016.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a XIII, 513 p. 61 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 9890
505 0 $a 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 Survey of 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.
520 $a This book constitutes the proceedings of the 18th International Workshop on Computer Algebra in Scientific Computing, CASC 2016, held in Bucharest, Romania, in September 2016. The 32 papers presented in this volume were carefully reviewed and selected from 39 submissions. They deal with cutting-edge research in all major disciplines of Computer Algebra.
650 0 $a Algorithms. $3 527865
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Computer simulation. $3 560190
650 0 $a Numerical analysis. $3 527939
650 0 $a Arithmetic and logic units, Computer. $3 1255170
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Symbolic and Algebraic Manipulation. $3 669944
650 2 4 $a Simulation and Modeling. $3 669249
650 2 4 $a Numeric Computing. $3 669943
650 2 4 $a Arithmetic and Logic Structures. $3 672631
700 1 $a Gerdt, Vladimir P. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 792768
700 1 $a Koepf, Wolfram. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1258367
700 1 $a Seiler, Werner M. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1258368
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 9783319456409
776 0 8 $i Printed edition: $z 9783319456423
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-319-45641-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)