"Durand-Kerner method" meaning in English

See Durand-Kerner method in All languages combined, or Wiktionary

Proper name

Etymology: After Emile Durand, a French mathematician, and Immo Kerner, a German mathematician. Head templates: {{en-proper noun}} Durand-Kerner method
  1. (mathematics) An algorithm for finding the roots of polynomial equations. Categories (topical): Mathematics Synonyms: method of Weierstrass
    Sense id: en-Durand-Kerner_method-en-name-RyfBbiAK Categories (other): English entries with incorrect language header, Entries with translation boxes, Pages with 1 entry, Pages with entries Topics: mathematics, sciences
{
  "etymology_text": "After Emile Durand, a French mathematician, and Immo Kerner, a German mathematician.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Durand-Kerner method",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Entries with translation boxes",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "1975, International journal of computer mathematics, volumes 5-6:",
          "text": "The improved Durand-Kerner Method […] Referring to the improved Durand-Kerner and the improved Ehrlich we find that the approximations converging towards the origin will move directly towards this zero on each iteration cycle always reducing their distance away by the fraction 2/(m+1) in the first method and 3/(m+2) in the second […]",
          "type": "quote"
        }
      ],
      "glosses": [
        "An algorithm for finding the roots of polynomial equations."
      ],
      "id": "en-Durand-Kerner_method-en-name-RyfBbiAK",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "root",
          "root"
        ],
        [
          "polynomial",
          "polynomial"
        ]
      ],
      "raw_glosses": [
        "(mathematics) An algorithm for finding the roots of polynomial equations."
      ],
      "synonyms": [
        {
          "word": "method of Weierstrass"
        }
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "Durand-Kerner method"
}
{
  "etymology_text": "After Emile Durand, a French mathematician, and Immo Kerner, a German mathematician.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Durand-Kerner method",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English terms with quotations",
        "English uncountable nouns",
        "Entries with translation boxes",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Mathematics"
      ],
      "examples": [
        {
          "ref": "1975, International journal of computer mathematics, volumes 5-6:",
          "text": "The improved Durand-Kerner Method […] Referring to the improved Durand-Kerner and the improved Ehrlich we find that the approximations converging towards the origin will move directly towards this zero on each iteration cycle always reducing their distance away by the fraction 2/(m+1) in the first method and 3/(m+2) in the second […]",
          "type": "quote"
        }
      ],
      "glosses": [
        "An algorithm for finding the roots of polynomial equations."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "root",
          "root"
        ],
        [
          "polynomial",
          "polynomial"
        ]
      ],
      "raw_glosses": [
        "(mathematics) An algorithm for finding the roots of polynomial equations."
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "synonyms": [
    {
      "word": "method of Weierstrass"
    }
  ],
  "word": "Durand-Kerner method"
}

Download raw JSONL data for Durand-Kerner method meaning in English (1.4kB)


This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2025-03-23 from the enwiktionary dump dated 2025-03-21 using wiktextract (fef8596 and 633533e). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.