See Lanczos algorithm on Wiktionary
{
"etymology_text": "Devised by Cornelius Lanczos.",
"head_templates": [
{
"args": {},
"expansion": "Lanczos algorithm",
"name": "en-proper noun"
}
],
"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",
"Lanczos algorithm"
]
}
],
"word": "Lanczos algorithm"
}
{
"etymology_text": "Devised by Cornelius Lanczos.",
"head_templates": [
{
"args": {},
"expansion": "Lanczos algorithm",
"name": "en-proper noun"
}
],
"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",
"Lanczos algorithm"
]
}
],
"word": "Lanczos algorithm"
}
Download raw JSONL data for Lanczos algorithm meaning in All languages combined (1.5kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2025-05-27 from the enwiktionary dump dated 2025-05-20 using wiktextract (a4e883e and f1c2b61). 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.