Computer Algebra in Scientific Computing

• Format: eBook
• Language: English
• Published: MDPI - Multidisciplinary Digital Publishing Institute 2019
• Subjects: Computer science; combinatorial decompositions; computational algebra; degree; Dini-type helicoidal hypersurface; element order; entanglement; four-dimensional space; free resolutions; Galois fields; Galois rings; Gauss map; Henneberg-type minimal surface; implicit equation; integrability; interval methods; invariant surfaces; isolated zeros; linearity; Lotka-Volterra system; minimum point; Minkowski 4-space; mutually unbiased bases; normal form; number of elements of the same order; over-determined polynomial system; polynomial arithmetic; polynomial modules; projective special linear group; projective special unitary group; pseudo-division; pseudo-remainder; simple Kn-group; sparse data structures; sparse polynomials; SU(2); sum of squares; superposition; timelike axis; Weierstrass representation
• Online Access: Open Access: DOAB: description of the publication; Open Access: DOAB, download the publication
• Physical Description: 1 online resource (160 p.)
• ISBN: 9783039217304; 9783039217311; books978-3-03921-731-1
• Access: Open Access

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.