𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generating numerical algorithms using a computer algebra system

✍ Scribed by Walter Gander

Publisher
Springer Netherlands
Year
2006
Tongue
English
Weight
435 KB
Volume
46
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Surprising Mathematics Using a Computer
Surprising Mathematics Using a Computer Algebra System
✍ FranΓ§ois Bergeron πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 140 KB

In the course of studying some idempotents of the group algebra of the syrnmetric group, we obtained new unexpected results because of our use of a computer algebra system. This was a direct result of being forced to compute in the ring of polynomials modulo the cyclotomic polynomial, after failing

A Computer Algebra System based on Order
A Computer Algebra System based on Order-sorted Algebra
✍ Anthony C. Hearn; Eberhard SchrΓΌfer πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 447 KB

This paper presents the prototype design of an algebraic computation system that manipulates algebraic quantities as generic objects using order-sorted algebra as the underlying model. The resulting programs have a form that is closely related to the algorithmic description of a problem, but with th

A Generalized Euclidean Algorithm for Co
A Generalized Euclidean Algorithm for Computing Triangular Representations of Algebraic Varieties
✍ Michael Kalkbrener πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 628 KB

We present an algorithm that computes an unmixed-dimensional decomposition of an arbitrary algebraic variety \(V\). Each \(V_{i}\) in the decomposition \(V=V_{1} \cup \ldots \cup V_{m}\) is given by a finite set of polynomials which represents the generic points of the irreducible components of \(V_