✦ LIBER ✦

Least-Squares Approximations in Geometric Buildup for Solving Distance Geometry Problems

✍ Scribed by Xin-long Luo; Zhi-jun Wu

Publisher: Springer
Year: 2011
Tongue: English
Weight: 614 KB
Volume: 149
Category: Article
ISSN: 0022-3239
DOI: 10.1007/s10957-011-9806-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An updated geometric build-up algorithm

An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data

✍ Di Wu; Zhijun Wu 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 240 KB

A mixed least squares method for solving

A mixed least squares method for solving problems in linear elasticity: theoretical study

✍ M. Tchonkova; S. Sture 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 146 KB

Minimal distance upper bounds for the pe

Minimal distance upper bounds for the perturbation of least squares problems in Hilbert spaces

✍ J. Ding 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 275 KB

In this paper, we present an optimal perturbation result on the least squares solutions to the operator equation Tx = y under the most general condition. (~) 2002 Elsevier Science Ltd. All rights reserved.

A mixed least squares method for solving

A mixed least squares method for solving problems in linear elasticity: formulation and initial results

✍ M. Tchonkova; S. Sture 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 562 KB

A multilevel block incomplete cholesky p

A multilevel block incomplete cholesky preconditioner for solving normal equations in linear least squares problems

✍ Jun Zhang; Tong Xiao 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 230 KB