An algorithm based on resolvent operators for solving variational inequalities in Hilbert spaces

In this paper, a new monotonicity, M$M$-monotonicity, is introduced, and the resolvent operator of an M$M$-monotone operator is proved to be single valued and Lipschitz continuous. With the help of the resolvent operator, an equivalence between the variational inequality VI(C,F+G)$(C,F+G)$ and the fixed point problem of a nonexpansive mapping is established. A proximal point algorithm is constructed to solve the fixed point problem, which is proved to have a global convergence under the condition that F$F$ in the VI problem is strongly monotone and Lipschitz continuous. Furthermore, a convergent path Newton method, which is based on the assumption that the projection mapping _∏C(⋅)${\prod }_C(\cdot )$ is semismooth, is given for calculating ε$\epsilon$-solutions to the sequence of fixed point problems, enabling the proximal point algorithm to be implementable.     

The approximation characteristic of diagonal matrix in probabilistic setting

In this paper, the approximation characteristic of a diagonal matrix in probabilistic and average case settings is investigated. And the asymptotic degree of the probabilistic linear (n,δ)$(n,\delta )$-width and p$p$-average linear n$n$-width of diagonal matrix M$M$ are determined.     

Stable categories of higher preprojective algebras

We introduce (n+1)$(n+1)$-preprojective algebras of algebras of global dimension n$n$. We show that if an algebra is n$n$-representation-finite then its (n+1)$(n+1)$-preprojective algebra is self-injective. In this situation, we show that the stable module category of the (n+1)$(n+1)$-preprojective algebra is (n+1)$(n+1)$-Calabi–Yau, and, more precisely, it is the (n+1)$(n+1)$-Amiot cluster category of the stable n$n$-Auslander algebra of the original algebra. In particular this stable category contains an (n+1)$(n+1)$-cluster tilting object. We show that even if the (n+1)$(n+1)$-preprojective algebra is not self-injective, under certain assumptions (which are always satisfied for n∈{1,2}$n\in \{1,2\}$) the results above still hold for the stable category of Cohen–Macaulay modules.     

Smale’s point estimate theory for Newton’s method on Lie groups

We introduce the notion of the (one-parameter subgroup) γ$\gamma$-condition for a map f$f$ from a Lie group to its Lie algebra and establish α$\alpha$-theory and γ$\gamma$-theory for Newton’s method for a map f$f$ satisfying this condition. Applications to analytic maps are provided, and Smale’s α$\alpha$-theory and γ$\gamma$-theory are extended and developed. Examples arising from initial value problems on Lie group are presented to illustrate applications of our results.     

A new method for computing Moore–Penrose inverse matrices

The Moore–Penrose inverse of an arbitrary matrix (including singular and rectangular) has many applications in statistics, prediction theory, control system analysis, curve fitting and numerical analysis. In this paper, an algorithm based on the conjugate Gram–Schmidt process and the Moore–Penrose inverse of partitioned matrices is proposed for computing the pseudoinverse of an m×n$m\times n$ real matrix A$A$ with m≥n$m\ge n$ and rank r≤n$r\le n$. Numerical experiments show that the resulting pseudoinverse matrix is reasonably accurate and its computation time is significantly less than that of pseudoinverses obtained by the other methods for large sparse matrices.     

Nonlinear maps preserving Jordan *-products

Let η$\eta$ be a non-zero scalar. In this paper, we investigate a bijective map ?$?$ between two von Neumann algebras, one of which has no central abelian projections, satisfying ?(AB+ηBA^∗)=?(A)?(B)+η?(B)?(A)^∗$?(AB+\eta B{A}^{\ast })=?\left(A\right)?\left(B\right)+\eta ?\left(B\right)?{\left(A\right)}^{\ast }$ for all A,B$A,B$ in the domain. It is showed that ?$?$ is a linear *-isomorphism if η$\eta$ is not real and ?$?$ is a sum of a linear *-isomorphism and a conjugate linear *-isomorphism if η$\eta$ is real.     

Modules satisfying the weak Nakayama property

Let R$R$ be a commutative ring with identity. We will say that an R$R$-module M$M$ satisfies the weak Nakayama property, if IM=M$IM=M$, where I$I$ is an ideal of R$R$, implies that for any x∈M$x\in M$ there exists a∈I$a\in I$ such that (a−1)x=0$(a-1)x=0$. In this paper, we will study modules satisfying the weak Nakayama property. It is proved that if R$R$ is a local ring, then R$R$ is a Max ring if and only if J(R)$J\left(R\right)$, the Jacobson radical of R$R$, is T$T$-nilpotent if and only if every R$R$-module satisfies the weak Nakayama property.     

Some decomposition results for a class of vacation queues

We analyze the MAP/PH/1 vacation system at arbitrary times using the matrix-analytic method, and obtain decomposition results for the R$R$ and G$G$ matrices. The decomposition results reduce the amount of computational effort needed to obtain these matrices. The results for the G$G$ matrix are extended to the BMAP/PH/1 system. We also show that in the case of the Geo/PH/1 and M/PH/1 systems with PH vacations both the G$G$ and R$R$ matrices can be obtained explicitly.     

Cycle-maximal triangle-free graphs

We conjecture that the balanced complete bipartite graph _{K⌊n/2⌋,⌈n/2⌉}$K_{\lfloor n/2\rfloor ,\lceil n/2\rceil }$ contains more cycles than any other n$n$-vertex triangle-free graph, and we make some progress toward proving this. We give equivalent conditions for cycle-maximal triangle-free graphs; show bounds on the numbers of cycles in graphs depending on numbers of vertices and edges, girth, and homomorphisms to small fixed graphs; and use the bounds to show that among regular graphs, the conjecture holds. We also consider graphs that are close to being regular, with the minimum and maximum degrees differing by at most a positive integer k$k$. For k=1$k=1$, we show that any such counterexamples have n≤91$n\le 91$ and are not homomorphic to _C5$C_5$; and for any fixed k$k$ there exists a finite upper bound on the number of vertices in a counterexample. Finally, we describe an algorithm for efficiently computing the matrix permanent (a #P$\#P$-complete problem in general) in a special case used by our bounds.     

New general convergence theory for iterative processes and its applications to Newton–Kantorovich type theorems

Let T:D⊂X→X$T:D\subset X\to X$ be an iteration function in a complete metric space X$X$. In this paper we present some new general complete convergence theorems for the Picard iteration _xn+1=T_xn$x_{n+1}=T{x}_n$ with order of convergence at least r≥1$r\ge 1$. Each of these theorems contains a priori and a posteriori error estimates as well as some other estimates. A central role in the new theory is played by the notions of a function of initial conditions   of T$T$ and a convergence function   of T$T$. We study the convergence of the Picard iteration associated to T$T$ with respect to a function of initial conditions E:D→X$E:D\to X$. The initial conditions in our convergence results utilize only information at the starting point _x0$x_0$. More precisely, the initial conditions are given in the form E(_x0)∈J$E\left(x_0\right)\in J$, where J$J$ is an interval on _R+${\mathbb{R}}_{+}$ containing 0. The new convergence theory is applied to the Newton iteration in Banach spaces. We establish three complete ω$\omega$-versions of the famous semilocal Newton–Kantorovich theorem as well as a complete version of the famous semilocal α$\alpha$-theorem of Smale for analytic functions.     

Necessary and sufficient condition for uniqueness of solution to the first boundary value problem for the diffusion equation in unbounded domains

This paper introduces a notion of regularity of t=-∞$t=-\infty$ for the diffusion (or heat) equation and establishes a necessary and sufficient condition for the existence of a unique bounded solution to the first boundary value problem for the diffusion equation in a general domain Ω⊂R^N+1$\Omega \subset {\mathbb{R}}^{N+1}$ which extends up to t=-∞$t=-\infty$.