Back to Search Start Over

Robust Algorithms for the Analysis of Fast-Field-Cycling Nuclear Magnetic Resonance Dispersion Curves.

Authors :
Bortolotti, Villiam
Conte, Pellegrino
Landi, Germana
Lo Meo, Paolo
Nagmutdinova, Anastasiia
Spinelli, Giovanni Vito
Zama, Fabiana
Source :
Computers (2073-431X); Jun2024, Vol. 13 Issue 6, p129, 14p
Publication Year :
2024

Abstract

Fast-Field-Cycling (FFC) Nuclear Magnetic Resonance (NMR) relaxometry is a powerful, non-destructive magnetic resonance technique that enables, among other things, the investigation of slow molecular dynamics at low magnetic field intensities. FFC-NMR relaxometry measurements provide insight into molecular motion across various timescales within a single experiment. This study focuses on a model-free approach, representing the NMRD profile R 1 as a linear combination of Lorentzian functions, thereby addressing the challenges of fitting data within an ill-conditioned linear least-squares framework. Tackling this problem, we present a comprehensive review and experimental validation of three regularization approaches to implement the model-free approach to analyzing NMRD profiles. These include (1) MF-UPen, utilizing locally adapted L 2 regularization; (2) MF-L1, based on L 1 penalties; and (3) a hybrid approach combining locally adapted L 2 and global L 1 penalties. Each method's regularization parameters are determined automatically according to the Balancing and Uniform Penalty principles. Our contributions include the implementation and experimental validation of the MF-UPen and MF-MUPen algorithms, and the development of a "dispersion analysis" technique to assess the existence range of the estimated parameters. The objective of this work is to delineate the variance in fit quality and correlation time distribution yielded by each algorithm, thus broadening the set of software tools for the analysis of sample structures in FFC-NMR studies. The findings underline the efficacy and applicability of these algorithms in the analysis of NMRD profiles from samples representing different potential scenarios. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
2073431X
Volume :
13
Issue :
6
Database :
Complementary Index
Journal :
Computers (2073-431X)
Publication Type :
Academic Journal
Accession number :
178155543
Full Text :
https://doi.org/10.3390/computers13060129