Sciweavers

15 search results - page 3 / 3
» Ordering Unstructured Meshes for Sparse Matrix Computations ...
Sort
View
EUROPAR
2011
Springer
12 years 4 months ago
A Bit-Compatible Parallelization for ILU(k) Preconditioning
Abstract. ILU(k) is a commonly used preconditioner for iterative linear solvers for sparse, non-symmetric systems. It is often preferred for the sake of its stability. We present T...
Xin Dong 0004, Gene Cooperman
ICASSP
2011
IEEE
12 years 8 months ago
Fast orthogonal decomposition of Volterra cubic kernels using oblique unfolding
Discrete-time Volterra modeling is a central topic in many application areas and a large class of nonlinear systems can be modeled using high-order Volterra series. The problem wi...
Rémy Boyer, Roland Badeau, Gérard Fa...
NIPS
2004
13 years 6 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
IPPS
2007
IEEE
13 years 11 months ago
Load Miss Prediction - Exploiting Power Performance Trade-offs
— Modern CPUs operate at GHz frequencies, but the latencies of memory accesses are still relatively large, in the order of hundreds of cycles. Deeper cache hierarchies with large...
Konrad Malkowski, Greg M. Link, Padma Raghavan, Ma...
CORR
2010
Springer
179views Education» more  CORR 2010»
13 years 2 months ago
The DMM bound: multivariate (aggregate) separation bounds
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsig...