793 search results - page 2 / 159 » Efficient computation of the characteristic polynomial |
139
click to vote
ISSAC
2007
Springer
16 years 4 days ago
2007
Springer
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
215
click to vote
TCS
2011
15 years 28 days 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...
153
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
—Modern Personal Digital Assistant (PDA) architectures often utilize a wholesale data transfer protocol known as “slow sync” for synchronizing PDAs with Personal Computers (P...
150
click to vote
FOCS
2008
IEEE
16 years 13 days ago
2008
IEEE
We give an algorithm for modular composition of degree n univariate polynomials over a finite field Fq requiring n1+o(1) log1+o(1) q bit operations; this had earlier been achiev...
167
click to vote
ISSAC
2009
Springer
16 years 16 days ago
2009
Springer
We address complexity issues for linear differential equations in characteristic p > 0: resolution and computation of the p-curvature. For these tasks, our main focus is on al...