On the Poincaré-Lyapunov constants and the Poincare series

Jaume Giné; Xavier Santallusia

Displaying similar documents to “On the Poincaré-Lyapunov constants and the Poincare series”

Improved K-K algorithm for computing Lyapunov values

Wang, Duo, Mao, Rei

Similarity:

Algorithm 7. Evaluation of a trigonometric polynomial

Lucja Sobich (1970)

Applicationes Mathematicae

Similarity:

Existence of guided cylindrical TM-modes in a homogeneous self-focusing dielectric

Charles A. Stuart, Huan-Song Zhou (2001)

Annales de l'I.H.P. Analyse non linéaire

Similarity:

A modified algorithm for the strict feasibility problem

D. Benterki, B. Merikhi (2010)

RAIRO - Operations Research

Similarity:

In this note, we present a slight modification of an algorithm for the strict feasibility problem. This modification reduces the number of iterations.

Algorithm 90. A procedure realizing a second order one-step method solving a system of ordinary differential equations

M. Szyszkowicz (1984)

Applicationes Mathematicae

Similarity:

Henri Poincaré's “Science et méthode”

David Ruelle (1998)

Publications Mathématiques de l'IHÉS

Similarity:

Extending the MAX Algorithm for Maximum Independent Set

Ngoc C. Lê, Christoph Brause, Ingo Schiermeyer (2015)

Discussiones Mathematicae Graph Theory

Similarity:

The maximum independent set problem is an NP-hard problem. In this paper, we consider Algorithm MAX, which is a polynomial time algorithm for finding a maximal independent set in a graph G. We present a set of forbidden induced subgraphs such that Algorithm MAX always results in finding a maximum independent set of G. We also describe two modifications of Algorithm MAX and sets of forbidden induced subgraphs for the new algorithms.

Algorithm 32. Construction of polynomial values orthogonal on given set of one-dimensional variable

Anna Bartkowiak (1974)

Applicationes Mathematicae

Similarity: