New rigorous perturbation bounds for the generalized Cholesky factorization
classification
🧮 math.NA
keywords
boundscholeskyfactorizationgeneralizedperturbationcomponentwiserigoroussome
read the original abstract
Some new rigorous perturbation bounds for the generalized Cholesky factorization with normwise or componentwise perturbations in the given matrix are obtained, where the componentwise perturbation has the form of backward rounding error for the generalized Cholesky factorization algorithm. These bounds can be much tighter than some existing ones while the conditions for them to hold are simple and moderate.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.