A direct algorithm to construct the minimal \(Z\)-pairs for rational functions. (Q1398291)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A direct algorithm to construct the minimal \(Z\)-pairs for rational functions. |
scientific article; zbMATH DE number 1956063
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A direct algorithm to construct the minimal \(Z\)-pairs for rational functions. |
scientific article; zbMATH DE number 1956063 |
Statements
A direct algorithm to construct the minimal \(Z\)-pairs for rational functions. (English)
0 references
29 July 2003
0 references
The author presents a direct algorithm to construct the minimal \(Z\)-pairs for rational functions. A Maple implementation of the algorithm is described and timing comparisons between this algorithm and other related algorithms are shown.
0 references
\(Z\)-pairs
0 references
rational functions
0 references
algorithms
0 references
Maple implementation
0 references
timing comparisons
0 references
0 references
0 references
0.87802845
0 references
0.87662137
0 references
0.8537982
0 references
0.8535148
0 references
0.85005385
0 references
0.8466586
0 references
0.84283483
0 references
0 references
