Übersicht			Auf mobile öffnen

Lieferstatus:	Auf Bestellung (Lieferzeit unbekannt)
Veröffentlichung:	August 2014
Genre:	Schulbücher
	Algorithm Analysis and Problem Complexity / Algorithms / Algorithms & data structures / Arithmetic and Logic Structures / Arithmetic and logic units, Computer / C / Computer architecture & logic design / Computer Graphics / computer science / Computer science—Mathematics / Computerhardware / Discrete Mathematics / Discrete Mathematics in Computer Science / Diskrete Mathematik / Grafikprogrammierung / Graphics programming / Mathematical theory of computation / Mathematik für Informatiker / Maths for computer scientists / Numeric Computing / Numerical analysis / Numerische Mathematik / Symbolic and Algebraic Manipulation mehr...
ISBN:	9783319105147
EAN-Code:	9783319105147
Verlag:	Springer EN
Einband:	Kartoniert
Sprache:	English
Serie:	#8660 - Lecture Notes in Computer Science Theoretical Computer Science and General Issues
Dimensionen:	H 235 mm / B 155 mm / D
Gewicht:	7723 gr
Seiten:	502
Illustration:	XIV, 502 p. 73 illus., schwarz-weiss Illustrationen
Zus. Info:	EUDR exemption - product or manufacturing materials placed on the market prior to 31.12.2025.
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

This book constitutes the proceedings of the 16th International Workshop on Computer Algebra in Scientific Computing, CASC 2014, held in Warsaw, Poland, in September 2014. The 33 full papers presented were carefully reviewed and selected for inclusion in this book. The papers address issues such as Studies in polynomial algebra are represented by contributions devoted to factoring sparse bivariate polynomials using the priority queue, the construction of irreducible polynomials by using the Newton index, real polynomial root finding by means of matrix and polynomial iterations, application of the eigenvalue method with symmetry for solving polynomial systems arising in the vibration analysis of mechanical structures with symmetry properties, application of Gröbner systems for computing the (absolute) reduction number of polynomial ideals, the application of cylindrical algebraic decomposition for solving the quantifier elimination problems, certification of approximate roots of overdetermined and singular polynomial systems via the recovery of an exact rational univariate representation from approximate numerical data, new parallel algorithms for operations on univariate polynomials (multi-point evaluation, interpolation) based on subproduct tree techniques.