Talk:Matrix decomposition

This is the talk page for discussing improvements to the Matrix decomposition article. This is not a forum for general discussion of the subject of the article.

Add new text under old text. New to Wikipedia? Welcome! Learn to edit; get help. Start a new topic Assume good faith Be polite and avoid personal attacks Be welcoming to newcomers Seek dispute resolution if needed Article policies Neutral point of view No original research Verifiability

Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL

Archives: 1Auto-archiving period: 12 months

This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Mathematics Mid‑priority This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics Mid This article has been rated as Mid-priority on the project's priority scale.

Archives

1

This page has archives. Topics inactive for 365 days are automatically archived 1 or more at a time by Lowercase sigmabot III if there are more than 10.

I suggest that this page would benefit by including additional matrix decompositions, particularly the LDL^t decomposition. Does anyone have any input on this? Thanks Dwhitam (talk) 04:18, 28 April 2009 (UTC) DwhitamReply

It is already mentioned. See Matrix decomposition#Cholesky decomposition which links to LDL decomposition (which is the LDL^t decomposition). JackSchmidt (talk) 13:28, 28 April 2009 (UTC)Reply

In general, we have ${\displaystyle A=VDV^{-1}}$, when A is symmetric, do we have ${\displaystyle A=VDV^{T}}$? Jackzhp (talk) 14:10, 7 March 2010 (UTC)Reply

A link to Rank factorization was recently added. This looks very similar to LU decomposition, but I don't have time right now to check whether and how it is related. Should both concepts be linked separately on this page, or should they be discussed together? And should the Rank factorization page be merged with the LU decomposition page? Rinconsoleao (talk) 08:50, 21 July 2010 (UTC)Reply

It's different from LU decomposition -- the article says that it works for rectangular matrices (whereas LU is only for square matrices), and the first matrix in that decomposition isn't triangular. So we shouldn't merge these articles. -- X7q (talk) 14:27, 21 July 2010 (UTC)Reply

Is it defined by PA=LU or by A=LUP? There seems to be some contradiction. —Preceding unsigned comment added by 68.102.28.107 (talk) 22:45, 10 May 2011 (UTC)Reply

The material just added regarding clans and petri nets appears to be original research and probably should be removed. Anita5192 (talk) 17:56, 8 April 2013 (UTC)Reply

I agree; journals published by scirp probably do not pass the threshold for this article, where all other decompositions are well established. Thus, I removed the material. -- Jitse Niesen (talk) 08:53, 9 April 2013 (UTC)Reply

I find it quite amazing that in the long list of decompositions, the one based on the direct sum decomposition of the space into generalised eigenspaces appears to be missing. This is one of the most basic decompositions of any linear operator on a complex vector space without additional (inner product) structure. More precisely it applies to any square matrix whose characterisitic (or minimal) polynomial splits into linear factors. While it is related to the Jordan normal form and somewhat to the Jordan–Chevalley decomposition, it is definitely not the same as either one of them. Is there a particular reason it is missing? — Preceding unsigned comment added by Marc van Leeuwen (talk • contribs) 14:12, 1 May 2013 (UTC)Reply

"Existence: An n-by-n matrix A always has n eigenvalues" It isn't true. Matrix [0,1;-1,0] has no real eigenvalues, only complex: ${\displaystyle i}$ and ${\displaystyle -i}$. An nxn matrix over complex numbers always has n complex eigenvalues, an nxn real matrix has n eigenvalues for example when it is a symmetric matrix. Bartekltg (talk) —Preceding undated comment added 03:16, 22 February 2014 (UTC)Reply

It is written :

• Decomposition: ${\displaystyle A=U^{T}U}$, where U is upper triangular with positive diagonal entries

Yet, in the Cholesky decomposition page, it is an lower triangular ! — Preceding unsigned comment added by Rafnuss (talk • contribs) 08:26, 6 January 2015 (UTC)Reply

In the Cholesky decomposition page, the decomposition is written as ${\displaystyle A=LL^{T}}$, where L is a lower triangular matrix. Defining ${\displaystyle U=L^{T}}$, then U is upper triangular and ${\displaystyle A=U^{T}U}$. Thus, these affirmations are equivalent. Best regards, Saung Tadashi (talk) 12:31, 6 January 2015 (UTC)Reply

The current state of the article seems to have two issues:

1. The article isn't easily readable
2. The content of this article doesn't seem to be of much use than those articles linked from the article.

There are two possible solutions to this,

1. Making this a Set index article directing users to the more specific articles. Consequence : Allows users to identify that this page doesn't give much information by itself. Example : Inkcap
2. Tabulate the sections of the article to make it more readable. Consequence : Makes article more readable. Example : Graph product

- - Kaartic ^{correct me, if i'm wrong} 13:21, 27 May 2017 (UTC)Reply

I think a bird-view of the matrix decompositions using a table would be more interesting as it would allow the readers to compare each decomposition. Saung Tadashi (talk) 23:34, 28 May 2017 (UTC)Reply

Hello fellow Wikipedians,

I have just modified one external link on Matrix decomposition. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:

• Added archive https://web.archive.org/web/20110314171151/http://www.graphlab.ml.cmu.edu/pmf.html to http://www.graphlab.ml.cmu.edu/pmf.html

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Y An editor has reviewed this edit and fixed any errors that were found.

• If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
• If you found an error with any archives or the URLs themselves, you can fix them with this tool.

Cheers.—InternetArchiveBot (Report bug) 15:41, 21 January 2018 (UTC)Reply