Search

In this paper, the solution to a bivariate Appell interpolation problem proposed in a previous work is given. Bounds of the truncation error are considered. Ten new interpolants for real, regular, bivariate functions are constructed. Numerical examples and comparisons with bivariate Bernstein polynomials are considered. [ABSTRACT FROM AUTHOR]

In this paper, an approach to orthogonal polynomials based on matrix calculus is proposed. Known and new basic results are given, such as recurrence relations and determinant forms. New algorithms, similar, but not identical, to the Chebyshev one, for practical calculation of the polynomials are presented. The cases of monic and symmetric orthogonal polynomial sequences and the case of orthonormal polynomial sequences have been considered. Some classical and non-classical examples are given. The work is framed in a broader perspective, already started by the authors. It provides for the determination of properties of a general sequence of polynomials and, therefore, their applicability to special classes of the most important polynomials. [ABSTRACT FROM AUTHOR]

Recently we have introduced a new technique for combining classical bivariate Shepard operators with three point polynomial interpolation operators (Dell'Accio and Di Tommaso, On the extension of the Shepard-Bernoulli operators to higher dimensions, unpublished). This technique is based on the association, to each sample point, of a triangle with a vertex in it and other ones in its neighborhood to minimize the error of the three point interpolation polynomial. The combination inherits both degree of exactness and interpolation conditions of the interpolation polynomial at each sample point, so that in Caira et al. (J Comput Appl Math 236:1691-1707, ) we generalized the notion of Lidstone Interpolation (LI) to scattered data sets by combining Shepard operators with the three point Lidstone interpolation polynomial (Costabile and Dell'Accio, Appl Numer Math 52:339-361, ). Complementary Lidstone Interpolation (CLI), which naturally complements Lidstone interpolation, was recently introduced by Costabile et al. (J Comput Appl Math 176:77-90, ) and drawn on by Agarwal et al. () and Agarwal and Wong (J Comput Appl Math 234:2543-2561, ). In this paper we generalize the notion of CLI to bivariate scattered data sets. Numerical results are provided. [ABSTRACT FROM AUTHOR]

A determinantal form for Δ-Appell sequences is proposed and general properties are obtained by using elementary linear algebra tools. As particular cases of Δ-Appell sequences the sequence of Bernoulli polynomials of second kind and the one of Boole polynomials are considered. A general linear interpolation problem, which generalizes the classical interpolation problem on equidistant points, is proposed. The solution of this problem is expressed by a basis of Δ-Appell polynomials. Numerical examples which justify theoretical results on the interpolation problem are given. [ABSTRACT FROM AUTHOR]

It is well-known that Muller’s method for the computation of the zeros of continuous functions has order ≈ 1.84 [10], and does not have the character of global convergence. Muller’s method is based on the interpolating polynomial built on the last three points of the iterative sequence. In this paper the authors take as nodes of the interpolating polynomial the last two points of the sequence and the middle point between them. The resulting method has order p=2 for regular functions. This method leads to a globally convergent algorithm because it uses dichotomic techniques. Many numerical examples are given to show how the proposed code improves on Muller’s method. [ABSTRACT FROM AUTHOR]

Recently, by Costabile, Gualtieri and Serra (1999), an iterative method was presented for the computation of zeros of C1 functions. This method combines the assured convergence of the bisection-like algorithms with a superlinear convergence speed which characterizes Newton-like methods. The order of the method and the cost per iteration is exactly equivalent to the Newton method. In this paper we present a new iterative method for the computation of the zeros of C1 functions with the same properties of convergence as the method proposed by Costabile, Gualtieri and Serra (1999) but with order 1+ $$\sqrt 2 $$ ≐2.41 for C3 functions. Compared with the methods of order 1+ $$\sqrt 2 $$ presented by Traub (1964), our methods ensure global convergence. Then we consider a generalization of this procedure which gives a class of methods of order ( n+ $$\sqrt {n^2 + 4} $$ )/2, where n is the degree of the approximating polynomial, with one-point iteration functions with memory. Finally a number of numerical tests are performed. The numerical results seem to show that, at least on a set of problems, the new methods work better than the methods proposed, and, therefore, than both the Newton and Alefeld and Potra (1992) methods. [ABSTRACT FROM AUTHOR]

In [1] there is an expansion in Bernoulli polynomials for sufficiently smooth real functions in an interval [ a, b]⊂ R that has useful applications to numerical analysis. An analogous result in a 2-dimensional context is derived in [2] in the case of rectangle. In this note we generalize the above-mentioned one-dimensional expansion to the case of C m-functions on a 2-dimensional simplex; a method to generalize the expansion on an N-dimensional simplex is also discussed. This new expansion is applied to find new cubature formulas for 2-dimensional simplex. [ABSTRACT FROM AUTHOR]

For the numerical solution of the initial value problem a parallel, global integration method is derived and studied. It is a collocation method. If f( x, y)≡ f( x) the method coincides with the Filippi's modified Clenshaw–Curtis quadrature [11]. Two numerical algorithms are considered and implemented, one of which is the application of the new method to Picard iterations, so it is a waveform relaxation technique [3]. Numerical experiments are favourably compared with the ones given by the known GAM [2], GBS [14] and Sarafyan [18] methods. [ABSTRACT FROM AUTHOR]

A six order formula of an explicit method for the numerical initial value problem, proposed in [1], [3], is determined. This formula which for f(x,y)≡f(x) is the Gauss quadrature formula with three points, requires only three stages by comparison with seven stages required by an explicit six order Runge-Kutta method. Convergence and stability are considered and numerical example are also given. [ABSTRACT FROM AUTHOR]

In this paper a detailed study of the convergence and stability of a numerical method for the differential problem has carried out and its truncation error estimated. Some numerical experiments are described. [ABSTRACT FROM AUTHOR]

Copyright of Calcolo is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Calcolo is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Calcolo is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Calcolo is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Calcolo is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Calcolo is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Two new general classes of polynomial sequences called respectively odd and even Lidstone-type polynomials are considered. These classes include classic Lidstone polynomials of first and second kind. Some characterizations of the two classes are given, including matrix form, conjugate sequences, generating function, recurrence relations, and determinant forms. Some examples are presented and some applications are sketched. [ABSTRACT FROM AUTHOR]