A stable algorithm for Hankel transforms using hybrid of Block-pulse and Legendre polynomials

A new numerical method, based on hybrid of Block-pulse and Legendre polynomials for numerical evaluation of Hankel transform is proposed in this paper. Hybrid of Block-pulse and Legendre polynomials are used as a basis to expand a part of the integrand, rf(r), appearing in the Hankel transform integral. Thus transforming the integral into a Fourier-Bessel series. Truncating the series, an efficient algorithm is obtained for the numerical evaluations of the Hankel transforms of order ν>−1. The method is quite accurate and stable, as illustrated by given numerical examples with varying degree of random noise terms εθi added to the data function f(r), where θi is a uniform random variable with values in [−1,1]. Finally, an application of the proposed method is given in solving the heat equation in an infinite cylinder with a radiation condition.     

Numerical evaluation of the Hankel transform by using linear Legendre multi-wavelets

An efficient algorithm for evaluating the Hankel transform Fn(p) of order n of a function f(r) is given. As the continuous Legendre multi-wavelets forms an orthonormal basis for L²(R); we expand the part rf(r) of the integrand in its wavelet series reducing the Hankel transform integral as a series of Bessel functions multiplied by the wavelet coefficients of the input function. Numerical examples are given to illustrate the efficiency of the proposed method.     

Solving linear integro-differential equation with Legendre wavelets

In this article, we use the continuous Legendre wavelets on the interval [0, 1) constructed by [M. Razzaghi and S. Yousefi, The Legendre wavelets operational matrix of integration, International Journal of Systems Science, 32(4) (2001) 495–502.] to solve the linear second kind integro-differential equations and construct the quadrature formulae for the calculation of inner products of any functions, which are required in the approximation for the integro-differential equations. Then we reduce the integro-differential equation to the solution of linear algebraic equations.     

Higher-order polynomial approximation

A new approach to polynomial higher-order approximation (smoothing) based on the basic elements method (BEM) is proposed. A BEM polynomial of degree n is defined by four basic elements specified on a three-point grid: x ₀ + α < x ₀ < x ₀ + β, αβ <0. Formulas for the calculation of coefficients of the polynomial model of order 12 were derived. These formulas depend on the interval length, continuous parameters α and β, and the values of f ^(m)(x ₀+ν), ν = α, β, 0, m = 0,3. The application of higher-degree BEM polynomials in piecewise-polynomial approximation and smoothing improves the stability and accuracy of calculations when the grid step is increased and reduces the computational complexity of the algorithms.     

Asymptotic behaviour of the solutions of second order functional differential equations

This paper presents integral criteria to determine the asymptotic behaviour of the solutions of second order nonlinear differential equations of the type y^″(x)+q(x)f(y(x))=0, with q(x)>0 and f(y) odd and positive for y>0, as x tends to +∞. It also compares them with the results obtained by Chanturia (1975) in [11] for the same problem.     

Cylindrical decomposition for systems transcendental in the first variable

We present a generalization of the Cylindrical Algebraic Decomposition (CAD) algorithm to systems of equations and inequalities in functions of the form p(x,f₁(x),…,f_m(x),y₁,…,y_n), where p∈Q[x,t₁,…,t_m,y₁,…,y_n] and f₁(x),…,f_m(x) are real univariate functions such that there exists a real root isolation algorithm for functions from the algebra Q[x,f₁(x),…,f_m(x)]. In particular, the algorithm applies when f₁(x),…,f_m(x) are real exp-log functions or tame elementary functions.     

DeMorgan systems with an infinitely many negations in the strict monotone operator case

We give a new representation theorem of negation based on the generator function of the strict operator. We study a certain class of strict monotone operators which build the DeMorgan class with infinitely many negations. We show that the necessary and sufficient condition for this operator class is f_c(x)f_d(x) = 1, where f_c(x) and f_d(x) are the generator functions of the strict t-norm and strict t-conorm.     

Legendre wavelets method for solving fractional integro-differential equations

In this paper, based on the constructed Legendre wavelets operational matrix of integration of fractional order, a numerical method for solving linear and nonlinear fractional integro-differential equations is proposed. By using the operational matrix, the linear and nonlinear fractional integro-differential equations are reduced to a system of algebraic equations which are solved through known numerical algorithms. The upper bound of the error of the Legendre wavelets expansion is investigated in Theorem 5.1. Finally, four numerical examples are shown to illustrate the efficiency and accuracy of the approach.     

Positive solutions of singular Dirichlet and periodic boundary value problems

Let A and T be positive numbers. The singular differential equation (r(x)x′)′ = μq(t)f(t, x) is considered. Here r > 0 on (0, A] may be singular at x = 0, and f(t, x) ≤ 0 may be singular at x = 0 and x = A. Effective sufficient conditions imposed on r, μ, q, and f are given for the existence of a solution x to the above equation satisfying either the Dirichlet conditions x(0) = x(T) = 0 or the periodic conditions x(0) = x(T), x′(0) = x′(T), and, in addition, 0 < x < A on (0, T).     

Robust algorithms that locate local extrema of a function of one variable from interval measurement results: A remark

The problem of locating local maxima and minima of a function from approximate measurement results is vital for many physical applications: inspectral analysis, chemical species are identified by locating local maxima of the spectra; inradioastronomy, sources of celestial radio emission, and their subcomponents, are identified by locating local maxima of the measured brightness of the radio sky;elementary particles are identified by locating local maxima of the experimental curves. Since measurements are never absolutely precise, as a result of the measurements, we have aclass of possible functions. If we measuref(x _i ) with interval uncertainty, this class consists of all functionsf for whichf(x _i ) ε [y _i ??, y _i +?], wherey _i are the results of measuringf(x _i ), andε is the measurement accuracy. For this class, in [2], a linear-time algorithm was described. In real life, a measuring instrument can sometimes malfunction, leading to the so-calledoutliers, i.e., measurementsy _i that can be way offf(x _i ) (and thus do not restrict the actual valuesf(x _i ) at all). In this paper, we describerobust algorithms, i.e., algorithms that find the number of local extrema in the presence of possible outliers. These algorithms solve an important practical problem, but they are not based on any new mathematical results: they simply use algorithms from [2] and [3].     

Some procedures for function approximation based on the use of sample data and their application in heuristic methods for solving practical problems

Let f(x) be a member of a set of functions over a probability space. Samples of f(x) are 2-tuples (xⁱ,f(xⁱ) where xⁱ is a sample of the random variable X and f(xⁱ) is a sample of f(x) at x = xⁱ. Some procedures and analysis are presented for the approximation of such functions by systems of orthonormal functions. The approximations are based on the data samples. The analysis includes the case of error in the measurement of f(xⁱ). The properties of the expected square error in the approximation are examined for a number of different estimators for the coefficients in the expansion and these well-behaved and easily analyzed estimators are compared to those obtained using the method of least squares. The effectiveness of different sets of basis functions, those involved in the Karhunen-Loeve expansion and others, can be compared and an approach is suggested to adaptive basis selection in order to select that basis which is most efficient in approximating the particular function under examination. The connection between results and applications are discussed in the introduction and conclusion.     

Fuzzy approximately cubic mappings

We establish some stability results concerning the cubic functional equation

f(2x+y)+f(2x-y)=2f(x+y)+2f(x-y)+12f(x)     

A recursive and a grammatical characterization of the exponential-time languages

We characterize the class of all languages which are acceptable in exponential time by means of recursive and grammatical methods. (i) The class of all languages which are acceptable in exponential time is uniquely characterized by the class of all (0-1)-functions which can be generated, starting with the initial functions of the Grzegorczyk-class $\text{E}$², by means of subtitution and limited recursion of the form f(x, y + 1) = h(x, y), f(x, y), f(x, l(x, y))), l(x, y) ? y. (ii) The class of all languages which are acceptable in exponential time is equal to the class of all languages generated by context-sensitive grammars with context-free control sets.     

Ein Abbrechkriterium für einen numerischen Algorithmus

A termination criterion by Nickel (Theorem 6, [1]) for guaranteeing the numerical convergence for locally stable and consistent algorithms is generalized. The assumption |x _ν+2,x _ν+1|≤L|x _ν+1,x _ν| (0≤L<1,L real constant) of the approximation sequence {x _ν} to the solution is replaced by the convergence of the progression \(\sum\limits_{v = 1}^\infty {|x,x_{v + 1} |/Q^v (0< Q< 1)} \) . Therefore the theorem of this paper is applicable to a large number of numerical procedures, for which untill now no termination criterion has been known (for example: Rombergprocedure). In particular this weakening is important for the computation of approximation solutions for integral equations.     

Efficient Legendre moment computation for grey level images

Legendre orthogonal moments have been widely used in the field of image analysis. Because their computation by a direct method is very time expensive, recent efforts have been devoted to the reduction of computational complexity. Nevertheless, the existing algorithms are mainly focused on binary images. We propose here a new fast method for computing the Legendre moments, which is not only suitable for binary images but also for grey level images. We first establish a recurrence formula of one-dimensional (1D) Legendre moments by using the recursive property of Legendre polynomials. As a result, the 1D Legendre moments of order p, L_p=L_p(0), can be expressed as a linear combination of L_p-1(1) and L_p-2(0). Based on this relationship, the 1D Legendre moments L_p(0) can thus be obtained from the arrays of L₁(a) and L₀(a), where a is an integer number less than p. To further decrease the computation complexity, an algorithm, in which no multiplication is required, is used to compute these quantities. The method is then extended to the calculation of the two-dimensional Legendre moments L_pq. We show that the proposed method is more efficient than the direct method.     

Stability analysis of nonlinear retarded difference equations in Banach spaces

In this paper, we give new sufficient conditions for asymptotic stability and instability of nonlinear difference equations with delays in infinite-dimensional spaces x(k + 1) = f(k,x(k), x(k−1), …x(k−r))), x(k) ϵ X, k = 0, 1,2,…, where X is a Banach space. Our results are obtained using a general comparison condition on the right-hand side function f(k,.), which generalizes the stability and instability results obtained by Yang, Miminis, Naulin, and Vanegas. An application to the stabilizability problem of retarded control systems and illustrative examples of the obtained results are given.     

Improving the efficiency index in enclosing a root of an equation

Recently several algorithms have been developed which achieve high efficiency index in enclosing a root of the equationf(x)=0 in an interval [a, b] over whichf(x) is continuous andf(a)f(b)<0. The highest efficiency index, 1.6686 ..., was achieved in [4] using the inverse cubic interpolation. This paper studies the possibility of improving efficiency index by using high order inverse interpolations. A class of algorithms are presented and the optimal one of the class has achieved the efficiency index 1.7282 ... With a user-given accurary ? and starting with the initial interval [a ₁,b ₁]=[a, b], these algorithms guarantee to find in finitely many iterations an enclosing interval [a _n ,b _n ] that contains a root of the equation and whose lengthb _n –a _n is smaller than ?. Numerical experiments indicate that the new algorithm performs very well in practice.     

Eine stets quadratisch konvergente Modifikation des Steffensen-Verfahrens

It is shown that the following modification of the Steffensen procedurex _n+1=x _n ?k _s (x _n )f(x _n ) (f[x _n ,x _n ?f(x _n )])^?1 (n=0,1,...) withk _s (x)=(1?z _s (x))^?1,z _s (x)=f(x) 2f[x?f(x),x,x+f(x)]×(f[x,x?f(x)])^?2 is quadratically convergent to the root of the equation \(f(x) = (x - \bar x)^p g(x) = 0(p > 0,g(\bar x) \ne 0)\) . Furthermore \(\mathop {\lim }\limits_{n \to \infty } k_s (x_n ) = p\) holds.     

New slope methods for sharper interval functions and a note on Fischer's acceleration method

This paper presents algorithms evaluating sharper bounds for interval functionsF(X) :IR ⁿ →IR. We revisit two methods that use partial derivatives of the function, and develop four other inclusion methods using the set of slopesS _f (x, z) off atx εX with respect to somez εIR ⁿ . All methods can be implemented using tools that automatically evaluate gradient and slope vectors by using a forward strategy, so the complex management of reverse accumulation methods is avoided. The sharpest methods compute each component of gradients and slopes separately, by substituting each interval variable at a time. Backward methods bring no great advantage in the sharpest algorithms, since object-oriented forward implementations are easy and immediate. Fischer's acceleration scheme [2] was also tested with interval variables. This method allows the direct evaluation of the productf′(x) * (x?z) as a single real number (instead of working with two vectors) and we used it to computeF′(X) * (X?z) for an interval vectorX. We are led to decide against such acceleration when interval variables are involved.