000			05315nam a22004095i 4500
001			306709
003			MX-SnUAN
005			20160429160050.0
007			cr nn 008mamaa
008			150903s2012 gw | o |||| 0|eng d
020			_a9783642329739 _99783642329739
024	7		_a10.1007/9783642329739 _2doi
035			_avtls000360093
039		9	_a201509031007 _bVLOAD _c201405070254 _dVLOAD _y201402201425 _zstaff
040			_aMX-SnUAN _bspa _cMX-SnUAN _erda
050		4	_aQA76.9.A43
100	1		_aGerdt, Vladimir P. _eeditor. _9324607
245	1	0	_aComputer Algebra in Scientific Computing : _b14th International Workshop, CASC 2012, Maribor, Slovenia, September 3-6, 2012. Proceedings / _cedited by Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, Evgenii V. Vorozhtsov.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2012.
300			_axiv, 363 páginas 42 ilustraciones _brecurso en línea.
336			_atexto _btxt _2rdacontent
337			_acomputadora _bc _2rdamedia
338			_arecurso en línea _bcr _2rdacarrier
347			_aarchivo de texto _bPDF _2rda
490	0		_aLecture Notes in Computer Science, _x0302-9743 ; _v7442
500			_aSpringer eBooks
505	0		_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).
520			_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.
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700	1		_aKoepf, Wolfram. _eeditor. _9324608
700	1		_aMayr, Ernst W. _eeditor. _9324609
700	1		_aVorozhtsov, Evgenii V. _eeditor. _9324610
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9783642329722
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-642-32973-9 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c306709 _d306709