The generalised eigenproblem Ax=λBx is very oftenencountered in computational electromagnetics. Its solution iseasily obtained when the matrices A and B are Hermitian and B ispositive definite. However, the errors introduced by thediscretisation process can deteriorate the properties of thematrices A and B in such a way that common techniques can nolonger be used. The Higham-Cheng algorithm is proposed as amethod to solve the generalised eigenproblem in these last cases.A brief account of the method is given and the algorithm isapplied to two classical electromagnetic problems.
Application of Higham-Cheng Algorithm to the Generalized Eigenproblem in Computational Electromagnetics
ANGIULLI, Giovanni
;
2001-01-01
Abstract
The generalised eigenproblem Ax=λBx is very oftenencountered in computational electromagnetics. Its solution iseasily obtained when the matrices A and B are Hermitian and B ispositive definite. However, the errors introduced by thediscretisation process can deteriorate the properties of thematrices A and B in such a way that common techniques can nolonger be used. The Higham-Cheng algorithm is proposed as amethod to solve the generalised eigenproblem in these last cases.A brief account of the method is given and the algorithm isapplied to two classical electromagnetic problems.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
