"Durand-Kerner method" meaning in English

{
  "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": "English entries with language name categories using raw markup",
          "parents": [
            "Entries with language name categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English entries with topic categories using raw markup",
          "parents": [
            "Entries with topic categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "Entry maintenance"
          ],
          "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": "quotation"
        }
      ],
      "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 entries with language name categories using raw markup",
        "English entries with topic categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English terms with non-redundant non-automated sortkeys",
        "English terms with quotations",
        "English uncountable nouns",
        "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": "quotation"
        }
      ],
      "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"
}