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...
שמור ב:
| מחבר ראשי: | |
|---|---|
| פורמט: | Online |
| שפה: | אנגלית |
| יצא לאור: |
MDPI - Multidisciplinary Digital Publishing Institute
2021
|
| נושאים: | |
| גישה מקוונת: | 42622 |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|
| _version_ | 1869518474165878784 |
|---|---|
| author | Weber, Andreas |
| author_browse | Weber, Andreas |
| author_facet | Weber, Andreas |
| author_sort | Weber, Andreas |
| collection | Directory of Open Access Books |
| description | 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 | Online |
| id | doab-20.500.12854ir-43712 |
| institution | Directory of Open Access Books |
| language | eng |
| publishDate | 2021 |
| publishDateRange | 2021 |
| publishDateSort | 2021 |
| publisher | MDPI - Multidisciplinary Digital Publishing Institute |
| publisherStr | MDPI - Multidisciplinary Digital Publishing Institute |
| record_format | ojs |
| spelling | doab-20.500.12854ir-437122024-04-14T10:28:03Z Computer Algebra in Scientific Computing Weber, Andreas QA75.5-76.95 T58.5-58.64 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 thema EDItEUR::U Computing and Information Technology::UY Computer science 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. 2021-02-11T10:19:22Z 2021-02-11T10:19:22Z 2019-12-09 11:49:16 2019 book 42622 9783039217311 9783039217304 https://directory.doabooks.org/handle/20.500.12854/43712 eng application/octet-stream Attribution-NonCommercial-NoDerivatives 4.0 International https://mdpi.com/books/pdfview/book/1768 MDPI - Multidisciplinary Digital Publishing Institute 10.3390/books978-3-03921-731-1 10.3390/books978-3-03921-731-1 46cabcaa-dd94-4bfe-87b4-55023c1b36d0 9783039217311 9783039217304 160 open access |
| spellingShingle | QA75.5-76.95 T58.5-58.64 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 thema EDItEUR::U Computing and Information Technology::UY Computer science Weber, Andreas Computer Algebra in Scientific Computing |
| title | Computer Algebra in Scientific Computing |
| title_full | Computer Algebra in Scientific Computing |
| title_fullStr | Computer Algebra in Scientific Computing |
| title_full_unstemmed | Computer Algebra in Scientific Computing |
| title_short | Computer Algebra in Scientific Computing |
| title_sort | computer algebra in scientific computing |
| topic | QA75.5-76.95 T58.5-58.64 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 thema EDItEUR::U Computing and Information Technology::UY Computer science |
| topic_facet | QA75.5-76.95 T58.5-58.64 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 thema EDItEUR::U Computing and Information Technology::UY Computer science |
| url | 42622 |
| work_keys_str_mv | AT weberandreas computeralgebrainscientificcomputing |