Zaloguj się

Gotowe bibliografie tematyczne / Inviscid Compressible Fluid Flows

Spis treści

Rozprawy doktorskie

Gotowa bibliografia na temat „Inviscid Compressible Fluid Flows”

Autor: Grafiati

Data publikacji: 6 września 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Inviscid Compressible Fluid Flows”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Rozprawy doktorskie na temat "Inviscid Compressible Fluid Flows"

1

Akargun, Yigit Hayri. "Least-squares Finite Element Solution Of Euler Equations With Adaptive Mesh Refinement." Master's thesis, METU, 2012. http://etd.lib.metu.edu.tr/upload/12614138/index.pdf.

Pełny tekst źródła

Streszczenie:

Least-squares finite element method (LSFEM) is employed to simulate 2-D and axisymmetric flows governed by the compressible Euler equations. Least-squares formulation brings many advantages over classical Galerkin finite element methods. For non-self-adjoint systems, LSFEM result in symmetric positive-definite matrices which can be solved efficiently by iterative methods. Additionally, with a unified formulation it can work in all flight regimes from subsonic to supersonic. Another advantage is that, the method does not require artificial viscosity since it is naturally diffusive which also ap

Style APA, Harvard, Vancouver, ISO itp.

2

Amoignon, Olivier. "Numerical Methods for Aerodynamic Shape Optimization." Doctoral thesis, Uppsala : Acta Universitatis Upsaliensis : Univ.-bibl. [distributör], 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-6252.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Holder, Justin. "Fluid Structure Interaction in Compressible Flows." University of Cincinnati / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ucin159584692691518.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Tota, Prasad Venkateshwara. "Meshless Euler solver using radial basis functions for solving inviscid compressible flows." [Ames, Iowa : Iowa State University], 2006.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Cole, Jeffrey William. "Hydrodynamic stability of compressible boundary layer flows." Thesis, University of Exeter, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.282650.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Zuppel, Eddy. "A numerical method for compressible viscous fluid flows /." Thesis, McGill University, 2004. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=80158.

Pełny tekst źródła

Streszczenie:

The steady two-dimensional compressible Navier-Stokes equations are solved using an iterative pseudo-time relaxation technique. An implicit first-order accurate Euler scheme is implemented after augmenting the steady governing equations by pseudo-time derivative terms, including artificial compressibility in the continuity equation and preconditioning in the energy equation. These augmented equations are modified by lagging certain flow variables in pseudo-time and by applying approximate factorization and an alternating direction implicit (ADI) method to split the solution procedure in

Style APA, Harvard, Vancouver, ISO itp.

7

Rudgyard, Michael A. "Cell vertex methods for compressible gas flows." Thesis, University of Oxford, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.279991.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

Nejat, Amir. "A higher-order accurate unstructured finite volume Newton-Krylov algorithm for inviscid compressible flows." Thesis, University of British Columbia, 2007. http://hdl.handle.net/2429/30969.

Pełny tekst źródła

Streszczenie:

A fast implicit (Newton-Krylov) finite volume algorithm is developed for higher-order unstructured (cell-centered) steady-state computation of inviscid compressible flows (Euler equations). The matrix-free General Minimal Residual (GMRES) algorithm is used for solving the linear system arising from implicit discretization of the governing equations, avoiding expensive and complicated explicit computation of the higher-order Jacobian matrix. An Incomplete Lower-Upper factorization technique is employed as the preconditioning strategy and a first-order Jacobian as a preconditioning matrix. The s

Style APA, Harvard, Vancouver, ISO itp.

9

Michalak, Christopher. "Efficient high-order accurate unstructured finite-volume algorithms for viscous and inviscid compressible flows." Thesis, University of British Columbia, 2009. http://hdl.handle.net/2429/7094.

Pełny tekst źródła

Streszczenie:

High-order accurate methods have the potential to dramatically reduce the computational time needed for aerodynamics simulations. This thesis studies the discretization and efficient convergence to steady state of the high-order accurate finite-volume method applied to the simplified problem of inviscid and laminar viscous two-dimensional flow equations. Each of the three manuscript chapters addresses a specific problem or limitation previously experienced with these schemes. The first manuscript addresses the absence of a method to maintain monotonicity of the solution at discontinuities whil

Style APA, Harvard, Vancouver, ISO itp.

10

Slack, David Christopher. "The development of solution algorithms for compressible flows." Diss., This resource online, 1991. http://scholar.lib.vt.edu/theses/available/etd-07282008-134254/.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!