Fast algorithms for the bean critical-state model for superconductivity

Khaled M. Furati*, Abul Hasan Siddiqi

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

The Bean critical-state model describes the penetration of magnetic field into type-II superconductors. Mathematically, it is a free boundary problem, and fast algorithms for its solution are needed in applied superconductivity. Existence and uniqueness of solution, parallel algorithms, stability, and error estimation for this model are discussed.

Original languageEnglish
Pages (from-to)177-192
Number of pages16
JournalNumerical Functional Analysis and Optimization
Volume26
Issue number2
DOIs
StatePublished - 2005

Bibliographical note

Funding Information:
This research was supported by King Fahd University of Petroleum & Minerals, Project MS/Safingsensor/234.

Keywords

  • Bean model
  • Parabolic variational and quasi-variational inequality
  • Parallel algorithms
  • Superconductivity

ASJC Scopus subject areas

  • Analysis
  • Signal Processing
  • Computer Science Applications
  • Control and Optimization

Fingerprint

Dive into the research topics of 'Fast algorithms for the bean critical-state model for superconductivity'. Together they form a unique fingerprint.

Cite this