Sensitivity analysis for the block Cholesky downdating problem

Aamir Farooq, Mahvish Samar, Hanyu Li, Chunlai Mu

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

Some improved rigorous perturbation bounds with normwise perturbation for the block Cholesky downdating problem are first derived by combining the modified matrix-vector equation approach with the strategy for Lyapunov majorant function and the Banach fixed point theorem. Then, we investigate four distinct kinds of condition numbers, i.e. two normwise ones, and mixed and componentwise ones, for this problem, and present their explicit expressions. Furthermore, using the probabilistic spectral norm estimator and the small-sample statistical condition estimation method, we also consider the statistical estimation of these condition numbers and design two algorithms. The obtained results are illustrated by numerical examples.
Original languageEnglish (US)
Pages (from-to)1234-1253
Number of pages20
JournalInternational Journal of Computer Mathematics
Volume97
Issue number6
DOIs
StatePublished - Jun 2 2020
Externally publishedYes

Bibliographical note

Generated from Scopus record by KAUST IRTS on 2023-09-21

Fingerprint

Dive into the research topics of 'Sensitivity analysis for the block Cholesky downdating problem'. Together they form a unique fingerprint.

Cite this