Adaptive truncation of matrix decompositions and efficient estimation of NMR relaxation distributions

DOI10.1088/0266-5611/31/4/045010MaRDI QIDQ5260929zbMATH OpenOpenAlexWikidataFDO

Authors Paul D. Teal, Craig Eccles

Publication date 30 June 2015

Published in Inverse Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1088/0266-5611/31/4/045010

zbMATH Keywords

adaptive truncationinterior point methodmatrix decompositionsmultidimensional relaxation distributionnuclear magnetic resonance

Mathematics Subject Classification ID

Decomposition methods (49M27) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15) Interior-point methods (90C51)

Recommendations

• N-Dimensional Tensor Completion for Nuclear Magnetic Resonance Relaxometry
• Fast \(\ell _{1}\) minimization by iterative thresholding for multidimensional NMR spectroscopy
• Regularized partial least squares with an application to NMR spectroscopy
• Improving CUR matrix decomposition and the Nyström approximation via adaptive sampling
• Efficient Maximum Entropy Reconstruction of Nuclear Magnetic Resonance T1-T2 Spectra
• A convex dual approach to the computation of NMR complex spectra
• NMF in MR spectroscopy

Cited in

(4)

• 2DNMR data inversion using locally adapted multi-penalty regularization
• Improved Butler-Reeds-Dawson algorithm for the inversion of two-dimensional NMR relaxometry data
• An automatic L₁-based regularization method for the analysis of FFC dispersion profiles with quadrupolar peaks
• Efficient Maximum Entropy Reconstruction of Nuclear Magnetic Resonance T1-T2 Spectra

This page was built for publication: Adaptive truncation of matrix decompositions and efficient estimation of NMR relaxation distributions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5260929)