A Sherman-Morrison approach to the solution of linear systems
Journal of Computational and Applied Mathematics
A discrete-time Markov-modulated queuing system with batched arrivals
Performance Evaluation
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
Dynamic normal forms and dynamic characteristic polynomial
Theoretical Computer Science
| Hi-index | 0.00 |
Suppose f=p/q is a quotient of two polynomials and that p has degree rp and q has degree rq. Assume that f(A) and f(A+uvT) are defined where $A \in {\mathbb R}^{n \times n}$, $u \in {\mathbb R}^n$, and $v \in {\mathbb R}^n$ are given and set r = max{rp,rq). We show how to compute f(A+uvT) in O(rn2) flops assuming that f(A) is available together with an appropriate factorization of the "denominator matrix" q(A). The central result can be interpreted as a generalization of the well-known Sherman--Morrison formula. For an application we consider a Jacobian computation that arises in an inverse problem involving the matrix exponential. With certain assumptions the work required to set up the Jacobian matrix can be reduced by an order of magnitude by making effective use of the rank-1 update formulae developed in this paper.