Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,523,630 papers from all fields of science
Search
Sign In
Create Free Account
Incomplete Cholesky factorization
Known as:
Cholesky
, Incomplete Cholesky
In numerical analysis, an incomplete Cholesky factorization of a symmetric positive definite matrix is a sparse approximation of the Cholesky…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Alternating direction implicit method
Conjugate gradient method
Kernel embedding of distributions
List of numerical analysis topics
Expand
Broader (1)
Numerical linear algebra
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Complex Incomplete Cholesky Factorization Preconditioned Bi-conjugate Gradient Method
Y. Zhang
,
Q. Sun
2011
Corpus ID: 55719673
─ Linear systems generated by finite element method (FEM) always have a symmetrical sparse system matrix, which requires a large…
Expand
Review
2010
Review
2010
Algorithms for Entropy and Correntropy Adaptation with Applications to Linear Systems
Deniz Erdoğmuş
,
Seungju Han
,
Abhishek Singh
Information Theoretic Learning
2010
Corpus ID: 116770763
This chapter develops several batch and online learning algorithms for the error entropy criterion (EEC) that are counterparts to…
Expand
2007
2007
An Incomplete Cholesky Factorization for Dense
Ma Lin
2007
Corpus ID: 14211310
In this paper, we study the use of an incomplete Cholesky factorization (ICF) as a preconditioner for solving dense positive…
Expand
2007
2007
3D transient analysis and movement simulation for the modelling of magnetic levitation
M. Rachek
,
M. Feliachi
International journal of computer application and…
2007
Corpus ID: 207406127
This paper presents a three-dimensional transient numerical modelling of an electromagnetic levitation problem that takes…
Expand
2005
2005
Svm Speaker Verification Using an Incomplete Cholesky Decomposition Sequence Kernel
J. Louradour
,
K. Daoudi
,
F. Bach
2005
Corpus ID: 264209958
The Generalized Linear discriminant Sequence (GLDS) kernel has been showing to provide very good performance in SVM speaker…
Expand
1999
1999
Parallel Solution of Large Sparse SPD Linear Systems Based on Overlapping Domain Decomposition
I. Kaporin
,
I. Konshin
International Conference on Parallel…
1999
Corpus ID: 13001386
We present a parallel iterative solver for large sparse symmetric positive definite (SPD) linear systems based on a new theory…
Expand
1998
1998
An algebraic multigrid method for solving very large electromagnetic systems
R. Mertens
,
H. Gersem
,
+4 authors
D. Roose
1998
Corpus ID: 15435068
Although most finite element programs have quite effective iterative solvers such as an incomplete Cholesky (IC) or symmetric…
Expand
1996
1996
A necessary and sufficient symbolic condition for the existence of incomplete Cholesky factorization
Xiaoge Wang
,
R. Bramley
,
K. Gallivan
1996
Corpus ID: 815552
Incomplete Cholesky factorization (IC) is a widely known and effective method of accelerating the convergence of conjugate…
Expand
1993
1993
Incomplete Cholesky Factorization with Sparsity Pattern Modi cation
Xiaoge Wang
,
K. Gallivan
1993
Corpus ID: 7307829
This paper proposes, analyzes, and numerically tests methods to assure the existence of incomplete Cholesky (IC) factorization…
Expand
1980
1980
A Non-Recursive Incomplete Cholesky Decomposition Method for the Solution of Linear Equations with a Sparse Matrix.
A. Hain
1980
Corpus ID: 118379672
Abstract : The incomplete Cholesky decomposition and the subsequent iterative solution by the conjugate gradient method has been…
Expand