## Abstract Recent advances in Computer Algebra have made it possible the study of algebraic analysis in an explicit and computational way. In this paper we show how these ideas have allowed the solution of a new class of problems in Clifford analysis and we describe the computational techniques th
✦ LIBER ✦
Reductions in Computational Complexity Using Clifford Algebras
✍ Scribed by René Schott; G. Stacey Staples
- Publisher
- Springer
- Year
- 2008
- Tongue
- English
- Weight
- 259 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0188-7009
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Computational algebraic analysis methods
✍
Irene Sabadini; Daniele C. Struppa
📂
Article
📅
2002
🏛
John Wiley and Sons
🌐
English
⚖ 131 KB
Complexes of Dirac operators in Clifford
✍
Irene Sabadini; Daniele C. Struppa; Frank Sommen; Peter Van Lancker
📂
Article
📅
2002
🏛
Springer-Verlag
🌐
French
⚖ 229 KB
Hartogs Extension Theorem for Functions
✍
Ricardo Abreu Blaya; Juan Bory Reyes
📂
Article
📅
2008
🏛
Springer
🌐
English
⚖ 134 KB
Computation of Non-Commutative Gröbner B
✍
Rafał Abłamowicz
📂
Article
📅
2010
🏛
Springer
🌐
English
⚖ 350 KB
Computing in the Field of Complex Algebr
✍
ADAM WOJCIECH STRZEBOŃSKI
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 371 KB
In this paper we present two methods of computing with complex algebraic numbers. The first uses isolating rectangles to distinguish between the roots of the minimal polynomial, the second method uses validated numeric approximations. We present algorithms for arithmetic and for solving polynomial e
Using the Magma Computer Algebra System
✍
JOHN CANNON; CATHERINE PLAYOUST
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 592 KB