Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
0 answers
71 views

The jump set of $SBV$ function for different value of parameter in image denoising problem

The classical Mumford-Shah image denoisng problem study the minimizer of the following functional, for each $\alpha>0$ where $\Omega\subset \mathbb R^2$ is open bounded with sommth boundary, $$ u_\...
JumpJump's user avatar
  • 679
1 vote
0 answers
64 views

Maximize discrete harmonic function at given point

Let $n>0$, and let $S_n$ denote the discrete square $S_n=[|-n,n|]^2$ (so $S_n$ has $(2n+1)^2$ elements). Let $K_n$ denote the set of four corner points $\lbrace (\pm n,\pm n)\rbrace$, and $C_n=S_n\...
Ewan Delanoy's user avatar
1 vote
0 answers
174 views

Negative eigenvalue of Toeplitz Hermitian matrix?

I am working on estimation of a covariance matrix and I know that the matrix is Toeplitz. The desired matrix should not produce negative eigenvalues at all. However, sometime my estimation leads to a ...
Creator's user avatar
  • 495
1 vote
0 answers
55 views

Separation on discrete set

Consider the set $L = \prod_{i=1}^n\{1,0\}$, i.e. L consists of the element of n-tuples whose entries are 0 or 1. Also we can regard $L$ as a subset of $R^n$. Define linear functions $f(x)= a_1x_1+ \...
user91646's user avatar
1 vote
0 answers
2k views

How to rotate a covariance matrix which contains quaternion elements? [closed]

I am implementing a paper which recovers full-3d body pose from images. It represents individual body parts as 7D vectors containing first the absolute 3D location [x y z] and then the unit ...
CVirtuous's user avatar
1 vote
0 answers
90 views

Separable Least squares - is there a notion of conjugate directions?

I have a general question. Suppose I have the following to optimize $$\|Y-A(\mathbf{x})B(\mathbf{y})\|^2$$ where $Y$ is a vector, $A(\mathbf{x})$ is a matrix that depends on a vector $\mathbf{x}$ in a ...
Max Hamper's user avatar
1 vote
0 answers
227 views

Find optimal value for a regularization parameter in generalized eigenvalue problem

Consider the generalized eigenvalue problem : $ \Sigma_{XY} \Sigma_{YX} {W} = \lambda \Sigma_{XX} {W} $ where $\Sigma_{XX} $ and $\Sigma_{XY}$ are sample covariance matrices are of the matrices $X$...
user41037's user avatar
1 vote
0 answers
110 views

Evaluate a Function to Full Machine Precision [closed]

If we want to evaluate $$f(x)=\frac{e^x-1-x}{x^2}$$ then we have to observe its large relative error as $x\to 0$. My question is that how can we find a method so that we can compute $f(x)$ to full ...
user85729's user avatar
1 vote
0 answers
26 views

How can I filter the effects of a variable from a correlation matrix?

I have a correlation matrix (it contains 500 columns and 500 rows) and I would like to make an other correlation matrix in which one variable (and its influences) is filtered from the initial matrix. ...
david86's user avatar
  • 11
1 vote
0 answers
64 views

Maximization of the difference of a monotone submodular function and a linear function with a cardinality constraint

Maximizing a monotone submodular function with a cardinality constraint can be solved by using a simple greedy heuristic. However, if the submodular function is non-monotone, the greedy heuristic can ...
LaoMao's user avatar
  • 11
1 vote
0 answers
533 views

Finding an error estimation for the De Moivre–Laplace theorem with Stirling's formula

Context for my question: For one part of my thesis I try to find an upper bound for the error in the normal approximation of the binomial distribution following the standard proof of the De Moivre–...
Stephan Kulla's user avatar
1 vote
1 answer
219 views

approximate diameter of polytopes in high dimensions

I just came across the following problem: Let us consider the unit corner of the n-cube $$ \Delta^n = \left\{(t_1,\cdots,t_n)\in\mathbb{R}^n\mid\sum_{i = 1}^{n}{t_i} \leq 1 \mbox{ and } t_i \ge 0 \...
rjm's user avatar
  • 75
1 vote
0 answers
119 views

Closed form answer to a naive integral [closed]

Let a and b be positive real numbers. How to find a closed form answer to the integral $$\int_0^t \left(-a t + \big(1+ \dfrac{2bt}{3}\big)^{-3/2}\right)^{5/3} dt$$ If it is not possible to find a ...
nikah amber's user avatar
1 vote
0 answers
171 views

Finding all feasible solutions

Let $u$ be a $n_{max} \times m$ matrix. Let $z$ be a $n_{max} \times s_{max} \times n_{max}$ cube. Let $w$ be a $n_{max} \times 1$ vector. All the three matrices can have values from the set $\{ 0, 1\}...
ubaabd's user avatar
  • 175
1 vote
0 answers
120 views

The column generation technique on a Train Unit Assignment Problem [Linear Programming]

I am doing an assignment where I need to implement a mathematical model that I can't wrap my head around. For the technique of column generation, one would need to my understanding, a master problem ...
k88's user avatar
  • 111
1 vote
0 answers
136 views

Monotonic convergence of Newton's method for boundary value problems

I’m interested in solving nonlinear elliptic boundary value problems of the type $$ -a\Delta u + f(u) = 0, $$ $$ u|_\Gamma = u_0 $$ by Newton’s method when its convergence is global and monotonic. ...
jokersobak's user avatar
1 vote
0 answers
59 views

Open volumetric time series data set

Does anyone know where I can find a good open volumetric time series data set? I had a look at some of Stanford's open data sets (https://graphics.stanford.edu/data/voldata/ ) But these do not seem ...
sav's user avatar
  • 191
1 vote
1 answer
279 views

Splines linearly independent

Let $N_1:=\chi_{[0,1]}$ be defined as this characteristic function and $N_n:=N_{n-1}*N_1$ then this leads to polynomials with support $[0,n]$. These splines are well-studied click for wikipedia My ...
Physicist 2.0's user avatar
1 vote
0 answers
85 views

Smallest sum of original column entries in 2d matrix [closed]

I have an interesting optimization problem I am trying to solve now and I thought I'd share it here in order to find the best answer. The problem itself is not complicated and it is stated like this: ...
Peter Kottas's user avatar
1 vote
0 answers
98 views

LU growth factor applied to LDL of a Positive Semidefinite matrix [closed]

For a Positive Semidefinite matrix $A$, which we can decompose through $LDL$ decomposition as follows: $A=LDL^\text{T}$; how can we prove that for a decomposition $A=LU=L(DL^\text{T})$, the growth ...
Pablo's user avatar
  • 111
1 vote
1 answer
83 views

Convergent algorithm for dividing a body into two regions of equal volume

Let $\Omega \subset R^3$ be a bounded open region. It is well known that there exists a smooth surface $\Gamma$ with minimum area and constant mean curvature which is orthogonal to $\partial \Omega$ ...
A random mathematician's user avatar
1 vote
1 answer
6k views

Convert linear programming problem into its standard form [closed]

all, I met a question that, the cost function of the linear programming problem is a function with absolute value. Here is the problem: min 3x1+|6x2+3| st. |x1+4|+|2x2|<=3 How can I deal with it?...
Mingzi Yi's user avatar
1 vote
0 answers
140 views

Reduce a Combinatorial problem

It is given n sets with k vectors. (k is element-wise positive or zero) Choose one vector of each set so that the biggest element of the sum of the chosen vectors is minimal. What i also know but is ...
JonasDuwell's user avatar
1 vote
0 answers
72 views

interpolation and approximation [closed]

Given a function $f$ in C^k[a,b], can we always construct function $g \neq f$ such that $g(x) \ge f(x)$ for all $x \in [a,b]$, $f^{(m)}(a)=g^{(m)}(a)$ and $f^{(m)}(b)=g^{(m)}(b)$ for $m=0,1,\dots, k$ ...
user51707's user avatar
1 vote
0 answers
98 views

Global approximation via convex combination of local approximations

I recently faced the problem of efficiently approximating a very large set of data points and, neither having a model of the empiric function, nor of the error distribution, my method of choice would ...
Manfred Weis's user avatar
  • 13.2k
1 vote
0 answers
1k views

Bounds for the infinity norm of the inverse for certain diagonaly dominant matrices

I m trying to analyse the stability against perturbations for a specific system of linear equations $Ax=b$. For this, i use the standard condition number $||A||_{\infty}||A^{-1}||_{\infty}$. Here ...
Joshuald1986's user avatar
1 vote
0 answers
173 views

Using FFT to aproximate a fuction [closed]

I am trying to use the FFT to approximate a given function. So i have 10 points xk that are given for example, if i use the FFT that will give me Xk. So now using the inverse FFT we can get the ...
EssexPN's user avatar
  • 111
1 vote
2 answers
172 views

Linear Programm with matrix [closed]

Is there a name for problems like this min norm(Cx) Ax = b where C is a matrix and norm is the maximum norm. This is kind of like a linear Programm. Could this be rewritten as linear programm? Or Any ...
absacker's user avatar
1 vote
0 answers
75 views

Are there any known bounds on the value of solutions of linear integer programming?

Given a linear objective function and a system of linear constraints; are there any known bounds on the values of (positive) integral solutions in terms of the coefficient matrix of the constraints? ...
GLG's user avatar
  • 111
1 vote
0 answers
493 views

Complexity of Nested Linear Optimization

My question is motivated by the fact, that among other ways, it is possible to restrict a variable to two discrete values, e.g. the prototypical $0$ and $1$, via an optimization constraint: $$\max(\...
Manfred Weis's user avatar
  • 13.2k
1 vote
0 answers
168 views

How to solve a divergent linear system using iterative methods?

I have a matrix A which is symmetric and non-diagonal dominant. I tried to use Jacobi/Gauss-Seidel/SOR to solve it but it diverges. Is there any mechanism to condition the matrix for convergence using ...
codepk's user avatar
  • 121
1 vote
0 answers
80 views

Variational problem for optimal weight function leading to shorter intervals with many primes

The motivation for the following problem stems from the recent preprint by James Maynard, see also Proposition 5 of the recent blogpost by Terrence Tao. The solution of this problem could give better ...
Vít Tuček's user avatar
  • 8,597
1 vote
0 answers
136 views

Solutions of Fredholm integral equation of the fisrt kind with asymmetric kernel

Given the integral equation: $$\int_0^{\lambda_0}K(\lambda,T)S(\lambda)d\lambda=f(T)$$ with $S(\lambda)$ unknown function and the kernel: $$K(\lambda,T)=\frac{1}{\lambda^5(\exp(k/\lambda T )-1)}$$ ...
Riccardo.Alestra's user avatar
1 vote
0 answers
377 views

The rationale of QR algorithm for computing eigenvectors

For a symmetric matrix $A$, the rationale for the success of applying QR to compute the spectral decomposition of $A = UDU^T$ is, for large $k$, the QR factorization of $A^k = Q_kR_k$ obeys, \begin{...
Jack Lee's user avatar
1 vote
0 answers
463 views

Reference request for parallel transport

I am learning about parallel transport on a Riemannian manifold equipped with an affine connexion. It seems (if I understand it well) that, in general, we might not be able to compute the parallel ...
pitchounet's user avatar
1 vote
0 answers
100 views

Distribute Monte Carlo samples among dimensions

Simplified problem: Given a $d$-times nested convolution of an input function $g(x):\mathbb{R}\mapsto \mathbb{R}$ with the same band-limited smooth function $f(x):\mathbb{R}\mapsto \mathbb{R}$. I am ...
Anton's user avatar
  • 101
1 vote
0 answers
196 views

Interior point optimisation using big M for L1 norm on linear system using Dikin's Affine method

I am a 4th year undergrad surveying student studying computations, specifically $L_{1}$ norm minimisation of residuals in large data sets. To start with (and probably to finish with) I'm using a set ...
lsdavies's user avatar
  • 111
1 vote
1 answer
353 views

What are the advantage of using operational calculus for numerically solving pde compared to FE or FD?

For numerically solving a partial differential equation (PDE) what advantage does operational calculus (OC) has over common methods like finite difference (FD), and finite element (FE)? I mean OC in ...
user avatar
1 vote
0 answers
256 views

Equal maximum and minimum in a large-scale linear programming

For a linear optimization of an integral (with integral constraints), I perform a linear programming for the equivalent series. Maximum and minimum of the LP problem tend to be equal as I increase the ...
Amir Kazemi's user avatar
1 vote
0 answers
102 views

Orthogonal projection of discontinuous piecewise polynomial space in energy scalar product

Let $I = [0,1]$ be the unit interval Let $I$ be partioned into $n$ closed subintervals $(I_j)_J$, each of length $1/n$. Let $X_{DC} = \{ v \in L^2[0,1] | 1 \leq j \leq n : v_{|I_j} \in \mathcal P_1( ...
shuhalo's user avatar
  • 5,327
1 vote
0 answers
1k views

Robust optimization in matlab using fmincon [closed]

I am trying to implement the following optimization (from this paper) in Matlab using fmincon: $\min_\omega\omega'\Sigma\omega$ subject to $\min_Ur_p \geq r_0$ where $\Sigma$ is a positive definite ...
Geraldine Bailey's user avatar
1 vote
0 answers
126 views

Matrix Minimax problem

I have the equation $\Sigma_k(M_k{p_k})V=EV$, where the $M_k$ are n*n real Hermitian matrices, $V$ is a n*n eigenvector matrix, $E$ a dim-n energy eigenvector and the $p_k$ scalar parameters. The $M_k$...
Hauke Reddmann's user avatar
1 vote
0 answers
109 views

Is there a Krylov subspace method for solving D+epsilon*S where D is diagonal, epsilon small and S skew-symmetric

I'm working on a problem that gives a matrix system of the form D + epsilon*S, where S is a skew-symmetric matrix. I'm interested in finding if any work has been done to develop a conjugate gradient ...
Nat Trask's user avatar
1 vote
0 answers
628 views

Totally unimodular Matrices

A matrix is totally uni-modular if the determinant of any (square) sub-matrix is {+1, 0, -1}. My question is, "Is there a way to transform(linear or non) a general matrix into a totally uni-modular ...
Clark's user avatar
  • 11
1 vote
1 answer
241 views

Covering max flow arcs by arc disjoint paths

Let $(N,A,s,t,u)$ be a network with node set $N$, arc set $A$, source $s\in N$, sink $t\in N$ and capacity vector $u\in\{1,2,\ldots,T\}^A$, and let $x=(x_a)_{a\in A}$ be a maximum $(s,t)$-flow. Is it ...
Thomas Kalinowski's user avatar
1 vote
0 answers
169 views

Extrema in two variables of a sum of logs, or equation with sum of rational functions

I am trying to find numerically $\arg\min_{x\in(1, +\infty),y\in(0, 1)}\sum_i\log(xy+\alpha_ix+\beta_iy+\gamma_i)$, where the sum has a large number of terms, and the coefficients are such that the ...
antony's user avatar
  • 11
1 vote
0 answers
532 views

How to find all the zeros of a cubic spline?

Let's say I have a cubic spline represented piecewise by cubic polynomials. Do you know an efficient algorithm for computing all its zeros? Thank you.
user21239's user avatar
1 vote
0 answers
298 views

Norm preserving matrix fix

Hello, I'll state the problem first and than I'll a little bit of motivation. Lets be given regular matrix $M \in \mathbb{R}^{n\times n}$ and norm $||.||$ in $\mathbb{R}^{n}$. Define $$ U =\{ L\in \...
Tomas Skrivan's user avatar
1 vote
0 answers
1k views

How to solve simple bilinear equations under extra linear constraints

Hello, This is the full version of a question I asked earlier. I am trying to understand whether finding a solution to the following bilinear system is computationally hard or easy: $\lambda_i^T u_{...
Woland's user avatar
  • 53
1 vote
0 answers
368 views

Definition of spectral gradient

Consider this differential operator $$ \mathcal{H}(\phi(\mathbf{x})) = -\triangle + V(\mathbf{x})H_\epsilon (\phi(\mathbf{x})) $$ where $\mathbf{x} \in \mathbb{R}^2$, $\phi : \mathbb{R}^2 \rightarrow \...
dranxo's user avatar
  • 817

1
27 28
29
30 31
35