Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 88812

Questions where the notion matrix has an important or crucial role (for the latter, note the tag matrix-theory for potential use). Matrices appear in various parts of mathematics, and this tag is typically combined with other tags to make the general subject clear, such as an appropriate top-level tag ra.rings-and-algebras, co.combinatorics, etc. and other tags that might be applicable. There are also several more specialized tags concerning matrices.

5 votes
1 answer
763 views

Perturbations on the pseudoinverse of a matrix

Given a matrix $A \in \mathbb{R}^{n\times m}$, and its perturbation $$ A_p = A + \Delta $$ is there a way to represent $$ (A_p)^{\star}= (A)^{\star} + f(\Delta) $$ where $(A_p)^{\star}$ ($(A)^{\star …
Ulderique Demoitre's user avatar
2 votes
0 answers
130 views

SVD when only off-diagonal terms are known

I have a real matrix $A \in \mathbb{R}^{n\times n}$ such that: $A$ is symmetric All the off-diagonal terms are known and positive Has rank $k<n$ Unfortunately I don't know the values of the diagon …
Ulderique Demoitre's user avatar
0 votes
1 answer
1k views

SVD alternatives for symmetric matrices

; however, under the copmutational point of view, SVD might be very slow on big matrices (its running time is $O(n^3)$). … Is there any known faster alternative to decompose such symmetric matrices? …
Ulderique Demoitre's user avatar
0 votes
1 answer
719 views

Unique solution to a matrix equations [closed]

Given any $n \times k$ real matrix $M$, where $n<k$ and $rank(M)=n$, I consider the following equation (where $M'$ is the transpose of $M$): $$ MM' = MAM' $$ Then clearly, $A = \mathbb{1}_k $, the $ …
Ulderique Demoitre's user avatar