2002
DOI: 10.1006/jcph.2002.7047
|View full text |Cite
|
Sign up to set email alerts
|

A Fast Semi-Implicit Finite-Difference Method for the TDGL Equations

Abstract: We propose a finite-difference algorithm for solving the time-dependent GinzburgLandau (TDGL) equation coupled to the appropriate Maxwell equation. The time derivatives are discretized using a second-order semi-implicit scheme which, for intermediate values of the Ginzburg-Landau parameter , allows time steps two orders of magnitude larger than commonly used in explicit schemes. We demonstrate the use of the method by solving a fully three-dimensional problem of a current-carrying wire with longitudinal and tr… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
58
0
3

Year Published

2005
2005
2018
2018

Publication Types

Select...
10

Relationship

0
10

Authors

Journals

citations
Cited by 89 publications
(61 citation statements)
references
References 16 publications
0
58
0
3
Order By: Relevance
“…The semi-implicit algorithm was used [28] which provides an effective numerical solution of Eqs. 1(a,b) for the case of large κ values.…”
Section: Model Systemmentioning
confidence: 99%
“…The semi-implicit algorithm was used [28] which provides an effective numerical solution of Eqs. 1(a,b) for the case of large κ values.…”
Section: Model Systemmentioning
confidence: 99%
“…In addition, a Crank-Nicolson 1 algorithm established for solving the superfluid GrossPitaevskii equations 2 has been adapted for solving the timedependent Ginzburg-Landau equations, 3 which provides a further improvement in efficiency of one or two orders of magnitude. These improvements permit the use of TDGL computation to model superconductors with high finite values in contact with nonsuperconducting materials.…”
Section: Introductionmentioning
confidence: 99%
“…In this work, the TDGL equations in the zero electric potential gauge were solved in 2D using the finite difference semiimplicit Crank-Nicolson algorithm developed by Winiecki and Adams [18]. It is based on the widely-used U-method described by Gropp et al [19].…”
Section: Methodsmentioning
confidence: 99%