Tikhonov regularization and constrained quadratic programming for magnetic coil design problems
Open accessThe 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.
Integrity signals
Registry
Cites
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.
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
Solutions of Ill-Posed Problems.
Bell, J. B., Tikhonov, A. N., & Arsenin, V. Y. (1978) · Mathematics of Computation · doi:10.2307/2006360 · Cited by 8,101
Solving Least Squares Problems.
Ling, R. F., Lawson, C. L., & Hanson, R. J. (1977) · Journal of the American Statistical Association · doi:10.2307/2286501 · Cited by 2,723
REGULARIZATION TOOLS: A Matlab package for analysis and solution of discrete ill-posed problems
Hansen, P. C. (1994) · Numerical Algorithms · doi:10.1007/bf02149761 · Cited by 1,710
A fast non-negativity-constrained least squares algorithm
Bro, R., & de Jong, S. (1997) · Journal of Chemometrics · doi:10.1002/(sici)1099-128x(199709/10)11:5<367::aid-cem481>3.0.co;2-i · Cited by 909
Electromagnetic Analysis and Design in Magnetic Resonance Imaging
Jin, J. (2018) · Routledge eBooks · doi:10.1201/9780203758731 · Cited by 502 · cited 1×
“The second coil, called the “gradient coil”, is built to produce the gradient field (a linearly changing magnetic field), and the third coil is of radio frequency (Jin, 1999).”
BackgroundA target field approach to optimal coil design
Turner, R. (1986) · Journal of Physics D: Applied Physics · doi:10.1088/0022-3727/19/8/001 · Cited by 440
Homogeneous magnet design using linear programming
Xu, H., Conolly, S., Scott, G., & Macovski, A. (2000) · IEEE Transactions on Magnetics · doi:10.1109/20.825817 · Cited by 102
A Finite Difference Method for the Design of Gradient Coils in MRI—An Initial Framework
Zhu, M., Xia, L., Liu, F., Zhu, J., Kang, L., & Crozier, . (2012) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2012.2188290 · Cited by 40
Design of a biplanar gradient coil using a genetic algorithm
Fisher, B. J., Dillon, N., Carpenter, T. A., & Häll, L. (1997) · Magnetic Resonance Imaging · doi:10.1016/s0730-725x(96)00371-2 · Cited by 37
Optimization-based approach to path planning for closed chain robot systems
Szynkiewicz, W., & Blaszczyk, J. (2011) · International Journal of Applied Mathematics and Computer Sciences · doi:10.2478/v10006-011-0052-8 · Cited by 28
Research works printed but not linked: 4
- Bro, R. and Jong, S.D. (1997). A fast non-negativityconstrained least squares algorithm, Journal of Chemometrics 11 (5): 393-401.
- 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.
- 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 .
- 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
A lightweight magnetically shielded room with active shielding
Holmes, N., Rea, M., Chalmers, J., Leggett, J., Edwards, L. J., Nell, P., Pink, S., Patel, P., Wood, J., Murby, N., et al. (2022) · Scientific Reports · doi:10.1038/s41598-022-17346-1 · Cited by 121
Performance characteristics of the low-cost Plantower PMS optical sensor
He, M., Kuerbanjiang, N., & Dhaniyala, S. (2019) · Aerosol Science and Technology · doi:10.1080/02786826.2019.1696015 · Cited by 104
“For the square of Euclidean norm, there exists the below relationship (e.g., Garda and Galias 2014) Ax bj jj j22 þ k Lxj jj j22 ¼ xT ATAþ kLTLð Þx 2 ATbð Þ T x þ bTb (4) Therefore, the Equation (3) has the form of a constrained quadratic programing problem (e.g., Wang and Yang 2008), xk ¼ argmin 12…”
BackgroundNaturalistic Hyperscanning with Wearable Magnetoencephalography
Holmes, N., Rea, M., Hill, R. M., Boto, E., Leggett, J., Edwards, L. J., Rhodes, N., Shah, V., Osborne, J., Fromhold, T. M., et al. (2023) · Sensors · doi:10.3390/s23125454 · Cited by 52
“Superposition of the magnetic field generated by multiple coils, each carrying an independently controllable current, enables the production of arbitrary patterns of magnetic field variation within a selected target volume (Garda and Galias, 2014; Juchem et al., 2010).”
BackgroundCooling effects inside water-cooled inductors for magnetic fluid hyperthermia
Gas, P., & Kurgan, E. (2017) · Progress in Applied Electrical Engineering (PAEE) · doi:10.1109/paee.2017.8008997 · Cited by 22
“One of the most important issues is optimization problem of the shape and thickness of inductor to achieve desired magnetic field in the target ROI [9], [10].”
BackgroundParametric curves to trace the TMS coils windings
Syrek, P., & Bărbulescu, R. (2017) · International Symposium on Advanced Topics in Electrical Engineering · doi:10.1109/atee.2017.7905069 · Cited by 7
“However, problem’s dimension increases radically [27,28].”
Metadata
- Authors
- Garda, B., & Galias, Z.
- Affiliations
- AGH University of Krakow (PL)
- Venue
- International Journal of Applied Mathematics and Computer Science
- Publisher
- University of Zielona Góra, Poland
- 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
- gold
- doi.org
- Licence
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Tikhonov regularization and constrained quadratic programming for magnetic coil design problems. https://app.cochat.ai/papers/10.2478/amcs-2014-0018
- The paper
- Garda, B., & Galias, Z. (2014). Tikhonov regularization and constrained quadratic programming for magnetic coil design problems. International Journal of Applied Mathematics and Computer Science. https://doi.org/10.2478/amcs-2014-0018
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.