Sciweavers

541 search results - page 4 / 109
» Factoring Solution Sets of Polynomial Systems in Parallel
Sort
View
ADG
1998
Springer
127views Mathematics» more  ADG 1998»
13 years 11 months ago
Decomposing Algebraic Varieties
Abstract. This paper describes a complete implementation of Ritt-Wu's characteristic sets method in the Maple system. The implemented algorithms include those with variants fo...
Dongming Wang
HPCN
2000
Springer
13 years 11 months ago
ParIC: A Family of Parallel Incomplete Cholesky Preconditioners
A class of parallel incomplete factorization preconditionings for the solution of large linear systems is investigated. The approach may be regarded as a generalized domain decompo...
Mardochée Magolu monga Made, Henk A. van de...
ALGORITHMICA
1999
123views more  ALGORITHMICA 1999»
13 years 7 months ago
Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields
We describe a coarse-grain parallel software system for the homogeneous solution of linear systems. Our solutions are symbolic, i.e., exact rather than numerical approximations. O...
Erich Kaltofen, A. Lobo
MOC
2011
13 years 2 months ago
Regeneration homotopies for solving systems of polynomials
We present a new technique, based on polynomial continuation, for solving systems of n polynomials in N complex variables. The method allows equations to be introduced one-by-one o...
Jonathan D. Hauenstein, Andrew J. Sommese, Charles...
CAP
2010
13 years 2 months ago
Parallel sparse polynomial division using heaps
We present a parallel algorithm for exact division of sparse distributed polynomials on a multicore processor. This is a problem with significant data dependencies, so our solutio...
Michael B. Monagan, Roman Pearce