default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuangzhi Du
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j28]Jing Han, Guangzhi Du:
Two-grid stabilized finite element methods with backtracking for the stationary Navier-Stokes equations. Adv. Comput. Math. 50(4): 83 (2024)- [j27]Guangzhi Du, Liyun Zuo:
Two-grid parallel stabilized finite element method based on overlapping domain decomposition for the Stokes problem. Comput. Math. Appl. 155: 91-96 (2024) - [j26]Guangzhi Du:
A two grid partition of unity finite element method for electrically conducting incompressible fluid flows. Comput. Math. Appl. 156: 121-128 (2024) - [j25]Jing Han, Guangzhi Du, Shilin Mi:
A parallel stabilized finite element method for the Navier-Stokes problem. Comput. Math. Appl. 170: 33-41 (2024) - [j24]Guangzhi Du, Liyun Zuo:
Improved parallel finite element methods for the stationary Navier-Stokes problem. Numer. Algorithms 97(3): 1383-1396 (2024) - 2023
- [j23]Guangzhi Du, Yao Rong, Liyun Zuo:
Numerical analysis of two-grid decoupled finite element algorithm for a coupled Darcy/Darcy fracture model. Appl. Math. Lett. 138: 108520 (2023) - [j22]Shilin Mi, Guangzhi Du:
A two-grid method with backtracking for Magnetohydrodynamic equations with low electromagnetic Reynolds number. Appl. Math. Lett. 141: 108614 (2023) - [j21]Xinhui Wang, Guangzhi Du:
Local and parallel stabilized finite element methods based on two-grid discretizations for the Stokes equations. Numer. Algorithms 93(1): 67-83 (2023) - [j20]Xinhui Wang, Guangzhi Du, Yi Li:
A modified local and parallel finite element method for the coupled Stokes-Darcy model with the Beavers-Joseph interface condition. Numer. Algorithms 93(2): 815-831 (2023) - [j19]Shilin Mi, Guangzhi Du, Yao Rong:
Local and parallel finite element algorithms for magnetohydrodynamic flows with low electromagnetic Reynolds number. Numer. Algorithms 93(4): 1661-1683 (2023) - [j18]Guangzhi Du, Shilin Mi, Xinhui Wang:
Local and parallel finite element methods based on two-grid discretizations for the unsteady mixed Stokes-Darcy model with the Beavers-Joseph interface condition. Numer. Algorithms 94(4): 1883-1918 (2023) - [i1]Luling Cao, Jian Li, Zhangxin Chen, Guangzhi Du:
A Local Parallel Finite Element Method for Super-Hydrophobic Proppants in a Hydraulic Fracturing System Based on a 2D/3D Transient Triple-Porosity Navier-Stokes Model. CoRR abs/2311.05170 (2023) - 2022
- [j17]Liyun Zuo, Guangzhi Du:
A novel two-grid method for a fracture model. Appl. Math. Lett. 125: 107797 (2022) - [j16]Qingtao Li, Guangzhi Du:
Local and parallel finite element methods based on two-grid discretizations for a non-stationary coupled Stokes-Darcy model. Comput. Math. Appl. 113: 254-269 (2022) - [j15]Guangzhi Du, Liyun Zuo, Yuhong Zhang:
A New Local and Parallel Finite Element Method for the Coupled Stokes-Darcy Model. J. Sci. Comput. 90(1): 43 (2022) - [j14]Qingtao Li, Guangzhi Du:
Local and Parallel Finite Element Methods Based on Two-grid Discretizations for a Transient Coupled Navier-Stokes/Darcy Model. J. Sci. Comput. 92(3): 76 (2022) - [j13]Guangzhi Du, Liyun Zuo:
Local and parallel partition of unity scheme for the mixed Navier-Stokes-Darcy problem. Numer. Algorithms 91(2): 635-650 (2022) - 2021
- [j12]Xinhui Wang, Guangzhi Du, Liyun Zuo:
A novel local and parallel finite element method for the mixed Navier-Stokes-Darcy problem. Comput. Math. Appl. 90: 73-79 (2021) - [j11]Guangzhi Du, Liyun Zuo:
A two-grid method with backtracking for the mixed Stokes/Darcy model. J. Num. Math. 29(1): 39-46 (2021) - [j10]Guangzhi Du, Liyun Zuo:
Local and parallel finite element methods for the coupled Stokes/Darcy model. Numer. Algorithms 87(4): 1593-1611 (2021) - [j9]Qingtao Li, Guangzhi Du:
Local and parallel finite element methods based on two-grid discretizations for the nonstationary Navier-Stokes equations. Numer. Algorithms 88(4): 1915-1936 (2021) - 2020
- [j8]Guangzhi Du, Liyun Zuo:
A Parallel Iterative Finite Element Method for the Linear Elliptic Equations. J. Sci. Comput. 85(2): 35 (2020)
2010 – 2019
- 2019
- [j7]Guangzhi Du, Liyun Zuo:
A two-grid parallel partition of unity finite element scheme. Numer. Algorithms 80(2): 429-445 (2019) - 2018
- [j6]Liyun Zuo, Guangzhi Du:
A multi-grid technique for coupling fluid flow with porous media flow. Comput. Math. Appl. 75(11): 4012-4021 (2018) - [j5]Guangzhi Du, Liyun Zuo:
A Parallel Partition of Unity Scheme Based on Two-Grid Discretizations for the Navier-Stokes Problem. J. Sci. Comput. 75(3): 1445-1462 (2018) - [j4]Liyun Zuo, Guangzhi Du:
A parallel two-grid linearized method for the coupled Navier-Stokes-Darcy problem. Numer. Algorithms 77(1): 151-165 (2018) - 2017
- [j3]Guangzhi Du, Liyun Zuo:
Local and parallel finite element post-processing scheme for the Stokes problem. Comput. Math. Appl. 73(1): 129-140 (2017) - 2016
- [j2]Yanren Hou
, Guangzhi Du:
An expandable local and parallel two-grid finite element scheme. Comput. Math. Appl. 71(12): 2541-2556 (2016) - [j1]Guangzhi Du, Yanren Hou, Liyun Zuo:
Local and parallel finite element methods for the mixed Navier-Stokes/Darcy model. Int. J. Comput. Math. 93(7): 1155-1172 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
