Overcompleteness
id:
overcompleteness-247-14344092
title:
Overcompleteness
text:
Overcompleteness is a concept from linear algebra that is widely used in mathematics, computer science, engineering, and statistics. It was introduced by R. J. Duffin and A. C. Schaeffer in 1952. Formally, a subset of the vectors { ϕ i } i ∈ J of a Banach space X , sometimes called a "system", is complete if every element in X can be approximated arbitrarily well in norm by finite linear combinations of elements in { ϕ i } i ∈ J . A system is called overcomplete if it contains more vectors than
brand slug:
wiki
category slug:
encyclopedia
description:
Concept in linear algebra
original url:
https://en.wikipedia.org/wiki/Overcompleteness
date created:
date modified:
2024-02-13T03:12:12Z
main entity:
{"identifier":"Q7113610","url":"https://www.wikidata.org/entity/Q7113610"}
image:
fields total:
13
integrity:
14