Sciweavers

2239 search results - page 29 / 448
» Computing with abstract matrix structures
Sort
View
COMPGEOM
2011
ACM
14 years 3 months ago
Zigzag persistent homology in matrix multiplication time
We present a new algorithm for computing zigzag persistent homology, an algebraic structure which encodes changes to homology groups of a simplicial complex over a sequence of sim...
Nikola Milosavljevic, Dmitriy Morozov, Primoz Skra...
IPPS
2003
IEEE
15 years 5 months ago
An Implicitly Parallel Object-Oriented Matrix Library and its Application to Medical Physics
We introduce VLADYMIR, a matrix library that permits the development of array-based code in C++. It is especially useful for numerical simulation tasks and parallelises automatical...
Jonas Lätt, Bastien Chopard
ICCSA
2003
Springer
15 years 4 months ago
Coarse-Grained Parallel Matrix-Free Solution of a Three-Dimensional Elliptic Prototype Problem
The finite difference discretization of the Poisson equation in three dimensions results in a large, sparse, and highly structured system of linear equations. This prototype prob...
Kevin P. Allen, Matthias K. Gobbert
CDC
2009
IEEE
285views Control Systems» more  CDC 2009»
14 years 9 months ago
Adaptive randomized algorithm for finding eigenvector of stochastic matrix with application to PageRank
Abstract-- The problem of finding the eigenvector corresponding to the largest eigenvalue of a stochastic matrix has numerous applications in ranking search results, multi-agent co...
Alexander V. Nazin, Boris T. Polyak
FPGA
2005
ACM
195views FPGA» more  FPGA 2005»
15 years 5 months ago
Sparse Matrix-Vector multiplication on FPGAs
Floating-point Sparse Matrix-Vector Multiplication (SpMXV) is a key computational kernel in scientific and engineering applications. The poor data locality of sparse matrices sig...
Ling Zhuo, Viktor K. Prasanna