AbstractThree algorithms for the evaluation of the Hadamard finite-part integral of the form ∫1-1(f(t)(1−t)1+α), where α is a positive non-integer, are described. One algorithm is based on a knowledge of the Chebyshev series expansion of f on [−1, 1], the other two on polynomial interpolations to f at the zeros of TN, the Chebyshev polynomial of the first kind. Convergence theorems are given for each algorithm, and each algorithm is demonstrated numerically
Some algorithms are described for the numerical evaluation of Hadamard finite part integrals of type...
AbstractIn this paper we construct product quadrature rules, based on spline interpolation, for the ...
AbstractA computationally efficient algorithm for evaluating Fourier integrals ∫1−1⨍(x)eiωxdx using ...
AbstractThree algorithms for the evaluation of the Hadamard finite-part integral of the form ∫1-1(f(...
AbstractSome algorithms are described for the numerical evaluation of Hadamard finite part integrals...
AbstractAn algorithm for the approximate evaluation of integrals defined by Cauchy principal value o...
AbstractThis paper is concerned with a Chebyshev quadrature rule for approximating one sided finite ...
AbstractAn automatic quadrature is presented for approximating Hadamard finite-part (fp) integrals o...
AbstractSome algorithms are described for the numerical evaluation of Hadamard finite part integrals...
In the present paper we introduce and study an extended product quadrature rule to approximate Hadam...
In the present paper we introduce and study an extended product quadrature rule to approximate Hadam...
In the present paper we introduce and study an extended product quadrature rule to approximate Hadam...
In the present paper we introduce and study an extended product quadrature rule to approximate Hadam...
Some algorithms are described for the numerical evaluation of Hadamard finite part integrals of type...
Some algorithms are described for the numerical evaluation of Hadamard finite part integrals of type...
Some algorithms are described for the numerical evaluation of Hadamard finite part integrals of type...
AbstractIn this paper we construct product quadrature rules, based on spline interpolation, for the ...
AbstractA computationally efficient algorithm for evaluating Fourier integrals ∫1−1⨍(x)eiωxdx using ...
AbstractThree algorithms for the evaluation of the Hadamard finite-part integral of the form ∫1-1(f(...
AbstractSome algorithms are described for the numerical evaluation of Hadamard finite part integrals...
AbstractAn algorithm for the approximate evaluation of integrals defined by Cauchy principal value o...
AbstractThis paper is concerned with a Chebyshev quadrature rule for approximating one sided finite ...
AbstractAn automatic quadrature is presented for approximating Hadamard finite-part (fp) integrals o...
AbstractSome algorithms are described for the numerical evaluation of Hadamard finite part integrals...
In the present paper we introduce and study an extended product quadrature rule to approximate Hadam...
In the present paper we introduce and study an extended product quadrature rule to approximate Hadam...
In the present paper we introduce and study an extended product quadrature rule to approximate Hadam...
In the present paper we introduce and study an extended product quadrature rule to approximate Hadam...
Some algorithms are described for the numerical evaluation of Hadamard finite part integrals of type...
Some algorithms are described for the numerical evaluation of Hadamard finite part integrals of type...
Some algorithms are described for the numerical evaluation of Hadamard finite part integrals of type...
AbstractIn this paper we construct product quadrature rules, based on spline interpolation, for the ...
AbstractA computationally efficient algorithm for evaluating Fourier integrals ∫1−1⨍(x)eiωxdx using ...