2013
DOI: 10.5540/tema.2013.014.03.0319
|View full text |Cite
|
Sign up to set email alerts
|

Formulações Semi-Discretas para a Equação 1D de Burgers

Abstract: RESUMO.Neste trabalho fizemos comparações entre formulações semi-discretas para a obtenção de soluções numéricas para a equação 1D de Burgers. As formulações consistem em discretizar o domínio temporal via métodos implícitos multi-estágios de segunda e quarta ordem: aproximantes de Padé R 11 e R 22 ; e o domínio espacial via métodos de elementos finitos: mínimos quadrados (MEFMQ), Galerkin (MEFG) e Streamline-Upwind Petrov-Galerkin (SUPG). Conhecendo as soluções analíticas da equação 1D de Burgues, para difere… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 17 publications
(48 reference statements)
0
1
0
Order By: Relevance
“…Note that the resolution of the complex linear system can be performed by other procedures, such as Cholesky decomposition, conjugate gradient, tridiagonal matrix algorithm (TDMA), modified strongly implicit procedure (MSI), among others. We chose the Relaxation Gauss-Seidel method because of its mathematical simplicity and easy computational implementation ( Smith, 2004;Sperandio, Mendes, & Monken, 2006;Romeiro, Castro, Cirilo, & Natti, 2011;Ferreira et al, 2012;Pardo, Natti, Romeiro, & Cirilo, 2011;Ladeia, Romeiro, Natti, & Cirilo, 2013;Saita et al, 2017;Romeiro, Mangili, Costanzi, Cirilo, & Natti, 2017;Cirilo, Barba, Romeiro, & Natti, 2018;Cirilo, Petrovskii, Romeiro, & Natti, 2019;Agrawal, 2019). We show that our procedure converges.…”
Section: Numerical Model For the Propagation Of Solitons In Optical Fibersmentioning
confidence: 99%
“…Note that the resolution of the complex linear system can be performed by other procedures, such as Cholesky decomposition, conjugate gradient, tridiagonal matrix algorithm (TDMA), modified strongly implicit procedure (MSI), among others. We chose the Relaxation Gauss-Seidel method because of its mathematical simplicity and easy computational implementation ( Smith, 2004;Sperandio, Mendes, & Monken, 2006;Romeiro, Castro, Cirilo, & Natti, 2011;Ferreira et al, 2012;Pardo, Natti, Romeiro, & Cirilo, 2011;Ladeia, Romeiro, Natti, & Cirilo, 2013;Saita et al, 2017;Romeiro, Mangili, Costanzi, Cirilo, & Natti, 2017;Cirilo, Barba, Romeiro, & Natti, 2018;Cirilo, Petrovskii, Romeiro, & Natti, 2019;Agrawal, 2019). We show that our procedure converges.…”
Section: Numerical Model For the Propagation Of Solitons In Optical Fibersmentioning
confidence: 99%