𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Least-squares problems for Michaelis–Menten kinetics

✍ Scribed by K. P. Hadeler; Dragan Jukić; Kristian Sabo

Publisher
John Wiley and Sons
Year
2007
Tongue
English
Weight
121 KB
Volume
30
Category
Article
ISSN
0170-4214

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The Michaelis–Menten kinetics is fundamental in chemical and physiological reaction theory. The problem of parameter identification, which is not well posed for arbitrary data, is shown to be closely related to the Chebyshev sum inequality. This inequality yields sufficient conditions for existence of feasible solutions both for nonlinear and for linear least‐squares problems. The conditions are natural and practical as they are satisfied if the data show the expected monotone and concave behaviour. Copyright © 2007 John Wiley & Sons, Ltd.

📜 SIMILAR VOLUMES

Matrix stretching for sparse least squar
Matrix stretching for sparse least squares problems
✍ Mikael Adlers; Åke Björck 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 91 KB

For linear least squares problems min x Ax -b 2 , where A is sparse except for a few dense rows, a straightforward application of Cholesky or QR factorization will lead to catastrophic fill in the factor R. We consider handling such problems by a matrix stretching technique, where the dense rows ar

Perturbation Bounds for Least Squares Pr
Perturbation Bounds for Least Squares Problems with Equality Constraints
✍ Jiu Ding 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 62 KB

We present some new results on the perturbation analysis for least squares problems with equality constraints, based on an equivalent formation of the problem and the optimal perturbation result for general least squares problems.