Asymptotic Expansions of exp - log
نویسندگان
چکیده
We give an algorithm to compute asymptotic expansions of exp-log functions. This algorithm automatically computes the necessary asymptotic scale and does not suuer from problems of indeenite cancellation. In particular, an asymptotic equivalent can always be computed for a given exp-log function. D eveloppements asymptotiques de fonctions exp-log R esum e Nous pr esentons un algorithme pour le calcul des d eveloppements asymptotiques des fonctions exp-log. Cet algorithme calcule automatiquement l' echelle asymptotique n ecessaire et ne souure pas de probl emes d'annulation innnie des premiers termes. En particulier, il est toujours possible de calculer un equivalent d'une fonction exp-log donn ee. Abstract We give an algorithm to compute asymptotic expansions of exp-log functions. This algorithm automatically computes the necessary asymptotic scale and does not suuer from problems of indeenite cancellation. In particular, an asymptotic equivalent can always be computed for a given exp-log function.
منابع مشابه
Calcul Symbolique, Programmation Et G Enie Logiciel General Asymptotic Scales and Computer Algebra General Asymptotic Scales and Computer Algebra General Asymptotic Scales and Computer Algebra
In many natural applications, one encounters asymptotic expansions of a form more complicated than mere Puiseux series. Existing computer algebra systems lack good algorithms for handling such asymptotic expansions. We present tools that permit the representation and automatic handling of general exp-log asymptotic expansions. Echelles Asymptotiques G en erales et Calcul Formel R esum e Dans de...
متن کاملAsymptotic Expansions with Oscillating CoeÆcients
In recent years, Computer Algebra has seen signi cant advances on a wide range of fronts. One of the many areas of development has been Symbolic Asymptotics. The exp{log functions are those de ned by expressions built from the rational numbers Q and the variable, x, using arithmetic operations and the functions exp and log, with the understanding that the latter is only applied to arguments whi...
متن کاملSecond Order Moment Asymptotic Expansions for a Randomly Stopped and Standardized Sum
This paper establishes the first four moment expansions to the order o(a^−1) of S_{t_{a}}^{prime }/sqrt{t_{a}}, where S_{n}^{prime }=sum_{i=1}^{n}Y_{i} is a simple random walk with E(Yi) = 0, and ta is a stopping time given by t_{a}=inf left{ ngeq 1:n+S_{n}+zeta _{n}>aright} where S_{n}=sum_{i=1}^{n}X_{i} is another simple random walk with E(Xi) = 0, and {zeta _{n},ngeq 1} is a sequence of ran...
متن کاملAsymptotic Expansions for Oscillatory Integrals Using Inverse Functions
We treat finite oscillatory integrals of the form ∫ b a F (x) exp[ikG(x)]dx in which both F and G are real on the real line, are analytic over the open integration interval, and may have algebraic singularities at either or both interval end points. For many of these, we establish asymptotic expansions in inverse powers of k. No appeal to the theories of stationary phase or steepest descent is ...
متن کاملAutomatic application of successive asymptotic expansions of Feynman diagrams
We discuss the program EXP used to automate the successive application of asymptotic expansions to Feynman diagrams. We focus on the generation of the relevant subgraphs and the determination of the topologies for the remaining integrals. Both tasks can be solved by using backtracking-type recursive algorithms. In addition, an application of EXP is presented, where the integrals were calculated...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996