364 search results - page 1 / 73 » Generalized normal forms and polynomial system solving |
70
Voted
ISSAC
2005
Springer
15 years 3 months ago
2005
Springer
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
This paper describes and analyzes a method for computing border bases of a zero-dimensional ideal I. The criterion used in the computation involves specific commutation polynomial...
108
click to vote
TCS
2011
14 years 4 months ago
2011
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
JSC
2006
14 years 9 months ago
2006
AAECC
2010
Springer
14 years 9 months ago
2010
Springer