The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2016
DOI: 10.1016/j.physd.2016.01.005
|View full text |Cite
|
Sign up to set email alerts
|

Rigorous numerics for NLS: Bound states, spectra, and controllability

Abstract: In this paper it is demonstrated how rigorous numerics may be applied to the one-dimensional nonlinear Schrödinger equation (NLS); specifically, to determining bound-state solutions and establishing certain spectral properties of the linearization. Since the results are rigorous, they can be used to complete a recent analytical proof [6] of the local exact controllability of NLS.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2016
2016
2019
2019

Publication Types

Select...
7

Relationship

3
4

Authors

Journals

citations
Cited by 12 publications
(13 citation statements)
references
References 32 publications
(36 reference statements)
0
13
0
Order By: Relevance
“…Proof. Given the three numerical approximations at λ ∈ {0.1446, 0.2346, 1.0846}, for each of the corresponding numerical approximations, the MATLAB script script proof theorem 1.m computes the coefficients Y , Z 0 , Z 1 and Z 2 given respectively by (20), (21), (27) and (28) and it verifies with INTLAB (interval arithmetic in MATLAB) the existence of an interval I = (r min , r max ) such that for each r ∈ I, p(r) < 0, with p(r) the radii polynomial as defined in (18). By Lemma 3.5, there exists a uniquex ∈ B r (x) such that f (x) = 0, with f given component-wise in (10).…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…Proof. Given the three numerical approximations at λ ∈ {0.1446, 0.2346, 1.0846}, for each of the corresponding numerical approximations, the MATLAB script script proof theorem 1.m computes the coefficients Y , Z 0 , Z 1 and Z 2 given respectively by (20), (21), (27) and (28) and it verifies with INTLAB (interval arithmetic in MATLAB) the existence of an interval I = (r min , r max ) such that for each r ∈ I, p(r) < 0, with p(r) the radii polynomial as defined in (18). By Lemma 3.5, there exists a uniquex ∈ B r (x) such that f (x) = 0, with f given component-wise in (10).…”
Section: Resultsmentioning
confidence: 99%
“…Combining the bounds Y , Z 0 , Z 1 and Z 2 given respectively by (20), (21), (27) and (28), we have explicitly constructed the radii polynomial p(r) as defined in (18).…”
Section: Computation Of Zmentioning
confidence: 99%
See 1 more Smart Citation
“…The radii polynomial approach has been applied to a host of problems in differential equations/dynamical systems theory including the study of initial value problems [8], equilibrium solutions of partial differential equations [2,9,10], periodic solutions of ordinary, delay and partial differential equations [1,11,12,13], stable/unstable invariant manifolds for differential equations [14], solutions of boundary value problems [15], eigenvalue/eigenfunction problems [16], connecting orbit problems for differential equations [17,18], and standing wave patterns [19].…”
Section: Computer-assisted Proofs and The Radii Polynomial Approachmentioning
confidence: 99%
“…For example equilibria and periodic orbits of ordinary, delay, partial differential equations (PDEs) as well as systems of PDEs are considered in [10,11,12,13,14,15,16,17]. The same approach is applied in order to validate transverse connecting orbits for ordinary differential equations in [18,19,20], to study symmetric pulses, kinks and radially symmetric solutions in reaction diffusion equations [21,22], to solve initial and boundary value problems for ordinary differential equations in a mathematically rigorous way [19,23], and to validate series expansions for the Floquet normal form for linear differential equations with periodic coefficients. This leads to methods for validated computations of the linear stable and unstable bundles of periodic orbits in differential equations [24].…”
Section: Introductionmentioning
confidence: 99%