default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarlos Lozano
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i8]Carlos Lozano, Jorge Ponsin:
Shock equations and jump conditions for the 2D Adjoint Euler equations. CoRR abs/2402.02894 (2024)- [i7]Carlos Lozano, Jorge Ponsin:
Explaining the Lack of Mesh Convergence of Inviscid Adjoint Solutions Near Solid Walls for Subcritical Flows. CoRR abs/2402.02897 (2024) - 2023
- [j8]Hiroyuki Miura
, Masashi Matsuoka, Juan C. Reyes, Nelson Pulido, Mitsufumi Hashimoto, Andrea C. Riaño, Alvaro Hurtado, Raul Rincon, Helber García, Carlos Lozano:
Quick Estimation Model for Mapping Earthquake Impacts in Bogotá, Colombia. ISPRS Int. J. Geo Inf. 12(12): 471 (2023) - [j7]Carlos Lozano, Jorge Ponsin:
Singularity and mesh divergence of inviscid adjoint solutions at solid walls. J. Comput. Phys. 489: 112256 (2023) - [i6]Carlos Lozano:
Entropy production by implicit Runge-Kutta schemes. CoRR abs/2311.12497 (2023) - [i5]Carlos Lozano:
Entropy and Adjoint Methods. CoRR abs/2311.12499 (2023) - [i4]Carlos Lozano:
Watch Your Adjoints! Lack of Mesh Convergence in Inviscid Adjoint Solutions. CoRR abs/2311.12504 (2023) - [i3]Carlos Lozano, Jorge Ponsin:
Exact inviscid drag adjoint solution for subcritical flows. CoRR abs/2311.12507 (2023) - 2022
- [i2]Carlos Lozano, Jorge Ponsin:
Analytic Adjoint Solutions for the 2D Incompressible Euler Equations Using the Green's Function Approach. CoRR abs/2201.08128 (2022) - [i1]Carlos Lozano, Jorge Ponsin:
Singularity and Mesh Divergence of Inviscid Adjoint Solutions at Solid Walls. CoRR abs/2201.08129 (2022) - 2021
- [j6]Stefano Bregni, Nury Gabriela Ramirez Cely, Fabrizio Granelli, Carlos Lozano, Octavia A. Dobre, Oscar M. Caicedo, Gidy Carolina Florez Navarro, Víctor P. Gil Jiménez, Gaurav Sharma, Matez Hribernik:
Global Communications Newsletter. IEEE Commun. Mag. 59(2): 5-8 (2021)
2010 – 2019
- 2019
- [j5]Carlos Lozano:
Entropy Production by Implicit Runge-Kutta Schemes. J. Sci. Comput. 79(3): 1832-1853 (2019) - [j4]Carlos Lozano:
Entropy and Adjoint Methods. J. Sci. Comput. 81(3): 2447-2483 (2019) - 2018
- [j3]Carlos Lozano:
Entropy Production by Explicit Runge-Kutta Schemes. J. Sci. Comput. 76(1): 521-564 (2018) - 2017
- [j2]Stefano Bregni, Carlos Lozano, Lianfeng Shen, Miroslav Skoric:
Global Communications Newsletter. IEEE Commun. Mag. 55(7): 7-10 (2017) - [j1]Carlos Lozano:
On mesh sensitivities and boundary formulas for discrete adjoint-based gradients in inviscid aerodynamic shape optimization. J. Comput. Phys. 346: 403-436 (2017)
2000 – 2009
- 2006
- [c1]Juan Francisco Díaz, Iván Javier Romero, Carlos Lozano:
Solving the Short Run Economic Dispatch Problem Using Concurrent Constraint Programming. IFIP PPAI 2006: 265-274
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 2025-01-21 00:00 CET 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:
