We consider the problem of solving a rational matrix equation arising in the solution of G-networks. We propose and analyze two numerical methods: a fixed point iteration and the Newton–Raphson method. The fixed point iteration is shown to be globally convergent with linear convergence rate, while the Newton method is shown to have a local convergence, with quadratic convergence rate. Numerical experiments show the effectiveness of the proposed methods.
On the solution of a rational matrix equation arising in G-networks
MEINI, BEATRICE;NESTI, TOMMASO
2017-01-01
Abstract
We consider the problem of solving a rational matrix equation arising in the solution of G-networks. We propose and analyze two numerical methods: a fixed point iteration and the Newton–Raphson method. The fixed point iteration is shown to be globally convergent with linear convergence rate, while the Newton method is shown to have a local convergence, with quadratic convergence rate. Numerical experiments show the effectiveness of the proposed methods.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.