✦ LIBER ✦

Fast regularized structured total least squares algorithm for solving the basic deconvolution problem

✍ Scribed by N. Mastronardi; P. Lemmerling; S. Van Huffel

Publisher: John Wiley and Sons
Year: 2005
Tongue: English
Weight: 99 KB
Volume: 12
Category: Article
ISSN: 1070-5325
DOI: 10.1002/nla.413

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast algorithm for the solution of large

Fast algorithm for the solution of large-scale non-negativity-constrained least squares problems

✍ Mark H. Van Benthem; Michael R. Keenan 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB 👁 2 views

Multipole fast algorithm for the least-s

Multipole fast algorithm for the least-squares approach of the method of fundamental solutions for three-dimensional harmonic problems

✍ I. Saavedra; H. Power 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB 👁 1 views

A fast, direct algorithm for the least-s

A fast, direct algorithm for the least-squares fitting of two sets of atomic coordinates of macromolecular structures

✍ Zong Jie Liu; Roland Van Rapenbusch 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 337 KB 👁 2 views

By use of rotation angle method a direct algorithm is derived, which determines the least-squares superposition that matches two sets of atomic coordinates. The program based on this algorithm runs fast. The solution obtained by this algorithm cannot be trapped by any local minimum. Testing examples