Multiplicative perturbation bounds for the Generalized block Cholesky downdating problem
Abstract
The explicit expressions for the strong and the weak rigorous multiplicative perturbation bounds for the Generalized block Cholesky downdating problem are obtained. By bringing together the modified matrix-vector equation approach with the method of Lyapunov majorant function and the Banach fixed point theorem, we derived the strong rigorous multiplicative perturbation bounds. By using the matrix-equation approach the weak rigorous multiplicative bounds are presented. Numerical experiments are provided to illustrate the obtained results.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.