Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Matrix decomposition
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Generalizations == {{Expand section|1=examples and additional citations|date=December 2014}} There exist analogues of the SVD, QR, LU and Cholesky factorizations for '''quasimatrices''' and '''cmatrices''' or '''continuous matrices'''.<ref>{{harvnb|Townsend|Trefethen|2015}}</ref> A ‘quasimatrix’ is, like a matrix, a rectangular scheme whose elements are indexed, but one discrete index is replaced by a continuous index. Likewise, a ‘cmatrix’, is continuous in both indices. As an example of a cmatrix, one can think of the kernel of an [[integral operator]]. These factorizations are based on early work by {{harvtxt|Fredholm|1903}}, {{harvtxt|Hilbert|1904}} and {{harvtxt|Schmidt|1907}}. For an account, and a translation to English of the seminal papers, see {{harvtxt|Stewart|2011}}.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)