1291 search results - page 3 / 259 » Computing the multiplicity structure in solving polynomial s... |
CIE
2006
Springer
13 years 11 months ago
2006
Springer
DAGSTUHL
2006
13 years 9 months ago
2006
Structured linear algebra techniques enable one to deal at once with various types of matrices, with features such as Toeplitz-, Hankel-, Vandermonde- or Cauchy-likeness. Following...
CORR
2008
Springer
13 years 7 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...
PODS
2006
ACM
14 years 7 months ago
2006
ACM
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
ISSAC
2005
Springer
14 years 1 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 ...