|
|

楼主 |
发表于 2025-10-26 18:00:28
|
显示全部楼层
7 ~" |" ^$ Y5 Z2 Y
[1] Liang, Qigang; Xu, Xuejun; Yuan, Liuyao Computing both upper and lower eigenvalue bounds by HDG methods. Comput. Methods Appl. Math. Accepted. (Special issue)( c8 K$ G$ \( p1 O
% C, l, Y1 _7 M- X[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.
# |& I2 h8 X4 c, \' N/ c2 ^: |2 j5 I* u, h( W: J) o$ a
[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)& M2 R3 q& f: o' l7 ~
2 M# t5 H8 t' T, F) c
[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.( v7 s9 F$ u6 G3 k2 }# y
: L4 S# s- ^' ?& Y. Z
[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.
% \! W" R& i- w# L/ k/ S% j, n. R% R' A+ i
[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.
`' r0 b. I0 m7 j6 y( \( x3 K
: \2 q3 a Z" i# N' t& Q& H7 k[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.
0 ]8 ]7 @- v8 Q3 A8 K4 J1 V Q
' t0 `$ V; J2 ?' s4 h这个在咋样 |
|