Preconditioning of wavelet BEM by the incomplete Cholesky factorization [PDF]
The present paper is dedicated to the preconditioning of boundary element matrices which are given in wavelet coordinates. We investigate the incomplete Cholesky factorization (ICF) for a pattern which includes also the coefficients of all off-diagonal ...
Harbrecht, Helmut
core
spam: A Sparse Matrix R Package with Emphasis on MCMC Methods for Gaussian Markov Random Fields [PDF]
spam is an R package for sparse matrix algebra with emphasis on a Cholesky factorization of sparse positive definite matrices. The implemantation of spam is based on the competing philosophical maxims to be competitively fast compared to existing tools ...
Reinhard Furrer, Stephan R. Sain
core
Incomplete Cholesky Factorization with Sparsity Pattern Modification
This paper proposes, analyzes, and numerically tests methods to assure the existence of incomplete Cholesky (IC) factorization preconditioners, based solely on the target sparsity pattern for the triangular factor R.
Xiaoge Wang +2 more
core
A Necessary And Sufficient Symbolic Condition For The Existence Of Incomplete Cholesky Factorization
. This paper presents a sufficient condition on sparsity patterns for the existence of the incomplete Cholesky factorization. Given the sparsity pattern P(A) of a matrix A, and a target sparsity pattern P satisfying the condition, incomplete Cholesky ...
Xiaoge Wang +2 more
core
CIMGS: An Incomplete Orthogonal Factorization
A new preconditioner (called CIMGS) based on an incomplete orthogonal factorization is derived, analyzed, and tested. Although designed for preconditioning least squares problems, it is also applicable to more general symmetric positive definite matrices.
Xiaoge Wang +2 more
core
Fast DOA Estimation Algorithms via Positive Incremental Modified Cholesky Decomposition for Augmented Coprime Array Sensors. [PDF]
Song J, Cao L, Zhao Z, Wang D, Fu C.
europepmc +1 more source
GPU Accelerated Sparse Cholesky Factorization [PDF]
The solution of sparse symmetric positive definite linear systems is an important computational kernel in large-scale scientific and engineering modeling and simulation.
Peyton, Barry W +2 more
core +1 more source
Cimgs: An Incomplete Orthogonal Factorization Preconditioner
. A new preconditioner for symmetric positive definite systems is proposed, analyzed, and tested. The preconditioner, Compressed Incomplete Modified Gram Schmidt (CIMGS), is based on an incomplete orthogonal factorization.
Xiaoge Wang +3 more
core
Automated prioritizing heuristics for parallel task graph scheduling in heterogeneous computing. [PDF]
Flint C, Paillat L, Bramas B.
europepmc +1 more source
Formalizing the Cholesky Factorization Theorem [PDF]
We present a formal proof of the Cholesky Factorization Theorem, a fundamental result in numerical linear algebra, by verifying formally a Cholesky decomposition algorithm in ACL2.
Hunt Jr., Warren A., Kwan, Carl
core +1 more source

