Results 1  10
of
163,517
On the stability of recursive formulas
 ASTIN Bulletin
, 1993
"... Based on recurrence quation theory and relative error (rather than absolute error) analysis, the concept and criterion for the stability of a recurrence equation are clarified. A family of recursions, called congruent recursions, is proved to be strongly stable in evaluating its nonnegative solutio ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
negative solutions. A type of strongly unstable recursion is identified. The recursive formula discussed by PANJER (1981) is proved to be strongly stable in evaluating the compound Poisson and the compound Negative Binomial (including Geometric) distributions. For the compound Binomial distribution, the recursion
RECURSIVE FORMULAS FOR WELSCHINGER INVARIANTS
, 809
"... Abstract. Welschinger invariants of the real projective plane can be computed via the enumeration of enriched graphs, called marked floor diagrams. By a purely combinatorial study of these objects, we prove a CaporasoHarris type formula which allows one to compute Welschinger invariants for configu ..."
Abstract
 Add to MetaCart
Abstract. Welschinger invariants of the real projective plane can be computed via the enumeration of enriched graphs, called marked floor diagrams. By a purely combinatorial study of these objects, we prove a CaporasoHarris type formula which allows one to compute Welschinger invariants
RECURSIVE FORMULAS FOR COMPOUND DIFFERENCE DISTRIBUTIONS*
"... Recursive formulas satisfied by the numbers of claims are lifted to recursire formulas satisfied by the amounts of aggregate claims. The derivation relies on only an elementary techniquepower series solutions to differential equations. The formulas are useful in the application of risk theory and ..."
Abstract
 Add to MetaCart
Recursive formulas satisfied by the numbers of claims are lifted to recursire formulas satisfied by the amounts of aggregate claims. The derivation relies on only an elementary techniquepower series solutions to differential equations. The formulas are useful in the application of risk theory
Universal recursive formulae for Qcurvature
"... Abstract. We discuss recursive formulas for Branson’s Qcurvatures. The formulas present Qcurvatures of any order in terms of lower order Qcurvatures and lower order GJMSoperators. These presentations are universal in the sense that the recursive structure does not depend on the dimension of the ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. We discuss recursive formulas for Branson’s Qcurvatures. The formulas present Qcurvatures of any order in terms of lower order Qcurvatures and lower order GJMSoperators. These presentations are universal in the sense that the recursive structure does not depend on the dimension
AN EFFECTIVE RECURSION FORMULA FOR COMPUTING INTERSECTION NUMBERS
, 2007
"... We prove a new effective recursion formula for computing all intersection indices (integrals of ψ classes) on the moduli space of curves, inducting only on the genus. ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We prove a new effective recursion formula for computing all intersection indices (integrals of ψ classes) on the moduli space of curves, inducting only on the genus.
Recursion formulae of higher WeilPetersson volumes
 Inter. Math. Res. Notices
"... Abstract. In this paper we study effective recursion formulae for computing intersection numbers of mixed ψ and κ classes on moduli spaces of curves. By using the celebrated WittenKontsevich theorem, we generalize MulaseSafnuk form of Mirzakhani’s recursion and prove a recursion formula of higher ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
Abstract. In this paper we study effective recursion formulae for computing intersection numbers of mixed ψ and κ classes on moduli spaces of curves. By using the celebrated WittenKontsevich theorem, we generalize MulaseSafnuk form of Mirzakhani’s recursion and prove a recursion formula of higher
RECURSIVE FORMULAS RELATED TO THE SUMMATION OF THE MÖBIUS FUNCTION
"... Abstract. For positive integers n, let µ(n) be the Möbius function, and M(n) its sum M(n) = Pn k=1 µ(k). We find some identities and recursive formulas for computing M(n); in particular, we present a twoparametric family of recursive formulas. 1. ..."
Abstract
 Add to MetaCart
Abstract. For positive integers n, let µ(n) be the Möbius function, and M(n) its sum M(n) = Pn k=1 µ(k). We find some identities and recursive formulas for computing M(n); in particular, we present a twoparametric family of recursive formulas. 1.
An inductive proof of the derivative Bspline recursion formula
"... An inductive proof using the recursion formula for Bsplines is given for the derivative of a Bspline function in terms of two Bsplines of lower order. Keywords. Bsplines, recursion, derivative. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
An inductive proof using the recursion formula for Bsplines is given for the derivative of a Bspline function in terms of two Bsplines of lower order. Keywords. Bsplines, recursion, derivative.
A RECURSION FORMULA FOR THE MOMENTS OF THE GAUSSIAN ORTHOGONAL ENSEMBLE
"... Abstract. – We present an analogue of the HarerZagier recursion formula for the moments of the Gaussian Orthogonal Ensemble in the form of a five term recurrence equation. The proof is based on simple Gaussian integration by parts and differential equations on Laplace transforms. A similar recursio ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Abstract. – We present an analogue of the HarerZagier recursion formula for the moments of the Gaussian Orthogonal Ensemble in the form of a five term recurrence equation. The proof is based on simple Gaussian integration by parts and differential equations on Laplace transforms. A similar
Results 1  10
of
163,517