Skip to search formSkip to main contentSkip to account menu

Cholesky decomposition

Known as: LDLT, Choleski factorization, LDL (disambiguation) 
In linear algebra, the Cholesky decomposition or Cholesky factorization is a decomposition of a Hermitian, positive-definite matrix into the product… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
The problem of Knowledge Base Completion can be framed as a 3rd-order binary tensor completion problem. In this light, the… 
Review
2013
Review
2013
This work is an overview of our preliminary experience in developing a high-performance iterative linear solver accelerated by… 
Highly Cited
2013
Highly Cited
2013
The application of semidefinite programming to the optimal power flow (OPF) problem has recently attracted significant research… 
Highly Cited
2006
Highly Cited
2006
The FETI‐DP and BDDC algorithms are reformulated using Block Cholesky factorizations, an approach which can provide a useful… 
Review
2001
Review
1998
Review
1998
This paper surveys the theoretical and computational development of the restricted maximum likelihood (REML) approach for the… 
Highly Cited
1996
Highly Cited
1996
Spatially registered Landsat Thematic Mapper (TM) and SPOT (Systeme Pour l'Observation de la Terre) panchromatic images were… 
Highly Cited
1990
Highly Cited
1990
Perturbation theory is developed for the Cholesky decomposition of an $n \times n$ symmetric positive semidefinite matrix $A$ of… 
Highly Cited
1989
Highly Cited
1989
A recently developed spatial operator algebra for manipu lator modeling, control, and trajectory design is dis cussed. The… 
Highly Cited
1972
Highly Cited
1972
In recent years several algorithms have appeared for modifying the factors of a matrix following a rank-one change. These methods…