An efficient upwind relaxation–sweeping algorithm for three-dimensional euler equations

Ge Cheng Zha; Dao Zhi Liu

doi:10.2514/6.1990-129

An efficient upwind relaxation–sweeping algorithm for three-dimensional euler equations

Research output: Contribution to conference › Paper › peer-review

Abstract

An efficient finite—volume algorithm for three—dimensional Euler equations is presented. The spacial discretization is based on Van Leer's flux vector splitting. The flow field is analyzed by alternating sweeping in the spanwise direction and local Gauss-Seidel iteration on each vertical streamwise plane. Very large time step can be obtained since no factorization error is introduced and it leads to very rapid convergence rate. The memory resources are greatly saved since the Jacobians, the residual R and the δUⁿ⁺¹ are stored only in one iterating plane. Two internal transonic flows are calculated to show the efficiency and accuracy.

Original language	English (US)
DOIs	https://doi.org/10.2514/6.1990-129
State	Published - 1990
Externally published	Yes
Event	28th Aerospace Sciences Meeting, 1990 - Reno, United States Duration: Jan 8 1990 → Jan 11 1990

Other

Other	28th Aerospace Sciences Meeting, 1990
Country	United States
City	Reno
Period	1/8/90 → 1/11/90

ASJC Scopus subject areas

Aerospace Engineering

Access to Document

10.2514/6.1990-129

Fingerprint Dive into the research topics of 'An efficient upwind relaxation–sweeping algorithm for three-dimensional euler equations'. Together they form a unique fingerprint.

Cite this

@conference{3110076a42a540e697f81d1ec45329ec,

title = "An efficient upwind relaxation–sweeping algorithm for three-dimensional euler equations",

abstract = "An efficient finite—volume algorithm for three—dimensional Euler equations is presented. The spacial discretization is based on Van Leer's flux vector splitting. The flow field is analyzed by alternating sweeping in the spanwise direction and local Gauss-Seidel iteration on each vertical streamwise plane. Very large time step can be obtained since no factorization error is introduced and it leads to very rapid convergence rate. The memory resources are greatly saved since the Jacobians, the residual R and the δUn+1 are stored only in one iterating plane. Two internal transonic flows are calculated to show the efficiency and accuracy.",

author = "Zha, {Ge Cheng} and Liu, {Dao Zhi}",

note = "Publisher Copyright: {\textcopyright} 1990 American institute of Aeronautics and Astronautics. Inc.; 28th Aerospace Sciences Meeting, 1990 ; Conference date: 08-01-1990 Through 11-01-1990",

year = "1990",

doi = "10.2514/6.1990-129",

language = "English (US)",

}

TY - CONF

T1 - An efficient upwind relaxation–sweeping algorithm for three-dimensional euler equations

AU - Zha, Ge Cheng

AU - Liu, Dao Zhi

PY - 1990

Y1 - 1990

N2 - An efficient finite—volume algorithm for three—dimensional Euler equations is presented. The spacial discretization is based on Van Leer's flux vector splitting. The flow field is analyzed by alternating sweeping in the spanwise direction and local Gauss-Seidel iteration on each vertical streamwise plane. Very large time step can be obtained since no factorization error is introduced and it leads to very rapid convergence rate. The memory resources are greatly saved since the Jacobians, the residual R and the δUn+1 are stored only in one iterating plane. Two internal transonic flows are calculated to show the efficiency and accuracy.

AB - An efficient finite—volume algorithm for three—dimensional Euler equations is presented. The spacial discretization is based on Van Leer's flux vector splitting. The flow field is analyzed by alternating sweeping in the spanwise direction and local Gauss-Seidel iteration on each vertical streamwise plane. Very large time step can be obtained since no factorization error is introduced and it leads to very rapid convergence rate. The memory resources are greatly saved since the Jacobians, the residual R and the δUn+1 are stored only in one iterating plane. Two internal transonic flows are calculated to show the efficiency and accuracy.

UR - http://www.scopus.com/inward/record.url?scp=85003441340&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85003441340&partnerID=8YFLogxK

U2 - 10.2514/6.1990-129

DO - 10.2514/6.1990-129

M3 - Paper

AN - SCOPUS:85003441340

T2 - 28th Aerospace Sciences Meeting, 1990

Y2 - 8 January 1990 through 11 January 1990

ER -

An efficient upwind relaxation–sweeping algorithm for three-dimensional euler equations

Abstract

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this