Sciweavers

6045 search results - page 35 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
PPOPP
2009
ACM
14 years 8 months ago
Solving dense linear systems on platforms with multiple hardware accelerators
In a previous paper we show how the FLAME methods and tools provide a solution to compute dense dense linear algebra operations on a multi-GPU platform with reasonable performance...
Enrique S. Quintana-Ortí, Francisco D. Igua...
COMPUTING
2010
13 years 5 months ago
Modified HSS iteration methods for a class of complex symmetric linear systems
In this paper, we introduce and analyze a modification of the Hermitian and skewHermitian splitting iteration method for solving a broad class of complex symmetric linear systems....
Zhong-Zhi Bai, Michele Benzi, Fang Chen
IPPS
2003
IEEE
14 years 1 months ago
Parallel Direct Solution of Linear Equations on FPGA-Based Machines
The efficient solution of large systems of linear equations represented by sparse matrices appears in many tasks. LU factorization followed by backward and forward substitutions i...
Xiaofang Wang, Sotirios G. Ziavras
ISSAC
2007
Springer
83views Mathematics» more  ISSAC 2007»
14 years 1 months ago
Parallel computation of the rank of large sparse matrices from algebraic K-theory
This paper deals with the computation of the rank and some integer Smith forms of a series of sparse matrices arising in algebraic K-theory. The number of non zero entries in the ...
Jean-Guillaume Dumas, Philippe Elbaz-Vincent, Pasc...
DCOSS
2005
Springer
14 years 1 months ago
Stably Computable Properties of Network Graphs
We consider a scenario in which anonymous, finite-state sensing devices are deployed in an ad-hoc communication network of arbitrary size and unknown topology, and explore what p...
Dana Angluin, James Aspnes, Melody Chan, Michael J...