Xi Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xi Yang has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Zhong-Zhi Bai
Institute of Computational Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China
3 shared publications - Michael KwokPo Ng
Department of Mathematics, Hong Kong Baptist University, Kowloon Tong, Hong Kong
1 shared publication - Yu-Mei Huang
School of Mathematics and Statistics, Lanzhou University, Lanzhou, China
1 shared publication
Latest Publications
- Open Access
Discrete-Time Accelerated Block Successive Overrelaxation Methods for Time-Dependent Stokes Equations
To further study the application of waveform relaxation methods in fluid dynamics in actual computation, this paper provides a general theoretical analysis of discrete-time waveform relaxation methods for solving linear DAEs. A class of discrete-time waveform relaxation methods, named discrete-time accelerated block successive overrelaxation (DABSOR) methods, is proposed for solving linear DAEs derived from discretizing time-dependent Stokes equations in space by using "Method of Lines". The analysis of convergence property and optimality of the DABSOR method are presented in detail. The theoretical results and the efficiency of the DABSOR method are verified by numerical experiments.
Open AccessDiscrete-Time Accelerated Block Successive Overrelaxation Methods for Time-Dependent Stokes Equations
To further study the application of waveform relaxation methods in fluid dynamics in actual computation, this paper provides a general theoretical analysis of discrete-time waveform relaxation methods for solving linear DAEs. A class of discrete-time waveform relaxation methods, named discrete-time accelerated block successive overrelaxation (DABSOR) methods, is proposed for solving linear DAEs derived from discretizing time-dependent Stokes equations in space by using "Method of Lines". The analysis of convergence property and optimality of the DABSOR method are presented in detail. The theoretical results and the efficiency of the DABSOR method are verified by numerical experiments.
- 24 August 2013
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 222, 519-538
Discrete-time accelerated block successive overrelaxation methods for time-dependent Stokes equations
- 24 August 2013
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 222, 519-538
Discrete-time accelerated block successive overrelaxation methods for time-dependent Stokes equations
- 31 July 2012
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 236 (13) , 3265-3285
Continuous-time accelerated block successive overrelaxation methods for time-dependent Stokes equations
- 31 July 2012
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 236 (13) , 3265-3285
Continuous-time accelerated block successive overrelaxation methods for time-dependent Stokes equations
- 15 February 2011
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 235 (8) , 2790-2804
On convergence conditions of waveform relaxation methods for linear differential-algebraic equations
- 15 February 2011
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 235 (8) , 2790-2804
On convergence conditions of waveform relaxation methods for linear differential-algebraic equations
- 1 March 2010
- Published by Global Science Press in Numerical Mathematics: Theory, Methods and Applications
- Vol. 3 (4) , 461-474
Preconditioned Iterative Methods for Algebraic Systems from Multiplicative Half-Quadratic Regularization Image Restorations
Image restoration is often solved by minimizing an energy function consisting of a data-fidelity term and a regularization term. A regularized convex term can usually preserve the image edges well in the restored image. In this paper, we consider a class of convex and edge-preserving regularization functions, i.e., multiplicative half-quadratic regularizations, and we use the Newton method to solve the correspondingly reduced systems of nonlinear equations. At each Newton iteration, the preconditioned conjugate gradient method, incorporated with a constraint preconditioner, is employed to solve the structured Newton equation that has a symmetric positive definite coefficient matrix. The eigenvalue bounds of the preconditioned matrix are deliberately derived, which can be used to estimate the convergence speed of the preconditioned conjugate gradient method. We use experimental results to demonstrate that this new approach is efficient, and the effect of image restoration is reasonably good.
- 1 March 2010
- Published by Global Science Press in Numerical Mathematics: Theory, Methods and Applications
- Vol. 3 (4) , 461-474
Preconditioned Iterative Methods for Algebraic Systems from Multiplicative Half-Quadratic Regularization Image Restorations
Image restoration is often solved by minimizing an energy function consisting of a data-fidelity term and a regularization term. A regularized convex term can usually preserve the image edges well in the restored image. In this paper, we consider a class of convex and edge-preserving regularization functions, i.e., multiplicative half-quadratic regularizations, and we use the Newton method to solve the correspondingly reduced systems of nonlinear equations. At each Newton iteration, the preconditioned conjugate gradient method, incorporated with a constraint preconditioner, is employed to solve the structured Newton equation that has a symmetric positive definite coefficient matrix. The eigenvalue bounds of the preconditioned matrix are deliberately derived, which can be used to estimate the convergence speed of the preconditioned conjugate gradient method. We use experimental results to demonstrate that this new approach is efficient, and the effect of image restoration is reasonably good.