2016
DOI: 10.1090/mcom/3177
|View full text |Cite
|
Sign up to set email alerts
|

Mathematical and numerical analysis of the time-dependent Ginzburg–Landau equations in nonconvex polygons based on Hodge decomposition

Abstract: Abstract. We prove well-posedness of time-dependent Ginzburg-Landau system in a nonconvex polygonal domain, and decompose the solution as a regular part plus a singular part. We see that the magnetic potential is not in H 1 in general, and the finite element method (FEM) may give incorrect solutions. To remedy this situation, we reformulate the equations into an equivalent system of elliptic and parabolic equations based on the Hodge decomposition, which avoids direct calculation of the magnetic potential. The… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
34
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
7

Relationship

2
5

Authors

Journals

citations
Cited by 25 publications
(34 citation statements)
references
References 39 publications
0
34
0
Order By: Relevance
“…More important is that our analysis is given without any time-step restrictions and under more general assumptions for the regularity of the solution of the TDGL equations, which includes the problem in nonconvex polygons and certain convex polyhedrons. Usually, conventional FEMs for a scalar parabolic equation require the regularity of the solution in H 1+s with s > 0 [11,15], while for the TDGL equations in a nonconvex polygon, A ∈ H s and curl A, div A ∈ H 1+s with s < 1 in general [31]. Our numerical results show clearly that the mixed method converges to a true solution for problems in a nonconvex polygon and conventional Lagrange type FEMs do not in this case.…”
Section: Introductionmentioning
confidence: 85%
See 2 more Smart Citations
“…More important is that our analysis is given without any time-step restrictions and under more general assumptions for the regularity of the solution of the TDGL equations, which includes the problem in nonconvex polygons and certain convex polyhedrons. Usually, conventional FEMs for a scalar parabolic equation require the regularity of the solution in H 1+s with s > 0 [11,15], while for the TDGL equations in a nonconvex polygon, A ∈ H s and curl A, div A ∈ H 1+s with s < 1 in general [31]. Our numerical results show clearly that the mixed method converges to a true solution for problems in a nonconvex polygon and conventional Lagrange type FEMs do not in this case.…”
Section: Introductionmentioning
confidence: 85%
“…The above theorem shows that the convergence rate of the mixed method depends upon the order of the FEM spaces and also the regularity of the exact solution. In [31], the authors proved that on a nonconvex polygon, the TDGL equations possess regularity only with…”
Section: Remark 23mentioning
confidence: 99%
See 1 more Smart Citation
“…Comparing to previous error analysis with conditional stability in [34][35][36], optimal error estimates were obtained unconditionally in [37,38]. Recently, this new technique has been used to analyze linearized FEMs for nonlinear Schrödinger type equation [24][25][26][27][28] and many other PDEs [39][40][41][42][43][44]. To our best knowledge, this new technique is mainly carried out for nonlinear parabolic type of equations and also possibly coupled with elliptic type of equations.…”
Section: Introductionmentioning
confidence: 95%
“…It is noted that the standard finite element solution of the TDGL may converge to an incorrect solution, while the finite element solution of the new equivalent system converges to the true solution. Unfortunately, the new equivalent system introduced in [19,20] cannot be extended to the three-dimensional model, and the regularity of the solution in a three-dimensional curved polyhedron is even weaker than the two-dimensional solutions. In this paper, we prove existence of weak solutions for the initial-boundary value problem (1.3)-(1.6) in a general three-dimensional curved polyhedron based on the weaker embedding inequality A L 3+δ (Ω) ≤ C A Hn(curl,div) , by constructing approximating solutions which preserve the physical property 0 ≤ |ψ| ≤ 1.…”
Section: Introductionmentioning
confidence: 99%