Let t be a sequence in (0,1) that converges to 1, and define the Abel-type matrix Aα,t by ank = ( k+α k ) tk+1 n (1−tn)α+1 for α>−1. The matrix Aα,t determines a sequenceto-sequence variant of the Abel-type power series method of summability introduced by Borwein in [1]. The purpose of this paper is to study these matrices as mappings into . Necessary and sufficient conditions for Aα,t to be , ...

A numerical method to solve Abel-type integral equations of first kind is given. In this paper we suggest the research of a numerical solution for Abel-type integral equations of the first kind, by using a collocation method employing an interpolatory product-quadrature formula with a trigonometric polynomial of the first order. Some results of numerical examples are reported.

The Abel method on summation by parts is reformulated to present new and elementary proofs of several classical identities of terminating balanced basic hypergeometric series. The examples strengthen our conviction that as traditional analytical instrument, the revised Abel method on summation by parts is indeed a very natural choice for working with basic hypergeometric series.

ABEL is a wide spectrum language developed at the University of Oslo. The applicative core of ABEL is a typed rst order language with subtypes and partial functions. The paper presents a constructive fragment of the core, based on terminating generator induction. We show how subtypes can be used to augment expressiveness and strengthen syntactic controls.

In this paper resolvent estimates for Abel integral operators are provided. These estimates are applied to deduce regularizing properties of Lavrentiev's m-times iterated method as well as iterative schemes ? with the discrepancy principle as corresponding parameter choice or stopping rule, respectively for solving the corresponding Abel integral equations of the rst kind.