Factorization of saddle-point matrices in dynamical systems optimization -- reusing pivots

From MaRDI portal
Publication:1736232

DOI10.1016/J.LAA.2018.12.026zbMATH Open1410.65079arXiv1703.09012OpenAlexW2907389642MaRDI QIDQ1736232FDOQ1736232


Authors: Jan Kuřátko Edit this on Wikidata


Publication date: 26 March 2019

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: In this paper we consider the application of direct methods for solving a sequence of saddle-point systems. Our goal is to design a method that reuses information from one factorization and applies it to the next one. In more detail, when we compute the pivoted LDLT factorization we speed up computation by reusing already computed pivots and permutations. We develop our method in the frame of dynamical systems optimization. Experiments show that the method improves efficiency over Bunch-Parlett while delivering the same results.


Full work available at URL: https://arxiv.org/abs/1703.09012




Recommendations




Cites Work


Uses Software





This page was built for publication: Factorization of saddle-point matrices in dynamical systems optimization -- reusing pivots

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736232)