The generalised eigenproblem Ax¯=λBx¯ is very often encountered in computational electromagnetics. Its solution is easily obtained when the matrices A and B are Hermitian and B is positive definite. However, the errors introduced by the discretisation process can deteriorate the properties of the matrices A and B in such a way that common techniques can no longer be used. The Higham-Cheng algorithm is proposed as a method to solve the generalised eigenproblem in these last cases. A brief account of the method is given and the algorithm is applied to two classical electromagnetic problems
Application of Higham-Cheng algorithm to the generalized eigenproblem in computational electromagnetics
AMENDOLA, Gian Domenico;DI MASSA, Giuseppe
2001-01-01
Abstract
The generalised eigenproblem Ax¯=λBx¯ is very often encountered in computational electromagnetics. Its solution is easily obtained when the matrices A and B are Hermitian and B is positive definite. However, the errors introduced by the discretisation process can deteriorate the properties of the matrices A and B in such a way that common techniques can no longer be used. The Higham-Cheng algorithm is proposed as a method to solve the generalised eigenproblem in these last cases. A brief account of the method is given and the algorithm is applied to two classical electromagnetic problemsFile 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.
