Sciweavers

1056 search results - page 36 / 212
» Handbook of mathematical functions
Sort
View
ISSAC
2004
Springer
94views Mathematics» more  ISSAC 2004»
14 years 2 months ago
Algorithms for polynomial GCD computation over algebraic function fields
Let L be an algebraic function field in k ≥ 0 parameters t1, . . . , tk. Let f1, f2 be non-zero polynomials in L[x]. We give two algorithms for computing their gcd. The first,...
Mark van Hoeij, Michael B. Monagan
FPL
2006
Springer
223views Hardware» more  FPL 2006»
14 years 10 days ago
From Equation to VHDL: Using Rewriting Logic for Automated Function Generation
This paper presents a novel tool flow combining rewriting logic with hardware synthesis. It enables the automated generation of synthesizable VHDL code from mathematical equations...
Carlos Morra, M. Sackmann, Sunil Shukla, Jürg...
FUIN
1998
135views more  FUIN 1998»
13 years 8 months ago
A Study on Partitioned Iterative Function Systems for Image Compression
The technique of image compression using Iterative Function System (IFS) is known as fractal image compression. An extension of IFS theory is called as Partitioned or local Iterati...
Suman K. Mitra, C. A. Murthy, Malay Kumar Kundu
MICS
2007
88views more  MICS 2007»
13 years 8 months ago
Inversion of Analytic Functions via Canonical Polynomials: A Matrix Approach
An alternative to Lagrange inversion for solving analytic systems is our technique of dual vector fields. We implement this approach using matrix multiplication that provides a f...
Philip Feinsilver, René Schott
ISSAC
2007
Springer
199views Mathematics» more  ISSAC 2007»
14 years 2 months ago
A sparse modular GCD algorithm for polynomials over algebraic function fields
We present a first sparse modular algorithm for computing a greatest common divisor of two polynomials f1, f2 ∈ L[x] where L is an algebraic function field in k ≥ 0 paramete...
Seyed Mohammad Mahdi Javadi, Michael B. Monagan