CoChat

Tikhonov regularization and constrained quadratic programming for magnetic coil design problems

Open access
Garda, Bartłomiej, Galias, Zbigniew · 2014 · International Journal of Applied Mathematics and Computer Science

The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.

Abstract

In this work, the problem of coil design is studied. It is assumed that the structure of the coil is known (i.e., the positions of simple circular coils are fixed) and the problem is to find current distribution to obtain the required magnetic field in a given region. The unconstrained version of the problem (arbitrary currents are allowed) can be formulated as a Least-SQuares (LSQ) problem. However, the results obtained by solving the LSQ problem are usually useless from the application point of view. Moreover, for higher dimensions the problem is ill-conditioned. To overcome these difficulties, a regularization term is sometimes added to the cost function, in order to make the solution smoother. The regularization technique, however, produces suboptimal solutions. In this work, we propose to solve the problem under study using the constrained Quadratic Programming (QP) method. The methods are compared in terms of the quality of the magnetic field obtained, and the power of the designed coil. Several 1D and 2D examples are considered. It is shown that for the same value of the maximum current the QP method provides solutions with a higher quality magnetic field than the regularization method.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.2478/amcs-2014-0018

Cites

14 of 14 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Research works printed but not linked: 4

  1. Bro, R. and Jong, S.D. (1997). A fast non-negativityconstrained least squares algorithm, Journal of Chemometrics 11 (5): 393-401.
  2. Garda, B. and Galias, Z. (2010). Comparison of the linear algebra approach and the evolutionary computing for magnetic field shaping in linear coils, Nonlinear Theory and Its Applications, NOLTA 2010, Cracow, Poland , pp. 508-511.
  3. Voglis, C. and Lagaris, I. (2004). BOXCQP: An algorithm for bound constrained convex quadratic problems, Proceedings of the 1st International Conference: From Scientific Computing to Computational Engineering, IC-SCCE, Athens, Greece .
  4. Zbigniew Galias received the M.Sc. degree in electronics from the AGH University of Science and Technology, Cracow, Poland, in 1990, the M.Sc. degree in mathematics from the Jagiellonian University, Cracow, in 1992, as well as the Ph.D. degree and the senior doctorate degree in electrical engineering from the AGH University of Science and Technology, in 1996 and 2004, respectively. He became an assistant professor at the AGH University in 1992, and was promoted to an associate professor in 1996. Since 2005, he has been a professor of electrical engineering at the AGH University. His research interests include simulation, analysis, and design of nonlinear systems, chaos, interval arithmetic and computer assisted theorem proving. He has published more than 100 research papers. He has held visiting research positions at the Technical University of Munich, the University of California at Berkeley, the University of California at San Diego, and the RMIT University, Melbourne. Doctor Galias was awarded the Polish Research Foundation scholarship in 1994, received the Polish Prime Minister award for the Ph.D. thesis in 1997, and was awarded the Fulbright fellowship in 1999.

Cited by

See all 7

Metadata

Authors
Garda, B., & Galias, Z.
Affiliations
AGH University of Krakow (PL)
Venue
International Journal of Applied Mathematics and Computer Science
Published
2014-06-26
Volume
24
Issue
2
Pages
249-257
ISSN
  • 1641-876X (ISSN-L)
  • 2083-8492
OpenAlex
W2024637386
Cited by
7
References
14
Citations by year
2026: 1 · 2023: 1 · 2022: 1 · 2019: 2 · 2017: 2
FWCI
0.83
Type
journal article
Language
en
Open access
Locations
  • International Journal of Applied Mathematics and Computer Science (publishedVersion, cc-by-nc-nd)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • Digital library of Zielona Gora (University of Zielona Góra) (submittedVersion)
Funders
Akademia Górniczo-Hutnicza im. Stanislawa Staszica (11.11.120.343)
Topics
  • Physical Sciences › Mathematics › Mathematical Physics › Numerical methods in inverse problems
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Superconducting Materials and Applications
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
Keywords
current distribution, Tikhonov regularization, constrained quadratic programming, least squares, ill-conditioned problems, magnetic field shaping, circular coil

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.