Multigrid and adaptive algorithm for solving the nonlinear schrodinger equation
✍ Scribed by Qianshun Chang; Goubin Wang
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 55 KB
- Volume
- 85
- Category
- Article
- ISSN
- 0021-9991
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The order of the matrices involved in several algebraic problems decreases during the solution process. In these cases, parallel algorithms which use adaptive solving block sizes offer better performance results than the ones obtained on parallel algorithms using traditional constant block sizes. Re
In this paper I prove a L p &L p estimate for the solutions to the one-dimensional Schro dinger equation with a potential in L 1 # where in the generic case #>3Â2 and in the exceptional case (i.e., when there is a half-bound state of zero energy) #>5Â2. I use this estimate to construct the scatterin
We study the δ-measure-like blowup of solutions to the pseudo-conformally invariant nonlinear Schrödinger equation For N = 1 or N ≥ 2 and u0 radially symmetric, we prove that if the blowup solution u(t) satisfies |u(t, x)| 2 dx u0 2 δ0(dx) in the sense of measures as t ↑ Tm (i.e., weakly \* in B ,