Mathematics for Enzyme Reaction Kinetics and Reactor Performance. F. Xavier MalcataЧитать онлайн книгу.

---

Скачать книгу

---

target="_blank" rel="nofollow" href="#fb3_img_img_1e474f97-97b3-5012-99f3-c1caebb8c4d6.png" alt="equation"/>

where Eq. (4.108) allows further simplification to

(4.161)

      One may similarly write

(4.162)

at the expense again of the rule of transposition of a product of matrices, see Eq. (4.120); the definition of inverse as conveyed by Eq. (4.124) permits simplification of Eq. (4.162) to

      (4.163)

      whereas Eq. (4.108) may again be invoked to attain

(4.164)

Inspection of Eqs. (4.161) and (4.164) confirms compatibility with the form of Eq. (4.124), so one concludes that

      (4.165)

      – meaning that the inverse of A^T is merely the transpose of A⁻¹; therefore, the transpose and inverse operators can also be exchanged without affecting the final result.

      Although being square is a necessary condition for invertibility of a matrix, it is far from being also a sufficient condition; in fact, the rank of (n × n) matrix A must coincide with its order, so as to guarantee existence of A⁻¹ (to be discussed later). Under such conditions, the said square matrix is termed regular – otherwise it is termed singular; as will be seen, the associated determinant is a convenient tool to effect this distinction.

      4.5.2 Block Matrix

Oftentimes, matrix A to be inverted appears as a block matrix, in agreement with Eq. (4.86) – so the question is to find its inverse, say, B, in a form consistent with Eq. (4.87); A_1,1 and B_1,1 will hereafter denote regular (m × m) matrices, A_1,2 and B_1,2 denote (m × p) matrices, A_2,1 and B_2,1 denote (p × m) matrices, and A_2,2 and B_2,2 denote regular (p × p) matrices. Under these conditions, Eq. (4.124) may be reformulated to

(4.166)

      so Eq. (4.88) may be retrieved to allow transformation of Eq. (4.166) to

      (4.167)

this is equivalent to writing

(4.168)

(4.169)

(4.170)

      and

(4.171)

owing to the required equality of matrices in the two sides. Equation (4.169) may be rewritten as

      (4.172)

      premultiplication of both sides by (which exists because A_1,1 is, by hypothesis, a regular square matrix), coupled with Eq. (4.56) and the definition of inverse matrix as per Eq. (4.124) yield

      (4.173)

      which is equivalent to

(4.174)

      at the expense of Eqs. (4.24), (4.57), and (4.64). By the same token, one gets

      (4.175)

from Eq. (4.170) – where premultiplication of both sides by produces

(4.176)

at the expense of Eqs. (4.24), (4.57) and (4.124); in view of the definition of identity matrix, one may rewrite Eq. (4.176)

---

Скачать книгу