Adaptive truncation of matrix decompositions and efficient estimation of NMR relaxation distributions. (25th March 2015)

• Record Type: Journal Article
• Authors: Teal, Paul D; Eccles, Craig
• Is Part Of: Inverse problems. Volume 31:Number 4(2015:Apr.)
• Publication Date: 2015-03-25
• Subjects: nuclear magnetic resonance -- multidimensional relaxation distribution -- matrix decomposition -- interior point method -- FISTA; Inverse problems (Differential equations) -- Periodicals; 515.357
• DOI: 10.1088/0266-5611/31/4/045010
• Languages: English
• ISSNs: 0266-5611

Abstract

Abstract: The two most successful methods of estimating the distribution of nuclear magnetic resonance relaxation times from two dimensional data are data compression followed by application of the Butler–Reeds–Dawson algorithm, and a primal-dual interior point method using preconditioned conjugate gradient. Both of these methods have previously been presented using a truncated singular value decomposition of matrices representing the exponential kernel. In this paper it is shown that other matrix factorizations are applicable to each of these algorithms, and that these illustrate the different fundamental principles behind the operation of the algorithms. These are the rank-revealing QR (RRQR) factorization and the LDL factorization with diagonal pivoting, also known as the Bunch–Kaufman–Parlett factorization. It is shown that both algorithms can be improved by adaptation of the truncation as the optimization process progresses, improving the accuracy as the optimal value is approached. A variation on the interior method viz, the use of barrier function instead of the primal-dual approach, is found to offer considerable improvement in terms of speed and reliability. A third type of algorithm, related to the algorithm known as Fast iterative shrinkage-thresholding algorithm, is applied to the problem. This method can be efficiently formulated without the use of a matrix decomposition.