Matrix inverse problem and its optimal approximation problem for R-skew symmetric matrices

Let R ∈ C^n×n be a nontrivial involution, i.e., R² = I and R ≠ ±I. A matrix A ∈ C^n×n is called R-skew symmetric if RAR = −A. The least-squares solutions of the matrix inverse problem for R-skew symmetric matrices with R∗ = R are firstly derived, then the solvability conditions and the solutions of the matrix inverse problem for R-skew symmetric matrices with R∗ = R are given. The solutions of the corresponding optimal approximation problem with R∗ = R for R-skew symmetric matrices are also derived. At last an algorithm for the optimal approximation problem is given. It can be seen that we extend our previous results [G.X. Huang, F. Yin, Matrix inverse problem and its optimal approximation problem for R-symmetric matrices, Appl. Math. Comput. 189 (2007) 482-489] and the results proposed by Zhou et al. [F.Z. Zhou, L. Zhang, X.Y. Hu, Least-square solutions for inverse problem of centrosymmetric matrices, Comput. Math. Appl. 45 (2003) 1581-1589].     

Length problems for automorphisms of modules over local rings

Let R be a local ring and M a free module of a finite rank over R. An element τ ∈ Aut_RM is said to be simple if τ ≠ 1 fixes a hyperplane of M.We shall show that for any σ ∈ Aut_RM there exist a basis X for M and ρ ∈ Aut_RM such that ρ acts as a permutation on X and ρ⁻¹σ is a product of m or less than m simple elements in Aut_RM, where m is the order of the invariant factors of σ modulo the maximal ideal of R.Also we shall investigate the problem treated by E.W. Ellers and H. Ishibashi [Factorizations of transformations over a valuation ring, Linear Algebra Appl. 85 (1987) 17-27], in which they showed that σ is a product of simple elements and gave an upper bound of the smallest number of such factors of σ, whereas in the present paper we will give lower bounds of σ in case that R is a local domain. Moreover we will factorize θσ as a product of symmetries and transvections for some θ the matrix of which is diagonal.     

On Euclidean distance matrices

If A is a real symmetric matrix and P is an orthogonal projection onto a hyperplane, then we derive a formula for the Moore-Penrose inverse of PAP. As an application, we obtain a formula for the Moore-Penrose inverse of an Euclidean distance matrix (EDM) which generalizes formulae for the inverse of a EDM in the literature. To an invertible spherical EDM, we associate a Laplacian matrix (which we define as a positive semidefinite n × n matrix of rank n − 1 and with zero row sums) and prove some properties. Known results for distance matrices of trees are derived as special cases. In particular, we obtain a formula due to Graham and Lovász for the inverse of the distance matrix of a tree. It is shown that if D is a nonsingular EDM and L is the associated Laplacian, then D⁻¹ − L is nonsingular and has a nonnegative inverse. Finally, infinitely divisible matrices are constructed using EDMs.     

A distance-based point-reassignment heuristic for the k-hyperplane clustering problem

We consider the k-Hyperplane Clustering problem where, given a set of m   points in Rⁿ${\mathbb{R}}^n$, we have to partition the set into k subsets (clusters) and determine a hyperplane for each of them, so as to minimize the sum of the squares of the Euclidean distances between the points and the hyperplane of the corresponding clusters. We give a nonconvex mixed-integer quadratically constrained quadratic programming formulation for the problem. Since even very small-size instances are challenging for state-of-the-art spatial branch-and-bound solvers like Couenne, we propose a heuristic in which many “critical” points are reassigned at each iteration. Such points, which are likely to be ill-assigned in the current solution, are identified using a distance-based criterion and their number is progressively decreased to zero. Our algorithm outperforms the best available one proposed by Bradley and Mangasarian on a set of real-world and structured randomly generated instances. For the largest instances, we obtain an average improvement in the solution quality of 54%.     

Jordan isomorphisms of upper triangular matrix rings

Let R be a 2-torsionfree ring with identity 1 and let T_n(R), n ? 2, be the ring of all upper triangular n × n matrices over R. We describe additive Jordan isomorphisms of T_n(R) onto an arbitrary ring and generalize several results on this line.     

A Variational Approach to Discontinuous Problems with Critical Sobolev Exponents

We employ variational techniques to study the existence and multiplicity of positive solutions of semilinear equations of the form − Δu = λh(x)H(u − a)u^q + u^2* − 1 in R^N, where λ, a > 0 are parameters, h(x) is both nonnegative and integrable on R^N, H is the Heaviside function, 2* is the critical Sobolev exponent, and 0 ≤ q < 2* − 1. We obtain existence, multiplicity and regularity of solutions by distinguishing the cases 0 ≤ q ≤ 1 and 1 < q < 2* − 1.     

Pointwise Estimate for Linear Combinations of Bernstein-Kantorovich Operators

For linear combinations of Bernstein-Kantorovich operators K_n, r(f, x), we give an equivalent theorem with ω^2r_?^λ(f, t). The theorem unites the corresponding results of classical and Ditzian-Totik moduli of smoothness.     

On single and double Soules matrices

Until now the concept of a Soules basis matrix of sign patternN consisted of an orthogonal matrix R∈R^n,n, generated in a certain way from a positive n-vector, which has the property that for any diagonal matrix Λ = diag(λ₁, … , λ_n), with λ₁ ? ? ? λ_n ? 0, the symmetric matrix A = RΛR^T has nonnegative entries only. In the present paper we introduce the notion of a pair of double Soules basis matrices of sign patternN which is a pair of matrices (P, Q), each in R^n,n, which are not necessarily orthogonal and which are generated in a certain way from two positive vectors, but such that PQ^T = I and such that for any of the aforementioned diagonal matrices Λ, the matrix A = PΛQ^T (also) has nonnegative entries only. We investigate the interesting properties which such matrices A have.As a preamble to the above investigation we show that the iterates, , generated in the course of the QR-algorithm when it is applied to A = RΛR^T, where R is a Soules basis matrix of sign pattern N, are again symmetric matrices generated by the Soules basis matrices R_k of sign pattern N which are themselves modified as the algorithm progresses.Our work here extends earlier works by Soules and Elsner et al.     

Duality for a Class of Multiobjective Control Problems

In this paper, a class of multiobjective control problems is considered, where the objective and constraint functions involved are f(t, x(t), ?(t), y(t), z(t)) with x(t) ∈ Rⁿ, y(t) ∈ Rⁿ, and z(t) ∈ R^m, where x(t) and z(t) are the control variables and y(t) is the state variable. Under the assumption of invexity and its generalization, duality theorems are proved through a parametric approach to related properly efficient solutions of the primal and dual problems.     

Alexandrov’s inequality and conjectures on some Toeplitz matrices

We study determinant inequalities for certain Toeplitz-like matrices over C. For fixed n and N ? 1, let Q be the n × (n + N − 1) zero-one Toeplitz matrix with Q_ij = 1 for 0 ? j − i ? N − 1 and Q_ij = 0 otherwise. We prove that det(QQ^∗) is the minimum of det(RR^∗) over all complex matrices R with the same dimensions as Q satisfying ∣R_ij∣ ? 1 whenever Q_ij = 1 and R_ij = 0 otherwise. Although R has a Toeplitz-like band structure, it is not required to be actually Toeplitz. Our proof involves Alexandrov’s inequality for polarized determinants and its generalizations. This problem is motivated by Littlewood’s conjecture on the minimum 1-norm of N-term exponential sums on the unit circle. We also discuss polarized Bazin-Reiss-Picquet identities, some connections with k-tree enumeration, and analogous conjectured inequalities for the elementary symmetric functions of QQ^∗.     

Solution blow-up for a new stationary Sobolev-type equation

A new nonlinear stationary Sobolev-type equation with a parameter η ∈ ℝ¹ is derived. For η > 0, global solvability in the weak generalized sense is proved in the entire waveguide $ \mathbb{S} $ \mathbb{S} ⊗ ℝ₊¹. For η < 0, the strong generalized solution is shown to blow up in a certain waveguide cross section z = R ₀ > 0. An upper bound for R ₀ in terms of the original parameters of the problem is obtained.     

Factoring and decomposing a class of linear functional systems

Within a constructive homological algebra approach, we study the factorization and decomposition problems for a class of linear functional (determined, over-determined, under-determined) systems. Using the concept of Ore algebras of functional operators (e.g., ordinary/partial differential operators, shift operators, time-delay operators), we first concentrate on the computation of morphisms from a finitely presented left module M over an Ore algebra to another one M′, where M (resp., M′) is a module intrinsically associated with the linear functional system Ry = 0 (resp., R′z = 0). These morphisms define applications sending solutions of the system R′z = 0 to solutions of R y = 0. We explicitly characterize the kernel, image, cokernel and coimage of a general morphism. We then show that the existence of a non-injective endomorphism of the module M is equivalent to the existence of a non-trivial factorization R = R₂R₁ of the system matrix R. The corresponding system can then be integrated “in cascade”. Under certain conditions, we also show that the system Ry = 0 is equivalent to a system R′z = 0, where R′ is a block-triangular matrix of the same size as R. We show that the existence of idempotents of the endomorphism ring of the module M allows us to reduce the integration of the system Ry = 0 to the integration of two independent systems R₁y₁ = 0 and R₂y₂ = 0. Furthermore, we prove that, under certain conditions, idempotents provide decompositions of the system Ry = 0, i.e., they allow us to compute an equivalent system R′z = 0, where R′ is a block-diagonal matrix of the same size as R. Applications of these results in mathematical physics and control theory are given. Finally, the different algorithms of the paper are implemented in the Maple package Morphisms based on the library oremodules.     

Lipschitz stability of controlled invariant subspaces

Let (A,B)∈C^n×n×C^n×m and M be an (A, B)-invariant subspace. In this paper the following results are presented: (i) If M∩ImB={0}, necessary and sufficient conditions for the Lipschitz stability of M are given. (ii) If M contains the controllability subspace of the pair (A, B), sufficient conditions for the Lipschitz stability of the subspace M are given.     

A finite difference solution to a two-dimensional parabolic inverse problem

In this paper, we consider the problem of finding u = u(x, y, t) and p = p(t) which satisfy u_t = u_xx + u_yy + p(t)u + ? in R × [0, T], u(x, y, 0) = f(x, y), (x, y) ∈ R = [0, 1] × [0, 1], u is known on the boundary of R and u(x^∗, y^∗, t) = E(t), 0 < t ? T, where E(t) is known and (x^∗, y^∗) is a given point of R. Through a function transformation, the nonlinear two-dimensional diffusion problem is transformed into a linear problem, and a backward Euler scheme is constructed. It is proved by the maximum principle that the scheme is uniquely solvable, unconditionally stable and convergent in L_∞ norm. The convergence orders of u and p are of O(τ + h²). The impact of initial data errors on the numerical solution is also considered. Numerical experiments are presented to illustrate the validity of the theoretical results.     

Deletion-restriction for subspace arrangements

Let A be a subspace arrangement in V with a designated maximal affine subspace A₀. Let A^′=A?{A₀} be the deletion of A₀ from A and A^″={A∩A₀|A∩A₀≠∅} be the restriction of A to A₀. Let M=V?_?A∈AA be the complement of A in V. If A is an arrangement of complex affine hyperplanes, then there is a split short exact sequence, 0→Hk(M^′)→Hk(M)→Hk+1−codimR(A₀)(M^″)→0. In this paper, we determine conditions for when the triple (A,A^′,A^″) of arrangements of affine subspaces yields the above split short exact sequence. We then generalize the no-broken-circuit basis nbc of Hk(M) for hyperplane arrangements to deletion-restriction subspace arrangements.     

Critical Exponents of Quasilinear Parabolic Equations

In this paper we study the critical exponents of the Cauchy problem in Rⁿ of the quasilinear singular parabolic equations: u_t = div(|∇u|^m − 1∇u) + t^s|x|^σu^p, with non-negative initial data. Here s ≥ 0, (n − 1)/(n + 1) < m < 1, p > 1 and σ > n(1 − m) − (1 + m + 2s). We prove that p_c ≡ m + (1 + m + 2s + σ)/n > 1 is the critical exponent. That is, if 1 < p ≤ p_c then every non-trivial solution blows up in finite time, but for p > p_c, a small positive global solution exists.     

On the solution set of an equation of the type f(t, Φ(u(t)) = 0

We investigate the solution set Γ of an equation of the type f(t, Φ(u(t)) = 0, where Φ is a linear homeomorphism from a topological vector space X onto L ¹(T) and f: T×R → R is a Carathéodory function. More precisely, we characterize the property of Γ of intersecting each closed hyperplane of X.     

Matrices A such that AA − AA are nonsingular

In this paper we study the class of square matrices A such that AA^† − A^†A is nonsingular, where A^† stands for the Moore-Penrose inverse of A. Among several characterizations we prove that for a matrix A of order n, the difference AA^† − A^†A is nonsingular if and only if R(A)⊕R(A^∗)=C_n,1, where R(·) denotes the range space. Also we study matrices A such that R(A)^⊥=R(A^∗).     

On the nonnegative rank of Euclidean distance matrices

The Euclidean distance matrix for n distinct points in R^r is generically of rank r + 2. It is shown in this paper via a geometric argument that its nonnegative rank for the case r = 1 is generically n.