INTRODUCTEON A linear Frcdhofm equation ol the first kind is defined by the ~XpE&3?l Here g(x) and K{x, c) are normally known functions, while it is desired to calculate #I. Although K(x, t) is usually known with high pwekkm, often g(x) is not. Examptes of&s kind of problem ial chemistry and chemica
The Minimal Radius of Galerkin Information for the Fredholm Problem of the First Kind
โ Scribed by S.V. Pereverzev; S.G. Solodky
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 276 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0885-064X
No coin nor oath required. For personal study only.
โฆ Synopsis
We propose a new scheme of discretization for solving Fredholm integral equations of the first kind and show that for some classes of equations this scheme is order-optimal in the sense of amount of used Galerkin information.
๐ SIMILAR VOLUMES
We consider the free non-commutative analogue 8\*, introduced by D. Voiculescu, of the concept of Fisher information for random variables. We determine the minimal possible value of 8\*(a, a\*), if a is a non-commutative random variable subject to the constraint that the distribution of a\*a is pres
A computer program written in FORTRAN IV for obtaining smooth solutions of ill-posed systems of linear equations arising from the discretization of the Fredholm integral equation of the first kind is given. It is based on a novel algorithm by the author. The algorithm is iterative using linear progr