default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJirí Fürst
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j13]Jirí Holman
, Jirí Fürst:
Rotated-hybrid Riemann solver for all-speed flows. J. Comput. Appl. Math. 427: 115129 (2023)- 2021
- [j12]Jirí Holman, Jirí Fürst:
Numerical simulation of separation induced laminar to turbulent transition over an airfoil. J. Comput. Appl. Math. 394: 113530 (2021) - [j11]Jirí Fürst, Jan Halama, Vladimír Hric:
A pressure based solver for simulation of non-equilibrium wet steam flows. J. Comput. Appl. Math. 398: 113653 (2021)
2010 – 2019
- 2019
- [j10]Jirí Fürst, Zdenek Zák:
Numerical simulation of unsteady flows through a radial turbine. Adv. Comput. Math. 45(4): 1939-1952 (2019) - [j9]Jirí Holman, Jirí Fürst:
Coupling the algebraic model of bypass transition with EARSM model of turbulence. Adv. Comput. Math. 45(4): 1977-1992 (2019) - 2018
- [j8]Jaroslav Fort, Jirí Fürst, Jan Halama, Vladimír Hric, Petr Louda, Martin Luxa, David Simurda:
Numerical simulation of flow through cascade in wind tunnel test section and stand-alone configurations. Appl. Math. Comput. 319: 633-646 (2018) - 2015
- [j7]Jirí Fürst, Jaroslav Fort, Jan Halama, Jirí Holman, Jan Karel, Vladimír Prokop, David Trdlicka:
Numerical simulation of circumferentially averaged flow in a turbine. Appl. Math. Comput. 267: 498-505 (2015) - 2013
- [j6]Petr Louda, Petr Svácek, Jaroslav Fort, Jirí Fürst, Jan Halama, Karel Kozel:
Numerical simulation of turbine cascade flow with blade-fluid heat exchange. Appl. Math. Comput. 219(13): 7206-7214 (2013) - [j5]Jirí Fürst, Jaromír Príhoda, Petr Straka:
Numerical simulation of transitional flows. Computing 95(S1): 163-182 (2013) - [c2]Jirí Holman, Jirí Fürst:
Numerical Simulation of Compressible Turbulent Flows Using Modified EARSM Model. ENUMATH 2013: 677-687 - 2010
- [j4]Jan Halama, Jiri Dobes, Jaroslav Fort, Jirí Fürst, Karel Kozel:
Numerical modeling of unsteady flow in steam turbine stage. J. Comput. Appl. Math. 234(7): 2336-2341 (2010) - [j3]Petra Puncochárová-Porízková, Jirí Fürst, Jaromír Horácek, Karel Kozel:
Numerical solutions of unsteady flows with low inlet Mach numbers. Math. Comput. Simul. 80(8): 1795-1805 (2010)
2000 – 2009
- 2009
- [j2]Jirí Fürst, Karel Kozel, Petr Furmánek:
High Order Finite Volume Schemes for Numerical Solution of 2D and 3D Transonic Flows. Kybernetika 45(4): 567-579 (2009) - 2007
- [c1]Petra Puncochárová-Porízková, Jaromír Horácek, Karel Kozel, Jirí Fürst:
Numerical simulation of airflow through the oscillating glottis. MAVEBA 2007: 55-58 - 2002
- [j1]Jirí Fürst, Karel Kozel:
Application of Second Order TVD and WENO Schemes in Internal Aerodynamics. J. Sci. Comput. 17(1-4): 253-262 (2002)
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-08-02 20:17 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:
