87
Views
4
CrossRef citations to date
0
Altmetric
Original Articles

Multiplicative perturbation bounds for the block Cholesky downdating problem

&
Pages 2421-2435 | Received 24 Apr 2019, Accepted 15 Nov 2019, Published online: 08 Dec 2019
 

ABSTRACT

In this paper, we give the explicit expressions for the strong and the weak rigorous multiplicative perturbation bounds for the block Cholesky downdating problem. First, we derived the strong rigorous multiplicative perturbation bounds by combining the modified matrix-vector equation approach with the strategy for Lyapunov majorant function and the Banach fixed point theorem. Then, the weak rigorous multiplicative bounds are obtained with the help of the matrix-equation approach. The obtained results are illustrated by numerical tests.

AMS SUBJECT CLASSIFICATIONS:

Acknowledgments

The authors appreciate the constructive remarks and suggestions of the anonymous referees that helped to improve the paper.

Disclosure statement

No potential conflict of interest was reported by the authors.

Additional information

Funding

The work is supported by the National Natural Science Foundation of China (Grant Nos. 11671060, 11571062, and 11771062).

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 1,129.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.