A General Procedure for the Computation of the Transversal Coupling Matrix

In this letter, we extend the computation procedure of the transversal coupling matrix proposed by Cameron (based on the expansion into partial fraction of the admittance matrix polynomials) to the cases where the original algorithm fails. Such cases happen when some of the admittance matrix eigenvalues are coincident or when common roots are present in the admittance matrix polynomials. Furthermore, it is also shown that in the case of coincident eigenvalues, there are infinite solutions for the transversal coupling matrix (unlike all other cases, where the solution is unique). The novel technique is validated by the computation of the transversal matrix for two types of path filters, where the conditions not allowing the use of the classical procedure are verified.