A lower bound for the departure from normality of an n X n matrix A is given. Furthermore, various inequalities are obtained for certain condition numbers associated with the reduction of A to its Jordan canonical form.
Abstract.We survey and classify the various algorithms for traversing binary trees in the three principal orders and the related two-and three-visit traversal orders. For each class of algorithms we determine which of the traversal orders may be effected by means of loop-free traversal algorithms.Although, in general, these are multi-visit traversal orders, we indicate how the algorithms may be modified to yield loop-free sinole-visit traversal algorithms in "non-standard" orders. We also exhibit and discuss the close relationship between the various stack-based algorithms and the other classes of algorithms.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.