Equivalence Between DFR Method and LDG Method for Solving Linear Third-Order KdV Equation

The equivalence between direct flux reconstruction method and local discontinuous Galerkin method in solving linear third-order KdV equation is studied. Firstly, the linear third-order KdV equation is spatially dispersed by DFR method and LDG method respectively, and the spatial discretization schemes of two numerical algorithms are given. Secondly, the equivalence of DFR and LDG methods is proved by two methods. The first proof relies on the property of Gauss quadrature: the M-point Gauss quadrature has 2M - 1 order algebraic accuracy; the second proof takes advantage of the special property of the Lobatto polynomial : the zeros of the derivative of Lobatto polynomial of degree M + 1 are M Gauss points. At last, taking the value of M to be 1 as an example, it is shown that the two numerical algorithms are equivalent to the ordinary differential equations used for programming when solving the linear third-order KdV equation.

Institutions

Publication Details

Journal
SHILAP Revista de lepidopterología
Published
2024-10-01
DOI
https://doi.org/10.15938/j.jhust.2024.05.016
Primary Topic
Paleontology and Stratigraphy of Fossils
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Equivalence Between DFR Method and LDG Method for Solving Linear Third-Order KdV Equation

SHILAP Revista de lepidopterología
Paleontology and Stratigraphy of Fossils
article

Equivalence Between DFR Method and LDG Method for Solving Linear Third-Order KdV Equation

article en

Abstract

The equivalence between direct flux reconstruction method and local discontinuous Galerkin method in solving linear third-order KdV equation is studied. Firstly, the linear third-order KdV equation is spatially dispersed by DFR method and LDG method respectively, and the spatial discretization schemes of two numerical algorithms are given. Secondly, the equivalence of DFR and LDG methods is proved by two methods. The first proof relies on the property of Gauss quadrature: the M-point Gauss quadrature has 2M - 1 order algebraic accuracy; the second proof takes advantage of the special property of the Lobatto polynomial : the zeros of the derivative of Lobatto polynomial of degree M + 1 are M Gauss points. At last, taking the value of M to be 1 as an example, it is shown that the two numerical algorithms are equivalent to the ordinary differential equations used for programming when solving the linear third-order KdV equation.

SHILAP Revista de lepidopterología
Harbin University of Science and Technology (CN), Harbin University (CN)
Openalex Percentile: Top 68%
Paleontology and Stratigraphy of Fossils
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.