𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Algorithm to Compute the Kernel of a Derivation up to a Certain Degree

✍ Scribed by Stefan Maubach

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
303 KB
Volume
29
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Algorithm To Compute The Invariant Ri
An Algorithm To Compute The Invariant Ring Of A Ga-action On An Affine Variety
✍ Arno van den Essen πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 159 KB

We describe an algorithm which computes the invariants of all \(G_{a}\)-actions on affine varieties, in case the invariant ring is finitely generated. The algorithm is based on a study of the kernel of a locally nilpotent derivation and some algoritlums from the theory of GrΓΆbner bases.

A BSP Recursive Divide and Conquer Algor
A BSP Recursive Divide and Conquer Algorithm to Compute the Inverse of a Tridiagonal Matrix
✍ Joan-Josep Climent; Leandro Tortosa; Antonio Zamora πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 253 KB

In this paper we discuss a recursive divide and conquer algorithm to compute the inverse of an unreduced tridiagonal matrix. It is based on the recursive application of the Sherman Morrison formula to a diagonally dominant tridiagonal matrix to avoid numerical stability problems. A theoretical study