Skip to main content

All Questions

Filter by
Sorted by
Tagged with
4 votes
1 answer
396 views

Resolvent of a triangular matrix

Suppose $A$ is a triangular matrix. What is the most efficient known algorithm to compute the polynomial (in $x$) matrix $(xI-A)^{-1}$? Of course, $(xI-A)^{-1}= N(x)/p_A(x)$, where $p_A$ is the ...
Michele's user avatar
  • 333
2 votes
0 answers
71 views

What are desirable properties that data should satisfy to reasonably use the dynamic mode decomposition?

In the dynamic mode decomposition, we consider a sequence of data vectors $\{z_0, \dots, z_m\}$ where $z_k \in \mathbb{R}^n$ for all $n$. We assume that the data satisfies the linear relationship $z_{...
Powerspawn's user avatar
-2 votes
0 answers
13 views

Convergence of $ \vec{x_{n+1}} = A^{-1} f(\vec{x_{n}},\vec{y_{n}}), \:\:\: \vec{y_{n+1}} = A^{-1} g(\vec{x_{n}},\vec{y_{n}}) $

I have two systems $$ A \vec{x} = f(\vec{x}, \vec{y}), \:\:\: A \vec{y} = g(\vec{x}, \vec{y}) $$ Both have the same constant, square, invertible matrix $A$. I implemented an iterative algorithm with ...
Redsbefall's user avatar