Metraipolis › archive › dc_ecdf43651e75
Overcompleteness — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Overcompleteness
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T16:09:43.165Z
- SHA-256 of the archived text
5b18c9e85efaf0f3518b1ed9fd5755cb984368bce0caa1c85f00da5b16de3fe8- Stable URL of this page
https://metraipolis.com/documento/dc_ecdf43651e75
How to cite
Overcompleteness — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Overcompleteness (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_ecdf43651e75 (Metraipolis archive dc_ecdf43651e75, sha256 5b18c9e85efaf0f3518b1ed9fd5755cb984368bce0caa1c85f00da5b16de3fe8)
BibTeX
@misc{dcecdf43651e75,
title = {Overcompleteness — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Overcompleteness},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_ecdf43651e75; sha256 5b18c9e85efaf0f3518b1ed9fd5755cb984368bce0caa1c85f00da5b16de3fe8},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Overcompleteness. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Overcompleteness is a concept from linear algebra that is widely used in mathematics, computer science, engineering, and statistics (usually in the form of overcomplete frames). It was introduced by R. J. Duffin and A. C. Schaeffer in 1952. Formally, a subset of the vectors { ϕ i } i ∈ J {\displaystyle \{\phi _{i}\}_{i\in J}} of a Banach space X {\displaystyle X} , sometimes called a "system", is complete if every element in X {\displaystyle X} can be approximated arbitrarily well in norm by finite linear combinations of elements in { ϕ i } i ∈ J {\displaystyle \{\phi _{i}\}_{i\in J}} . A system is called overcomplete if it contains more vectors than necessary to be complete, i.e., there exist ϕ j ∈ { ϕ i } i ∈ J {\displaystyle \phi _{j}\in \{\phi _{i}\}_{i\in J}} that can be removed from the system such that { ϕ i } i ∈ J ∖ { ϕ j } {\displaystyle \{\phi _{i}\}_{i\in J}\setminus \{\phi _{j}\}} remains complete. In research areas such as signal processing and function approximation, overcompleteness can help researchers to achieve a more stable, more robust, or more compact decomposition than using a basis.
Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Linear algebra»).
Fonte: Wikipedia in inglese, voce «Overcompleteness» — https://en.wikipedia.org/wiki/Overcompleteness
Wikidata Q7113610 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q7113610
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Overcompleteness?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1356951904, consultata il 2026-10-07T15:42:39.155Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 4b262b694f80cada4da40939494d5c99542edb55b13bc7746d2b21f9a1e8a474