573 search results - page 21 / 115 » On Wiedemann's Method of Solving Sparse Linear Systems |
IPPS
2006
IEEE
14 years 3 months ago
2006
IEEE
A new class of parallel normalized preconditioned conjugate gradient type methods in conjunction with normalized approximate inverses algorithms, based on normalized approximate f...
SIAMSC
2008
13 years 9 months ago
2008
Abstract. In this paper, we empirically investigate the NP-hard problem of finding sparsest solutions to linear equation systems, i.e., solutions with as few nonzeros as possible. ...
ICASSP
2011
IEEE
13 years 14 days ago
2011
IEEE
Solving linear regression problems based on the total least-squares (TLS) criterion has well-documented merits in various applications, where perturbations appear both in the data...
COMPUTING
2010
13 years 6 months ago
2010
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....
SAGA
2001
Springer
14 years 1 months ago
2001
Springer
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...