.png){kind=icon}
.png){kind=icon}
Return
Sensitivity analysis for the generalized Cholesky factorization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2019.124556.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The explicit expressions of the normwise, mixed, and componentwise condition numbers and their upper bounds for the generalized Cholesky factorization are first obtained. Then, some improved rigorous perturbation bounds with normwise or componentwise perturbation in the given matrix are derived by bringing together the modified matrix-vector equation approach with the method of Lyapunov majorant function and the Banach fixed point theorem. Theoretical and experimental results show that these new bounds are always tighter than the corresponding ones in the literature. (C) 2019 Elsevier Inc. All rights reserved.
Keywords:
Generalized Cholesky factorization
Condition number
Rigorous perturbation bound
Lyapunov majorant function
Banach fixed point theorem
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W