Abstract | Keywords | Export | Availability | Bookmark

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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.

superposition --- SU(2) --- pseudo-remainder --- interval methods --- sparse polynomials --- element order --- Henneberg-type minimal surface --- timelike axis --- combinatorial decompositions --- sparse data structures --- mutually unbiased bases --- invariant surfaces --- projective special unitary group --- Minkowski 4-space --- free resolutions --- Dini-type helicoidal hypersurface --- linearity --- integrability --- Galois rings --- minimum point --- entanglement --- degree --- pseudo-division --- computational algebra --- polynomial arithmetic --- projective special linear group --- normal form --- Galois fields --- Gauss map --- implicit equation --- number of elements of the same order --- Weierstrass representation --- Lotka–Volterra system --- isolated zeros --- polynomial modules --- over-determined polynomial system --- simple Kn-group --- sum of squares --- four-dimensional space