The commonly used graded piecewise polynomial collocation method for weakly singular Volterra integral equations may cause serious round-off error problems due to its use of extremely nonuniform partitions and the sensitivity of such time-dependent equations to round-off errors. The singularity preserving (nonpolynomial) collocation method is known to have only local convergence. To overcome th...

The main purpose of this paper is the construction of explicit Gauss-Turán quadrature formulas: they are relative to some classes of weight functions, which have the peculiarity that the corresponding s-orthogonal polynomials, of the same degree, are independent of s. These weights too are introduced and discussed here. Moreover, highest-precision quadratures for evaluating Fourier-Chebyshev co...

We revisit the problem of extending quadrature formulas for general weight functions, and provide a generalization of Patterson’s method for the constant weight function. The method can be used to compute a nested sequence of quadrature formulas for integration with respect to any continuous probability measure on the real line with finite moments. The advantages of the method include that it w...

This paper is devoted to the analysis of network approximation in the framework of approximation and regularization theory. It is shown that training neural networks and similar network approximation techniques are equivalent to least-squares collocation for a corresponding integral equation with molliied data. Results about convergence and convergence rates for exact data are derived based upo...

In the Newton/log-barriermethod,Newton steps are taken for the log-barrier function for a xed value of the barrier parameter until a certain convergence criterion is satis ed. The barrier parameter is then decreased and the Newton process is repeated. A naive analysis indicates that Newton's method does not exhibit superlinear convergence to the minimizer of each instance of the log-barrier fun...

We consider solving integral equations on a piecewise smooth surface S in R 3 with a smooth kernel function, using piecewise polynomial collocation interpolation of the surface. The theoretical analysis includes the eeects of the numerical integration of the collocation coeecients and the use of the approximating surface. The resulting order of convergence is higher than had previously been exp...

In this work the collocation method based on quartic B-spline is developed and applied to two-point boundary value problem in ordinary diferential equations. The error analysis and convergence of presented method is discussed. The method illustrated by two test examples which verify that the presented method is applicable and considerable accurate.

In order to approximate the integral I( f ) = ∫ b a f (x)dx, where f is a sufficiently smooth function, models for quadrature rules are developed using a given panel of n (n ≥ 2) equally spaced points. These models arise from the undetermined coefficients method, using a Newton’s basis for polynomials. Although part of the final product is algebraically equivalent to the well known closed Newto...

This paper presents the formulation of numerical algorithms for the solution of the closest-point projection equations that appear in typical implementations of return mapping algorithms in elastoplasticity. The main motivation behind this work is to avoid the poor global convergence properties of a straight application of a Newton scheme in the solution of these equations, the socalled Newton–...