573 search results - page 33 / 115 » On Wiedemann's Method of Solving Sparse Linear Systems |
ICCSA
2003
Springer
14 years 2 months ago
2003
Springer
The solution of large-scale, nonlinear PDE-based simulations typically depends on the performance of sparse linear solvers, which may be invoked at each nonlinear iteration. We pre...
ICASSP
2010
IEEE
13 years 9 months ago
2010
IEEE
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
SAT
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. SAT Modulo Theories (SMT) consists of deciding the satisfiability of a formula with respect to a decidable background theory, such as linear integer arithmetic, bit-vect...
SIAMSC
2011
13 years 4 months ago
2011
The classical inexact Newton algorithm is an efficient and popular technique for solving large sparse nonlinear system of equations. When the nonlinearities in the system are wellb...
STACS
1997
Springer
14 years 1 months ago
1997
Springer
Exotic semirings such as the “(max, +) semiring” (R ∪ {−∞}, max, +), or the “tropical semiring” (N ∪ {+∞}, min, +), have been invented and reinvented many times s...