A program for the solution of ill-posed linear systems arising from the discretization of the Fredholm integral equation of the first kind
β Scribed by Nabih N. Abdelmalek
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 593 KB
- Volume
- 58
- Category
- Article
- ISSN
- 0010-4655
No coin nor oath required. For personal study only.
β¦ Synopsis
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 programming techniques and is numerically stable. Numerical results show that it gives accuracy comparable to the truncated singular value decomposition method, yet it is about 2 to 5 times faster. The program may also obtain the least squares solution of ill-conditioned systems of linear equations under a simple condition. Numerical results are given.
π SIMILAR VOLUMES
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
## Abstract In this paper we consider a class of specific Urysohn integral equations for which the solutions are only determined with the exception of rearrangements of function values and associated arguments. As an alternative to Tikhonov's regularization method approximating minimumβnorm solutio
## Abstract The aim of this paper is to study, in the class of HΓΆlder functions, linear integral equations with coefficients cos __x__ having zeros in an interval under consideration. Using the theory of singular integral equations, necessary and sufficient conditions for the solvability of these e
Title of program: ILUCG2 (Incomplete LU factorized Con-being stiff and requiring implicit solution techniques. Generjugate Gradient algorithm for 2D problems) ally, the resulting matrix equations are asymmetric; we solve them here with the ILUCG2 program. In a subsequent article Catalogue number: AC