"bisection method" meaning in English

See bisection method in All languages combined, or Wiktionary

Noun

Forms: bisection methods [plural]
Head templates: {{en-noun}} bisection method (plural bisection methods)
  1. (mathematics) A root-finding method that applies to any continuous functions for which one knows two values with opposite signs, and consists of repeatedly bisecting the interval defined by these values and then selecting the subinterval in which the function changes sign, and therefore must contain a root.

Inflected forms

{
  "forms": [
    {
      "form": "bisection methods",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "bisection method (plural bisection methods)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English links with redundant alt parameters",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [],
          "source": "w"
        }
      ],
      "glosses": [
        "A root-finding method that applies to any continuous functions for which one knows two values with opposite signs, and consists of repeatedly bisecting the interval defined by these values and then selecting the subinterval in which the function changes sign, and therefore must contain a root."
      ],
      "id": "en-bisection_method-en-noun-pOB5YHMi",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "root",
          "root"
        ],
        [
          "continuous function",
          "continuous function"
        ],
        [
          "value",
          "value"
        ],
        [
          "opposite",
          "opposite"
        ],
        [
          "sign",
          "sign"
        ],
        [
          "consist",
          "consist"
        ],
        [
          "bisect",
          "bisect"
        ],
        [
          "interval",
          "interval"
        ],
        [
          "subinterval",
          "subinterval"
        ],
        [
          "function",
          "function"
        ]
      ],
      "raw_glosses": [
        "(mathematics) A root-finding method that applies to any continuous functions for which one knows two values with opposite signs, and consists of repeatedly bisecting the interval defined by these values and then selecting the subinterval in which the function changes sign, and therefore must contain a root."
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "bisection method"
}
{
  "forms": [
    {
      "form": "bisection methods",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "bisection method (plural bisection methods)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English links with redundant alt parameters",
        "English multiword terms",
        "English nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Mathematics"
      ],
      "glosses": [
        "A root-finding method that applies to any continuous functions for which one knows two values with opposite signs, and consists of repeatedly bisecting the interval defined by these values and then selecting the subinterval in which the function changes sign, and therefore must contain a root."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "root",
          "root"
        ],
        [
          "continuous function",
          "continuous function"
        ],
        [
          "value",
          "value"
        ],
        [
          "opposite",
          "opposite"
        ],
        [
          "sign",
          "sign"
        ],
        [
          "consist",
          "consist"
        ],
        [
          "bisect",
          "bisect"
        ],
        [
          "interval",
          "interval"
        ],
        [
          "subinterval",
          "subinterval"
        ],
        [
          "function",
          "function"
        ]
      ],
      "raw_glosses": [
        "(mathematics) A root-finding method that applies to any continuous functions for which one knows two values with opposite signs, and consists of repeatedly bisecting the interval defined by these values and then selecting the subinterval in which the function changes sign, and therefore must contain a root."
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "bisection method"
}

Download raw JSONL data for bisection method meaning in English (1.5kB)


This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2025-11-18 from the enwiktionary dump dated 2025-11-01 using wiktextract (22806f4 and a050b89). 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.