Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,273,703 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.
Highly Cited
2017
Highly Cited
2017
Compression, inversion, and approximate PCA of dense kernel matrices at near-linear computational complexity
Florian Schäfer
,
T. Sullivan
,
H. Owhadi
Multiscale Modeling & simulation
2017
Corpus ID: 34210843
Dense kernel matrices Θ∈R^(N×N) obtained from point evaluations of a covariance function G at locations {x_i}1≤i≤N arise in…
Expand
Highly Cited
2007
Highly Cited
2007
Fast cross-validation algorithms for least squares support vector machine and kernel ridge regression
S. An
,
Wanquan Liu
,
S. Venkatesh
Pattern Recognition
2007
Corpus ID: 207320655
Highly Cited
2005
Highly Cited
2005
Predictive low-rank decomposition for kernel methods
F. Bach
,
Michael I. Jordan
International Conference on Machine Learning
2005
Corpus ID: 5344737
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These…
Expand
Highly Cited
2004
Highly Cited
2004
kernlab - An S4 Package for Kernel Methods in R
Alexandros Karatzoglou
,
A. Smola
,
K. Hornik
,
A. Zeileis
2004
Corpus ID: 3008038
kernlab is an extensible package for kernel-based machine learning methods in R. It takes advantage of R's new S4 ob ject model…
Expand
Review
2001
Review
2001
Full 3-D inversion of electromagnetic data on PC
Y. Sasaki
2001
Corpus ID: 2191977
Highly Cited
1999
Highly Cited
1999
Incomplete Cholesky Factorizations with Limited Memory
Chih-Jen Lin
,
J. J. Moré
SIAM Journal on Scientific Computing
1999
Corpus ID: 6824105
We propose an incomplete Cholesky factorization for the solution of large-scale trust region subproblems and positive definite…
Expand
Highly Cited
1998
Highly Cited
1998
Reliable and Efficient Computation of Optical Flow
S. Lai
,
B. Vemuri
International Journal of Computer Vision
1998
Corpus ID: 10447863
In this paper, we present two very efficient and accurate algorithms for computing optical flow. The first is a modified gradient…
Expand
Review
1997
Review
1997
Iterative methods for solving linear systems
A. Greenbaum
Frontiers in applied mathematics
1997
Corpus ID: 117817432
List of Algorithms Preface 1. Introduction. Brief Overview of the State of the Art Notation Review of Relevant Linear Algebra…
Expand
Highly Cited
1995
Highly Cited
1995
An improved incomplete Cholesky factorization
Mark T. Jones
,
P. Plassmann
TOMS
1995
Corpus ID: 207188965
Incomplete factorization has been shown to be a good preconditioner for the conjugate gradient method on a wide variety of…
Expand
Highly Cited
1980
Highly Cited
1980
An incomplete factorization technique for positive definite linear systems
T. Manteuffel
1980
Corpus ID: 51810241
This paper describes a technique for solving the large sparse symmetric linear systems that arise from the application of finite…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE