- Main
Computing the weak limit of KdV
Published Web Location
https://doi.org/10.1002/cpa.3160471003Abstract
The solution of the KdV equation with single‐minimum initial data has a zero‐dispersion limit characterized by Lax and Levermore as the solution of an infinite‐dimensional constrained quadratic minimization problem. An adaptive numerical method for computing the weak limit from this characterization is constructed and validated. The method is then used to study the weak limit. Initial simple experiments confirm theoretical predictions, while experiments with more complicated data display multiphase behavior considerably beyond the scope of current theoretical analyses. The method computes accurate weak limits with multiphase structures sufficiently complex to provide useful test cases for the calibration of numerical averaging algorithms. © 1994 John Wiley & Sons, Inc. Copyright © 1994 Wiley Periodicals, Inc., A Wiley Company
Many UC-authored scholarly publications are freely available on this site because of the UC's open access policies. Let us know how this access is important for you.
Main Content
Enter the password to open this PDF file:
-
-
-
-
-
-
-
-
-
-
-
-
-
-