Xuemin Tu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xuemin Tu has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Jing Li
Kent State University
3 shared publications - Alexandre J. Chorin
Department of Mathematics, University of California, Berkeley, CA 94720, USA
2 shared publications - Barry Smith
Argonne National Laboratory
2 shared publications Jing Li
Kent State University
2 shared publicationsAlexandre J. Chorin
University of California and Lawrence, Berkeley National Laboratory
1 shared publication- Alexandre J. Chorin1 shared publication
Latest Publications
- 18 March 2017
- Published by Springer Nature
- p. 269-276
A BDDC Algorithm for Weak Galerkin Discretizations
- 18 March 2017
- Published by Springer Nature
- p. 269-276
A BDDC Algorithm for Weak Galerkin Discretizations
- Open Access
Composing Scalable Nonlinear Algebraic Solvers
Most efficient linear solvers use composable algorithmic components, with the most common model being the combination of a Krylov accelerator and one or more preconditioners. A similar set of concepts may be used for nonlinear algebraic systems, where nonlinear composition of different nonlinear solvers may significantly improve the time to solution. We describe the basic concepts of nonlinear composition and preconditioning and present a number of solvers applicable to nonlinear partial differential equations. We have developed a software framework in order to easily explore the possible combinations of solvers. We show that the performance gains from using composed solvers can be substantial compared with gains from standard Newton-Krylov methods.
Open AccessComposing Scalable Nonlinear Algebraic Solvers
Most efficient linear solvers use composable algorithmic components, with the most common model being the combination of a Krylov accelerator and one or more preconditioners. A similar set of concepts may be used for nonlinear algebraic systems, where nonlinear composition of different nonlinear solvers may significantly improve the time to solution. We describe the basic concepts of nonlinear composition and preconditioning and present a number of solvers applicable to nonlinear partial differential equations. We have developed a software framework in order to easily explore the possible combinations of solvers. We show that the performance gains from using composed solvers can be substantial compared with gains from standard Newton-Krylov methods.
- Open Access
- 1 January 2016
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems
- Vol. 36 (8) , 4227-4246
Sampling, feasibility, and priors in data assimilation
Importance sampling algorithms are discussed in detail, with an emphasis on implicit sampling, and applied to data assimilation via particle filters. Implicit sampling makes it possible to use the data to find high-probability samples at relatively low cost, making the assimilation more efficient. A new analysis of the feasibility of data assimilation is presented, showing in detail why feasibility depends on the Frobenius norm of the covariance matrix of the noise and not on the number of variables. A discussion of the convergence of particular particle filters follows. A major open problem in numerical data assimilation is the determination of appropriate priors; a progress report on recent work on this problem is given. The analysis highlights the need for a careful attention both to the data and to the physics in data assimilation problems.
- 1 January 2016
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems
- Vol. 36 (8) , 4227-4246
Open AccessSampling, feasibility, and priors in data assimilation
Importance sampling algorithms are discussed in detail, with an emphasis on implicit sampling, and applied to data assimilation via particle filters. Implicit sampling makes it possible to use the data to find high-probability samples at relatively low cost, making the assimilation more efficient. A new analysis of the feasibility of data assimilation is presented, showing in detail why feasibility depends on the Frobenius norm of the covariance matrix of the noise and not on the number of variables. A discussion of the convergence of particular particle filters follows. A major open problem in numerical data assimilation is the determination of appropriate priors; a progress report on recent work on this problem is given. The analysis highlights the need for a careful attention both to the data and to the physics in data assimilation problems.
- 1 January 2016
- Published by Springer Nature
- p. 327-334
A FETI-DP Algorithm for Saddle Point Problems in Three Dimensions
- 1 January 2016
- Published by Springer Nature
- p. 327-334
A FETI-DP Algorithm for Saddle Point Problems in Three Dimensions
- Open Access
A FETI-DP type domain decomposition algorithm for three-dimensional incompressible Stokes equations
The FETI-DP algorithms, proposed by the authors in [SIAM J. Numer. Anal., 51 (2013), pp.~1235--1253] and [Internat. J. Numer. Methods Engrg., 94 (2013), pp.~128--149] for solving incompressible Stokes equations, are extended to three-dimensional problems. A new analysis of the condition number bound for using the Dirichlet preconditioner is given. An advantage of this new analysis is that the numerous coarse level velocity components, required in the previous analysis to enforce the divergence free subdomain boundary velocity conditions, are no longer needed. This greatly reduces the size of the coarse level problem in the algorithm, especially for three-dimensional problems. The coarse level velocity space can be chosen as simple as for solving scalar elliptic problems corresponding to each velocity component. Both Dirichlet and lumped preconditioners are analyzed using a same framework in this new analysis. Their condition number bounds are proved to be independent of the number of subdomains for fixed subdomain problem size. Numerical experiments in both two and three dimensions demonstrate the convergence rate of the algorithms.
Open AccessA FETI-DP type domain decomposition algorithm for three-dimensional incompressible Stokes equations
The FETI-DP algorithms, proposed by the authors in [SIAM J. Numer. Anal., 51 (2013), pp.~1235--1253] and [Internat. J. Numer. Methods Engrg., 94 (2013), pp.~128--149] for solving incompressible Stokes equations, are extended to three-dimensional problems. A new analysis of the condition number bound for using the Dirichlet preconditioner is given. An advantage of this new analysis is that the numerous coarse level velocity components, required in the previous analysis to enforce the divergence free subdomain boundary velocity conditions, are no longer needed. This greatly reduces the size of the coarse level problem in the algorithm, especially for three-dimensional problems. The coarse level velocity space can be chosen as simple as for solving scalar elliptic problems corresponding to each velocity component. Both Dirichlet and lumped preconditioners are analyzed using a same framework in this new analysis. Their condition number bounds are proved to be independent of the number of subdomains for fixed subdomain problem size. Numerical experiments in both two and three dimensions demonstrate the convergence rate of the algorithms.
- 21 April 2014
- Published by Springer Nature
- p. 597-605
On the Origins of Iterative Substructuring Methods
- 21 April 2014
- Published by Springer Nature
- p. 597-605
On the Origins of Iterative Substructuring Methods
- 21 April 2014
- Published by Springer Nature
- p. 157-165
A FETI-DP Algorithm for Incompressible Stokes Equations with Continuous Pressures
- 21 April 2014
- Published by Springer Nature
- p. 157-165
A FETI-DP Algorithm for Incompressible Stokes Equations with Continuous Pressures
- 5 July 2013
- Published by Springer Nature
- p. 63-88
A Survey of Implicit Particle Filters for Data Assimilation
- 5 July 2013
- Published by Springer Nature
- p. 63-88
A Survey of Implicit Particle Filters for Data Assimilation
- 29 January 2013
- Published by Springer Nature in Chinese Annals of Mathematics, Series B
- Vol. 34 (1) , 89-98
Implicit Sampling, with Application to Data Assimilation
- 29 January 2013
- Published by Springer Nature in Chinese Annals of Mathematics, Series B
- Vol. 34 (1) , 89-98
Implicit Sampling, with Application to Data Assimilation