The variable projection algorithm in time-resolved spectroscopy, microscopy and mass spectrometry applications

36Citations
Citations of this article
54Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Nonlinear least squares optimization problems in which the parameters can be partitioned into two sets such that optimal estimates of parameters in one set are easy to solve for given fixed values of the parameters in the other set are common in practice. Particularly ubiquitous are data fitting problems in which the model function is a linear combination of nonlinear functions, which may be addressed with the variable projection algorithm due to Golub and Pereyra. In this paper we review variable projection, with special emphasis on its application to matrix data. The generalization of the algorithm to separable problems in which the linear coefficients of the nonlinear functions are subject to constraints is also discussed. Variable projection has been instrumental for model-based data analysis in multi-way spectroscopy, time-resolved microscopy and gas or liquid chromatography mass spectrometry, and we give an overview of applications in these domains, illustrated by brief case studies. © 2008 Springer Science+Business Media, LLC.

Cite

CITATION STYLE

APA

Mullen, K. M., & Stokkum, I. H. M. V. (2009). The variable projection algorithm in time-resolved spectroscopy, microscopy and mass spectrometry applications. Numerical Algorithms, 51(3), 319–340. https://doi.org/10.1007/s11075-008-9235-2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free