27 search results - page 2 / 6 » Parallel Cholesky Factorization of a Block Tridiagonal Matri... |
PARA
2004
Springer
13 years 10 months ago
2004
Springer
The sparse Cholesky factorization of some large matrices can require a two dimensional partitioning of the matrix. The sparse hypermatrix storage scheme produces a recursive 2D par...
MOC
2000
13 years 4 months ago
2000
Recently Laurie presented a new algorithm for the computation of (2n+1)-point Gauss-Kronrod quadrature rules with real nodes and positive weights. This algorithm first determines a...
SIAMMAX
2010
12 years 11 months ago
2010
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
PPAM
2007
Springer
13 years 11 months ago
2007
Springer
Dense linear algebra codes are often expressed and coded in terms of BLAS calls. This approach, however, achieves suboptimal performance due to the overheads associated to such cal...
PPOPP
1991
ACM
13 years 8 months ago
1991
ACM
This paper presents Jade, a language which allows a programmer to easily express dynamic coarse-grain parallelism. Starting with a sequential program, a programmer augments those ...