Zobrazeno 1 - 10 of 30 pro vyhledávání: '"Ching-Sung Liu"'
1
Akademický článek
An Inexact Noda Iteration for Computing the Smallest Eigenpair of a Large, Irreducible Monotone Matrix
Autor: Ching-Sung Liu
Publikováno v: Mathematics, Vol 12, Iss 16, p 2546 (2024)
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 relaxati
Externí odkaz: https://doaj.org/article/e818f210191b4c25a6659ff899868bbd
Zobrazit plný text záznamu
8
Continuation methods for computing Z-/H-eigenpairs of nonnegative tensors
Autor: Yueh-Cheng Kuo, Wen-Wei Lin, Ching-Sung Liu
Publikováno v: Journal of Computational and Applied Mathematics. 340:71-88
In this paper, a homotopy continuation method for the computation of nonnegative Z-/H-eigenpairs of a nonnegative tensor is presented. We show that the homotopy continuation method is guaranteed to compute a nonnegative eigenpair. Additionally, using
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::46aa2f828f007797821cd2529f7b959e
https://doi.org/10.1016/j.cam.2018.02.027
Zobrazit plný text záznamu
9
On the structured backward error of inexact Arnoldi methods for (skew)-Hermitian and (skew)-symmetric eigenvalue problems
Autor: Ching-Sung Liu, Che-Rung Lee
Publikováno v: BIT Numerical Mathematics. 57:1083-1108
In this paper, we present the inexact structure preserving Arnoldi methods for structured eigenvalue problems. They are called structure preserving because the computed eigenvalues and eigenvectors can preserve the desirable properties of the structu
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::9e07536e53e9fed562cc07b69d9dc229
https://doi.org/10.1007/s10543-017-0660-2
Zobrazit plný text záznamu
10
Newton–Noda iteration for finding the Perron pair of a weakly irreducible nonnegative tensor
Autor: Wen-Wei Lin, Chun-Hua Guo, Ching-Sung Liu
Publikováno v: Numerische Mathematik. 137:63-90
We present a Newton---Noda iteration (NNI) for computing the Perron pair of a weakly irreducible nonnegative mth-order tensor $${\mathscr {A}}$$A, by combining the idea of Newton's method with the idea of the Noda iteration. The method requires the s
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::c8b00ebc6d89bb5df0fb9f09919b0755
https://doi.org/10.1007/s00211-017-0869-7
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje