Nonlinear Maps Preserving the Jordan Triple *-Product on Factor von Neumann Algebras

Let A and B be two factor von Neumann algebras. For A, B ∈ A, define by [A, B]_*= AB-BA~*the skew Lie product of A and B. In this article, it is proved that a bijective map Φ : A → B satisfies Φ([[A, B]_*, C]_*) = [[Φ(A), Φ(B)]_*, Φ(C)]_*for all A, B, C ∈ A if and only if Φ is a linear *-isomorphism, or a conjugate linear *-isomorphism, or the negative of a linear *-isomorphism, or the negative of a conjugate linear *-isomorphism.     

Best proximity points: global optimal approximate solutions

Let A and B be non-empty subsets of a metric space. As a non-self mapping \({T:A\longrightarrow B}\) does not necessarily have a fixed point, it is of considerable interest to find an element x in A that is as close to Tx in B as possible. In other words, if the fixed point equation Tx = x has no exact solution, then it is contemplated to find an approximate solution x in A such that the error d(x, Tx) is minimum, where d is the distance function. Indeed, best proximity point theorems investigate the existence of such optimal approximate solutions, called best proximity points, to the fixed point equation Tx = x when there is no exact solution. As the distance between any element x in A and its image Tx in B is at least the distance between the sets A and B, a best proximity pair theorem achieves global minimum of d(x, Tx) by stipulating an approximate solution x of the fixed point equation Tx = x to satisfy the condition that d(x, Tx) = d(A, B). The purpose of this article is to establish best proximity point theorems for contractive non-self mappings, yielding global optimal approximate solutions of certain fixed point equations. Besides establishing the existence of best proximity points, iterative algorithms are also furnished to determine such optimal approximate solutions.     

Stabilization of a Class of Uncertain Systems

We consider the problem to synthesize a stabilizing control u synthesis for systems \(\frac{{dx}}{{dt}} = Ax + Bu\) where A ∈ ?^n×n and B ∈ ?^n×m, while the elements α_i,j(·) of the matrix A are uniformly bounded nonanticipatory functionals of arbitrary nature. If the system is continuous, then the elements of the matrix B are continuous and uniformly bounded functionals as well. If the system is pulse-modulated, then the elements of the matrix B are differentiable uniformly bounded functions of time. It is assumed that k isolated uniformly bounded elements \({\alpha _{{i_l},{j_l}}}\left( \cdot \right)\) satisfying the condition \(\mathop {\inf }\limits_{\left( \cdot \right)} \left| {{\alpha _{{i_l},{j_l}}}\left( \cdot \right)} \right|{\alpha _ - } > 0,\quad l \in \overline {1,k}\) are located above the main diagonal of the matrix A(·), where G _k is the set of all isolated elements of the system, J₁ is the set of indices of rows of matrix A(·) containing isolated elements, and J₂ is the set of indices of its rows free of isolated elements. It is assumed that other elements located above the main diagonal are sufficiently small provided that their row indices belong to J₁, i.e., \(\mathop {\sup }\limits_{\left( \cdot \right)} \left| {{\alpha _{i,j}}\left( \cdot \right)} \right| < \delta ,\quad {\alpha _{i,j}} \notin {G_k},\quad i \in {J_1},\quad j > i\). All other elements located above the main diagonal are uniformly bounded. The relation u = S(·)x is satisfied in the continuous case, while the relation u = ξ(t) is satisfied in the pulse-modulated case; here the components of the vector ξ are outputs of synchronous pulse elements. Constructing a special quadratic Lyapunov function, one can determine a matrix S(·) such that the closed system becomes globally exponentially stable in the continuous case. In the pulse-modulated case, input pulses are synthesized such that the system becomes globally asymptotically stable.     

On a property of the reducibility exponent of linear differential systems

We establish that the reducibility exponent (Differentsial’nye Uravneniya, 2007, vol. 43, no. 2, pp. 191–202) of each linear system

$$\dot x = A(t)x, x \in \mathbb{R}^n , t \geqslant 0$$

, with piecewise continuous bounded coefficient matrix A does not belong to the set of values of σ for which the perturbed system (1_A+Q) with an arbitrary piecewise continuous perturbation Q satisfying the condition \(\overline {\lim } _{t \to + \infty } t^{ - 1} \ln \left\| {Q(t)} \right\| \leqslant - \sigma \) is reducible to the original system (1 _A ) by some Lyapunov transformation.

     

Conflict free colorings of nonuniform systems of infinite sets

If \(\mathcal{H}\) is a system of infinite sets, |A∩B|<r for \({A\ne B\in\mathcal{H}}\) (r<ω) then \(\mathcal{H}\) has a conflict free coloring with ω colors, i.e., a function \(F\colon {\bigcup\mathcal{H}\to\omega}\) so that each \(A\in\mathcal{H}\) has a color i<ω with |F ^?1(i)∩A|=1.     

Chowla’s cosine problem

A continuous linear map T from a Banach algebra A into another B approximately preserves the zero products if ‖T(a)T(b)‖ ≤ α‖a‖‖b‖ (a,b ∈ A, ab = 0) for some small positive α. This paper is mainly concerned with the question of whether any continuous linear surjective map T: A → B that approximately preserves the zero products is close to a continuous homomorphism from A onto B with respect to the operator norm. We show that this is indeed the case for amenable group algebras.     

An extended class of stabilizable uncertain systems

The system of equations \(\frac{{dx}}{{dt}} = A\left( \cdot \right)x + B\left( \cdot \right)u\), where A(·) ∈ ?^{n × n}, B(·) ∈ ?^{n × m}, S(·) ∈ R^{n × m}, is considered. The elements of the matrices A(·), B(·), S(·) are uniformly bounded and are functionals of an arbitrary nature. It is assumed that there exist k elements \({\alpha _{{i_i}{j_l}}}\left( \cdot \right)\left( {l \in \overline {1,k} } \right)\) of fixed sign above the main diagonal of the matrix A(·), and each of them is the only significant element in its row and column. The other elements above the main diagonal are sufficiently small. It is assumed that m = n ?k, and the elements β_ij(·) of the matrix B(·) possess the property \(\left| {{\beta _{{i_s}s}}\left( \cdot \right)} \right| = {\beta _0} > 0\;at\;{i_s}\; \in \;\overline {1,n} \backslash \left\{ {{i_1}, \ldots ,{i_k}} \right\}\). The other elements of the matrix B(·) are zero. The positive definite matrix H = {h_ij} of the following form is constructed. The main diagonal is occupied by the positive numbers h_ii = h_i, \({h_{{i_l}}}_{{j_l}}\, = \,{h_{{j_l}{i_l}}}\, = \, - 0.5\sqrt {{h_{{i_l}}}_{{j_l}}} \,\operatorname{sgn} \,{\alpha _{{i_l}}}_{{j_l}}\left( \cdot \right)\). The other elements of the matrix H are zero. The analysis of the derivative of the Lyapunov function V(x) = x*H^–1x yields h_i\(\left( {i \in \overline {1,n} } \right)\) and λ_i ≤ 0 \(\left( {i \in \overline {1,n} } \right)\) such that for S(·) = H^?1ΛB(·), Λ = diag(λ₁, ..., λ_n), the system of the considered equations becomes globally exponentially stable. The control is robust with respect to the elements of the matrix A(·).     

Stability of uncertain discrete systems

The uncertain system

$x_{n + 1} = A_n x_n , n = 0,1,2, \ldots ,$

is considered, where the coefficients a _ij (n) of the m×m matrix A _n are functionals of any nature subject to the constraints

$\begin{array}{*{20}c} {\left| {a_{i,i} (n)} \right| \leqslant \alpha _ * < 1,} \\ {\left| {a_{i,j} (n)} \right| \leqslant \alpha _0 for j \geqslant i + 1,} \\ {\left| {a_{i,j} (n)} \right| \leqslant \delta for j < i.} \\ \end{array} $

Such systems include, in particular, switched-type systems, whose matrix A can take values in a given finite set.By using a special Lyapunov function, a bound δ ≤ δ(α₀,α_*) ensuring the global asymptotic stability of the system is found. In particular, the system is stable if the last inequality is replaced by a _i,j (n) = 0 for j < i.It is shown that pulse-width modulated systems reduce to the uncertain systems under consideration; moreover, in the case of a pulse-width modulation of the first kind, the coefficients of the matrix A are functions of x(n), and in the case of a modulation of the second kind, they are functionals.     

Localization of the eigenvalues of a pencil of positive definite matrices

Let A and B be real square positive definite matrices close to each other. A domain S on the complex plane that contains all the eigenvalues λ of the problem Az = λBz is constructed analytically. The boundary ?S of S is a curve known as the limacon of Pascal. Using the standard conformal mapping of the exterior of this curve (or of the exterior of an enveloping circular lune) onto the exterior of the unit disc, new analytical bounds are obtained for the convergence rate of the minimal residual method (GMRES) as applied to solving the linear system Ax = b with the preconditioner B.     

Modified quasi-Chebyshev acceleration to nonoverlapping parallel multisplitting method

In this study, we propose a modified quasi-Chebyshev acceleration to the nonoverlopping multisplitting iteration method for solving the linear systems A x = b where A is a real symmetric positive definite matrix or an H-matrix. In the process of the parallel multisplitting method, the distributive tasks are parallelly computed by each processor, then a global modified acceleration is used to obtain the solution of the system A x = b for every τ steps, such that the efficiency of the computation can be improved. The convergence theory of the new algorithm is given under some reasonable conditions. Finally, numerical experiments show that the method is efficient and effective.     

A note on generating <Emphasis Type="Italic">P</Emphasis>-matrices

We prove that for any \({A,B\in\mathbb{R}^{n\times n}}\) such that each matrix S satisfying min(A, B) ≤ S ≤ max(A, B) is nonsingular, all four matrices A ^?1 B, AB ^?1, B ^?1 A and BA ^?1 are P-matrices. A practical method for generating P-matrices is drawn from this result.     

Equations in finite fields with restricted solution sets. I (Character sums)

In earlier papers, for “large” (but otherwise unspecified) subsets A, B of Z _p and for h(x) ∈ Z _p [x], Gyarmati studied the solvability of the equations a + b = h(x), resp. ab = h(x) with a ∈ A, b ∈ B, x ∈ Z _p , and for large subsets A, B, C, D of Z _p Sárközy showed the solvability of the equations a + b = cd, resp. ab + 1 = cd with a ∈ A, b ∈ B, c ∈ C, d ∈ D. In this series of papers equations of this type will be studied in finite fields. In particular, in Part I of the series we will prove the necessary character sum estimates of independent interest some of which generalize earlier results.     

A generalized variant of the deteriorated PSS preconditioner for nonsymmetric saddle point problems

Based on the variant of the deteriorated positive-definite and skew-Hermitian splitting (VDPSS) preconditioner developed by Zhang and Gu (BIT Numer. Math. 56:587–604, 2016), a generalized VDPSS (GVDPSS) preconditioner is established in this paper by replacing the parameter α in (2,2)-block of the VDPSS preconditioner by another parameter β. This preconditioner can also be viewed as a generalized form of the VDPSS preconditioner and the new relaxed HSS (NRHSS) preconditioner which has been exhibited by Salkuyeh and Masoudi (Numer. Algorithms, 2016). The convergence properties of the GVDPSS iteration method are derived. Meanwhile, the distribution of eigenvalues and the forms of the eigenvectors of the preconditioned matrix are analyzed in detail. We also study the upper bounds on the degree of the minimum polynomial of the preconditioned matrix. Numerical experiments are implemented to illustrate the effectiveness of the GVDPSS preconditioner and verify that the GVDPSS preconditioned generalized minimal residual method is superior to the DPSS, relaxed DPSS, SIMPLE-like, NRHSS, and VDPSS preconditioned ones for solving saddle point problems in terms of the iterations and computational times.     

Acute perturbation of Drazin inverse and oblique projectors

For an n×n complex matrix A with ind(A) = r; let A^D and A^π = I–AA^D be respectively the Drazin inverse and the eigenprojection corresponding to the eigenvalue 0 of A: For an n×n complex singular matrix B with ind(B) = s, it is said to be a stable perturbation of A, if I–(B^π–A^π)² is nonsingular, equivalently, if the matrix B satisfies the condition \(\mathcal{R}(B^s)\cap\mathcal{N}(A^r)=\left\{0\right\}\) and \(\mathcal{N}(B^s)\cap\mathcal{R}(A^r)=\left\{0\right\}\), introduced by Castro-González, Robles, and Vélez-Cerrada. In this paper, we call B an acute perturbation of A with respect to the Drazin inverse if the spectral radius ρ(B^π–A^π) < 1: We present a perturbation analysis and give suffcient and necessary conditions for a perturbation of a square matrix being acute with respect to the matrix Drazin inverse. Also, we generalize our perturbation analysis to oblique projectors. In our analysis, the spectral radius, instead of the usual spectral norm, is used. Our results include the previous results on the Drazin inverse and the group inverse as special cases and are consistent with the previous work on the spectral projections and the Moore-Penrose inverse.     

BTTB preconditioners for BTTB systems

In this paper, we consider solving the BTTB system \({\cal T}_{m,n}[f] {\bf{x}} = {\bf{b}}\) by the preconditioned conjugate gradient (PCG) method, where \({\cal T}_{m,n}[f]\) denotes the m × m block Toeplitz matrix with n × n Toeplitz blocks (BTTB) generated by a (2π, 2π)-periodic continuous function f(x, y). We propose using the BTTB matrix \({\cal T}_{m,n}[1/f]\) to precondition the BTTB system and prove that only O(m)?+?O(n) eigenvalues of the preconditioned matrix \({\cal T}_{m,n}[1/f] {\cal T}_{m,n}[f]\) are not around 1 under the condition that f(x, y)?>?0. We then approximate 1/f(x, y) by a bivariate trigonometric polynomial, which can be obtained in O(m n log(m n)) operations by using the fast Fourier transform technique. Numerical results show that our BTTB preconditioner is more efficient than block circulant preconditioners.     

Weak-type Estimates and Potential Estimates for Elliptic Equations with Drift Terms

We consider divergence form elliptic equations with a strongly singular drift term ?d i v(A?u)+b??u=μ in a domain \({\Omega } \subset \mathbb {R}^{n}\) (n≥3). We give a weak-type \(L^{1} - L^{n / (n - 2), \infty }\) estimate for a solution to the Dirichlet problem with homogeneous boundary condition. Moreover, we give a two-sided pointwise potential estimate for a weak solution and its applications.     

Estimates for sums of moduli of blocks in trigonometric Fourier series

We consider the following two problems. Problem 1: what conditions on a sequence of finite subsets A _k ? ? and a sequence of functions λ _k : A _k → ? provide the existence of a number C such that any function f ∈ L ₁ satisfies the inequality ‖U _A,Λ(f)‖ _p ≤ C‖f‖₁ and what is the exact constant in this inequality? Here, \(U_{\mathcal{A},\Lambda } \left( f \right)\left( x \right) = \sum\nolimits_{k = 1}^\infty {\left| {\sum\nolimits_{m \in A_k } {\lambda _k \left( m \right)c_m \left( f \right)e^{imx} } } \right|}\) and c _m (f) are Fourier coefficients of the function f ∈ L ₁. Problem 2: what conditions on a sequence of finite subsets A _k ? ? guarantee that the function \(\sum\nolimits_{k = 1}^\infty {\left| {\sum\nolimits_{m \in A_k } {c_m \left( h \right)e^{imx} } } \right|}\) belongs to L _p for every function h of bounded variation?     

Globally convergent Jacobi methods for positive definite matrix pairs

The paper derives and investigates the Jacobi methods for the generalized eigenvalue problem A x = λ B x, where A is a symmetric and B is a symmetric positive definite matrix. The methods first “normalize” B to have the unit diagonal and then maintain that property during the iterative process. The global convergence is proved for all such methods. That result is obtained for the large class of generalized serial strategies from Hari and Begovi? Kova? (Trans. Numer. Anal. (ETNA) 47, 107–147, 2017). Preliminary numerical tests confirm a high relative accuracy of some of those methods, provided that both matrices are positive definite and the spectral condition numbers of Δ _A AΔ _A and Δ _B BΔ _B are small, for some nonsingular diagonal matrices Δ _A and Δ _B .     

<Emphasis Type="Italic">θ</Emphasis>-Pairs for 2-maximal subgroups of finite groups

Let H, A and B be subgroups of a group G. We call the pair (A, B) a θ-pair for H in G if: (i) \({\langle H, A\rangle=G}\) and B = (A ∩ H) _G ; (ii) if A ₁/B is a proper subgroup of A/B and \({{A_1/B \vartriangleleft G/B}}\), then \({G\neq \langle H, A_1\rangle}\). In this paper, we study the θ-pairs for 2-maximal subgroups of a group, which imply a group to be solvable or supersolvable.     

Nonaffine differential-algebraic curves do not exist

The paper outlines why the spectrum of maximal ideals Spec _? A of a countable-dimensional differential ?-algebra A of transcendence degree 1 without zero divisors is locally analytic, which means that for any ?-homomorphism ψ _M: A → ? (M ∈ Spec _? A) and any a ∈ A the Taylor series \(\widetilde {{\psi _M}}{\left( a \right)^{\underline{\underline {def}} }}\sum\limits_{m = 0}^\infty {\psi M\left( {{a^{\left( m \right)}}} \right)} \frac{{{z^m}}}{{m!}}\) has nonzero radius of convergence depending on the element a ∈ A.