Applications of Computer Algebra

Kalamata, Greece, July 20–23 2015

AvIlias S. Kotsireas,Edgar Martínez-Moro

Inbunden, Engelska, 2017

Del 198 i serien Springer Proceedings in Mathematics & Statistics

1 653 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2017-07-27
Mått:155 x 235 x 34 mm
Vikt:957 g
Format:Inbunden
Språk:Engelska
Serie:Springer Proceedings in Mathematics & Statistics
Antal sidor:515
Upplaga:17001
Förlag:Springer International Publishing AG
ISBN:9783319569307

Utforska kategorier

Innehållsförteckning

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).

Du kanske också är intresserad av

Applications of Computer Algebra

Edgar Martinez-Moro, Ilias S. Kotsireas

E-bok

2017

2 044 kr

Del 5

ADVANCES IN ALGEBRAIC GEOMETRY CODES

AL EDGAR MARTINEZ-MORO ET, Edgar Martínez-Moro, Carlos Munuera, Diego Ruano

Inbunden, 2008

2 657 kr

Del 8

ALGEBRAIC GEOMETRY MODELING IN INFORMATION THEORY

Moro Edgar Martinez, Edgar Martínez Moro

Inbunden, 2013

1 683 kr

Algorithms and Complexity in Mathematics, Epistemology, and Science

Nicolas Fillion, Robert M. Corless, Ilias S. Kotsireas

Inbunden, 2019

1 104 kr

Learning and Intelligent Optimization

Panos M. Pardalos, Ilias S. Kotsireas

E-bok

2020

718 kr

Advances in Combinatorial Mathematics

Ilias S. Kotsireas, Eugene V. Zima

Inbunden, 2009

1 104 kr

Advances in Combinatorics

Eugene V. Zima, Ilias S. Kotsireas

E-bok

2013

1 427 kr

Del 185

Dynamics of Disasters—Key Concepts, Models, Algorithms, and Insights

Ilias S. Kotsireas, Anna Nagurney, Panos M. Pardalos

Häftad, 2018

1 653 kr

Advances in Combinatorics

Ilias S. Kotsireas, Eugene V. Zima

Häftad, 2015

1 104 kr

Learning and Intelligent Optimization

Panos M. Pardalos, Ilias S. Kotsireas, Francesco Archetti, Varvara A. Rasskazova, Dimitris E. Simos

E-bok

2023

1 255 kr

Applications of Computer Algebra

Kalamata, Greece, July 20–23 2015

AvIlias S. Kotsireas,Edgar Martínez-Moro

Inbunden, Engelska, 2017

Del 198 i serien Springer Proceedings in Mathematics & Statistics

1 653 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

Produktinformation

Utgivningsdatum:2017-07-27
Mått:155 x 235 x 34 mm
Vikt:957 g
Format:Inbunden
Språk:Engelska
Serie:Springer Proceedings in Mathematics & Statistics
Antal sidor:515
Upplaga:17001
Förlag:Springer International Publishing AG
ISBN:9783319569307

Utforska kategorier

Innehållsförteckning

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).