Data Structures and Algorithms


The Bordering Method of the Cholesky Decomposition and its Backward Differentiation

Authors: Stephen P Smith

This paper describes the backward differentiation of the Cholesky decomposition by the bordering method. The backward differentiation of the Cholesky decomposition by the inner product form and the outer product form have been described elsewhere. It is found that the resulting algorithm can be adapted to vector processing, as is also true of the algorithms developed from the inner product form and outer product form. The three approaches can also be fashioned to treat sparse matrices, but this is done by enforcing the same sparse structure found for the Cholesky decomposition on a secondary work space.

Comments: 12 Pages.

Download: PDF

Submission history

[v1] 2017-02-13 21:17:07 (removed)
[v2] 2017-02-15 22:12:15 (removed)
[v3] 2017-02-18 21:07:27 (removed)
[v4] 2017-02-20 14:49:06

Unique-IP document downloads: 332 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus