On a linear problem of tracing a given motion

In the present paper, we consider the problem on the optimal tracing of a given vector function with the use of a generalized projection of the trajectory of a linear plant. The deviation of a given motion is measured in the metric C ^m [0, T] of continuous vector functions of the corresponding dimension m. We suggest an efficient method for the construction of an approximate solution of this optimization problem with given accuracy.     

Vector measure Maurey–Rosenthal-type factorizations and -sums of -spaces

Consider a vector measure of bounded variation m with values in a Banach space and an operator T:XL¹(m), where L¹(m) is the space of integrable functions with respect to m. We characterize when T can be factorized through the space L²(m) by means of a multiplication operator given by a function of L²(|m|), where |m| is the variation of m, extending in this way the Maurey–Rosenthal Theorem. We use this result to obtain information about the structure of the space L¹(m) when m is a sequential vector measure. In this case the space L¹(m) is an ℓ-sum of L¹-spaces.     

Surfaces with parallel normalized mean curvature vector

A surfaceM in a Riemannian manifold is said to have parallel normalized mean curvature vector if the mean curvature vector is nonzero and the unit vector in the direction of the mean curvature vector is parallel in the normal bundle. In this paper, it is proved that every analytic surface in a euclideanm-spaceE ^m with parallel normalized mean curvature vector must either lies in aE ⁴ or lies in a hypersphere ofE ^m as a minimal surface. Moreover, it is proved that if a Riemann sphere inE ^m has parallel normalized mean curvature vector, then it lies either in aE ³ or in a hypersphere ofE ^m as a minimal surfaces. Applications to the classification of surfaces with constant Gauss curvature and with parallel normalized mean curvature vector are also given.     

Alternating cycle-free matchings

The investigation of alternating cycle-free matchings is motivated by the Jump-number problem for partially ordered sets and the problem of counting maximum cardinality matchings in hexagonal systems.We show that the problem of deciding whether a given chordal bipartite graph has an alternating cycle-free matching of a given cardinality is NP-complete. A weaker result, for bipartite graphs only, has been known for some time. Also, the alternating cycle-free matching problem remains NP-complete for strongly chordal split graphs of diameter 2.In contrast, we give algorithms to solve the alternating cycle-free matching problem in polynomial time for bipartite distance hereditary graphs (time O(m ²) on graphs with m edges) and distance hereditary graphs (time O(m ⁵)).     

Conservation and bifurcation of an invariant torus of a vector field

We consider small perturbations with respect to a small parameter ε≥0 of a smooth vector field in ℝ^n+m possessing an invariant torusT ^m. The flow on the torusT ^m is assumed to be quasiperiodic withm basic frequencies satisfying certain conditions of Diophantine type; the matrix Ω of the variational equation with respect to the invariant torus is assumed to be constant. We investigate the existence problem for invariant tori of different dimensions for the case in which Ω is a nonsingular matrix that can have purely imaginary eigenvalues. Translated fromMatematicheskie Zametki, Vol. 61, No. 1, pp. 34–44, January, 1997. Translated by S. K. Lando     

Embedding into Rectilinear Spaces

We show that the problem whether a given finite metric space (X,d) can be embedded into the rectilinear space R ^m can be formulated in terms of m -colorability of a certain hypergraph associated with (X,d) . This is used to close a gap in the proof of an assertion of Bandelt and Chepoi [2] on certain critical metric spaces for this embedding problem. We also consider the question of determining the maximum number of equidistant points that can be placed in the m -dimensional rectilinear space and show that this number is equal to 2m for m ≤ 3 . Received March 19, 1996, and in revised form March 14, 1997.     

Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem

The Fermat—Weber location problem is to find a point in ⁿ that minimizes the sum of the weighted Euclidean distances fromm given points in ⁿ . A popular iterative solution method for this problem was first introduced by Weiszfeld in 1937. In 1973 Kuhn claimed that if them given points are not collinear then for all but a denumerable number of starting points the sequence of iterates generated by Weiszfeld's scheme converges to the unique optimal solution. We demonstrate that Kuhn's convergence theorem is not always correct. We then conjecture that if this algorithm is initiated at the affine subspace spanned by them given points, the convergence is ensured for all but a denumerable number of starting points.     

Best Constants in the Miranda-Agmon Inequalities for Solutions of Elliptic Systems and the Classical Maximum Modulus Principle for Fluid and Elastic Half-spaces

The Dirichlet problem for elliptic systems of the second order with constant real and complex coefficients in the half-space  ^k ₊ = {x = (x ₁,…,x_k ): x_k > 0} is considered. It is assumed that the boundary values of a solution u = (u ₁,…,u _m) have the form ψ ₁ ξ ₁ + · · · + ψ _n ξ _n, 1 ≤ n ≤ m, where ξ ₁,· · ·,ξ _n is an orthogonal system of m-component normed vectors and ψ ₁,· · ·,ψ _n are continuous and bounded functions on ? ^k ₊. We study the mappings [C(? ^k ₊)] ⁿ ? (ψ ₁,…,ψ _n) → u(x) ?  ^m and [C(? ^k ₊)] ⁿ ? (ψ ₁,…,ψ _n) → u(x) ?  ^m generated by real and complex vector valued double layer potentials. We obtain representations for the sharp constants in inequalities between |u(x)| or |(z, u(x))| and ∥u| _xk =₀∥, where z is a fixed unit m-component vector, | · | is the length of a vector in a finite-dimensional unitary space or in Euclidean space, and (·,·) is the inner product in the same space. Explicit representations of these sharp constants for the Stokes and Lamé systems are given. We show, in particular, that if the velocity vector (the elastic displacement vector) is parallel to a constant vector at the boundary of a half-space and if the modulus of the boundary data does not exceed 1, then the velocity vector (the elastic displacement vector) is majorised by 1 at an arbitrary point of the half-space. An analogous classical maximum modulus principle is obtained for two components of the stress tensor of the planar deformed state as well as for the gradient of a biharmonic function in a half-plane.     

Algorithms for shortest paths and d-cycle problems

Let G be a weighted graph with n vertices and m edges. We address the d-cycle problem, i.e., the problem of finding a subgraph of minimum weight with given cyclomatic number d. Hartvigsen [Minimum path bases, J. Algorithms 15 (1993) 125–142] presented an algorithm with running time O(n²m) and O(n^2d−1m²) for the cyclomatic numbers d=1 and d2, respectively. Using a (d+1)-shortest-paths algorithm, we develop a new more efficient algorithm for the d-cycle problem with running time O(n^2d−1+n²m+n³logn).     

The existence and regularity of multiple solutions for a class of infinitely degenerate elliptic equations

Let X = (X₁, …, X_m) be an infinitely degenerate system of vector fields. We study the existence and regularity of multiple solutions of the Dirichlet problem for a class of semi‐linear infinitely degenerate elliptic operators associated with the sum of square operator δ_X = ∑_{j = 1}^m X_j^* X_j (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Critical Points Index for Vector Functions and Vector Optimization

In this work, we study the critical points of vector functions from ℝ ⁿ to ℝ ^m with n≥m, following the definition introduced by Smale in the context of vector optimization. The local monotonicity properties of a vector function around a critical point which are invariant with respect to local coordinate changes are considered. We propose a classification of critical points through the introduction of a generalized Morse index for a critical point, consisting of a triplet of nonnegative integers. The proposed index is based on the sign of an appropriate invariant vector-valued second-order differential.     

Impulsive control systems with commutative vector fields

We consider variational problems with control laws given by systems of ordinary differential equations whose vector fields depend linearly on the time derivativeu=(u ¹,...,u ^m ) of the controlu=(u ¹,...,u ^m ). The presence of the derivativeu, which is motivated by recent applications in Lagrangian mechanics, causes an impulsive dynamics: at any jump of the control, one expects a jump of the state.The main assumption of this paper is the commutativity of the vector fields that multiply theu . This hypothesis allows us to associate our impulsive systems and the corresponding adjoint systems to suitable nonimpulsive control systems, to which standard techniques can be applied. In particular, we prove a maximum principle, which extends Pontryagin's maximum principle to impulsive commutative systems.     

A continuous method for computing bounds in integer quadratic optimization problems

In the graph partitioning problem, as in other NP-hard problems, the problem of proving the existence of a cut of given size is easy and can be accomplished by exhibiting a solution with the correct value. On the other hand proving the non-existence of a cut better than a given value is very difficult. We consider the problem of maximizing a quadratic function x ^T Q x where Q is an n × n real symmetric matrix with x an n-dimensional vector constrained to be an element of {–1, 1} ⁿ . We had proposed a technique for obtaining upper bounds on solutions to the problem using a continuous approach in [4]. In this paper, we extend this method by using techniques of differential geometry.     

For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution

We consider linear equations y = Φx where y is a given vector in ?ⁿ and Φ is a given n × m matrix with n < m ≤ τn, and we wish to solve for x ∈ ?^m. We suppose that the columns of Φ are normalized to the unit ??₂‐norm, and we place uniform measure on such Φ. We prove the existence of ρ = ρ(τ) > 0 so that for large n and for all Φ's except a negligible fraction, the following property holds: For every y having a representation y = Φx₀ by a coefficient vector x₀ ∈ ?^m with fewer than ρ · n nonzeros, the solution x₁ of the ??₁‐minimization problem is unique and equal to x₀. In contrast, heuristic attempts to sparsely solve such systems—greedy algorithms and thresholding—perform poorly in this challenging setting. The techniques include the use of random proportional embeddings and almost‐spherical sections in Banach space theory, and deviation bounds for the eigenvalues of random Wishart matrices. © 2006 Wiley Periodicals, Inc.     

Local solvability of a nonstationary leakage problem for an ideal incompressible fluid, 3

In this paper we prove the existence and uniqueness of solutions of the leakage problem for the Euler equations in bounded domain Ω C R³ with corners π/n, n = 2, 3… We consider the case where the tangent components of the vorticity vector are given on the part S₁ of the boundary where the fluid enters the domain. We prove the existence of an unique solution in the Sobolev space W_p^l(Ω), for arbitrary natural l and p > 1. The proof is divided on three parts: (1) the existence of solutions of the elliptic problem in the domain with corners where v – velocity vector, ω – vorticity vector and n is an unit outward vector normal to the boundary, (2) the existence of solutions of the following evolution problem for given velocity vector (3) the method of successive approximations, using solvability of problems (1) and (2).     

Asymptotic behavior of smooth solutions for partially dissipative hyperbolic systems with a convex entropy

We study the asymptotic time behavior of global smooth solutions to general entropy, dissipative, hyperbolic systems of balance laws in m space dimensions, under the Shizuta‐Kawashima condition. We show that these solutions approach a constant equilibrium state in the L^p‐norm at a rate O(t^{? (m/2)(1 ? 1/p)}) as t → ∞ for p ∈ [min{m, 2}, ∞]. Moreover, we can show that we can approximate, with a faster order of convergence, the conservative part of the solution in terms of the linearized hyperbolic operator for m ≥ 2, and by a parabolic equation, in the spirit of Chapman‐Enskog expansion in every space dimension. The main tool is given by a detailed analysis of the Green function for the linearized problem. © 2007 Wiley Periodicals, Inc.     

Surrogate methods for linear inequalities

Three algorithms are developed and validated for finding a pointx inR ⁿ that satisfies a given system of inequalities,Axb. A andb are a given matrix and a given vector inR ^m×n andR ^m , respectively, with the rows ofA assumed normalized. The algorithms are iterative and are based upon the orthogonal projection of an infeasible point onto the manifold of the bounding hyperplanes of some of the given constraints. The choice of the active constraints and the actual projection are accomplished through the use of surrogate constraints.This work was supported in part by the City University of New York Research Center. The author thanks Professor D. Goldfarb for suggesting the problem and also for his valuable literature information and time. The word surrogate was borrowed from one of his works.     

Construction of Surfaces with Parallelism Conditions

In this paper we define the notion of pseudo-parallel parameterized surfaces, extending that of offset surfaces. Then we consider the problem of fitting a set of scattered points with a surface pseudo-parallel to a given reference surface. We propose a method of solution based on a modified version of the classical smoothing D ^m -splines over a bounded domain. The convergence of the method is established and some numerical examples are given.     

An active index algorithm for the nearest point problem in a polyhedral cone

We consider the problem of finding the nearest point in a polyhedral cone C={x∈R ⁿ :D x≤0} to a given point b∈R ⁿ , where D∈R ^m×n . This problem can be formulated as a convex quadratic programming problem with special structure. We study the structure of this problem and its relationship with the nearest point problem in a pos cone through the concept of polar cones. We then use this relationship to design an efficient algorithm for solving the problem, and carry out computational experiments to evaluate its effectiveness. Our computational results show that our proposed algorithm is more efficient than other existing algorithms for solving this problem.     

Approximation by smoothing variational vector splines for noisy data

This paper addresses the problem of constructing some free-form curves and surfaces from given to different types of data: exact and noisy data. We extend the theory of D^m${\mathrm{D}}^m$-splines over a bounded domain for noisy data to the smoothing variational vector splines. Both results of convergence for respectively the exact and noisy data are established, as soon as some estimations of errors are given.