73 search results - page 1 / 15 » Solving Linear Systems through Nested Dissection |
FOCS
2010
IEEE
14 years 2 months ago
2010
IEEE
Abstract--The generalized nested dissection method, developed by Lipton, Rose, and Tarjan, is a seminal method for solving a linear system Ax = b where A is a symmetric positive de...
COMPUTING
2007
14 years 4 months ago
2007
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...
112
click to vote
PC
2011
13 years 11 months ago
2011
We investigate the efficient iterative solution of large-scale sparse linear systems on shared-memory multiprocessors. Our parallel approach is based on a multilevel ILU precondit...
SC
1994
ACM
14 years 8 months ago
1994
ACM
In recent years, interior point algorithms have been used successfully for solving mediumto large-size linear programming LP problems. In this paper we describe a highly parallel ...
NAACL
2010
14 years 2 months ago
2010
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...