Computer Algebra in Scientific Computing

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

Full description

Saved in:
Bibliographic Details
:
Year of Publication:2019
Language:English
Physical Description:1 electronic resource (160 p.)
Tags: Add Tag
No Tags, Be the first to tag this record!
LEADER 03144nam-a2200733z--4500
001 993547991604498
005 20231214133326.0
006 m o d
007 cr|mn|---annan
008 202102s2019 xx |||||o ||| 0|eng d
020 |a 3-03921-731-3 
035 |a (CKB)4100000010106237 
035 |a (oapen)https://directory.doabooks.org/handle/20.500.12854/43712 
035 |a (EXLCZ)994100000010106237 
041 0 |a eng 
100 1 |a Weber, Andreas  |4 auth 
245 1 0 |a Computer Algebra in Scientific Computing 
260 |b MDPI - Multidisciplinary Digital Publishing Institute  |c 2019 
300 |a 1 electronic resource (160 p.) 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
520 |a 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. 
546 |a English 
653 |a superposition 
653 |a SU(2) 
653 |a pseudo-remainder 
653 |a interval methods 
653 |a sparse polynomials 
653 |a element order 
653 |a Henneberg-type minimal surface 
653 |a timelike axis 
653 |a combinatorial decompositions 
653 |a sparse data structures 
653 |a mutually unbiased bases 
653 |a invariant surfaces 
653 |a projective special unitary group 
653 |a Minkowski 4-space 
653 |a free resolutions 
653 |a Dini-type helicoidal hypersurface 
653 |a linearity 
653 |a integrability 
653 |a Galois rings 
653 |a minimum point 
653 |a entanglement 
653 |a degree 
653 |a pseudo-division 
653 |a computational algebra 
653 |a polynomial arithmetic 
653 |a projective special linear group 
653 |a normal form 
653 |a Galois fields 
653 |a Gauss map 
653 |a implicit equation 
653 |a number of elements of the same order 
653 |a Weierstrass representation 
653 |a Lotka–Volterra system 
653 |a isolated zeros 
653 |a polynomial modules 
653 |a over-determined polynomial system 
653 |a simple Kn-group 
653 |a sum of squares 
653 |a four-dimensional space 
776 |z 3-03921-730-5 
906 |a BOOK 
ADM |b 2023-12-15 05:50:19 Europe/Vienna  |f system  |c marc21  |a 2020-02-01 22:26:53 Europe/Vienna  |g false 
AVE |i DOAB Directory of Open Access Books  |P DOAB Directory of Open Access Books  |x https://eu02.alma.exlibrisgroup.com/view/uresolver/43ACC_OEAW/openurl?u.ignore_date_coverage=true&portfolio_pid=5338680040004498&Force_direct=true  |Z 5338680040004498  |b Available  |8 5338680040004498