16 search results - page 3 / 4 » Updating an LU Factorization with Pivoting |
SIAMNUM
2010
14 years 6 months ago
2010
We discuss and compare two greedy algorithms, that compute discrete versions of Fekete-like points for multivariate compact sets by basic tools of numerical linear algebra. The fi...
PPAM
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We present an out-of-core sparse direct solver for unsymmetric linear systems. The solver factors the coefficient matrix A into A = PLU using Gaussian elimination with pa...
112
click to vote
MP
2008
14 years 11 months ago
2008
The simplex algorithm computes the simplex multipliers by solving a system (or two triangular systems) at each iteration. This note offers an efficient approach to updating the sim...
100
click to vote
PDPTA
2008
15 years 1 months ago
2008
Solving linear systems with a large number of variables is at the core of many scienti c problems. Parallel processing techniques for solving such systems have received much attent...
107
click to vote
LCPC
1998
Springer
15 years 3 months ago
1998
Springer
There is a class of sparse matrix computations, such as direct solvers of systems of linear equations, that change the fill-in (nonzero entries) of the coefficient matrix, and invo...