Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

On a generalization of the resolvent condition in the Kreiss matrix theorem
HTML articles powered by AMS MathViewer

by H. W. J. Lenferink and M. N. Spijker PDF
Math. Comp. 57 (1991), 211-220 Request permission

Abstract:

This paper deals with a condition on the resolvent of $s \times s$ matrices A. In one of the equivalent assertions of the Kreiss matrix theorem, the spectral norm of the resolvent of A at $\zeta$ must satisfy an inequality for all $\zeta$ lying outside the unit disk in $\mathbb {C}$. We consider a generalization in which domains different from the unit disk and more general norms are allowed. Under this generalized resolvent condition an upper bound is derived for the norms of the nth powers of $s \times s$ matrices B. Here, B depends on A via a relation $B = \varphi (A)$, where $\varphi$ is an arbitrary rational function. The upper bound grows linearly with $s \geq 1$ and is independent of $n \geq 1$. This generalizes an upper bound occurring in the Kreiss theorem where $B = A$. Like the classical Kreiss theorem, the upper bound derived in this paper can be used in the stability analysis of numerical methods for solving differential equations.
References
Similar Articles
Additional Information
  • © Copyright 1991 American Mathematical Society
  • Journal: Math. Comp. 57 (1991), 211-220
  • MSC: Primary 65F35; Secondary 15A60, 65L20, 65M06
  • DOI: https://doi.org/10.1090/S0025-5718-1991-1079025-4
  • MathSciNet review: 1079025