|
|

楼主 |
发表于 2025-10-26 18:00:28
|
显示全部楼层
* `( u: m9 J& Q# m, R[1] Liang, Qigang; Xu, Xuejun; Yuan, Liuyao Computing both upper and lower eigenvalue bounds by HDG methods. Comput. Methods Appl. Math. Accepted. (Special issue)* s0 S; c# |# T. `0 ~
/ Z+ A, R) f) U0 @. u
[2] Liang, Qigang; Xu, Xuejun; Zhang, Shangyou On a sharp estimate of overlapping Schwarz methods in H(curl;Ω) and H(div;Ω). IMA J. Numer. Anal.45 (2025), no. 2,1009–1027.
& H2 d2 K) s1 O f. T1 n: F7 ]! k0 y; T9 w A! d1 X
[3] Liang, Qigang; Wang, Wei; Xu, Xuejun A domain decomposition method for nonconforming finite element approximations of eigenvalue problems. Commun. Appl. Math. Comput.7 (2025), no. 2,606–636. (Special issue)
+ x3 _9 H( I' V' Q" S, o# l5 z5 m, S+ @- ~: Q2 q! ?
[4] Liang, Qigang; Wang, Wei; Xu, Xuejun A two-level block preconditioned Jacobi-Davidson method for multiple and clustered eigenvalues of elliptic operators. SIAM J. Numer. Anal. 62 (2024), no. 2, 998–1019.
( u4 z. c* w+ f2 f# x, I( B% j) H
[5] Liang, Qigang; Xu, Xuejun A two-level preconditioned Helmholtz subspace iterative method for Maxwell eigenvalue problems. SIAM J. Numer. Anal. 61 (2023), no. 2, 642–674.
$ J+ a& y' b. A8 ]$ E! C
! d" V3 j c8 F) o[6] Liang, Qigang; Xu, Xuejun; Yuan, Liuyao A weak Galerkin finite element method can compute both upper and lower eigenvalue bounds. J. Sci. Comput. 93 (2022), no. 1, Paper No. 19, 21 pp.
* \5 q) l$ o ~/ o) j7 e
D/ t+ M# N% s0 c v[7] Liang, Qigang; Xu, Xuejun A two-level preconditioned Helmholtz-Jacobi-Davidson method for the Maxwell eigenvalue problem. Math. Comp. 91 (2022), no. 334, 623–657.6 D( U. K8 v; A, w, N% K
4 y& t" p) O" |5 g; w) ?6 N' Q7 c \! \
这个在咋样 |
|