Full metadata record
DC FieldValueLanguage
dc.contributor.authorChien, C. -S.en_US
dc.contributor.authorHuang, H. -T.en_US
dc.contributor.authorJeng, B. -W.en_US
dc.contributor.authorLi, Z. -C.en_US
dc.date.accessioned2014-12-08T15:12:14Z-
dc.date.available2014-12-08T15:12:14Z-
dc.date.issued2008-05-01en_US
dc.identifier.issn0377-0427en_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.cam.2007.03.017en_US
dc.identifier.urihttp://hdl.handle.net/11536/9405-
dc.description.abstractWe study efficient two-grid discretization schemes with two-loop continuation algorithms for computing wave functions of two-coupled nonlinear Schrodinger equations defined on the unit square and the unit disk. Both linear and quadratic approximations of the operator equations are exploited to derive the schemes. The centered difference approximations, the six-node triangular elements and the Adini elements are used to discretize the PDEs defined on the unit square. The proposed schemes also can compute stationary solutions of parameter-dependent reaction-diffusion systems. Our numerical results show that it is unnecessary to perform quadratic approximations. (c) 2007 Elsevier B.V. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectSchrodinger equationen_US
dc.subjecttwo-grid discretization schemesen_US
dc.subjectcontinuationen_US
dc.subjectAdini's elementsen_US
dc.titleTwo-grid discretization schemes for nonlinear Schrodinger equationsen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.cam.2007.03.017en_US
dc.identifier.journalJOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICSen_US
dc.citation.volume214en_US
dc.citation.issue2en_US
dc.citation.spage549en_US
dc.citation.epage571en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000254637700017-
dc.citation.woscount4-
Appears in Collections:Articles


Files in This Item:

  1. 000254637700017.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.