Rational divide-and-conquer relations (Q541804)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5905130
Language Label Description Also known as
default for all languages
No label defined
    English
    Rational divide-and-conquer relations
    scientific article; zbMATH DE number 5905130

      Statements

      Rational divide-and-conquer relations (English)
      0 references
      0 references
      0 references
      0 references
      8 June 2011
      0 references
      Summary: A rational divide-and-conquer relation, which is a natural generalization of the classical divide-and-conquer relation, is a recursive equation of the form \(f(bn) = R (f(n), f(n), \dots, f(b- 1)n) + g(n)\), where \(b\) is a positive integer \(\geq 2\); \(R\) a rational function in \(b - 1\) variables and \(g\) a given function. Closed-form solutions of certain rational divide-and-conquer relations which can be used to characterize the trigonometric cotangent-tangent and the hyperbolic cotangent-tangent function solutions are derived and their global behaviors are investigated.
      0 references
      trigonometric cotantent-tangent function solution
      0 references
      rational divide-and-conquer relation
      0 references
      recursive equation
      0 references
      closed-form solutions
      0 references
      hyperbolic cotangent-tangent function solutions
      0 references
      global behaviors
      0 references

      Identifiers