An Inexact Noda Iteration for Computing the Smallest Eigenpair of a Large, Irreducible Monotone Matrix
In this paper, we introduce an inexact Noda iteration method featuring inner and outer iterations for computing the smallest eigenvalue and corresponding eigenvector of an irreducible monotone matrix. The proposed method includes two primary relaxation steps designed to compute the smallest eigenval...
Na minha lista:
| Autor principal: | |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
MDPI AG
2024-08-01
|
| coleção: | Mathematics |
| Assuntos: | |
| Acesso em linha: | https://www.mdpi.com/2227-7390/12/16/2546 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|