My Account Log in

1 option

Computer Algebra in Scientific Computing : 16th International Workshop, CASC 2014, Warsaw, Poland, September 8-12, 2014. 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, 8660.
Theoretical Computer Science and General Issues ; 8660
Language:
English
Subjects (All):
Algorithms.
Computer science--Mathematics.
Computer science.
Computer graphics.
Numerical analysis.
Computer arithmetic and logic units.
Algorithm Analysis and Problem Complexity.
Discrete Mathematics in Computer Science.
Symbolic and Algebraic Manipulation.
Computer Graphics.
Numeric Computing.
Arithmetic and Logic Structures.
Local Subjects:
Algorithm Analysis and Problem Complexity.
Discrete Mathematics in Computer Science.
Symbolic and Algebraic Manipulation.
Computer Graphics.
Numeric Computing.
Arithmetic and Logic Structures.
Physical Description:
1 online resource (XIV, 502 pages) : 73 illustrations.
Edition:
First edition 2014.
Contained In:
Springer eBooks
Place of Publication:
Cham : Springer International Publishing : Imprint: Springer, 2014.
System Details:
text file PDF
Summary:
This book constitutes the proceedings of the 16th International Workshop on Computer Algebra in Scientific Computing, CASC 2014, held in Warsaw, Poland, in September 2014. The 33 full papers presented were carefully reviewed and selected for inclusion in this book. The papers address issues such as Studies in polynomial algebra are represented by contributions devoted to factoring sparse bivariate polynomials using the priority queue, the construction of irreducible polynomials by using the Newton index, real polynomial root finding by means of matrix and polynomial iterations, application of the eigenvalue method with symmetry for solving polynomial systems arising in the vibration analysis of mechanical structures with symmetry properties, application of Gröbner systems for computing the (absolute) reduction number of polynomial ideals, the application of cylindrical algebraic decomposition for solving the quantifier elimination problems, certification of approximate roots of overdetermined and singular polynomial systems via the recovery of an exact rational univariate representation from approximate numerical data, new parallel algorithms for operations on univariate polynomials (multi-point evaluation, interpolation) based on subproduct tree techniques.
Contents:
Relation Algebra, RelView, and Plurality Voting
An Algorithm for Converting Nonlinear Differential Equations to Integral Equations with an Application to Parameter Estimation from Noisy Data
Truth Table Invariant Cylindrical Algebraic Decomposition by Regular Chains
Computing the Topology of an Arrangement of Implicit and Parametric Curves Given by Values
Finding a Deterministic Generic Position for an Algebraic Space Curve
Computer Algebra Experimentation
On the Parallelization of Subproduct Tree Techniques Targeting
Many-core Architectures
Deterministically Computing Reduction Numbers of Polynomial Ideals.
Other Format:
Printed edition:
ISBN:
978-3-319-10515-4
9783319105154
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.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account