Numerical methods for integral equations of Mellin type (Q1841972): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0377-0427(00)00483-0 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2031210500 / rank | |||
Normal rank |
Latest revision as of 10:46, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Numerical methods for integral equations of Mellin type |
scientific article |
Statements
Numerical methods for integral equations of Mellin type (English)
0 references
15 November 2001
0 references
The authors investigate methods for the solution of second kind equations \[ Kx\equiv x(t) - \int_0^1 k \biggl(\frac{t}{\tau}\biggr) x(\tau) \frac{d \tau}{ \tau}= f(t), \quad s \in [0,1] \tag{1} \] with Mellin type kernels. Here \(k \) is a smooth function on \((0, \infty) , K(s/ \sigma) \sigma^{-1} \) is smooth at \(s=\sigma >0 \) but blows up with \(O(\sigma^{-1}) \) when \(s= \sigma \to 0 \). To define the collocation procedure they choose \(r \) points \(0 \leq \zeta_1 \leq \dots \leq \zeta_l \leq 1 \) in the segment \([0,1]\) and map these to each segment \(\triangle_k=[t_k,t_{k+1}]\), \(t_k=k/n\), \(k=0,1,\dots ,n,\) with the formula \(t_{kl}=t_k + \zeta_l h\), \(k=0,1,\dots, n-1\), \(l=1,2,\dots,r\), \(h=1/n. \) A piecewise continuous spline \(x_n(t) \) consists of \( n\) polynomials up to \(r-1 \) order, defined in the segments \(\triangle_k\), \(k=0,1, \dots,n-1.\) The modified collocation method is \[ (I-K)x_n(t_{ij})=f(t_{ij}), \quad j=1,2,\dots,r, \;i= i^*, i^*+1, \dots, n, \tag{2} \] where \(i^* > 0. \) The authors prove the existence of such an \(i^* \) that the system (2) is solvable, the collocation method (2) is stable and has optimal order of convergence in \(L_p\).
0 references
integral equation of Mellin type
0 references
collocation method
0 references
convergence
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references