Linear algebra is concerned with vector spaces of all dimensions and linear transformations between them, including systems of linear equations, bases, dimensions, subspaces, matrices, determinants, traces, eigenvalues and eigenvectors, diagonalization, Jordan forms, etc. For questions specifically ...

learn more… | top users | synonyms (1)

8
votes
1answer
78 views
+50

Most efficient method for computing Singular Value Decomposition of a triangular matrix?

There are several methods available for computing SVD of a general matrix. I am interested in knowing about the best approach which could be used for computing SVD of an upper triangular matrix. ...
2
votes
1answer
48 views
+100

Detecting singular system during Cholesky resolution

I am solving small linear systems with a symmetric positive matrix by the method of Cholesky, without pivoting. "Bad" matrices are detected when you take the square root of a diagonal element, which ...
2
votes
0answers
45 views
+50

Linear algebra, are my steps to compute cost function value correct?

Reading this : From http://www.holehouse.org/mlclass/09_Neural_Networks_Learning.html Cost function for a single training example is given as : cost(i) = $ y^i \; log \; h_\theta(x^i) + (1 - ...
5
votes
1answer
102 views
+100

Counting the number of rank $r$ binary $n \times k$ matrices that has unique columns

I'm trying to figure out how many ways there are to construct a $k \times n$ binary matrix such that it has rank $r$ and no column is repeating. I've tried a bunch of different approaches. The attempt ...
7
votes
1answer
229 views
+100

Approximate spectral decomposition

See attempt below I am interested in effective and constructive computations for finding approximate spectral decompositions in some suitable format. Namely, let $A: H \rightarrow H$ be a Hermitian ...
3
votes
0answers
39 views
+200

The lattice points in the real cone of some semigroups are just the integer cone of that semigroup.

I'm trying to solve an exercise in Fulton's book on toric varieties, and have reduced it to the following: Let $M$ be a lattice of rank $n$ with $M \otimes \mathbb{R} = V$, and $S$ be a finitely ...
1
vote
0answers
57 views
+50

When might some a variable leave the basis?

In the simplex algorithm in linear programming, what are conditions for a variable to leave a basis (not necessarily basis for the/an optimal solution)? I'm supposed to list as many sufficient and ...
2
votes
0answers
39 views
+100

How to prove this result about the interlacing of eigenvalues.

Let $A$ be a real symmetric matrix of order $n$ with eigenvalues $\mu_1\ge \mu_2,\ldots, \mu_{n}$. $B=\begin{bmatrix} x&x&x&x&x \end{bmatrix}$, where $x$ is non zero column vector in ...
1
vote
0answers
90 views
+150

Linear w.r.t. any measure

Let $X$ be a Banach space endowed with a Borel $\sigma$-algebra. How do we call a real-valued Borel function $f$ that satisfies for any Borel probability measure $\mu$ the following formula $$ ...
-5
votes
2answers
130 views
+400

How many ways are there to prove Cayley-Hamilton Theorem?

I see many proofs for Cayley-Hamilton Theorem in textbooks and net, so I want to know how many proofs are there for this important and applicable theorem.
0
votes
0answers
28 views
+50

Davenport's Q-method (Finding an orientation matching a set of point samples)

I have an initial set of 3D positions that form a shape. After letting them move independently, my goal is to find the best rotation of the original configuration to try to match the current state. ...
2
votes
0answers
110 views
+50

Spliting subspaces and finite fields

I'm sure that the following is true, but I can't prove it. Let $R<S<K, R=\mathrm{GF}(q),\ S= \mathrm{GF}(q^n), \ K= \mathrm{GF}(q^{mn})$ be a tower of finite fields and $A = \{\theta\in K: ...