Sciweavers

103 search results - page 7 / 21
» Algorithms for solving linear systems over cyclotomic fields
Sort
View
FCCM
2006
IEEE
195views VLSI» more  FCCM 2006»
15 years 3 months ago
A Parallel Hardware Architecture for fast Gaussian Elimination over GF(2)
This paper presents a hardware-optimized variant of the well-known Gaussian elimination over GF(2) and its highly efficient implementation. The proposed hardware architecture, we...
Andrey Bogdanov, M. C. Mertens
CGF
2010
99views more  CGF 2010»
14 years 9 months ago
Trivial Connections on Discrete Surfaces
This paper presents a straightforward algorithm for constructing connections on discrete surfaces that are as smooth as possible everywhere but on a set of isolated singularities ...
Keenan Crane, Mathieu Desbrun, Peter Schröder
ISSAC
1997
Springer
105views Mathematics» more  ISSAC 1997»
15 years 1 months ago
On Randomized Lanczos Algorithms
Las Vegas algorithms that are based on Lanczos’s method for solving symmetric linear systems are presented and analyzed. These are compared to a similar randomized Lanczos algor...
Wayne Eberly, Erich Kaltofen
ICDCN
2010
Springer
15 years 4 months ago
Parallelization of the Lanczos Algorithm on Multi-core Platforms
In this paper, we report our parallel implementations of the Lanczos sparse linear system solving algorithm over large prime fields, on a multi-core platform. We employ several lo...
Souvik Bhattacherjee, Abhijit Das
ICTIR
2009
Springer
15 years 4 months ago
PageRank: Splitting Homogeneous Singular Linear Systems of Index One
Abstract. The PageRank algorithm is used today within web information retrieval to provide a content-neutral ranking metric over web pages. It employs power method iterations to so...
Douglas V. de Jager, Jeremy T. Bradley