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)

Related topics

Related topics

50 relations
AnalyticaBlock matrix pseudoinverseBrownian surfaceCMA-ES

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
High Performance Reconfigurable Computing for Cholesky Decomposition
This paper proposes a hardware accelerator for Cholesky decomposition on FPGAs by designing a single triangular linear equation… 
Highly Cited
2005
Highly Cited
2005
An information-theoretic framework for deriving canonical decision-feedback receivers in Gaussian channels
A framework is presented that allows a number of known results relating feedback equalization, linear prediction, and mutual… 
Highly Cited
2004
Highly Cited
2004
The design and implementation of a new out-of-core sparse cholesky factorization method
We describe a new out-of-core sparse Cholesky factorization method. The new method uses the elimination tree to partition the… 
Highly Cited
2003
Highly Cited
2003
Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
A so-called DCA method based on a d.c.\ (difference of convex functions) optimization approach (algorithm) for solving large… 
Highly Cited
1998
Highly Cited
1998
On the use of the Hipparcos intermediate astrometric data
With the publication of the Hipparcos cat- alogue, astrometric data of unprecedented quality and quantity has become available… 
Highly Cited
1997
Highly Cited
1997
Subregion-Adaptive Integration of Functions Having a Dominant Peak
Abstract Many statistical multiple integration problems involve integrands that have a dominant peak. In applying numerical… 
1994
1994
DRIC: A dynamic version of the RIC method
A new incomplete factorization method is proposed, differing from previous ones by the way in which the diagonal entries of the… 
1992
1992
A Cartesian Parallel Nested Dissection Algorithm
This paper is concerned with the distributed parallel computation of an ordering for a symmetric positive definite sparse matrix… 
Highly Cited
1986
Highly Cited
1986
Implementation of adaptive array algorithms
Some new, efficient, and numerically stable algorithms for the recursive solution of matrix problems arising in optimal beam… 
Highly Cited
1975
Highly Cited
1975
Solution of linear equations with skyline-stored symmetric matrix
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)