English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The article presents methods for the computation of all Mathieu functions of integer order, which cover a large range of n and h; previous algorithms were limited to small values of n. The algorithms are given in sufficient detail to enable straightforward implementation. The algorithms can handle a large range of the order n (0-200) and the parameter h (0-4n).

Algorithms for the computation of all Mathieu functions of integer orders