Computer Mathematics 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, - used book

EAN (ISBN-13): 9783540878261
ISBN (ISBN-10): 3540878262
Hardcover
Paperback
Publishing year: 2008
Publisher: Springer
358 Pages
Weight: 0,560 kg
Language: eng/Englisch

Book in our database since 2008-07-19T06:45:32+01:00 (London)
Detail page last modified on 2023-07-09T03:24:01+01:00 (London)
ISBN/EAN: 9783540878261

ISBN - alternate spelling:
3-540-87826-2, 978-3-540-87826-1
Alternate spelling and related search-keywords:
Book author: deepak
Book title: singapore, symposium, before the computer, papers, invited, lecture notes mathematics

---

Information from Publisher

Author: Deepak Kapur
Title: Lecture Notes in Artificial Intelligence; Lecture Notes in Computer Science; Computer Mathematics - 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007, Revised and Invited Papers
Publisher: Springer; Springer Berlin
359 Pages
Publishing year: 2008-09-29
Berlin; Heidelberg; DE
Language: English
80,24 € (DE)
82,49 € (AT)
100,20 CHF (CH)
Contact supplier
XI, 359 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Künstliche Intelligenz; Verstehen; Mathematik; algebraic-numeric computation; algorithms; associate residual; automated reasoning; biomechanics problem; characteristic set; computational geometry; computer algebra; difference substitution; formal mathematics; groebner basis; instability; logic; symmetric polynomials; Artificial Intelligence; Computer Communication Networks; Theory of Computation; Symbolic and Algebraic Manipulation; Numerical Analysis; Mathematical Applications in Computer Science; Netzwerk-Hardware; Theoretische Informatik; Mathematik für Informatiker; Numerische Mathematik; EA

Algorithms and Implementations.- Computing the Minkowski Value of the Exponential Function over a Complex Disk.- Unconstrained Parametric Minimization of a Polynomial: Approximate and Exact.- The Nearest Real Polynomial with a Real Multiple Zero in a Given Real Interval.- Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping.- Which Symmetric Homogeneous Polynomials Can Be Proved Positive Semi-definite by Difference Substitution Method?.- Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis.- Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix.- Efficient Algorithms for Computing Nœther Normalization.- Stability of GPBiCG_AR Method Based on Minimization of Associate Residual.- Evaluation of a Java Computer Algebra System.- A New Property of Hamming Graphs and Mesh of d-ary Trees.- Numerical Methods and Applications.- An Interpolation Method That Minimizes an Energy Integral of Fractional Order.- Solving Biomechanical Model Using Third-Order Runge-Kutta Methods.- An Efficient Fourth Order Implicit Runge-Kutta Algorithm for Second Order Systems.- Laplace Equation Inside a Cylinder: Computational Analysis and Asymptotic Behavior of the Solution.- A Method and Its Implementation for Constructing Bäcklund Transformations to Nonlinear Evolution Equations.- On the Invariant Properties of Hyperbolic Bivariate Third-Order Linear Partial Differential Operators.- Symbolic Solution to Magnetohydrodynamic Hiemenz Flow in Porous Media.- Local Similarity Solutions for Laminar Boundary Layer Flow along a Moving Cylinder in a Parallel Stream.- Elimination: Triangular Forms, Resultants, Equation Solving.- An Algorithm for Transforming Regular Chain into NormalChain.- A Modified Van der Waerden Algorithm to Decompose Algebraic Varieties and Zero-Dimensional Radical Ideals.- Regular Decompositions.- Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation.- The Maximality of the Dixon Matrix on Corner-Cut Monomial Supports.- Properties of Ascending Chains for Partial Difference Polynomial Systems.- Cryptology.- Some Mathematical Problems in Cryptanalysis.- A Reduction Attack on Algebraic Surface Public-Key Cryptosystems.- Computational Logic.- The Four Colour Theorem: Engineering of a Formal Proof.- On the Computation of Elimination Ideals of Boolean Polynomial Rings.- Computer Search for Large Sets of Idempotent Quasigroups.