Computer Algebra in Scientific Computing
Springer International Publishing (Verlag)
978-3-319-45640-9 (ISBN)
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.
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 Surveyof 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.
Erscheinungsdatum | 11.10.2016 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
Zusatzinfo | XIII, 513 p. 61 illus. |
Verlagsort | Cham |
Sprache | englisch |
Maße | 155 x 235 mm |
Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
Schlagworte | Algebraic Algorithms • Algorithm analysis and problem complexity • algorithms and data structures • Algorithms Design • analysis of algorithms • Applications • applications to natural sciences and engineering • automated reasoning • Complexity • Computability • Computer Algebra Systems • Computer Science • conference proceedings • Differential Equations • Engineering • Finite Element Method • Gröbner Bases • Gröbner Bases • Informatics • Logic • mathematical software • Natural Sciences • Numerical analysis • Parallel Processing • quantum computation theory • Research • Simulation and modeling • symbolic algorithms |
ISBN-10 | 3-319-45640-7 / 3319456407 |
ISBN-13 | 978-3-319-45640-9 / 9783319456409 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich