No label defined (Q3973055)

[For the entire collection see Zbl 0722.00036.] Direct methods for this type of problems are often preferable, which use Gauss-type formulae after expressing the unknown function as the product of a weight function \((1-x)^{1-\alpha}(1+x)^{1-\beta}\) and a smooth function to be computed. Zeros of a Jacobi polynomial are used as quadrature nodes in the Gauss-Jacobi integral formula and zeros of another Jacobi polynomial are used as the corresponding collocation points. In section 3 the discrete scheme of general quadrature-collocation nodes is given and the solvability of the system of equations is proved. Some special choices of nodes are discussed in section 4 as well as the Gauss- Jacobi and the Lobatto-Jacobi scheme, the coincidence of quadrature nodes and collocation points, and the minimum norm-least squares scheme. One numerical example is presented, where the right-hand side function has a peak value. It demonstrates that a flexible choice of the collocation nodes can lead to better results at a lower computational cost.