𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Algebraic Approach to Computing Adjoint Curves

✍ Scribed by MICHAL MŇUK

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
545 KB
Volume
23
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis

This paper describes an algebraic approach to computing the system of adjoint curves to a given absolutely irreducible plane algebraic curve. The proposed algorithm utilizes the integral closure of the coordinate ring rather than expanding neighborhood graphs using quadratic transformations.

📜 SIMILAR VOLUMES

An Algebraic Computational Approach to t
An Algebraic Computational Approach to the Identifiability of Fourier Models
✍ M. Caboara; E. Riccomagno 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 506 KB

Computer algebra and in particular Gröbner bases are powerful tools in experimental design (Pistone and Wynn, 1996, Biometrika 83, 653-666). This paper applies this algebraic methodology to the identifiability of Fourier models. The choice of the class of trigonometric models forces one to deal with

An approach to growth curve analysis
An approach to growth curve analysis
✍ G.F. Byrne 📂 Article 📅 1973 🏛 Elsevier Science ⚖ 328 KB

Byrne, G. F., 1973 . An approach to growth curve analysis. Agric. Meteorol., A mathematical expression for the growth rate of a pasture is derived from simple assumptions relating transpiration and respiration to the current total dry weight. It is shown that numerical integration of the expression

A Direct Approach to Computing theμ-basi
A Direct Approach to Computing theμ-basis of Planar Rational Curves
✍ Jianmin Zheng; Thomas W. Sederberg 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 265 KB

This paper presents an O(n 2 ) algorithm, based on Gröbner basis techniques, to compute the µ-basis of a degree n planar rational curve. The prior method involved solving a set of linear equations whose complexity by standard numerical methods was O(n 3 ). The µ-basis is useful in computing the impl

A Computer Algebra Approach to the Discr
A Computer Algebra Approach to the Discrete Dirichlet Problem
✍ Craig R. Orr; Doron Zeilberger 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 100 KB

The Gröbner Basis Algorithm is used to find closed form expressions for the generating functions of finite difference equations. Such difference equations arise in elliptic PDE's, random walk problems, and gambler's ruin problems.