Skip to Main content Skip to Navigation
Journal articles

A priori reduction method for solving the two-dimensional Burgers' equations

Abstract : The two-dimensional Burgers' equations are solved here using the A Priori Reduction method. This method is based on an iterative procedure which consists in building a basis for the solution where at each iteration the basis is improved. The method is called a priori because it does not need any prior knowledge of the solution, which is not the case if the standard Karhunen-Loéve decomposition is used. The accuracy of the APR method is compared with the standard Newton-Raphson scheme and with results from the literature. The APR basis is also compared with the Karhunen-Loéve basis.
Document type :
Journal articles
Complete list of metadatas

https://hal-mines-paristech.archives-ouvertes.fr/hal-00585095
Contributor : Bibliothèque Umr7633 <>
Submitted on : Monday, April 11, 2011 - 4:55:31 PM
Last modification on : Thursday, September 24, 2020 - 6:30:07 PM

Identifiers

Citation

Cyrille Allery, Aziz Hamdouni, David Ryckelynck, N. Verdon. A priori reduction method for solving the two-dimensional Burgers' equations. Applied Mathematics and Computation, Elsevier, 2011, 217, pp.6671-6679. ⟨10.1016/j.amc.2011.01.065⟩. ⟨hal-00585095⟩

Share

Metrics

Record views

282