ISSAC 2007 - PDF Preprint Papers

ISSAC 2007 International Conference on Symbolic and Algebraic Computation

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ISSAC-2007 Paper

click to vote

ISSAC
2007
Springer

199views Mathematics» more ISSAC 2007»

A sparse modular GCD algorithm for polynomials over algebraic function fields

13 years 10 months ago

Download www.cecm.sfu.ca

We present a ﬁrst sparse modular algorithm for computing a greatest common divisor of two polynomials f1, f2 ∈ L[x] where L is an algebraic function ﬁeld in k ≥ 0 paramete...

Seyed Mohammad Mahdi Javadi, Michael B. Monagan

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	199	A sparse modular GCD algorithm for polynomials over algebraic function fields	claim
2	177	Component-level parallelization of triangular decompositions	claim
3	163	POSIX threads polynomials(PTPol): a scalable implementation of univariate arithmetic operations	claim
4	162	Multiprocessed parallelism support in ALDOR on SMPs and multicores	claim
5	161	Loewy decomposition of linear differential equations	claim
6	153	On exact and approximate interpolation of sparse rational functions	claim
7	149	Computing numerically with functions instead of numbers	claim
8	147	Differential equations for algebraic functions	claim
9	146	Fast and exact geometric analysis of real algebraic plane curves	claim
10	142	Fast arithmetic for triangular sets: from theory to practice	claim
11	132	Structured matrix methods for polynomial root-finding	claim
12	132	Adaptive loops with kaapi on multicore and grid: applications in symmetric cryptography	claim
13	131	Some recent progress in exact linear algebra and related questions	claim
14	130	On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms	claim
15	128	Productivity and performance using partitioned global address space languages	claim
16	121	A comparative analysis of parallel disk-based Methods for enumerating implicit graphs	claim
17	112	G-graphs for the cage problem: a new upper bound	claim
18	112	Differential forms in computational algebraic geometry	claim
19	111	Numerical optimization in hybrid symbolic-numeric computation	claim
20	111	On the complexity of real solving bivariate systems	claim
21	108	Minimum converging precision of the QR-factorization algorithm for real polynomial GCD	claim
22	107	A recipe for symbolic geometric computing: long geometric product, BREEFS and Clifford factorization	claim
23	107	Approximate GCDs of polynomials and SOS relaxation	claim
24	107	A disk-based parallel implementation for direct condensation of large permutation modules	claim
25	106	Counting reducible and singular bivariate polynomials	claim
26	106	Numerical techniques for computing the inertia of products of matrices of rational numbers	claim
27	105	Certification of the QR factor R and of lattice basis reducedness	claim
28	105	Companion matrix pencils for hermite interpolants	claim
29	105	Symbolic summation with radical expressions	claim
30	103	The nearest polynomial of lower degree	claim
31	100	Towards a high-level implementation of flexible parallelism primitives for symbolic languages	claim
32	99	Computing monodromy via parallel homotopy continuation	claim
33	99	Faster inversion and other black box matrix computations using efficient block projections	claim
34	97	Symbolic-numeric computation of implicit riquier bases for PDE	claim
35	95	Multithreaded programming in Cilk	claim
36	94	Faster algorithms for the characteristic polynomial	claim
37	94	A straightening law for the Drinfel'd Lagrangian Grassmannian	claim
38	94	Solving toeplitz- and vandermonde-like linear systems with large displacement rank	claim
39	93	Approximate bivariate factorization: a geometric viewpoint	claim
40	91	Generation and optimisation of code using coxeter lattice paths	claim
41	90	Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using Abelian lifts	claim
42	89	Solving third order linear differential equations in terms of second order equations	claim
43	88	Polynomial-time algorithm for Hilbert series of Borel type ideals	claim
44	83	Parallel computation of the rank of large sparse matrices from algebraic K-theory	claim
45	82	The solution of s exp(s) = a is not always the lambert w function of a	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers