Sciweavers

95 search results - page 7 / 19
» Fast linear algebra is stable
Sort
View
ASPDAC
2008
ACM
126views Hardware» more  ASPDAC 2008»
13 years 9 months ago
DPlace2.0: A stable and efficient analytical placement based on diffusion
Nowadays a placement problem often involves multi-million objects and excessive fixed blockages. We present a new global placement algorithm that scales well to the modern large-s...
Tao Luo, David Z. Pan
DAGSTUHL
2006
13 years 8 months ago
Using fast matrix multiplication to solve structured linear systems
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...
Éric Schost, Alin Bostan, Claude-Pierre Jea...
IPPS
2003
IEEE
14 years 21 days ago
Natural Block Data Decomposition for Heterogeneous Clusters
We propose general purposes natural heuristics for static block and block-cyclic heterogeneous data decomposition over processes of parallel program mapped into multidimensional g...
Egor Dovolnov, Alexey Kalinov, Sergey Klimov
SIAMSC
2008
111views more  SIAMSC 2008»
13 years 7 months ago
An Algebraic Multigrid Approach Based on a Compatible Gauge Reformulation of Maxwell's Equations
With the rise in popularity of compatible finite element, finite difference and finite volume discretizations for the time domain eddy current equations, there has been a correspon...
Pavel B. Bochev, Jonathan J. Hu, Christopher M. Si...
FOCS
2002
IEEE
14 years 11 days ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich