My Account Log in

1 option

Computer Algebra in Scientific Computing : 18th International Workshop, CASC 2016, Bucharest, Romania, September 19-23, 2016, Proceedings / edited by Vladimir P. Gerdt, Wolfram Koepf, Werner M. Seiler, Evgenii V. Vorozhtsov.

SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online

View online
Format:
Book
Contributor:
Gerdt, V. P., editor.
Koepf, Wolfram, editor.
Seiler, Werner M. (Werner Markus), editor.
Vorozhtsov, Evgenii V., editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 9890.
Theoretical Computer Science and General Issues ; 9890
Language:
English
Subjects (All):
Algorithms.
Computer science--Mathematics.
Computer science.
Computer simulation.
Numerical analysis.
Computer arithmetic and logic units.
Algorithm Analysis and Problem Complexity.
Discrete Mathematics in Computer Science.
Symbolic and Algebraic Manipulation.
Simulation and Modeling.
Numeric Computing.
Arithmetic and Logic Structures.
Local Subjects:
Algorithm Analysis and Problem Complexity.
Discrete Mathematics in Computer Science.
Symbolic and Algebraic Manipulation.
Simulation and Modeling.
Numeric Computing.
Arithmetic and Logic Structures.
Physical Description:
1 online resource (XIII, 513 pages) : 61 illustrations.
Edition:
First edition 2016.
Contained In:
Springer eBooks
Place of Publication:
Cham : Springer International Publishing : Imprint: Springer, 2016.
System Details:
text file PDF
Summary:
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.
Contents:
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.
Other Format:
Printed edition:
ISBN:
978-3-319-45641-6
9783319456416
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Library Catalog Using Articles+ Library Account