Results 11 to 20 of about 510,427 (158)
Preconditioning of wavelet BEM by the incomplete Cholesky factorization [PDF]
Computing and Visualization in Science, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Harbrecht, Helmut
openaire +4 more sources
A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners [PDF]
SIAM Journal on Scientific Computing, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
James L. Hook +3 more
openaire +5 more sources
An Incomplete Cholesky Factorization for Dense Symmetric Positive Definite Matrices [PDF]
BIT Numerical Mathematics, 2000 An incomplete Cholesky factorization is obtained if only the large components of pivot columns enter into the factorization. The efficiency is tested for three types of matrices. 1. Randomly generated matrices; 2. Dense matrices from semi-definite programming of the form \(\bar A (S^{-1} \otimes X) A^T\) and 3.
Lin, Chih-Jen, Saigal, Romesh
openaire +4 more sources
, 2022 We consider the numerical solution of large and sparse linear systems arising from a finite difference discretization of the anisotropic diffusion equation. We study preconditioned conjugate gradient as an iterative solver, with the incomplete Cholesky factorization as a preconditioner.
Beauchamp, Austin
core +3 more sources
Transactions of the Korean Society of Mechanical Engineers A, 2003 The preconditioned conjugate gradient method is an efficient iterative solution scheme for large size finite element problems. As preconditioning method, we choose an incomplete Cholesky factorization which has efficiency and easiness in implementation in this paper.
이병채, 고진환
core +3 more sources
ACM Transactions on Mathematical SoftwareOur interest lies in the robust and efficient solution of large sparse linear least-squares problems. In recent years, hardware developments have led to a surge in interest in exploiting mixed precision arithmetic within numerical linear algebra algorithms to take advantage of potential savings in memory requirements, runtime and energy use, whilst ...
Jennifer Scott, Miroslav Tůma
openaire +4 more sources
Solving large scale linear programming [PDF]
, 1993 The interior point method (IPM) is now well established as a competitive technique for solving very large scale linear programming problems. The leading variant of the interior point method is the primal dual - predictor corrector algorithm due to ...
Levkovitz, R, Mitra, G, Hafsteinsson, H
core +6 more sources
, 2008 This article, aimed at a general audience of computational scientists, surveys the Cholesky factorization for symmetric positive definite matrices, covering algorithms for computing it, the numerical stability of the algorithms, and updating and ...
Higham, Nicholas J.
core +3 more sources
Fast kernel
Applied Mathematics and Computation, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li Chen +3 more
openaire +1 more source
Task Parallel Incomplete Cholesky Factorization using 2D Partitioned-Block Layout [PDF]
CoRR, 2016 We introduce a task-parallel algorithm for sparse incomplete Cholesky factorization that utilizes a 2D sparse partitioned-block layout of a matrix. Our factorization algorithm follows the idea of algorithms-by-blocks by using the block layout. The algorithm-by-blocks approach induces a task graph for the factorization.
Kyungjoo Kim +4 more
openaire +4 more sources