Qinghai Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Qinghai Zhang has a total of 98 co-authors. Here are the top co-authors by number of shared publications:
- Philip L.-F. Liu
Department of Civil and Environmental Engineering, National University of Singapore, 117576, Republic of Singapore
4 shared publications Shubo Zhao
College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang, 830046 China. Current address: School of Mathematical Sciences, Zhejiang University, Hangzhou, Zhejiang, 310058, China
3 shared publicationsAaron Fogelson
2 shared publications- Kaiyi Liang
Zhejiang University, Hangzhou, China
2 shared publications - Renjun Xu
College of Computer Science and Technology, Zhejiang University, Hangzhou, China
2 shared publications Yan Tan
School of Mathematical Sciences Zhejiang University 310058 Hangzhou Zhejiang China
2 shared publications
Latest Publications
- 10 October 2026
- Published by Springer Nature in Machine Learning
- Vol. 115 (10) , 244
A Survey on Loss-based Regularization for Model Generalization
- 10 October 2026
- Published by Springer Nature in Machine Learning
- Vol. 115 (10) , 244
A Survey on Loss-based Regularization for Model Generalization
- 25 April 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 107 (3) , 77
A Multiphase Cubic MARS Method for Fourth- and Higher-Order Interface Tracking of Two or More Materials with Arbitrary Topology and Geometry
- 25 April 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 107 (3) , 77
A Multiphase Cubic MARS Method for Fourth- and Higher-Order Interface Tracking of Two or More Materials with Arbitrary Topology and Geometry
- 18 February 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in Multiscale Modeling & Simulation
- Vol. 24 (1) , 290-315
Fourth-Order Adaptive Mesh Refinement Both in Space and in Time for Incompressible Navier–Stokes Equations with Dirichlet Boundary Conditions
We present a fourth-order projection method with adaptive mesh refinement (AMR) for numerically solving the incompressible Navier–Stokes equations (INSE) with subcycling in time. Our method features (i) a reformulation of INSE so that the velocity divergence decays exponentially on the coarsest level, (ii) a derivation of coarse-fine interface conditions that preserves the decay of velocity divergence on any refinement level of the AMR hierarchy, (iii) an approximation of the coarse-fine interface conditions via spatiotemporal interpolations to facilitate subcycling in time, (iv) enforcing to machine precision solvability conditions of elliptic equations over each connected component of any refinement level, (v) a discrete composite projection for synchronizing multiple levels, and (vi) geometric multigrid algorithms for solving linear systems with optimal complexity. Different from current block-structured AMR, our method never applies the fine-to-coarse averaging to projected velocities. Results of numerical tests demonstrate the high accuracy and efficiency of the proposed method.
- 18 February 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in Multiscale Modeling & Simulation
- Vol. 24 (1) , 290-315
Fourth-Order Adaptive Mesh Refinement Both in Space and in Time for Incompressible Navier–Stokes Equations with Dirichlet Boundary Conditions
We present a fourth-order projection method with adaptive mesh refinement (AMR) for numerically solving the incompressible Navier–Stokes equations (INSE) with subcycling in time. Our method features (i) a reformulation of INSE so that the velocity divergence decays exponentially on the coarsest level, (ii) a derivation of coarse-fine interface conditions that preserves the decay of velocity divergence on any refinement level of the AMR hierarchy, (iii) an approximation of the coarse-fine interface conditions via spatiotemporal interpolations to facilitate subcycling in time, (iv) enforcing to machine precision solvability conditions of elliptic equations over each connected component of any refinement level, (v) a discrete composite projection for synchronizing multiple levels, and (vi) geometric multigrid algorithms for solving linear systems with optimal complexity. Different from current block-structured AMR, our method never applies the fine-to-coarse averaging to projected velocities. Results of numerical tests demonstrate the high accuracy and efficiency of the proposed method.
- Open Access
A linear MARS method for three-dimensional interface tracking
For explicit interface tracking in three dimensions, we propose a linear MARS method that (a) represents the interface by a partially ordered set of glued surfaces and approximates each glued surface with a triangular mesh, (b) maintains an $(r,h,θ)$-regularity on each triangular mesh so that the distance between any pair of adjacent markers is within the range $[rh,h]$ and no angle in any triangle is less than $θ$, (c) applies to three-dimensional continua with arbitrarily complex topology and geometry, (d) preserves topological structures and geometric features of moving phases under diffeomorphic and isometric flow maps, and (e) achieves second-order and third-order accuracy in terms of the Lagrangian and Eulerian length scales, respectively. Results of classic benchmark tests verify the effectiveness of the novel mesh adjustment algorithms in enforcing the $(r,h,θ)$-regularity and demonstrate the high accuracy and efficiency of the proposed linear MARS method.Open AccessA linear MARS method for three-dimensional interface tracking
For explicit interface tracking in three dimensions, we propose a linear MARS method that (a) represents the interface by a partially ordered set of glued surfaces and approximates each glued surface with a triangular mesh, (b) maintains an $(r,h,θ)$-regularity on each triangular mesh so that the distance between any pair of adjacent markers is within the range $[rh,h]$ and no angle in any triangle is less than $θ$, (c) applies to three-dimensional continua with arbitrarily complex topology and geometry, (d) preserves topological structures and geometric features of moving phases under diffeomorphic and isometric flow maps, and (e) achieves second-order and third-order accuracy in terms of the Lagrangian and Eulerian length scales, respectively. Results of classic benchmark tests verify the effectiveness of the novel mesh adjustment algorithms in enforcing the $(r,h,θ)$-regularity and demonstrate the high accuracy and efficiency of the proposed linear MARS method. - Open Access
- 26 November 2025
- Published by Springer Nature in Nature
- Vol. 647 (8091) , 889-896
Slipknot-gauged mechanical transmission and robotic operation
Mechanical transmission is essential in force-related activities ranging from the daily tying of shoe laces1 to sophisticated surgical2 and robotic operations3,4. Modern machines and robots typically use complex electronic devices designed to sense and limit force5, some of which still face challenges when operating space is limited (for example, in minimally invasive surgeries)6 or when resources are scarce (for example, operations in remote areas without electricity). Here we describe an alternative slipknot-based mechanical transmission mechanism to control the intelligent operation of both human and robotic systems. Through topological design, slipknot tying and release can encode and deliver force with a consistency of 95.4% in repeating operations, which circumvents the need for additional sensors and controllers. When applied to surgical repair, this mechanism helped inexperienced surgeons to improve their knotting-force precision by 121%, enabling them to perform surgical knots as good as those of experienced surgeons. Moreover, blood supply and tissue healing after surgery were improved. The mechano-intelligence exhibited in slipknots may inspire investigations of knotted structures across multiple length scales. This slipknot-gauged mechanical transmission strategy can be widely deployed, opening up opportunities for resource-limited healthcare, science education and field exploration.
- 26 November 2025
- Published by Springer Nature in Nature
- Vol. 647 (8091) , 889-896
Open AccessSlipknot-gauged mechanical transmission and robotic operation
Mechanical transmission is essential in force-related activities ranging from the daily tying of shoe laces1 to sophisticated surgical2 and robotic operations3,4. Modern machines and robots typically use complex electronic devices designed to sense and limit force5, some of which still face challenges when operating space is limited (for example, in minimally invasive surgeries)6 or when resources are scarce (for example, operations in remote areas without electricity). Here we describe an alternative slipknot-based mechanical transmission mechanism to control the intelligent operation of both human and robotic systems. Through topological design, slipknot tying and release can encode and deliver force with a consistency of 95.4% in repeating operations, which circumvents the need for additional sensors and controllers. When applied to surgical repair, this mechanism helped inexperienced surgeons to improve their knotting-force precision by 121%, enabling them to perform surgical knots as good as those of experienced surgeons. Moreover, blood supply and tissue healing after surgery were improved. The mechano-intelligence exhibited in slipknots may inspire investigations of knotted structures across multiple length scales. This slipknot-gauged mechanical transmission strategy can be widely deployed, opening up opportunities for resource-limited healthcare, science education and field exploration.
- 22 October 2025
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 105 (2) , 1-36
GePUP-ES: High-order Energy-stable Projection Methods for Incompressible Navier-Stokes Equations with No-slip Conditions
- 22 October 2025
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 105 (2) , 1-36
GePUP-ES: High-order Energy-stable Projection Methods for Incompressible Navier-Stokes Equations with No-slip Conditions
- Open Access
On Convergence of the Secant Method
The secant method, as an important approach for solving nonlinear equations, is introduced in nearly all numerical analysis textbooks. However, most textbooks only briefly address the Q-order of convergence of this method, with few providing rigorous mathematical proofs. This paper establishes a rigorous proof for the Q-order of convergence of the secant method and theoretically compares its computational efficiency with that of Newton's method.
Open AccessOn Convergence of the Secant Method
The secant method, as an important approach for solving nonlinear equations, is introduced in nearly all numerical analysis textbooks. However, most textbooks only briefly address the Q-order of convergence of this method, with few providing rigorous mathematical proofs. This paper establishes a rigorous proof for the Q-order of convergence of the secant method and theoretically compares its computational efficiency with that of Newton's method.
- 26 September 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 47 (5) , A2722-A2745
Fourth- and Higher-Order Semi-Lagrangian Finite Volume Methods for the Two-Dimensional Advection Equation on Arbitrarily Complex Domains
To numerically solve the two-dimensional advection equation, we propose a family of fourth- and higher-order semi-Lagrangian finite volume (SLFV) methods that feature (1) fourth-, sixth-, and eighth-order convergence rates, (2) applicability to both regular and irregular domains with arbitrarily complex topology and geometry, (3) ease of handling both zero and nonzero source terms, and (4) the same algorithmic steps for both periodic and incoming penetration conditions. Test results confirm the analysis and demonstrate the accuracy, flexibility, robustness, and excellent conditioning of the proposed SLFV method.
- 26 September 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 47 (5) , A2722-A2745
Fourth- and Higher-Order Semi-Lagrangian Finite Volume Methods for the Two-Dimensional Advection Equation on Arbitrarily Complex Domains
To numerically solve the two-dimensional advection equation, we propose a family of fourth- and higher-order semi-Lagrangian finite volume (SLFV) methods that feature (1) fourth-, sixth-, and eighth-order convergence rates, (2) applicability to both regular and irregular domains with arbitrarily complex topology and geometry, (3) ease of handling both zero and nonzero source terms, and (4) the same algorithmic steps for both periodic and incoming penetration conditions. Test results confirm the analysis and demonstrate the accuracy, flexibility, robustness, and excellent conditioning of the proposed SLFV method.
- Open Access
Fourth- and Higher-Order Semi-Lagrangian Finite Volume Methods for the Two-dimensional Advection Equation on Arbitrarily Complex Domains
To numerically solve the two-dimensional advection equation, we propose a family of fourth- and higher-order semi-Lagrangian finite volume (SLFV) methods that feature (1) fourth-, sixth-, and eighth-order convergence rates, (2) applicability to both regular and irregular domains with arbitrarily complex topology and geometry, (3) ease of handling both zero and nonzero source terms, and (4) the same algorithmic steps for both periodic and incoming penetration conditions. Test results confirm the analysis and demonstrate the accuracy, flexibility, robustness, and excellent conditioning of the proposed SLFV method.
Open AccessFourth- and Higher-Order Semi-Lagrangian Finite Volume Methods for the Two-dimensional Advection Equation on Arbitrarily Complex Domains
To numerically solve the two-dimensional advection equation, we propose a family of fourth- and higher-order semi-Lagrangian finite volume (SLFV) methods that feature (1) fourth-, sixth-, and eighth-order convergence rates, (2) applicability to both regular and irregular domains with arbitrarily complex topology and geometry, (3) ease of handling both zero and nonzero source terms, and (4) the same algorithmic steps for both periodic and incoming penetration conditions. Test results confirm the analysis and demonstrate the accuracy, flexibility, robustness, and excellent conditioning of the proposed SLFV method.
- Open Access
Fourth- and higher-order finite element methods for the incompressible Navier-Stokes equations with Dirichlet boundary conditions
Inspired by the unconstrained pressure Poisson equation (PPE) formulation [Liu, Liu, \& Pego, Comm. Pure Appl. Math. 60 (2007): 1443-1487], we previously proposed the generic projection and unconstrained PPE (GePUP) formulation [Zhang, J. Sci. Comput. 67 (2016): 1134-1180] for numerically solving the incompressible Navier-Stokes equations (INSE) with no-slip boundary conditions. In GePUP, the main evolutionary variable does not have to be solenoidal with its divergence controlled by a heat equation. This work presents high-order finite-element solvers for the INSE under the framework of method-of-lines. Continuous Lagrange finite elements of equal order are utilized for the velocity and pressure finite element spaces to discretize the weak form of GePUP in space, while high-order implicit-explicit Runge-Kutta methods are then employed to treat the stiff diffusion term implicitly and the other terms explicitly. Due to the implicit treatment of the diffusion term, the time step size is only restricted by convection. The solver is efficient in that advancing the solution at each time step only involves solving a sequence of linear systems either on the velocity or on the pressure with geometric multigrid methods. Furthermore, the solver is enhanced with adaptive mesh refinement so that the multiple length scales and time scales in flows at moderate or high Reynolds numbers can be efficiently resolved. Numerical tests with various Reynolds numbers are performed for the single-vortex test, the lid-driven cavity, and the flow past a cylinder/sphere, demonstrating the high-order accuracy of GePUP-FEM both in time and in space and its capability of accurately and efficiently capturing the right physics. Moreover, our solver offers the flexibility in choosing velocity and pressure finite element spaces and is free of the standard inf-sup condition.
Open AccessFourth- and higher-order finite element methods for the incompressible Navier-Stokes equations with Dirichlet boundary conditions
Inspired by the unconstrained pressure Poisson equation (PPE) formulation [Liu, Liu, \& Pego, Comm. Pure Appl. Math. 60 (2007): 1443-1487], we previously proposed the generic projection and unconstrained PPE (GePUP) formulation [Zhang, J. Sci. Comput. 67 (2016): 1134-1180] for numerically solving the incompressible Navier-Stokes equations (INSE) with no-slip boundary conditions. In GePUP, the main evolutionary variable does not have to be solenoidal with its divergence controlled by a heat equation. This work presents high-order finite-element solvers for the INSE under the framework of method-of-lines. Continuous Lagrange finite elements of equal order are utilized for the velocity and pressure finite element spaces to discretize the weak form of GePUP in space, while high-order implicit-explicit Runge-Kutta methods are then employed to treat the stiff diffusion term implicitly and the other terms explicitly. Due to the implicit treatment of the diffusion term, the time step size is only restricted by convection. The solver is efficient in that advancing the solution at each time step only involves solving a sequence of linear systems either on the velocity or on the pressure with geometric multigrid methods. Furthermore, the solver is enhanced with adaptive mesh refinement so that the multiple length scales and time scales in flows at moderate or high Reynolds numbers can be efficiently resolved. Numerical tests with various Reynolds numbers are performed for the single-vortex test, the lid-driven cavity, and the flow past a cylinder/sphere, demonstrating the high-order accuracy of GePUP-FEM both in time and in space and its capability of accurately and efficiently capturing the right physics. Moreover, our solver offers the flexibility in choosing velocity and pressure finite element spaces and is free of the standard inf-sup condition.