In this paper, a generalized E-transformation arising from the study of a generalization of sequence transformations and triangular recursion schemes is proposed. Three new algorithms, namely, the generalized E-algori...
详细信息
In this paper, a generalized E-transformation arising from the study of a generalization of sequence transformations and triangular recursion schemes is proposed. Three new algorithms, namely, the generalized E-algorithm, the generalized FS-algorithm and the generalized hungry type E-algorithm, are constructed for implementing the generalization of the E-transformation. Some convergence results of the generalized E-algorithm are obtained. In addition, some particular cases of the generalized E-transformation and the recursive algorithms for their computation are also studied.
In this paper, a generalization of the G-transformation is proposed together with the corresponding auxiliary rs-algorithm for implementation. We show that the related generalization of the rs-algorithm is equivalent ...
详细信息
In this paper, a generalization of the G-transformation is proposed together with the corresponding auxiliary rs-algorithm for implementation. We show that the related generalization of the rs-algorithm is equivalent to a generalized qd-algorithm. Applications of the generalization of the G-transformation to the computation of infinite integrals are also given. (C) 2010 IMACS. Published by Elsevier B.V. All rights reserved.
In this paper we shall introduce a formal system of algorithmic logic which enables us to formulate some problems connected with a retrieval system which provides a comprehensive tool in automated theorem proving of t...
详细信息
In this paper we shall introduce a formal system of algorithmic logic which enables us to formulate some problems connected with a retrieval system which provides a comprehensive tool in automated theorem proving of theorems consisting of programs, procedures and functions. The procedures and functions may occur in considered theorems while the program of the above mentioned system is being executed. We can get an answer whether some relations defined by programs hold and we can prove functional equations in a dynamic way by looking for a special set of axioms /assumptions/ during the execution of system. We formulate rs-algorithm which enables us to construct the set of axioms for proving some properties of functions and relations defined by programs. By rs-algorithm we get the dynamic process of proving functional equations and we can answer the question whether some relations defined by programs hold. It enables us to solve some problems concerning the correctness of programs. This system can be used for giving an expert appraisement. We shall provide the major structures and a sketch of an implementation of the above formal system.
In this paper, a generalization of the G-transformation is proposed together with the corresponding auxiliary rs-algorithm for implementation. We show that the related generalization of the rs-algorithm is equivalent ...
详细信息
In this paper, a generalization of the G-transformation is proposed together with the corresponding auxiliary rs-algorithm for implementation. We show that the related generalization of the rs-algorithm is equivalent to a generalized qd-algorithm. Applications of the generalization of the G-transformation to the computation of infinite integrals are also given. (C) 2010 IMACS. Published by Elsevier B.V. All rights reserved.
暂无评论