We study the problem of computing the upper bound of the discrete Fréchet distance for imprecise input, and prove that the problem is NP-hard. This solves an open problem posed in 2010 by Ahn et al. If shortcuts are allowed, we show that the upper bound of the discrete Fréchet distance with shortcuts for imprecise input can be computed in polynomial time and we present several efficient algorit...

We introduce the concepts of growth and spectral bound for strongly continuous semigroups acting on Fréchet spaces and show that the Banach space inequality s(A) 6 ω0(T ) extends to the new setting. Via a concrete example of an even uniformly continuous semigroup we illustrate that for Fréchet spaces effects with respect to these bounds may happen that cannot occur on a Banach space.

The official data in relation to salaries paid in Spain from 1999 to 2014 has been analyzed. The inadequate data format does not reflect the whole salary distribution. Fréchet distributions have been fitted to the data. This simple distribution has similar accuracy in relation to the data when compared to other distributions (Log-Normal, Gamma, Dagum, GB2). Analysis of the data through the fitt...

Computing the Fréchet distance between two polygonal curves H Alt, M Godau International Journal of Computational Geometry & ..., 1995 World Scientific As a measure for the resemblance of curves in arbitrary dimensions we consider the socalled Fréchet-distance, which is compatible with parametrizations of the curves. For polygonal chains P and Q consisting of p and q edges an algorithm of runti...

On a smooth manifold M, the vector bundle structures of the second order tangent bundle, T M bijectively correspond to linear connections. In this paper we classify such structures for those Fréchet manifolds which can be considered as projective limits of Banach manifolds. We investigate also the relation between ordinary differential equations on Fréchet spaces and the linear connections on t...

In this paper, we study a problem on computing the Fréchet distance between two polygonal curves and provide efficient solutions for solving it. In the classical Fréchet distance, point objects move arbitrarily fast on the polygonal curves. Here, we consider the problem instance where the speed per segment is a constant within a specified range. We first describe a naive algorithm which solves ...

Motivated by an Arens regularity problem, we introduce the concepts of matrix Banach space and matrix Banach algebra. The notion of matrix normed space in the sense of Ruan is a special case of our matrix normed system. A matrix Banach algebra is a matrix Banach space with a completely contractive multiplication. We study the structure of matrix Banach spaces and matrix Banach algebras. Then we...

Iterative regularization methods for nonlinear ill-posed equations of the form F (x) = y, where F : D(F ) ⊂ X → Y is an operator between Hilbert spaces X and Y , usually involve calculation of the Fréchet derivatives of F at each iterate and at the unknown solution x†. In this paper, we suggest a modified form of the generalized Gauss-Newton method which requires the Fréchet derivative of F onl...

Finding the similarity between paths is an important problem that comes up in many areas such as 3D modeling, GIS applications, ordering, and reachability. Given a set of points S, a polygonal curve P , and an ε > 0, the discrete set-chain matching problem is to find another polygonal curve Q such that the nodes of Q are points in S and dF (P,Q) ≤ ε. Here, dF is the discrete Fréchet distance be...

‎in this paper‎, ‎using fixed point method‎, ‎we prove the generalized hyers-ulam stability of‎ ‎random homomorphisms in random $c^*$-algebras and random lie $c^*$-algebras‎ ‎and of derivations on non-archimedean random c$^*$-algebras and non-archimedean random lie c$^*$-algebras for‎ ‎the following $m$-variable additive functional equation:‎ ‎$$sum_{i=1}^m f(x_i)=frac{1}{2m}left[sum_{i=1}^mfle...