Paper Info
Title
On the sensitivity of generators for the QR factorization of quasiseparable matrices with total nonpositivity.
Abstract
In this paper, we provide a relatively robust representation for the QR factorization of quasiseparable matrices with total nonpositivity. This representation allows us to develop a structure-preserving perturbation analysis. Consequently, stronger perturbation bounds are obtained to show that its generators determine the factors and to high relative accuracy, independent of any conventional condition number. This means that it is possible to accurately compute the QR factorization by operating on these generators.
Year
DOI
Venue
2018
https://doi.org/10.1007/s11075-017-0345-6
Numerical Algorithms
Keywords
Field
DocType
Quasiseparable matrices,Total nonpositivity,Perturbation,QR factorization,High relative accuracy,65F15,15A18
Condition number,Mathematical optimization,Algebra,Perturbation theory,Matrix (mathematics),QR decomposition,Perturbation (astronomy),Mathematics
Journal
Volume
Issue
ISSN
77
3
1017-1398
Citations 
PageRank 
References 
0
0.34
13
Authors
1
Name
Order
Citations
PageRank
Rong Huang1386.09