Questions tagged [matrices]
For questions about construction and modification of matrices, objects represented by 2-dimensional arrays that are used to define linear operators within linear algebra.
297
questions
-2
votes
1
answer
35
views
Is there a way to confirm a matrix multiplication solution in O(n)
Let A, B matrices of dimensions
$\sqrt{n} * \sqrt{n}$
So that each has a total of n elements.
Let there be a matrix C.
Is there a known way to confirm wether C is the product of the two or not, in O(n)...
- 1
2
votes
1
answer
55
views
Conditional Maximization of a Binary Matrix
Given an $L \times N$ matrix $A$ with only binary values, $A_{ij} \in \{0, 1\}$, and a vector $b$ with $b_j = 2^{j-1}$, I want to find a matrix $\tilde{A}$ that maximizes $\tilde{c}=\tilde{A}b$, ...
- 51
0
votes
1
answer
27
views
Will CSR format store the all 0 column?
In the matrix(3 rows and 7 columns) below with 4 all zero columns
0 4 0 0 0 0 0
2 1 0 0 0 0 0
0 0 3 0 0 0 0
The CSR format of storage is :
row_ptr: [0, 1, 3, 4]
col_ind: [0, 0, 1, 2]
values: [4, 2, ...
- 31
1
vote
1
answer
26
views
Given a $n \times n$ matrix $M$ find a subset of d rows and d columns so that the sum of the elements in their intersection in maximized
Given a $n \times n$ matrix $M$ of positive integers and a constant $d$. If $R,C \subset \{1,...,n\} $ let $$S_M(R,C) = \sum_{r \in R,c \in C }M_{i,j} $$
I want to find the sets $$R,C \subset \{1,...,...
- 203
1
vote
1
answer
39
views
Compute matrix inversion / multiplication using a black box
Suppose you're given a black box $A$, and you're told $A$ can invert a matrix (assuming the matrix is invertible) $M$ in $O(T_A)$. You're also given a black box $B$, and you're told $B$ can multiply ...
- 1,910
3
votes
1
answer
50
views
How does numpy.linalg.inv calculate the inverse of a matrix?
What is the algorithm behind this routine and is there documentation available for it?
- 31
2
votes
1
answer
48
views
Mathematical operation for removing duplicate rows in a matrix
I am using the GraphBLAS C API (https://graphblas.org/) which provides an interface for performing mathematical operations on sparse matrices. Given an adjacency matrix $\mathbf{A}: \mathbb{R}^{n \...
- 256
1
vote
1
answer
114
views
Learning eigenvalue decomposition
How would you build a fully connected neural network that learns eigenvalue decomposition efficiently?
I wanted to build NNs that can predict certain properties about matrices which are NP-hard to ...
- 113
2
votes
1
answer
23
views
Generate paths of fixed length across a weighted matrix (defined in $\mathbb{R}$) whose weights' sum falls into given interval
PSSM or PWM (Positional Weighted Matrix) is a common thing in biological science, used often to observe the distribution of letters inside a group of strings of the same length. It's composed by log-...
- 121
0
votes
0
answers
29
views
Modify this GEPP algorithm to work with matrices
I've been stuck with this problem for a day or so, and I really can't figure it out. I need to modify this pseudocode so that it works when b is not just a vector, but a matrix with same number of ...
0
votes
0
answers
36
views
Find submatrix with sum as close to k as possible
What is the efficient algorithm to find a submatrix (must be rectangle) with a sum that is as close as possible to k? Matrix consists only of nonnegative integers. Iterating through all possible ...
- 1
1
vote
0
answers
54
views
Maximize sum of matrix after deleting K rows and K columns
You're given a m by n matrix filled with positive integers, as well as some integer k (0 <...
- 111
1
vote
1
answer
175
views
Time Complexity of Matrix Fibonacci Algorithm
In my reference, Exercise 0.4(e), Algorithms by Sanjoy Dasgupta, Christos H. Papadimitriou, and Umesh V. Vazirani, it is given that
$$
\begin{bmatrix}F_n\\F_{n+1}\end{bmatrix}=\begin{bmatrix}0&1\\...
- 139
3
votes
0
answers
75
views
What's the fastest known non-galactic algorithm for matrix multiplication of large matrices
"A galactic algorithm is one that outperforms any other algorithm for problems that are sufficiently large, but where "sufficiently large" is so big that the algorithm is never used in ...
- 356
2
votes
1
answer
78
views
A version of Bareiss algorithm or similar for symmetric matrices
A linear equation $Ax=b$ can be solved by reducing the matrix $A$ to upper triangular form by using Gaussian elimination or LU decomposition. If $A$ is symmetric and positive definite one can use ...
- 86
1
vote
0
answers
38
views
Algorithm for the inversion of a striped matrix with tridiagonal stripes
I'd like to compute the inverse of a matrix of size $S^2N \times S^2N$ over complex numbers that is composed of tri-diagonal $S\times S$ size blocks of tri-diagonal $S\times S$ block matrices. This ...
- 11
0
votes
0
answers
36
views
Matrix Multiplication with a matrix consisting of a single shifted row
I have the following question (prefacing this with the fact that this is a question from an exam, I am currently studying but am stumped so reaching out for help).
The answer to the following ...
- 13
2
votes
1
answer
67
views
Selecting a submatrix of a binary matrix NP hard?
I have the following problem and I am wondering if it is NP Hard or not.
Let $A$ be a binary matrix whose rows and columns are indexed by the sets $\mathcal{I}=1,...,m$ and $\mathcal{J}=1,...,n$.
A ...
- 23
1
vote
1
answer
160
views
Reorder columns in a 2d matrix to maximize the count of all repeated subarrays across all rows
I have a matrix (input):
--
c1
c2
c3
r1
AA
BB
CC
r2
CC
RR
BB
r3
EE
DD
FF
r4
KK
DD
EE
r5
DD
GG
KK
r6
PP
QQ
KK
Let's call each matrix cell a namespace. If two ...
1
vote
1
answer
32
views
Writing an Algorithm to Represent a Bit Matrix in Minimal Operations?
I am trying to come up with an algorithm to find the minimal representation of the transformation from a zero matrix to a target matrix.
Specifically, I have an empty matrix and can perform operations ...
- 11
1
vote
1
answer
122
views
Given a binary matrix, find the number of sub-matrices with all ones
Given a matrix A, let Aij denote the element of the i'th row and j'th column.
$$ A_{i,j}\in \{0, 1\}$$
Find the number of sub-matrices with all ones.
1 <= #rows, #columns <= 150
P.S. This ...
- 139
2
votes
0
answers
64
views
Permuting matrix entries to lower rank
Suppose I have a rank-$k$ matrix $A \in \mathbf{R}^{m \times n}$. Now suppose this matrix has its elements shuffled by an adversary to maximize the rank. Is there a way to reverse this permutation and ...
- 43
1
vote
0
answers
46
views
Adding two 2D matrices together: row by row vs column by column
When adding two 2D matrices of the same size (in row major format), in sequential code with no vector operations, is it faster to add them column by column or row by row?
At first I thought it would ...
- 11
8
votes
5
answers
3k
views
In algorithms for matrix multiplication (eg Strassen), why do we say n is equal to the number of rows and not the number of elements in both matrices?
In Strassen's algorithm, we calculate the time complexity based on n being the number of rows of the square matrix. Why don't we take n to be the total number of entries in the matrices (so if we were ...
2
votes
2
answers
194
views
Complexity of unbounded Gaussian convolution
What is the asymptotic complexity of doing a convolution of an unbounded Gaussian on an NxN input matrix $M$?
The naive approach is $O(n^4)$ ($R_{ij} = \sum_{k=1}^{n}\sum_{l=1}^{n}M_{kl}*g(\sqrt{(k-i)^...
- 1,414
1
vote
2
answers
157
views
Convert lower-left matrix triangle 1D index to row, column
How can I convert a 1D index in the lower-left triangle of a grid into a row and column?
For example, consider this table of 1D indices, indexed by row and column
...
- 187
1
vote
1
answer
40
views
Expected value of maximum of a matrix of size $n$
I have a square matrix (call it $A$) of size $n$ ($n$ is a positive integer). Each column is a permutation of $[1:n]$.
I take the first row of $A$, i.e. $A(1,:)$ and wonder what will be the frequency ...
- 183
0
votes
0
answers
32
views
Fast compute of F*P*FT matrix product
Let $P$ be a symmetric (positive definite, if that helps...) matrix of size $n$.
Let $F$ be a matrix of size $n$.
Is there an existing efficient algorithm implementation to calculate $FPF^T$ ?
Is ...
- 101
0
votes
1
answer
30
views
Split matrix by groups of columns but *capture all combinations of X columns* for some X
Say I have a big matrix, ~50000 rows, ~80000 columns. I want to split it up and solve subproblems on different machines (horizontal scaling).
But I need to make sure every column can be combined with ...
0
votes
0
answers
112
views
Prove that the total number of parenthesizations of n matrices is Ω(4^n/n^3/2)
Is it possible to prove the total number of parenthesizations of n matrices is Ω(4^n/n^3/2) using the Induction Method?
Recurrence formula from CLRS book
When n = 1, the sequence consists of just one ...
0
votes
0
answers
254
views
Binary Matrix covered with squares to cover all 1's in min cost
So I recently came across a question in my Algorithms class.
Given a binary matrix of N X N.
we can do following operation any number of times
we can take a square of size M X M (1 <= M <= N) ...
1
vote
1
answer
57
views
Having a 2D matrix with three typed elements, how to efficiently cover one of the types and NOT cover the other one?
I have a matrix with three possible elements: A, B and C. The size of the matrix could be a maximum of 15x16.
$$
\begin{bmatrix}
A & A & C & A\\
A & C & B & C\\
A & C & ...
- 111
0
votes
0
answers
54
views
Complexity of calculating Takagi's factorization of $n \times n$ matrix
As described here the Takagi factorization of a square symmetric complex matrix $A=VDV^T$ where D is a real nonnegative diagonal matrix, and V is unitary. I'm wondering what the complexity of ...
- 53
2
votes
1
answer
68
views
Finding a map between two matrices that minimises distance differences of neighbors
Given two binary matrices of the same size with the same element counts, how can we find a map mapping ones to ones such that the sum of differences of distances of all pairs of neighbors is minimised,...
- 317
0
votes
1
answer
52
views
Time reversible Markov chains question
Let Q be a symmetric transition probability matrix on states 1 , . . . , n; that is $q_{i,j} = q_{j,i}$ for all i , j.
Consider a markov chain defined as follows. Whenever the chain is in state i, the ...
0
votes
0
answers
47
views
Display XY data on computer
I would like to experiment with displaying the output of an analog to digital converter on computer. Samples of the ADC output would determine the intensity of one pixel.
The input to the ADC is an ...
0
votes
0
answers
81
views
Given a 2D Array (of 0's and 1's), find the minimum number of rows required so that maximum columns have their sum greater than a threshold
I have a 2D array of some rows and columns which are having only 0's and 1's. I would want to know if there is a way to optimize the number of rows so that maximum number of columns have their column ...
0
votes
1
answer
60
views
Whether a number is in a sorted matrix
I have a square n-by-n matrix of integers. The number of columns is equal to the number of rows.
Each column and row are sorted from the lowest to highest numbers. For example:
Another example:
I ...
- 103
2
votes
2
answers
479
views
Counting the number of parenthesization
I'm reading CLRS and there is something I don't understand regarding counting the number of parenthesization, in the Matrix-chain multiplication chapter, the book says:
Denote the number of ...
- 33
1
vote
1
answer
221
views
Complexity of finding $d$ largest eigenvectors of a symmetric matrix
I know that for $n \times n$ matrix, it takes $O(n^2)$ time complexity to compute the largest eigenpair of the matrix using Power method or etc. I'm interested to further extend the case so that now ...
- 123
0
votes
2
answers
93
views
What kind of algorithm do i need when the place of numbers changing according to n number?
I have a project in Golang. But i don't have any idea about how to solve it.
n will be an odd number (Feedback will be given if an odd number is not written)
As output, a structure with n*n matrix ...
1
vote
0
answers
24
views
Algorithmic ideas to multiply two tall & skinny matrices into one large square matrix?
This problems comes from AI, and it looks something like this:
I am supposed to multiply two floating-point matrices A * B. A ...
- 11
0
votes
0
answers
19
views
runtime of solving matrix differential equation wrt dimensions of matrix
Suppose a computer solves a coupled differential equations (with given boundary conditions) of which each equation deals with $2^n \times 2^n$ size of matrices as solutions. My question is
Does time-...
- 101
3
votes
0
answers
185
views
Low-rank matrix completion is NP-hard
In looking into the problem of low-rank matrix completion / relaxations of the general problem to derive exact solutions, many papers cite that the original formulation is NP-hard but I cannot find a ...
- 31
1
vote
1
answer
39
views
Find indices of equal cells in a matrix
I am trying to find the indices of all the equal elements in a matrix $\left ( n\times m \right )$. For each pair of matching cell, I will perform a specific function on them. For example:
$ \begin{...
- 11
4
votes
1
answer
714
views
Maximum sum of values in a square grid (one in each row/ column)
this is my first post here so bare with me :).
What i'm looking for is an algorithm that can find the maximum sum of values in a square grid under the restriction, that you can only pick 1 value from ...
- 41
1
vote
0
answers
61
views
Time complexity of computing general imminant
Consider the immanent of $n \times n$ complex matrices
\begin{equation}
\operatorname{Imm}_f(A) = \sum_{\sigma \in S_n} f_n(\sigma) A_{1 \sigma(1)} \cdots A_{n \sigma(n)}.
\end{equation}
Here $f_n:\pi ...
- 11
0
votes
3
answers
181
views
Data structure to efficiently add zero-rows to a sparse matrix
I would like to create a data structure representing a sparse matrix, where the number of non-zero values is $\mathcal{O}(n)$ (the matrix is $n\times n$).
The matrix should support the following ...
- 161
1
vote
0
answers
219
views
Describing the subproblem graph for matrix-chain multiplication
From Introduction to Algorithms by CLRS:
15.2-4 Describe the subproblem graph for matrix-chain multiplication with an input chain of length n. How many vertices does it have? How
many edges does it ...
4
votes
0
answers
66
views
minimizing a pairwise sum with respect to a sequence of integers
Let $m$ and $n$ be two integers, where $m \leq n$.
Suppose you are given $m^2$ matrices $W^{i,j} \in \mathbb{R}^{n \times n}$ for $i, j \in \{1, \dots, m\}$.
The goal is to find a sequence $a$ of $m$ ...
- 505