Numerical approximation of Fredholm integral equation by the constrained mock-Chebyshev least squares operator (Q6567306)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Numerical approximation of Fredholm integral equation by the constrained mock-Chebyshev least squares operator |
scientific article; zbMATH DE number 7876194
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Numerical approximation of Fredholm integral equation by the constrained mock-Chebyshev least squares operator |
scientific article; zbMATH DE number 7876194 |
Statements
Numerical approximation of Fredholm integral equation by the constrained mock-Chebyshev least squares operator (English)
0 references
4 July 2024
0 references
The paper deals with numerical approaches for approximating the solution of the integral equation \N\[\Nf (y) - \mu \int_{- 1}^1 f(x) k(x, y) w(x) dx = g(y), \quad y \in [- 1, 1],\N\]\Nwhere \(f\) is the unknown solution, \(\mu \in \mathbb{R} \setminus \{0\}\), $k$, $g$ are given functions not necessarily known in the analytical form, and $w$ is a Jacobi weight. The proposed projection methods are based on the constrained mock-Chebyshev least squares polynomials, and starting from data known at equally spaced points, provide a fine approximation of the solution. Such peculiarity can be helpful in all cases we deal with experimental data, typically measured at equispaced points. The authors prove the introduced methods are stable and convergent in some Sobolev subspace of $C[-1,1]$. Several numerical tests confirm the theoretical estimates and numerical effectiveness of the proposed methods.
0 references
Fredholm integral equation
0 references
constrained mock-Chebyshev least squares
0 references
equispaced nodes
0 references
Chebyshev nodes
0 references
0 references
0 references
0 references