Computer Algebra in Scientific Computing

• Egile nagusia: Weber, Andreas (auth)
• Formatua: Baliabide elektronikoa Liburu kapitulua
• Hizkuntza: ingelesa
• Argitaratua: MDPI - Multidisciplinary Digital Publishing Institute 2019
• Gaiak: Computer science; 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
• Sarrera elektronikoa: DOAB: download the publication; DOAB: description of the publication

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...