Generic asymptotic expansions

Joris Van Der Hoeven

doi:10.1007/s002000050094

Generic asymptotic expansions

Joris Van Der Hoeven

Résultats de recherche: Contribution à un journal › Article › Revue par des pairs

Résumé

We give an expansion algorithm for germs of exp-log functions at infinity which is correct modulo Schanuel's conjecture. We also show how the algorithm can be made generic. More precisely, we reduce the expansion algorithm for exp-log functions depending on parameters to the problem of deciding whether a given system of exp-log equations and inequalities in several variables admits a solution.

langue originale	Anglais
Pages (de - à)	25-44
Nombre de pages	20
journal	Applicable Algebra in Engineering, Communication and Computing
Volume	9
Numéro de publication	1
Les DOIs	https://doi.org/10.1007/s002000050094
état	Publié - 1 janv. 1998

Accès au document

10.1007/s002000050094

Contient cette citation

@article{f90a20a8e64e400185d344e5571f78fd,

title = "Generic asymptotic expansions",

abstract = "We give an expansion algorithm for germs of exp-log functions at infinity which is correct modulo Schanuel's conjecture. We also show how the algorithm can be made generic. More precisely, we reduce the expansion algorithm for exp-log functions depending on parameters to the problem of deciding whether a given system of exp-log equations and inequalities in several variables admits a solution.",

keywords = "Algorithm, Asymptotic expansion, Exp-log function, Genericity",

author = "\{Van Der Hoeven\}, Joris",

year = "1998",

month = jan,

day = "1",

doi = "10.1007/s002000050094",

language = "English",

volume = "9",

pages = "25--44",

journal = "Applicable Algebra in Engineering, Communication and Computing",

issn = "0938-1279",

number = "1",

}

TY - JOUR

T1 - Generic asymptotic expansions

AU - Van Der Hoeven, Joris

PY - 1998/1/1

Y1 - 1998/1/1

N2 - We give an expansion algorithm for germs of exp-log functions at infinity which is correct modulo Schanuel's conjecture. We also show how the algorithm can be made generic. More precisely, we reduce the expansion algorithm for exp-log functions depending on parameters to the problem of deciding whether a given system of exp-log equations and inequalities in several variables admits a solution.

AB - We give an expansion algorithm for germs of exp-log functions at infinity which is correct modulo Schanuel's conjecture. We also show how the algorithm can be made generic. More precisely, we reduce the expansion algorithm for exp-log functions depending on parameters to the problem of deciding whether a given system of exp-log equations and inequalities in several variables admits a solution.

KW - Algorithm

KW - Asymptotic expansion

KW - Exp-log function

KW - Genericity

U2 - 10.1007/s002000050094

DO - 10.1007/s002000050094

M3 - Article

AN - SCOPUS:0031678151

SN - 0938-1279

VL - 9

SP - 25

EP - 44

JO - Applicable Algebra in Engineering, Communication and Computing

JF - Applicable Algebra in Engineering, Communication and Computing

IS - 1

ER -

Generic asymptotic expansions

Résumé

Accès au document

Empreinte digitale

Contient cette citation