Skip to search formSkip to main contentSkip to account menu

Euler–Maclaurin formula

Known as: Euler - Maclaurin formula, Euler summation formula, Euler-MacLaurin formula 
In mathematics, the Euler–Maclaurin formula provides a powerful connection between integrals (see calculus) and sums. It can be used to approximate… 
Wikipedia (opens in a new tab)

Related topics

Related topics

18 relations

Broader (2)

Approximation theoryHilbert space
Bernoulli polynomialsClenshaw–Curtis quadratureDiscrete cosine transformElementary function

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Reasoning on LTL on Finite Traces: Insensitivity to Infiniteness
In this paper we study when an LTL formula on finite traces (LTLf formula) is insensitive to infiniteness, that is, it can be… 
2013
2013
A Multidimensional Euler-Maclaurin Formula and an Application
Abstract. We compare, in the multidimensional case, the Fourier integral of a function λ of bounded variation and the… 
Highly Cited
2012
Highly Cited
2012
Coefficient estimates for a certain subclass of analytic and bi-univalent functions
Highly Cited
2010
Highly Cited
2010
Certain subclasses of analytic and bi-univalent functions
2010
2010
The generalized Euler-Maclaurin formula for the numerical solution of Abel-type integral equations
An extension of the Euler-Maclaurin formula to singular integrals was introduced by Navot [12]. In this paper this result is… 
2006
2006
The Euler-Maclaurin Formula and Sums of Powers
Mathematicians have long been intrigued by the sum 1 + 2 + · · ·+ n of the first n integers, where m is a nonnegative integer… 
2002
2002
Euler-Maclaurin Formula
In q-calculus, the Jackson formula (19.2) provides a way to compute explicitly a q-antiderivative of any function. Recall that… 
2001
2001
The Euler–Maclaurin and Taylor Formulas: Twin, Elementary Derivations
The calculator is perfectly suited to brute force processes. Want to sum a few hundred terms of a series? The calculator can do… 
Highly Cited
1994
Highly Cited
1994
Counting solutions to Presburger formulas: how and why
We describe methods that are able to count the number of integer solutions to selected free variables of a Presburger formula, or… 
1991
1991
A characterisation of graphs having three pairwise compatible Euler tours
  • B. Jackson
  • Journal of combinatorial theory. Series B (Print)
  • 1991
  • Corpus ID: 492658
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)