Our paper reviews Kallay’s results on a geometric version of the classic Newton-Raphson method, in the context of plane curve queries, e.g. curve-curve intersection, point-curve distance computation. Variants of the geometric Newton-Raphson methods are proposed and empirically verified.

It is well known [28] that a number of important classes of univalent functions (e.g. convex, starlike) are related through their derivatives by functions with positive real part. These functions play an important part in problem from signal theory, in moment problems and in constructing quadrature formulas, see Ronning [97] and the references cited therein for some recent applications. In this...

The spline collocation method  is employed to solve a system of linear and nonlinear Fredholm and Volterra integro-differential equations. The solutions are collocated by cubic B-spline and the integrand is approximated by the Newton-Cotes formula. We obtain the unique solution for linear and nonlinear system $(nN+3n)times(nN+3n)$ of integro-differential equations. This approximation reduces th...

A collocation procedure is developed for the linear and nonlinear Fredholm and Volterraintegro-differential equations, using the globally defined B-spline and auxiliary basis functions.The solutionis collocated by cubic B-spline and the integrand is approximated by the Newton-Cotes formula.The error analysis of proposed numerical method is studied theoretically. Numerical results are given toil...

We provide an algorithm to compute the nodes and weights for Gauss-Chebyshev quadrature formulas integrating exactly in spaces of rational functions with arbitrary real poles outside [−1, 1]. Contrary to existing rational quadrature formulas, the computational effort is very low, even for extremely high degrees, and under certain conditions on the poles it can be shown that the complexity is of...

We continue with analyzing quadrature formulas of high degree of precision for computing the Fourier coefficients in expansions of functions with respect to a system of orthogonal polynomials, started recently by Bojanov and Petrova [Quadrature formulae for Fourier coefficients, J. Comput. Appl. Math. 231 (2009), 378–391] and we extend their results. Construction of new Gaussian quadrature form...

This paper examines the relationship between the degree of uniformity of distribution of grids, including Smolyak grids, with the intention of choosing weights to obtain efficient quadrature formulas.

Consider a hermitian positive-definite linear functional F, and assume we have m distinct nodes fixed in advance anywhere on the real line. In this paper we then study the existence and construction of nth rational Gauss-Radau (m = 1) and Gauss-Lobatto (m = 2) quadrature formulas that approximate F{f}. These are quadrature formulas with n positive weights and with the n−m remaining nodes real a...

We show how to combine incidence matrices, which admit Hermite-Birkhoff quadrature formulas of Gaussian type for any positive measure, in such a way that the resulting matrix also admits Gaussian type quadratures for any positive measure. Moreover, the uniqueness property and the extremal property of the formulas corresponding to the submatrices are transferred to the formula admitted by the co...

Abstract. A series of papers have treated the frequency analysis problem by studying the zeros of orthogonal polynomials on the unit circle with respect to measures determined by observations of the signal. In the recent paper [3], a different approach was used, where properties of Szegő quadrature formulas associated with the zeros of paraorthogonal polynomials with respect to the same measure...