"Lanczos algorithm" meaning in English

See Lanczos algorithm in All languages combined, or Wiktionary

Proper name

Forms: the Lanczos algorithm [canonical]
Etymology: Devised by Cornelius Lanczos. Head templates: {{en-prop|def=1}} the Lanczos algorithm
  1. (computing theory) An iterative algorithm that is an adaptation of power methods to find the most useful eigenvalues and eigenvectors of an nth-order linear system with a limited number of operations, m, where m is much smaller than n. Wikipedia link: Cornelius Lanczos Related terms: Lanczos approximation, Lanczos potential, Lanczos resampling
{
  "etymology_text": "Devised by Cornelius Lanczos.",
  "forms": [
    {
      "form": "the Lanczos algorithm",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1"
      },
      "expansion": "the Lanczos algorithm",
      "name": "en-prop"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "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": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [],
          "source": "w"
        }
      ],
      "glosses": [
        "An iterative algorithm that is an adaptation of power methods to find the most useful eigenvalues and eigenvectors of an nth-order linear system with a limited number of operations, m, where m is much smaller than n."
      ],
      "id": "en-Lanczos_algorithm-en-name-c9mIO9nC",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "iterative",
          "iterative"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "eigenvalue",
          "eigenvalue"
        ],
        [
          "eigenvector",
          "eigenvector"
        ],
        [
          "operation",
          "operation"
        ]
      ],
      "raw_glosses": [
        "(computing theory) An iterative algorithm that is an adaptation of power methods to find the most useful eigenvalues and eigenvectors of an nth-order linear system with a limited number of operations, m, where m is much smaller than n."
      ],
      "related": [
        {
          "word": "Lanczos approximation"
        },
        {
          "word": "Lanczos potential"
        },
        {
          "word": "Lanczos resampling"
        }
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Cornelius Lanczos"
      ]
    }
  ],
  "word": "Lanczos algorithm"
}
{
  "etymology_text": "Devised by Cornelius Lanczos.",
  "forms": [
    {
      "form": "the Lanczos algorithm",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1"
      },
      "expansion": "the Lanczos algorithm",
      "name": "en-prop"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "related": [
    {
      "word": "Lanczos approximation"
    },
    {
      "word": "Lanczos potential"
    },
    {
      "word": "Lanczos resampling"
    }
  ],
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Theory of computing"
      ],
      "glosses": [
        "An iterative algorithm that is an adaptation of power methods to find the most useful eigenvalues and eigenvectors of an nth-order linear system with a limited number of operations, m, where m is much smaller than n."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "iterative",
          "iterative"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "eigenvalue",
          "eigenvalue"
        ],
        [
          "eigenvector",
          "eigenvector"
        ],
        [
          "operation",
          "operation"
        ]
      ],
      "raw_glosses": [
        "(computing theory) An iterative algorithm that is an adaptation of power methods to find the most useful eigenvalues and eigenvectors of an nth-order linear system with a limited number of operations, m, where m is much smaller than n."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Cornelius Lanczos"
      ]
    }
  ],
  "word": "Lanczos algorithm"
}

Download raw JSONL data for Lanczos algorithm 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 2026-01-06 from the enwiktionary dump dated 2026-01-01 using wiktextract (96027d6 and 9905b1f). 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.