default search action
Ngoc Tien Tran
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Dietmar Gallistl
, Ngoc Tien Tran:
Stability and guaranteed error control of approximations to the Monge-Ampère equation. Numerische Mathematik 156(1): 107-131 (2024) - [j7]Carsten Carstensen, Benedikt Gräßle, Ngoc Tien Tran:
Adaptive hybrid high-order method for guaranteed lower eigenvalue bounds. Numerische Mathematik 156(3): 813-851 (2024) - [j6]Ngoc Tien Tran
Discrete Weak Duality of Hybrid High-Order Methods for Convex Minimization Problems. SIAM J. Numer. Anal. 62(4): 1492-1514 (2024) - [i10]Carsten Carstensen, Benedikt Gräßle, Ngoc Tien Tran:
Adaptive hybrid high-order method for guaranteed lower eigenvalue bounds. CoRR abs/2404.01228 (2024) - [i9]Carsten Carstensen, Ngoc Tien Tran:
Locking-free hybrid high-order method for linear elasticity. CoRR abs/2404.02768 (2024) - [i8]Ngoc Tien Tran:
Lower eigenvalue bounds with hybrid high-order methods. CoRR abs/2406.06244 (2024) - 2023
- [j5]Van-Truong Nguyen
An Improvement of the Camshift Human Tracking Algorithm Based on Deep Learning and the Kalman Filter. J. Robotics 2023: 5525744:1-5525744:12 (2023) - [j4]Dietmar Gallistl
Convergence of a regularized finite element discretization of the two-dimensional Monge-Ampère equation. Math. Comput. 92(342): 1467-1490 (2023) - [j3]Fleurianne Bertrand
Stabilization-free HHO a posteriori error control. Numerische Mathematik 154(3-4): 369-408 (2023) - [i7]Dietmar Gallistl, Ngoc Tien Tran
Stability and guaranteed error control of approximations to the Monge-Ampère equation. CoRR abs/2301.06805 (2023) - [i6]Ngoc Tien Tran
Finite element approximation for uniformly elliptic linear PDE of second order in nondivergence form. CoRR abs/2302.04202 (2023) - [i5]Ngoc Tien Tran:
Discrete weak duality of hybrid high-order methods for convex minimization problems. CoRR abs/2308.03223 (2023) - 2022
- [j2]Carsten Carstensen, Ngoc Tien Tran
Convergent adaptive hybrid higher-order schemes for convex minimization. Numerische Mathematik 151(2): 329-367 (2022) - [i4]Fleurianne Bertrand, Carsten Carstensen, Benedikt Gräßle, Ngoc Tien Tran
Stabilization-free HHO a posteriori error control. CoRR abs/2207.01038 (2022) - 2021
- [j1]Carsten Carstensen, Ngoc Tien Tran
Unstabilized Hybrid High-order Method for a Class of Degenerate Convex Minimization Problems. SIAM J. Numer. Anal. 59(3): 1348-1373 (2021) - [i3]Carsten Carstensen, Ngoc Tien Tran:
Convergent adaptive hybrid higher-order schemes for convex minimization. CoRR abs/2111.01181 (2021) - [i2]Dietmar Gallistl, Ngoc Tien Tran:
Convergence of a regularized finite element discretization of the two-dimensional Monge-Ampère equation. CoRR abs/2112.10711 (2021) - 2020
- [i1]Carsten Carstensen, Ngoc Tien Tran:
Unstabilized Hybrid High-Order method for a class of degenerate convex minimization problems. CoRR abs/2011.15059 (2020)
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-07 21:20 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: