9 search results - page 2 / 2 » Probabilistically Stable Numerical Sparse Polynomial Interpo... |
SIAMMAX
2011
12 years 9 months ago
2011
We investigate an acceleration technique for restarted Krylov subspace methods for computing the action of a function of a large sparse matrix on a vector. Its effect is to ultima...
FOCS
1992
IEEE
13 years 9 months ago
1992
IEEE
We consider a variant of the traditional task of explicitly reconstructing algebraic functions from black box representations. In the traditional setting for such problems, one is ...
BMVC
2001
13 years 8 months ago
2001
The ability to construct CAD or other object models from edge and range data has a fundamental meaning in building a recognition and positioning system. While the problem of model...
SIAMSC
2010
13 years 4 months ago
2010
A recursive acceleration method is proposed for multiplicative multilevel aggregation algorithms that calculate the stationary probability vector of large, sparse, and irreducible ...