Sciweavers

573 search results - page 15 / 115
» On Wiedemann's Method of Solving Sparse Linear Systems
Sort
View
NAA
2004
Springer
117views Mathematics» more  NAA 2004»
14 years 2 months ago
Parallel Performance of a 3D Elliptic Solver
It was recently shown that block-circulant preconditioners applied to a conjugate gradient method used to solve structured sparse linear systems arising from 2D or 3D elliptic prob...
Ivan Lirkov
ICASSP
2011
IEEE
13 years 21 days ago
Image editing based on Sparse Matrix-Vector multiplication
This paper presents a unified model for image editing in terms of Sparse Matrix-Vector (SpMV) multiplication. In our framework, we cast image editing as a linear energy minimizat...
Ying Wang, Hongping Yan, Chunhong Pan, Shiming Xia...
CORR
2004
Springer
121views Education» more  CORR 2004»
13 years 8 months ago
Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners
We consider linear systems arising from the use of the finite element method for solving a certain class of linear elliptic problems. Our main result is that these linear systems, ...
Erik G. Boman, Bruce Hendrickson, Stephen A. Vavas...
COMPUTING
2007
103views more  COMPUTING 2007»
13 years 9 months ago
An algebraic approach for H-matrix preconditioners
Hierarchical matrices (H-matrices) approximate matrices in a data-sparse way, and the approximate arithmetic for H-matrices is almost optimal. In this paper we present an algebrai...
S. Oliveira, F. Yang
JSC
2010
155views more  JSC 2010»
13 years 7 months ago
Algorithms for solving linear systems over cyclotomic fields
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
Liang Chen, Michael B. Monagan