Low rank update of block-LDLᵀ decomposition

Open discussion regarding features, bugs, issues, vendors, etc.

Low rank update of block-LDLᵀ decomposition

Postby pushpendre » Wed Dec 28, 2016 6:05 am

Hi,

I was wondering if any stable algorithm for efficiently updating the block-LDLᵀ decomposition of symmetric indefinite matrices was already available in the LAPACK library? I know that the dsytf2* functions compute this decomposition but I was not able to find anything for updating the decomposition.

Professor Danny Sorensen's thesis UPDATING THE SYMMETRIC INDEFINITE FACTORIZATION WITH APPLICATIONS IN A MODIFIED NEWTON'S METHOD contains one such algorithm including fortran source code on page 140, but the thesis is available as OCR'd pdf therefore I thought of asking on the LAPACK forum before spending time manually typing something that might already exist.

Thanks.
pushpendre
 
Posts: 3
Joined: Wed Dec 28, 2016 4:07 am

Re: Low rank update of block-LDLᵀ decomposition

Postby Julien Langou » Mon Jan 02, 2017 10:21 am

Julien Langou
 
Posts: 813
Joined: Thu Dec 09, 2004 12:32 pm
Location: Denver, CO, USA


Return to User Discussion

Who is online

Users browsing this forum: Bing [Bot] and 2 guests