Integration of Rational Functions: Rational Computation of the Logarithmic Part
نویسندگان
چکیده
This formula is not satisfactory under a computing point of view because it introduces more algebraic quantities than necessary. The number P(a)/Q'(a) is called the residue of the root a of Q. We introduce the notion of multiplicity of a residue b that is the number of roots a having b as a residue. Trager (1976) introduced a new formula involving less algebraic numbers: let S(y) be the resultant S(y) = Resx[P(x) yQ'(x ), Q(x)-l; we have
منابع مشابه
COUPLED FIXED POINT THEOREMS FOR RATIONAL TYPE CONTRACTIONS VIA C-CLASS FUNCTIONS
In this paper, by using C-class functions, we will present a coupled xed problem in b-metric space for the single-valued operators satisfying a generalized contraction condition. First part of the paper is related to some xed point theorems, the second part presents the uniqueness and existence for the solution of the coupled xed point problem and in the third part we...
متن کاملThe best uniform polynomial approximation of two classes of rational functions
In this paper we obtain the explicit form of the best uniform polynomial approximations out of Pn of two classes of rational functions using properties of Chebyshev polynomials. In this way we present some new theorems and lemmas. Some examples will be given to support the results.
متن کاملA rational Chebyshev functions approach for Fredholm-Volterra integro-differential equations
The purpose of this study is to present an approximate numerical method for solving high order linear Fredholm-Volterra integro-differential equations in terms of rational Chebyshev functions under the mixed conditions. The method is based on the approximation by the truncated rational Chebyshev series. Finally, the effectiveness of the method is illustrated in several numerical examples. The p...
متن کاملRational Proofs against Rational Verifiers
Rational proofs, introduced by Azar and Micali (STOC 2012), are a variant of interactive proofs in which the prover is rational, and may deviate from the protocol for increasing his reward. Guo et al. (ITCS 2014) demonstrated that rational proofs are relevant to delegation of computation. By restricting the prover to be computationally bounded, they presented a one-round delegation scheme with ...
متن کاملSymbolic-Numeric Integration of Rational Functions
We consider the problem of symbolic-numeric integration of symbolic functions, focusing on rational functions. Using a hybrid method allows the stable yet efficient computation of symbolic antiderivatives while avoiding issues of ill-conditioning to which numerical methods are susceptible. We propose two alternative methods for exact input that compute the rational part of the integral using He...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 9 شماره
صفحات -
تاریخ انتشار 1990