Reprint

Computer Algebra in Scientific Computing

Edited by
November 2019
160 pages
  • ISBN978-3-03921-730-4 (Paperback)
  • ISBN978-3-03921-731-1 (PDF)

This book is a reprint of the Special Issue Computer Algebra in Scientific Computing that was published in

Computer Science & Mathematics
Engineering
Physical Sciences
Public Health & Healthcare
Summary

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.

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