|
|

楼主 |
发表于 2025-10-26 18:00:28
|
显示全部楼层
( j9 G$ U1 X/ d) [8 f" ?( T0 U
[1] Liang, Qigang; Xu, Xuejun; Yuan, Liuyao Computing both upper and lower eigenvalue bounds by HDG methods. Comput. Methods Appl. Math. Accepted. (Special issue)! d0 q- E% Q6 h9 O2 N) t
9 r% v' W- k( _$ j
[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." X* Y% M2 G; v0 N1 t$ p
z: m7 k9 q& ^% O
[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)2 j* C* P% j$ T4 m4 M- q
. G+ f. Q& h2 u d8 ?+ d, N[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.
7 V8 c" [2 U0 P7 [1 m6 m0 B* y/ T1 j- J0 x
[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.
; _: K1 Q# j- q. X: B3 q7 C8 ?: }6 t
[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.
- J+ s; ~/ T" I7 a2 f- h3 I5 T2 a% G# q5 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.2 [8 Z5 \- w( I z% T( t. b
0 C6 u) D9 s2 }% ^8 c2 |* O这个在咋样 |
|