✦ LIBER ✦

The Optimal Approximations for Solving Linear Ill-Posed Problems

✍ Scribed by S.G. Solodky

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 195 KB
Volume: 17
Category: Article
ISSN: 0885-064X
DOI: 10.1006/jcom.2000.0546

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal order methods of solving non-lin

Optimal order methods of solving non-linear ill-posed problems

✍ V.P. Tanana 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 411 KB

A relaxation method for solving non-line

A relaxation method for solving non-linear ill-posed problems

✍ B. Imomnazarov 📂 Article 📅 1978 🏛 Elsevier Science ⚖ 408 KB

Method of contracting compacta for solvi

Method of contracting compacta for solving non-linear ill-posed problems

✍ Yu.L Gaponenko 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 597 KB

An asymptotically optimal method for sol

An asymptotically optimal method for solving an ill-posed classification problem

✍ I.M. Islamov 📂 Article 📅 1989 🏛 Elsevier Science ⚖ 668 KB

On optimal methods for solving ill-posed

On optimal methods for solving ill-posed problems with an approximately specified operator, and error estimates for the methods

✍ V.P. Tanana 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 478 KB

An Optimal Stopping Rule for the v-Metho

An Optimal Stopping Rule for the v-Method for Solving Ill-Posed Problems, Using Christoffel Functions

✍ M. Hanke; H.W. Engl 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 639 KB

We design an order-optimal stopping rule for the \(\nu\)-method for solving ill-posed problems with noisy data. The construction of the \(\nu\)-method is based on a sequence of Jacobi polynomials, and the stopping rule is based on a sequence of related Christoffel functions. The motivation for our s