LEADER 06466nam 22007935 450 001 996465277903316 005 20230927174335.0 010 $a3-642-32973-X 024 7 $a10.1007/978-3-642-32973-9 035 $a(CKB)3400000000085725 035 $a(SSID)ssj0000745876 035 $a(PQKBManifestationID)11421399 035 $a(PQKBTitleCode)TC0000745876 035 $a(PQKBWorkID)10861477 035 $a(PQKB)10191430 035 $a(DE-He213)978-3-642-32973-9 035 $a(MiAaPQ)EBC3069877 035 $a(PPN)168323222 035 $a(EXLCZ)993400000000085725 100 $a20120829d2012 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputer Algebra in Scientific Computing$b[electronic resource] $e14th International Workshop, CASC 2012, Maribor, Slovenia, September 3-6, 2012, Proceedings /$fedited by Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, Evgenii V. Vorozhtsov 205 $a1st ed. 2012. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2012. 215 $a1 online resource (XIV, 363 p. 42 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7442 300 $aInternational conference proceedings. 311 $a3-642-32972-1 320 $aIncludes bibliographical references and author index. 327 $aOn Polynomial Solutions of Linear Partial Differential and (q-)Difference Equations -- An Algebraic Characterization of Rainbow Connectivity -- Application of the Method of Asymptotic Solution to One Multi-Parameter Problem -- A New Algorithm for Long Integer Cube Computation with Some Insight into Higher Powers -- Lightweight Abstraction for Mathematical Computation in Java -- Calculation of Normal Forms of the Euler?Poisson Equations -- Stability of Equilibrium Positions in the Spatial Circular Restricted Four-Body Problem -- Computing Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates -- Comprehensive Involutive Systems -- A Polynomial-Time Algorithm for the Jacobson Form of a Matrix of Ore Polynomials -- The Resonant Center Problem for a 2:-3 Resonant Cubic Lotka?Volterra System -- Complexity of Solving Systems with Few Independent Monomials and Applications to Mass-Action Kinetics Symbolic-Numerical Calculations of -- High-|m| Rydberg States and Decay Rates in Strong Magnetic Fields -- Quasi-stability versus Genericity -- Invariant Theory: Applications and Computations (Invited Talk) -- Local Generic Position for Root Isolation of Zero-Dimensional Triangular Polynomial Systems -- On Fulton?s Algorithm for Computing Intersection Multiplicities -- A Note on the Space Complexity of Fast D-Finite Function Evaluation -- Inversion Modulo Zero-Dimensional Regular Chains -- Sparse Polynomial Powering Using Heaps -- Stability Conditions of Monomial Bases and Comprehensive Gröbner Systems -- Parallel Reduction of Matrices in Gr¨obner Bases Computations -- Real and Complex Polynomial Root-Finding by Means of Eigen-Solving -- Root-Refining for a Polynomial Equation -- PoCaB: A Software Infrastructure to Explore Algebraic Methods for Bio-chemical Reaction Networks -- Approximately Singular Systems and Ill-Conditioned Polynomial Systems -- Symbolic-Numeric Implementation of the Method of Collocations and Least Squares for 3D Navier?Stokes Equations -- Verifiable Conditions on Asymptotic Stabilisability for a Class of Planar Switched Linear Systems -- Improving Angular Speed Uniformity by Optimal C0 Piecewise Reparameterization -- Usage of Modular Techniques for Efficient Computation of Ideal Operations (Invited Talk). 330 $aThis book constitutes the proceedings of the 14th International Workshop on Computer Algebra in Scientific Computing, CASC 2012, held in Maribor, Slovenia, in September 2012. The 28 full papers presented were carefully reviewed and selected for inclusion in this book. One of the main themes of the CASC workshop series, namely polynomial algebra, is represented by contributions devoted to new algorithms for computing comprehensive Gröbner and involutive systems, parallelization of the Gröbner bases computation, the study of quasi-stable polynomial ideals, new algorithms to compute the Jacobson form of a matrix of Ore polynomials, a recursive Leverrier algorithm for inversion of dense matrices whose entries are monic polynomials, root isolation of zero-dimensional triangular polynomial systems, optimal computation of the third power of a long integer, investigation of the complexity of solving systems with few independent monomials, the study of ill-conditioned polynomial systems, a method for polynomial root-finding via eigen-solving and randomization, an algorithm for fast dense polynomial multiplication with Java using the new opaque typed method, and sparse polynomial powering using heaps. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7442 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aComputer graphics 606 $aNumerical analysis 606 $aComputer arithmetic and logic units 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aSymbolic and Algebraic Manipulation 606 $aComputer Graphics 606 $aNumerical Analysis 606 $aArithmetic and Logic Structures 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aComputer graphics. 615 0$aNumerical analysis. 615 0$aComputer arithmetic and logic units. 615 14$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aSymbolic and Algebraic Manipulation. 615 24$aComputer Graphics. 615 24$aNumerical Analysis. 615 24$aArithmetic and Logic Structures. 676 $a004.01/51 702 $aGerdt$b Vladimir P$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKoepf$b Wolfram$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMayr$b Ernst W$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aVorozhtsov$b Evgenii V$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465277903316 996 $aComputer Algebra in Scientific Computing$9772100 997 $aUNISA