This paper shows that the Pfaffians and determinants of some skew centrosymmetric matrices can be computed by a paired two-term recurrence relation, or a general number sequence of second order. As a result, the complexities of the formulas are of order n. Furthermore, the formulas have no divisions at all, i.e., they fall into the class of breakdown-free algorithms.
展开▼
