2020
DOI: 10.1515/ijnsns-2019-0055
|View full text |Cite
|
Sign up to set email alerts
|

A multivariate spectral quasi-linearization method for the solution of (2+1) dimensional Burgers’ equations

Abstract: In this paper, we introduce the multi-variate spectral quasi-linearization method which is an extension of the previously reported bivariate spectral quasi-linearization method. The method is a combination of quasi-linearization techniques and the spectral collocation method to solve three-dimensional partial differential equations. We test its applicability on the (2 + 1) dimensional Burgers’ equations. We apply the spectral collocation method to discretize both space variables as well as the time variable. T… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
7
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(7 citation statements)
references
References 18 publications
0
7
0
Order By: Relevance
“…From the inspection of Table 3, we observe that for each method, both the computational time and condition number increase with time, T but with small values recorded for the MV-SLQLM. The present results suggest that employing the LLM to decouple the quasilinearized equations saves more on computational time than solving it as a compact matrix system of quasilinearized equations (see [72,84]). Furthermore, in agreement with Hidayat et al [49], Table 3 shows that low computational effort of collocation is indeed guaranteed for schemes with Kronecker delta properties.…”
Section: Numerical Simulations and Discussionmentioning
confidence: 77%
See 4 more Smart Citations
“…From the inspection of Table 3, we observe that for each method, both the computational time and condition number increase with time, T but with small values recorded for the MV-SLQLM. The present results suggest that employing the LLM to decouple the quasilinearized equations saves more on computational time than solving it as a compact matrix system of quasilinearized equations (see [72,84]). Furthermore, in agreement with Hidayat et al [49], Table 3 shows that low computational effort of collocation is indeed guaranteed for schemes with Kronecker delta properties.…”
Section: Numerical Simulations and Discussionmentioning
confidence: 77%
“…In Table 3, the numerical results based on running/CPU time and condition number of the coefficient matrices, obtained using the proposed method, are compared with those presented by the TV-SCM [84] and MV-SQLM [72] at two subinterval lengths ½0, T in t variable and using the same number of collocation points in the spatial and time domains.…”
Section: Numerical Simulations and Discussionmentioning
confidence: 99%
See 3 more Smart Citations