Questions on the various algorithms used in linear algebra computations (matrix computations).

learn more… | top users | synonyms

1
vote
0answers
104 views

Fast simultaneous orthonormal basis computation for multiple nullspaces

Consider vectors $a_i\in R^{m\times n}$ and $B\in R^{m\times p}$, with $n +p < m$, and assume that the columns of $(A, B)$ are linearly independent. To compute an orthobasis for $\text{ker}(A)$, it ...
1
vote
0answers
423 views

Tridiagonal sparse matrix - linear equation

I have to following linear system to solve : $Ax=e_1$ where $A$ is a sparse tridiagonal matrix with the main diagonal terms $a_{ii}$ being all different, and the off-diagonal terms being each others ...
0
votes
0answers
20 views

Smallest square problem, $A^*A$ singular?

In our numerics class, we have to solve the smallest square problem $Ax = b$ with $$A = \left( \begin{matrix} 1 & 3 &-4\\ 3 & 9 & -2\\ 4 & 12 & -6\\ 2 & 6 & 2 ...
0
votes
0answers
13 views

Linear Inverse Problem with symmetry constraint

I'm not entirely sure if this is even a solvable problem: $\mathbf{A} = \mathbf{B} \mathbf{C}$ Knowns: $\mathbf{A} \in \Bbb{R}_{n\times m}^{+}$, $\mathbf{B} \in \Bbb{R}_{n\times m}^{+}$ An ...
0
votes
0answers
33 views

Determining Nullspace Basis so that only one column is deleted or added as a row is added or deleted, with remaining columns of basis staying the same

I would like to compute, in MATLAB, the basis Z for the nullspace of an m by n matrix A, such that if one row of A is added (resulting in A_a), the basis for A_a is n-m-1 of the n-m columns of Z, ...
0
votes
0answers
10 views

the SVD (singular value decomposition) of an augmented matrix

Suppose we have a $4\times 3$ dimensional matrix $A$. Denote the SVD of $A$ by $USV^T$, where $U\in R^{4\times 3}, S\in R^{3\times 3}, V\in R^{3\times 3}$. Then, we construct a new matrix $B=[A;0]\in ...
0
votes
0answers
24 views

Upperbound for a linear algebraic ratio?

Consider ($n\times 1$)-column vector $\mathbf{p} = (p_i)_{i=1}^n$ with $p_i > 0$ and a symmetric ($n\times n$)-matrix $\mathbf{A} = [a_{ij}]$ with $a_{ii} = 0$ and $a_{ij} \in [0,1]$ for $i \neq ...
0
votes
0answers
7 views

Backwards Stability of systems

Let $A$ be a nonsingular matrix, let $x_{k+1}$ be an approximation to the solution of $Ax=b$, and let $r^{k+1}=b-Ax^{k+1}$. Show that $x^{k+1}$ is $\epsilon$-backward stable approximate of ...
0
votes
0answers
21 views

Linearize discretized nonlinear system model

For the following nonlinear system I want to find the linearization after a discretization: $$ \begin{pmatrix} \dot{x_{1}} \\ \dot{x_{1}} \\ \dot{x_{1}} \end{pmatrix} = 1/A \begin{pmatrix} ...
0
votes
0answers
22 views

Looking for polynomial to represent approximate 2D matrix.

I am looking for a polynomial that similars Legender polynomial(a set of orthogonal polynomial basis function. Could you suggest to me some polynomial? Because my goal is that I want to approximate 2D ...
0
votes
0answers
14 views

sparse, complex, unymetric test-matrix

Can anybody recommend me a sparse, complex, unsymmetric test-matrix (maybe from MartixMarket) which is solvable with a transpose-free QMR without preconditioning in under 1000 iterations?
0
votes
0answers
18 views

How many kind of basis function to approximate an arbitrary function

I am finding a list algorithm to approximate an arbitrary function. Such as Bernstein, he said that a linear combination of Bernstein basis polynomials $$B_n(x) = \sum_{\nu=0}^{n} \beta_{\nu} ...
0
votes
0answers
17 views

Implementing specific SVD algorithms

My goal is to learn to implement the two-sided Jacobi SVD, a method of SVD for bidiagonal matrices, and a method of SVD for tridiagonal matrices. Can anyone recommend a place to learn about these, or ...
0
votes
0answers
21 views

How to implement QR method for bidiagonal matrices?

My goal is to take the singular value decomposition of a (not necessarily square) matrix. I have a method to do bidiagonalization of a matrix, and I can chop the bottom rows of zeros. In order to find ...
0
votes
0answers
21 views

Help understanding Jacobi SVD

I found this link, and I want to complete this implementation of the Jacobi SVD method, but it isn't clear to me how to implement alpha, beta, and gamma. I think it's very clear that ...
0
votes
0answers
4 views

Find rank-vital rows (coloops) of a matrix

Let $A$ be a $m\times n, m\geq n$ matrix over a finite field. Coloop is any row of $A$, such that the rank of $A$ is decreased when that row is removed. What is an efficient algorithm to find all the ...
0
votes
0answers
37 views

QR method for Hessenberg matrices

In trying to implement the method, my approach is to use a reduction to Hessenberg form, and then to iterate using a QR method of Givens rotations. However, I am having trouble successfully ...
0
votes
0answers
19 views

Generate duplicate element from a matrix by formula $b(i:j)=A(i:j,:) \times A^{-1} \times b$

I have an interesting question about generate duplicate elements from matrix. I assume that I have a matrix A (such as the bellow example $5 \times 5$) and vector $b$ is $5 \times 1$. My goal is make ...
0
votes
0answers
16 views

Help Required in eigenvectors for sparse matrix?

I have a large sparse matrix A(~400000,~400000) . If I randomly remove few rows from the matrix will there be considerable change in the eigenvalues and the eigenvector's compared to eigenvector's of ...
0
votes
0answers
40 views

Finding a function using first derivative

I have some data about just first derivative of a function. Also, I know a point of this function(e.g. (x1,y1)). How can I obtain the function? All my date are numerical. dev f(x)=[ 580.00 , 479.7308 ...
0
votes
0answers
36 views

Normal form calculation

I am working on a problem involves 4 dimensional dynamical system. Is there any ready package (for maple ,matlab...) which calculate the normal form of nonlinear continuous dynamical systems? The ...
0
votes
0answers
34 views

Can someone explain how to obtain zeroes for L and U for A=LU factorization?

I understand that,In A=LU, for the L = lower triangular matrix, must have zeroes for all elements above the main diagonal and for U = upper triangular matrix, we need to have all elements as zeroes ...
0
votes
0answers
97 views

QR fatorization for tridiagonal matrices

Let $$A = \left[\begin{array}{rrrr} \delta_1&\gamma_2 & &0 \\ \gamma_2&\delta_2 &\ddots & \\ &\ddots &\ddots &\gamma_n \\ 0 & &\gamma_n ...
0
votes
0answers
24 views

the rank of QR decomposition

I saw this in a paper, where one has a QR decomposition $C=QR$ ($C\in R^{m\times r}$, $Q\in R^{m\times r}$ is column orthogonal, $R\in R^{r\times r}$, $m>r$). However, under the condition that the ...
0
votes
0answers
62 views

Practical examples/implementation details for Gauss-Seidel method

I'm having a presentation on Gauss-Seidel iterative method, and although it isn't mandatory , I would like to have some practical examples for this method (a system of linear equations with n>=1000, ...
0
votes
0answers
20 views

Iterated Schur complement for block matrices

Suppose you have got a symmetric block matrix $A = \begin{pmatrix} A_{1,1} & \dots & A_{1,n} \\ \vdots & & \vdots \\ A_{n,1} & \dots & A_{n,n} \end{pmatrix}$ Suppose that ...
0
votes
0answers
38 views

How to fit a stochastic matrix to given data.?

Given a data sequence of noisy observations of a 3-state Markov chain $X$ -- $y_1$,$y_2$,...$y_n$, with two transition matrices $A_1$ and $A_2$ corresponding to different regions (**) in the (unit) ...
0
votes
0answers
11 views

Powers of matrices via the generalised Lanczos process

At each iterative step of the generalised Lanczos process for the pair of matrices (A,B), we obtain the following factorisation: $$ A Q_k = B Q_{k+1} \widehat{T}_k, $$ where $Q_k^T B Q_k = I_k$ and ...
0
votes
0answers
43 views

Which of the following fixed point iterations will converge?

Which of the following fixed point iterations will converge? Why? Give the rate of convergence. (a) $x_{n+1} = \cos x_n$ (b) $x_{n+1} = \sin x_n$ (c) $x_{n+1} = \tan x_n$ For $10$ bonus ...
0
votes
0answers
20 views

Mixed Lognormal Model Calibration

Any ideas as to how to calibrate a mixed lognormal volatility model (Brigo and Mercurio 2002) for arbitrary N < 10? The paper seems vague with respect to implementation.
0
votes
0answers
14 views

LU Decopmostions with block

So both $A_{11}$ and $\hat{A_{22}}$ have $LU$ decompositions say $A_{11}=L_{1}U_{1}$ and $\hat{A_{22}}=L_{2}U_{2}$. Show that $ \begin{bmatrix} A_{11} & A_{12} \\ A_{21} & A_{22} ...
0
votes
0answers
52 views

Generalized SVD and weighted SVD

I've the following question: How should I select the $A$,$B$ matrices in the generalized singular value decomposition (GSVD) such that it solves the weighted version of the generalized singular value ...
0
votes
0answers
43 views

Finding the closest low rank correlation matrix?

I am looking to find the rank 3 correlation matrix approximation of a rank $n-1$ correlation matrix. This best approximation can be more clearly defined as the closest correlation matrix with rank 3 ...
0
votes
0answers
24 views

Linear System with non zeros count constraint

I trying to solve a simple linear system: $Ax=b$ But with constraints like: $\sum{x_i}=S$, Usually S = 1. $L \le x \le U$, Lower & Upper bounds (usually $0 \le x \le 1$) And "Maximum count of ...
0
votes
0answers
18 views

Does the Conjugate Gradient Method provide an eigenvalue estimate?

Suppose that we apply a Krylov subspace method to the linear system $A x = b$. For example, if $A$ is symmetric positive-definite, then the Conjugate Gradient method may be used. I remember that the ...
0
votes
0answers
32 views

Search Direction in Conjugate Gradient

Could you help me with a Conjugate Gradient question? In using CG to solve $Ax = b$, why is the search direction $p_{k+1}$ in CG chosen as a linear combination of the residual $r_k$ and previous ...
0
votes
0answers
55 views

Induced matrix p-norm

Let $\|\cdot\|_p$ denote the $p$ norm $(p≥1)$ defined for every vector $x=(x_1,x_2,\ldots,x_n)^t\in\mathbb C^n$ by $\|x\|_p=(\sum|x_j|^p)^{1/p}$ and let $|||\cdot|||_p$ denote the matrix norm defined ...
0
votes
0answers
94 views

update cholesky factorization

I need to compute cholesky(H'*H) where H is a big sparse rectangular matrix. After that H is modified by adding several lines. That is Hn = [H ; line_1 ; ... ; line_n] in Matlab. How can I recompute ...
0
votes
0answers
21 views

order of convergence for approximations

Let $u \in L^{2}(0,1)$ and $0 < x_{1}< x_{2}<... < x_{n} = 1$, where x$_{k}$ = k$\cdot$h, n$\cdot$h = 1, a partition of the interval [0,1]. Define I$_{k}$(x) = 1 if x $\in$ [x$_{k}$, ...
0
votes
0answers
22 views

Location and perturbation of eigenvalues

This is a problem from Horn and Johnson's Matrix Analysis. I'm having trouble showing the bolded parts in the following paragraphs. In fact, I don't really understand what the sentences mean. I would ...
0
votes
0answers
28 views

A problem on Gersgorin cirle passing through the eigenvalue of an absolute matrix

I'm having trouble solving the following problem. I think I need to show that the matrix $D^{-1}|A|D$ has property SC, but I can't come up with a way to show it. I would really appreciate any ...
0
votes
0answers
36 views

Is the following matrix Upper Hessenberg?

Does $$ A = \begin{pmatrix} 1 & 1 \\ -1 & -1 \end{pmatrix}$$ properly satisfy the definition of upper Hessenberg?
0
votes
0answers
337 views

Applying Central Difference (Finite Difference Method) in MATLAB

I was given a rather complicated few problems to solve in MATLAB using the central difference method, and I'd like some help figuring out how to translate this into code. The goal is to discretize ...
0
votes
0answers
36 views

Show that Newton’s Method is well-defined for all k and converges to 0 for $x_0>0$

Let $f : R → R$ with $f$ twice continuously differentiable, $\gamma > f''(x)>\delta, f(0)=0,f'(x)>\rho $ for $x ≥ 0$. Show that for any $x_0 > 0$ that Newton’s Method is well-defined for ...
0
votes
0answers
23 views

Jacobi Iteration with Shift

The question is to solve a linear system using Jacobi iterations with a shift of mu = 5. My code converges very quickly, but it does not yield the results that MATLAB gives with the backslash ...
0
votes
0answers
18 views

Convergence of recursive application of finite-difference operator to $C^{\infty}$ functions

Let $f\colon \mathbb{R}\to \mathbb{R}$ be an arbitrary smooth function (whose extension to a complex differentiable function is entire, if it matters). Let $\mathbf{D}_{h}$ be a finite difference ...
0
votes
0answers
18 views

Applying perturbed matrix to unperturbed eigenvector

Suppose we've got a matrix $P$ and a perturbed version $\hat{P}=P+E.$ Given that $v$ is an eigenvector of $P$ with $Pv=0,$ I'd like to get as sharp a bound as possible on $\hat{P}v$ (in terms of ...
0
votes
0answers
188 views

Matlab project - Jacobi method for tridiagonal matrices…

I have to do a project in Matlab to my University and I don't quite understand what I should do. I was given script that solves systems of equations with Jacobi's method with given tolerance and ...
0
votes
0answers
69 views

Strictly diagonally dominant matrix -LU factorization

Let $A\in\mathbb{C^{n\times n}}$ be strictly diagonally dominant. I want to show that the LU factorizations with and without partial pivoting are the same for these matrices. For start, I created ...
0
votes
0answers
24 views

Pairing Two Point Clouds

So I have two point clouds $X$ and $Y$ each with $N$ points in the familiar $\mathbb{R}^3$ euclidian 3D space. I then have an inter-point distance $d(\vec x_i,\vec y_j)$ which is zero if $\vec x_i$ is ...