Necessary conditions for nonconvex distributed control problems governed by elliptic variational inequalities

In 1956, R. Penrose studied best-approximate solutions of the matrix equation AX = B. He proved that A⁺B (where A⁺ is the Moore-Penrose inverse) is the unique matrix of minimal Frobenius norm among all matrices which minimize the Frobenius norm of AX ? B. In particular, A⁺ is the unique best-approximate solution of AX = I. The vector version of Penrose's result (that is, the fact that the vector A⁺b is the best-approximate solution in the Euclidean norm of the vector equation Ax = b) has long been generalized to infinite dimensional Hilbert spaces.In this paper, an infinite dimensional version of Penrose's full result is given. We show that a straightforward generalization is not possible and provide new extremal characterizations (in terms of the Hermitian order) of A⁺ and of the classes of generalized inverses associated with minimal norm solutions of consistent operator equations or with least-squares solutions. For a certain class of operators, we can phrase our characterizations in terms of a whole class of norms (including the Hilbert-Schmidt and the trace norms), thus providing new extremal characterizations even in the matrix case. We treat both operators with closed range and with not necessarily closed range. Finally, we characterize A⁺ as the unique inner inverse of minimal Hilbert-Schmidt norm if ∥A⁺∥₂ < ∞. We give an application of the new extremal characterization to the compensation problem in systems analysis in infinite-dimensional Hilbert spaces.     

Variational Inequalities: an Elementary Approach

We will deal with the following problem: Let M be an n×n matrix with real entries. Under which conditions the family of inequalities: x∈? ⁿ ;x?0;M·x?0has non–trivial solutions? We will prove that a sufficient condition is given by m_i,j+m_j,i?0 (1?i,j?n); from this result we will derive an elementary proof of the existence theorem for Variational Inequalities in the framework of Monotone Operators.     

Approximation algorithms for indefinite complex quadratic maximization problems

In this paper,we consider the following indefinite complex quadratic maximization problem: maximize zHQz,subject to zk ∈ C and zkm = 1,k = 1,...,n,where Q is a Hermitian matrix with trQ = 0,z ∈ Cn is the decision vector,and m 3.An (1/log n) approximation algorithm is presented for such problem.Furthermore,we consider the above problem where the objective matrix Q is in bilinear form,in which case a 0.7118 cos mπ 2approximation algorithm can be constructed.In the context of quadratic optimization,various extensions and connections of the model are discussed.     

A two-dimensional inverse problem for an integro-differential equation of electrodynamics

An integro-differential equation corresponding to a two-dimensional problem of electrodynamics with dispersion is considered. It is assumed that the electrodynamic properties of a nonconducting medium with a constant magnetic permeability and the external current are independent of the x ₃ coordinate. In this case, the third component of the electric field vector satisfies a second-order scalar integro-differential equation with a variable permittivity of the medium. For this equation, we study the problem of finding the spatial part of the kernel entering the integral term. This corresponds to finding the part of the permittivity that depends on the electromagnetic frequency. It is assumed that the permittivity support is contained in some compact domain Ω ? ?². To find this coefficient inside Ω, we use information on the solution of the corresponding direct problem on the boundary of Ω on a finite time interval. An estimate for the conditional stability of the solution of the inverse problem is established under the assumption that the time interval is sufficiently large.     

A Riemann-Hilbert Problem for the Moisil-Teodorescu System

In a bounded domain with smooth boundary in ?³ we consider the stationary Maxwell equations for a function u with values in ?³ subject to a nonhomogeneous condition (u, v)_x = u₀ on the boundary, where v is a given vector field and u₀ a function on the boundary. We specify this problem within the framework of the Riemann-Hilbert boundary value problems for the Moisil-Teodorescu system. This latter is proved to satisfy the Shapiro-Lopaniskij condition if an only if the vector v is at no point tangent to the boundary. The Riemann-Hilbert problem for the Moisil-Teodorescu system fails to possess an adjoint boundary value problem with respect to the Green formula, which satisfies the Shapiro-Lopatinskij condition. We develop the construction of Green formula to get a proper concept of adjoint boundary value problem.     

Contribution to the General Linear Conjugation Problem for A Piecewise Analytic Vector

Establishing an analogy between the theories of Riemann–Hilbert vector problem and linear ODEs, for the n-dimensional homogeneous linear conjugation problem on a simple smooth closed contour Γ partitioning the complex plane into two domains D⁺ and D^? we show that if we know n?1 particular solutions such that the determinant of the size n?1 matrix of their components omitting those with index k is nonvanishing on D⁺ ∪ Γ and the determinant of the matrix of their components omitting those with index j is nonvanishing on Γ ∪ D^? {∞}, where \(k,j = \overline {1,n} \), then the canonical system of solutions to the linear conjugation problem can be constructed in closed form.     

On characterizations of sup-preserving functionals

Let (E, ≦) be a vector lattice and E ₊ be the set of all nonnegative elements of E. We investigate M-functionals from E ₊ into ?₊, that is functions A: E ₊ → ?₊ such that $$ \Lambda (f \vee g) = \Lambda (f) \vee \Lambda (g),\Lambda (\alpha f) = \alpha \Lambda (f) $$ for α ≧ 0 and f, g ? E ₊. Let X be a set and Σ be an algebra of subsets of X. By an M-measure we understand the function μ: Σ → ?₊ such that μ( $ \not 0 $ ) = 0 and $$ \mu (A \cup B) = \mu (A) \vee \mu (B)forA,B \in \Sigma ). $$ The main result of the paper is a Riesz type theorem. We prove that every M-functional on C(X, ?)₊ can be expressed in terms of M-measure.     

一类Hermitian鞍点矩阵的特征值估计

本文研究了一类大型稀疏Hermitian鞍点线性系统Az=(B E E* 0)(x y)=(f g)=b系数矩阵的特征值,其中B∈C~(p×p)是Hermitian正定阵矩阵,E∈C~(p×q)是列降秩.本文分别给出了该系数矩阵正特征值与负特征值界的一个估计式,同时通过数值算例验证本文所给出的特征值界的估计是合理且有效的.     

On the basis property of eigenelements of ordinary linear differential operators in a space of the type <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>, <Emphasis Type="Italic">p</Emphasis> ≥ 2

For a linear differential expression with matrix coefficients in the class L _p , p ≥ 2, and with a parameter λ, we consider a boundary value problem with boundary conditions at the endpoints of the interval [a, b]. Under the condition that the problem is regular, we obtain a formula for the Fourier series expansion of an arbitrary vector function of the class L _p in the root functions of the problem.     

On Ochoa's special matrices in matrix classes

It is well known that the ideal classes of an order Z[μ], generated over Z by the integral algebraic number μ, are in a bijective correspondence with certain matrix classes, that is, classes of unimodularly equivalent matrices with rational integer coefficients. If the degree of μ is ?3, we construct explicitly a particularly simple ideal matrix for an ideal which is a product of different prime ideals of degree 1. We obtain the following special n×n matrix (c_ij) in the matrix class corresponding to the ideal class of our ideal: c_i+1,_i=1(i=1,…,n?2); c_ij=0(?i?n, 1?j?n? 2, and i≠j+1); c_nj=0(j)=2,…,n?1). The remaining coefficients are given as explicit polynomials in an integer z which depends on the ideal. It is shown that the matrix class of every regular ideal class of Z[μ] contains a special matrix of this kind.     

Non-characteristic mixed problems for non-linear symmetric hyperbolic systems

In this paper the existence and uniqueness of solutions of the following initial boundary value problem for non-linear symmetric hyperbolic equations of the first order are shown, where M = I ⁺ ? S , has the same from as the Kreiss' condition, but S must be sufficiently small ( I ⁺ is the unit matrix in the space generated by eigenvectors of the matrix ? A · n? , corresponding to positive eigenvalues) and n? is a unit outward vector normal to the boundary. The main result of the paper is obtaining an a priori estimate for non-linear equations. This estimate is obtained for sufficiently small time and norms of given data functions. The existence of solutions is proved by the method of successive approximations, which can be used because at each step such properties as symmetry of matrices and the numbers of positive and negative eigenvalues of the matrix ? A · n? are assured. This can be done because we restrict our attention to such systems of equations for which these properties are satisfied for solutions from some neighbourhood of initial data u ₀. Therefore, using the fact that solutions in the class of continuous functions are sought, these properties can be satisfied for sufficiently small time. Moreover, some examples of initial boundary value problems for equations of hydrodynamics and magnetohydrodynamics are considered.     

Vector and matrix apportionment problems and separable convex integer optimization

The problems of (bi-)proportional rounding of a nonnegative vector or matrix, resp., are written as particular separable convex integer minimization problems. Allowing any convex (separable) objective function we use the notions of vector and matrix apportionment problems. As a broader class of problems we consider separable convex integer minimization under linear equality restrictions Ax = b with any totally unimodular coefficient matrix A. By the total unimodularity Fenchel duality applies, despite the integer restrictions of the variables. The biproportional algorithm of Balinski and Demange (Math Program 45:193–210, 1989) is generalized and derives from the dual optimization problem. Also, a primal augmentation algorithm is stated. Finally, for the smaller class of matrix apportionment problems we discuss the alternating scaling algorithm, which is a discrete variant of the well-known Iterative Proportional Fitting procedure.     

Construction of Carleman formulas by using mixed problems with parameter-dependent boundary conditions

Let D be an open connected subset of the complex plane C with sufficiently smooth boundary ?D. Perturbing the Cauchy problem for the Cauchy–Riemann system ??u = f in D with boundary data on a closed subset S ? ?D, we obtain a family of mixed problems of the Zaremba-type for the Laplace equation depending on a small parameter ε ∈ (0, 1] in the boundary condition. Despite the fact that the mixed problems include noncoercive boundary conditions on ?D\S, each of them has a unique solution in some appropriate Hilbert space H ⁺(D) densely embedded in the Lebesgue space L ₂(?D) and the Sobolev–Slobodetski? space H ^1/2?δ(D) for every δ > 0. The corresponding family of the solutions {u _ε} converges to a solution to the Cauchy problem in H ⁺(D) (if the latter exists). Moreover, the existence of a solution to the Cauchy problem in H ⁺(D) is equivalent to boundedness of the family {u _ε} in this space. Thus, we propose solvability conditions for the Cauchy problem and an effective method of constructing a solution in the form of Carleman-type formulas.     

A modified greedy analysis pursuit algorithm for the cosparse analysis model

In the past decade, the sparse representation synthesis model has been deeply researched and widely applied in signal processing. Recently, a cosparse analysis model has been introduced as an interesting alternative to the sparse representation synthesis model. The sparse synthesis model pay attention to non-zero elements in a representation vector x, while the cosparse analysis model focuses on zero elements in the analysis representation vector Ωx. This paper mainly considers the problem of the cosparse analysis model. Based on the greedy analysis pursuit algorithm, by constructing an adaptive weighted matrix W _k?1, we propose a modified greedy analysis pursuit algorithm for the sparse recovery problem when the signal obeys the cosparse model. Using a weighted matrix, we fill the gap between greedy algorithm and relaxation techniques. The standard analysis shows that our algorithm is convergent. We estimate the error bound for solving the cosparse analysis model, and then the presented simulations demonstrate the advantage of the proposed method for the cosparse inverse problem.     

On the problem of determining the structure of a layered medium and the shape of an impulse source

For the equation of wave propagation in the half-space ? ₊ ² + = {(x, y) ∈ ?² | y > 0} we consider the problem of determining the speed of wave propagation that depends only on the variable y and the shape of a point impulse source on the boundary of the half-space. We show that, under some assumptions on the shape of the source and the structure of the medium, both unknown functions of one variable are uniquely determined by the displacements of boundary points of the medium. We estimate stability of a solution to the problem.     

A criterion for the existence of decaying solutions in the problem on a resonator with a cylindrical waveguide

For the Helmholtz equation Δu + k ² u = 0 in a domain Ω with a cylindrical outlet Q ₊ = ω × ?₊ to infinity, we construct a fictitious scattering operator $\mathfrak{S}$ that is unitary in L ₂(ω) and establish a bijection between the lineal of decaying solutions of the Dirichlet problem in Ω and the subspace of eigenfunctions of $\mathfrak{S}$ corresponding to the eigenvalue 1 and orthogonal to the eigenfunctions with eigenvalues λ_n ≤ k ² of the Dirichlet problem for the Laplace operator on the cross-section ω.     

Possible isolation number of a matrix over nonnegative integers

Let ?₊ be the semiring of all nonnegative integers and A an m × n matrix over ?₊. The rank of A is the smallest k such that A can be factored as an m × k matrix times a k×n matrix. The isolation number of A is the maximum number of nonzero entries in A such that no two are in any row or any column, and no two are in a 2 × 2 submatrix of all nonzero entries. We have that the isolation number of A is a lower bound of the rank of A. For A with isolation number k, we investigate the possible values of the rank of A and the Boolean rank of the support of A. So we obtain that the isolation number and the Boolean rank of the support of a given matrix are the same if and only if the isolation number is 1 or 2 only. We also determine a special type of m×n matrices whose isolation number is m. That is, those matrices are permutationally equivalent to a matrix A whose support contains a submatrix of a sum of the identity matrix and a tournament matrix.     

On a Vector Version of a Fundamental Lemma of J. L. Lions

Let ? be a bounded and connected open subset of R~N with a Lipschitzcontinuous boundary,the set ? being locally on the same side of ??.A vector version of a fundamental lemma of J.L.Lions,due to C.Amrouche,the first author,L.Gratie and S.Kesavan,asserts that any vector field v =(vi) ∈(D′(?))~N,such that all the components 1/2(?_jv_i + ?_iv_j),1 ≤ i,j ≤ N,of its symmetrized gradient matrix field are in the space H~(-1)(?),is in effect in the space(L~2(?))~N.The objective of this paper is to show that this vector version of J.L.Lions lemma is equivalent to a certain number of other properties of interest by themselves.These include in particular a vector version of a well-known inequality due to J.Neˇcas,weak versions of the classical Donati and Saint-Venant compatibility conditions for a matrix field to be the symmetrized gradient matrix field of a vector field,or a natural vector version of a fundamental surjectivity property of the divergence operator.     

Dual submanifolds in rational homology spheres

Let Σ be a simply connected rational homology sphere. A pair of disjoint closed submanifolds M_+, M_-? Σ are called dual to each other if the complement Σ-M_+ strongly homotopy retracts onto M_- or vice-versa. In this paper, we are concerned with the basic problem of which integral triples(n; m_+, m-) ∈ N~3 can appear, where n = dimΣ-1 and m_± = codim M_±-1. The problem is motivated by several fundamental aspects in differential geometry.(i) The theory of isoparametric/Dupin hypersurfaces in the unit sphere S~(n+1) initiated by′Elie Cartan, where M_± are the focal manifolds of the isoparametric/Dupin hypersurface M ? S~(n+1), and m± coincide with the multiplicities of principal curvatures of M.(ii) The Grove-Ziller construction of non-negatively curved Riemannian metrics on the Milnor exotic spheres Σ,i.e., total spaces of smooth S~3-bundles over S~4 homeomorphic but not diffeomorphic to S~7, where M_± =P_±×_(SO(4))S~3, P → S~4 the principal SO(4)-bundle of Σ and P_± the singular orbits of a cohomogeneity one SO(4) × SO(3)-action on P which are both of codimension 2.Based on the important result of Grove-Halperin, we provide a surprisingly simple answer, namely, if and only if one of the following holds true:· m_+ = m_-= n;· m_+ = m_-=1/3n ∈ {1, 2, 4, 8};· m_+ = m_-=1/4n ∈ {1, 2};· m_+ = m_-=1/6n ∈ {1, 2};·n/(m_++m_-)= 1 or 2, and for the latter case, m_+ + m_-is odd if min(m_+, m_-)≥2.In addition, if Σ is a homotopy sphere and the ratio n/(m_++m_-)= 2(for simplicity let us assume 2 m_- m_+),we observe that the work of Stolz on the multiplicities of isoparametric hypersurfaces applies almost identically to conclude that, the pair can be realized if and only if, either(m_+, m_-) =(5, 4) or m_+ + m_-+ 1 is divisible by the integer δ(m_-)(see the table on Page 1551), which is equivalent to the existence of(m_--1) linearly independent vector fields on the sphere S~(m_++m_-)by Adams' celebrated work. In contrast, infinitely many counterexamples are given if Σ is a rational homology sphere.