1 option
Applications of Computer Algebra : Kalamata, Greece, July 20–23 2015 / edited by Ilias S. Kotsireas, Edgar Martínez-Moro.
Springer Nature - Springer Mathematics and Statistics eBooks 2017 English International Available online
View online- Format:
- Book
- Series:
- Springer Proceedings in Mathematics & Statistics, 2194-1017 ; 198
- Language:
- English
- Subjects (All):
- Commutative algebra.
- Commutative rings.
- Algebraic fields.
- Polynomials.
- Coding theory.
- Information theory.
- Computer science--Mathematics.
- Computer science.
- Geometry, Algebraic.
- Commutative Rings and Algebras.
- Field Theory and Polynomials.
- Coding and Information Theory.
- Mathematical Applications in Computer Science.
- Algebraic Geometry.
- Local Subjects:
- Commutative Rings and Algebras.
- Field Theory and Polynomials.
- Coding and Information Theory.
- Mathematical Applications in Computer Science.
- Algebraic Geometry.
- Physical Description:
- 1 online resource (XIV, 515 p. 126 illus., 73 illus. in color.)
- Edition:
- 1st ed. 2017.
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2017.
- Summary:
- The Applications of Computer Algebra (ACA) conference covers a wide range of topics from Coding Theory to Differential Algebra to Quantam Computing, focusing on the interactions of these and other areas with the discipline of Computer Algebra. This volume provides the latest developments in the field as well as its applications in various domains, including communications, modelling, and theoretical physics. The book will appeal to researchers and professors of computer algebra, applied mathematics, and computer science, as well as to engineers and computer scientists engaged in research and development.
- Contents:
- An algebraic method to compute the mobility of closed-loop overconstrained mechanisms (Ali, Moinet, Serre)
- Simplicial topological coding and homology of spin networks (Berec)
- Trial set and Groebner bases for binary codes (Borges-Quintana, Borges-Trenard, Martiınez-Moro)
- Automated Study of Envelopes of 1-parameter Families of Surfaces (Dana-Picard, Zehavi)
- Complex Roots of Quaternion Polynomials (Dospra, Poulakis)
- Mathematical renormalization in quantum electrodynamics via noncommutative generating series (Duchamp, Ngoc Minh, Quoc Hoan, Penson, Simonnet)
- The root lattice A2 in the construction of substitution tilings and singular hypersurfaces (Escudero)
- Finding eigenvalues of self-maps with the Kronecker canonical form (Ethier, Jablonski, Mrozek)
- Algorithm for Predicting Mathematical Formulae from Linear Strings for Mathematical Inputs (Fukui)
- Algebraic Modelling of Covering Arrays (Garn, Simos)
- Applications of Signatures Curves to Characterize Melanomas and Moles (Grim, Shakiban)
- Contemporary interpretation of a historical locus problem with the use of computer algebra (Hasek, Kovacs, Zahradnik)
- Computing the Chern-Schwartz-MacPherson Class of Complete Simplical Toric Varieties (Helmer)
- The Generalized Rabinowitsch Trick (Kapur, Sun, Wang, Zhou)
- A Web-based Quantum Computer Simulator with Symbolic Extensions (Karamitrou, Tsimpouris, Mavridi, Sgarbas)
- Dixon-EDF: The Premier Method for Solution of Parametric Polynomial Systems ( Lewis)
- Visualization of Orthonormal Triads in Cylindrical and Spherical Coordinates (Lopez-Garcia, Jimenez Zamudio, Diaz V.)
- Geometric and Computational Approach to Classical and Quantum Secret Sharing (Matsumoto, Ruano)
- Computing the Dixon Resultant with the Maple Package DR (Minimair)
- Collaborative Computer Algebra (Minimair)
- States and channels in quantum mechanics without complex numbers (Miszczak)
- Double Hough transform for estimating the position of the mandibular canal in dental radiographs (Onchis-Moaca, Zappala, Gotja, Real)
- Simple and Nearly Optimal Polynomial Root- nding by Means of Root Radii Approximation (Pan)
- A Fast Schur-Euclid-type Algorithm for Quasiseparable Polynomials (Perera, Olshevsky)
- The use of CAS Piranha for the construction of motion equations of the planetary system problem (Perminov, Kuznetsov)
- Code-Based Cryptosystems Using Generalized Concatenated Codes (Puchinger, Muelich, Ishak, Bossert)
- Univariate real root isolation over a single logarithmic extension of real algebraic numbers (Strzebonski, Tsigaridas)
- On the complexity of multivariate polynomial division (van der Hoeven)
- Preserving syntactic correctness while editing mathematical formulas (van der Hoeven, Lecerf, Raux)
- About balanced application of CAS in undergraduate mathematics (Varbanova)
- Some remarks on Taylor’s polynomials visualization using Mathematica in context of function approximation (Wojas, Krupa)
- Zooming algorithms for accurate plotting of functions of two realvariables (Zeitoun, Dana-Picard).
- Notes:
- Includes bibliographical references at the end of each chapters.
- ISBN:
- 3-319-56932-5
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.