Sciweavers

8298 search results - page 122 / 1660
» On the Complexity of Numerical Analysis
Sort
View
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
15 years 11 months ago
Computing the rank and a small nullspace basis of a polynomial matrix
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
Arne Storjohann, Gilles Villard
COMPGEOM
2004
ACM
15 years 11 months ago
Inner and outer rounding of set operations on lattice polygonal regions
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
Olivier Devillers, Philippe Guigue
CSUR
2004
91views more  CSUR 2004»
15 years 6 months ago
Line drawing, leap years, and Euclid
Bresenham's algorithm minimizes error in drawing lines on integer grid points; leap year calculations, surprisingly, are a generalization. We compare the two calculations, exp...
Mitchell A. Harris, Edward M. Reingold
FUIN
2010
136views more  FUIN 2010»
15 years 3 months ago
Modeling Biology using Generic Reactive Animation
Abstract. Complex biological systems involve incorporated behaviors of numerous processes, mechanisms and objects. However, experimental analysis, by its nature, divides biological...
Yaki Setty, Irun R. Cohen, David Harel
SIAMSC
2008
126views more  SIAMSC 2008»
15 years 6 months ago
Towards a Statistical Theory of Texture Evolution in Polycrystals
Abstract. Most technologically useful materials possess polycrystalline microstructures composed of a large number of small monocrystalline grains separated by grain boundaries. Th...
K. Barmak, M. Emelianenko, Dmitry Golovaty, David ...