相关论文: Minimal Perturbations to Roots of Parameterized Eq…
We consider the Min-$r$-Lin$(Z_m)$ problem: given a system $S$ of length-$r$ linear equations modulo $m$, find $Z \subseteq S$ of minimum cardinality such that $S-Z$ is satisfiable. The problem is NP-hard and UGC-hard to approximate in…
The stabilization by noise for parabolic equations in perforated domains, i.e. domains with small holes, is investigated. We show that when the holes are small enough, one can stabilize the unstable equations using suitable multiplicative…
Parameterized complexity allows us to analyze the time complexity of problems with respect to a natural parameter depending on the problem. Reoptimization looks for solutions or approximations for problem instances when given solutions to…
Meaningful comparison between sets of observations often necessitates alignment or registration between them, and the resulting optimization problems range in complexity from those admitting simple closed-form solutions to those requiring…
When the parameter of a map is chosen, at each iteration step, following a certain rule, is called Parametric Perturbation. If the parameters are drawn from a distribution, then this perturbation is called Random Parametric Perturbation.…
A general method of minimization using correlation coefficients and order statistics is evaluated relative to least squares procedures in the estimation of parameters for normal data in simple linear regression.
Some monotone increasing sequences of the lower bounds for the minimum eigenvalue of $M$-matrices are given. It is proved that these sequences are convergent and improve some existing results. Numerical examples show that these sequences…
We propose two families of asymptotically local minimax lower bounds on parameter estimation performance. The first family of bounds applies to any convex, symmetric loss function that depends solely on the difference between the estimate…
Differential equations are used to model and predict the behaviour of complex systems in a wide range of fields, and the ability to solve them is an important asset for understanding and predicting the behaviour of these systems.…
We consider the problem of recovering an unknown matching between a set of $n$ randomly placed points in $\mathbb{R}^d$ and random perturbations of these points. This can be seen as a model for particle tracking and more generally, entity…
The paper is largely of a review nature. It considers two main methods used to study stability and obtain appropriate quantitative estimates of perturbations of (inhomogeneous) Markov chains with continuous time and a finite or countable…
Given a matrix the seriation problem consists in permuting its rows in such way that all its columns have the same shape, for example, they are monotone increasing. We propose a statistical approach to this problem where the matrix of…
Perturbative Symmetry Approach is formulated in symbolic representation. Easily verifiable integrability conditions of a given equation are constructed in the frame of the approach. Generalisation for the case of non-local and non-evolution…
Contrary to an assumption made by Bojanczyk, Higham, and Patel [SIAM J. Matrix Anal. Appl., 24(4):914-931, 2003], a perturbation bound for indefinite least square problems is capable of arbitrarily large overestimates for all perturbations…
Parametric model order reduction using reduced basis methods can be an effective tool for obtaining quickly solvable reduced order models of parametrized partial differential equation problems. With speedups that can reach several orders of…
In this paper we discuss reduced order models for the approximation of parametric eigenvalue problems. In particular, we are interested in the presence of intersections or clusters of eigenvalues. The singularities originating by these…
We compute the linear responses of the Hubble diagram to small scalar perturbations in the Robertson-Walker metric and to small peculiar velocities of emitter and receiver. We discuss the monotonicity constraint of the Hubble diagram in the…
This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…
We show that, under reasonable assumptions, two negative roots can be eliminated from the characteristic equation of a polynomial-like iterative equation. This result gives a new case where we may lower the order of such an equation.
Combining the techniques of approximation algorithms and parameterized complexity has long been considered a promising research area, but relatively few results are currently known. In this paper we study the parameterized approximability…