TY - BOOK ID - 61122611 TI - Computer Algebra in Scientific Computing PY - 2019 SN - 3039217313 3039217305 PB - MDPI - Multidisciplinary Digital Publishing Institute DB - UniCat KW - superposition KW - SU(2) KW - pseudo-remainder KW - interval methods KW - sparse polynomials KW - element order KW - Henneberg-type minimal surface KW - timelike axis KW - combinatorial decompositions KW - sparse data structures KW - mutually unbiased bases KW - invariant surfaces KW - projective special unitary group KW - Minkowski 4-space KW - free resolutions KW - Dini-type helicoidal hypersurface KW - linearity KW - integrability KW - Galois rings KW - minimum point KW - entanglement KW - degree KW - pseudo-division KW - computational algebra KW - polynomial arithmetic KW - projective special linear group KW - normal form KW - Galois fields KW - Gauss map KW - implicit equation KW - number of elements of the same order KW - Weierstrass representation KW - Lotka–Volterra system KW - isolated zeros KW - polynomial modules KW - over-determined polynomial system KW - simple Kn-group KW - sum of squares KW - four-dimensional space UR - https://www.unicat.be/uniCat?func=search&query=sysid:61122611 AB - Although scientific computing is very often associated with numeric computations, the use of computer algebra methods in scientific computing has obtained considerable attention in the last two decades. Computer algebra methods are especially suitable for parametric analysis of the key properties of systems arising in scientific computing. The expression-based computational answers generally provided by these methods are very appealing as they directly relate properties to parameters and speed up testing and tuning of mathematical models through all their possible behaviors. This book contains 8 original research articles dealing with a broad range of topics, ranging from algorithms, data structures, and implementation techniques for high-performance sparse multivariate polynomial arithmetic over the integers and rational numbers over methods for certifying the isolated zeros of polynomial systems to computer algebra problems in quantum computing. ER -