矩阵方程AXB+CYD＝E的对称极小范数最小二乘解

对于任意给定的矩阵A∈Rm×n,B∈Rn×s,C∈Rm×k,D∈Rk×s,E∈Rm×s,本文利用矩阵的Kmnecker积和Moore-Penrose广义逆,研究矩阵方程AXB CYD=E的对称极小范数最小二乘解,得到了解的表达式．并由此给出了矩阵方程AXB=C的双对称极小范数最小二乘解的表达式．此外,我们还给出了求矩阵方程AXB=C的双对称极小范数最小二乘解的数值算法和数值例子．     

Breather molecules and localized interaction solutions in the (2+1)-dimensional BLMP equation

The (2+1)-dimensional Boiti–Leon–Manna–Pempinelli (BLMP) equation is an important integrable model. In this paper, we obtain the breather molecule, the breather-soliton molecule and some localized interaction solutions to the BLMP equation. In particular, by employing a compound method consisting of the velocity resonance, partial module resonance and degeneration of the breather techniques, we derive some interesting hybrid solutions mixed by a breather-soliton molecule/breather molecule and a lump, as well as a bell-shaped soliton and lump. Due to the lack of the long wave limit, it is the first time using the compound degeneration method to construct the hybrid solutions involving a lump. The dynamical behaviors and mathematical features of the solutions are analyzed theoretically and graphically. The method introduced can be effectively used to study the wave solutions of other nonlinear partial differential equations.     

The D'Alembert type waves and the soliton molecules in a (2+1)-dimensional Kadomtsev-Petviashvili with its hierarchy equation

For a one (2+1)-dimensional combined Kadomtsev-Petviashvili with its hierarchy equation, the missing D'Alembert type solution is derived first through the traveling wave transformation which contains several special kink molecule structures. Further, after introducing the Bäcklund transformation and an auxiliary variable, the N-soliton solution which contains some soliton molecules for this equation, is presented through its Hirota bilinear form. The concrete molecules including line solitons, breathers and a lump as well as several interactions of their hybrid are shown with the aid of special conditions and parameters. All these dynamical features are demonstrated through the different figures.     

Muirhead-Rado inequality for compact groups

Muirhead’s majorization inequality was extended by Rado to the case of arbitrary permutation groups. We further generalize this inequality to compact groups and their linear representations over the reals. We characterize saturation of the inequality, and describe the saturation condition in detail for the case of actions on Hermitian operators. Supported in part by the National Science Foundation and the Center for the Mathematics of Information.     

Symmetric nonnegative realizability via partitioned majorization

A sufficient condition for symmetric nonnegative realizability of a spectrum is given in terms of (weak) majorization of a partition of the negative eigenvalues by a selection of the positive eigenvalues. If there are more than two positive eigenvalues, an additional condition, besides majorization, is needed on the partition. This generalizes observations of Suleǐmanova and Loewy about the cases of one and two positive eigenvalues, respectively. It may be used to provide insight into realizability of 5-element spectra and beyond.     

Accelerating electromagnetic magic field from the C-metric

Various aspects of the C-metric representing two rotating charged black holes accelerated in opposite directions are summarized and its limits are considered. A particular attention is paid to the special-relativistic limit in which the electromagnetic field becomes the “magic field” of two oppositely accelerated rotating charged relativistic discs. When the acceleration vanishes the usual electromagnetic magic field of the Kerr–Newman black hole with gravitational constant set to zero arises. Properties of the accelerated discs and the fields produced are studied and illustrated graphically. The charges at the rim of the accelerated discs move along spiral trajectories with the speed of light. If the magic field has some deeper connection with the field of the Dirac electron, as is sometimes conjectured because of the same gyromagnetic ratio, the “accelerating magic field” represents the electromagnetic field of a uniformly accelerated spinning electron. It generalizes the classical Born’s solution for two uniformly accelerated monopole charges.     

On the cut‐off phenomenon for the transitivity of randomly generated subgroups

Consider K ≥ 2 independent copies of the random walk on the symmetric group S_N starting from the identity and generated by the products of either independent uniform transpositions or independent uniform neighbor transpositions. At any time $n\in \mathbb{N}$, let G_n be the subgroup of S_N generated by the K positions of the chains. In the uniform transposition model, we prove that there is a cut‐off phenomenon at time N ln(N)/(2K) for the non‐existence of fixed point of G_n and for the transitivity of G_n, thus showing that these properties occur before the chains have reached equilibrium. In the uniform neighbor transposition model, a transition for the non‐existence of a fixed point of G_n appears at time of order $N^{1+\frac{2}{K}}$ (at least for K ≥ 3), but there is no cut‐off phenomenon. In the latter model, we recover a cut‐off phenomenon for the non‐existence of a fixed point at a time proportional to N by allowing the number K to be proportional to ln(N). The main tools of the proofs are spectral analysis and coupling techniques. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2012     

Path-following interior point algorithms for the Cartesian <Emphasis Type="Italic">P</Emphasis><Subscript>*</Subscript>(κ)-LCP over symmetric cones

In this paper, we establish a theoretical framework of path-following interior point algorithms for the linear complementarity problems over symmetric cones (SCLCP) with the Cartesian P _*(κ)-property, a weaker condition than the monotonicity. Based on the Nesterov-Todd, xy and yx directions employed as commutative search directions for semidefinite programming, we extend the variants of the short-, semilong-, and long-step path-following algorithms for symmetric conic linear programming proposed by Schmieta and Alizadeh to the Cartesian P _*(κ)-SCLCP, and particularly show the global convergence and the iteration complexities of the proposed algorithms. This work was supported by National Natural Science Foundation of China (Grant Nos. 10671010, 70841008)     

On an open problem of Sankaranarayanan

Let λ(n) be the n-th normalized Fourier coeficient of a holomorphic Hecke eigenform f(z) ∈ Sk(Γ) for the full modular group.In one of his papers,Sankaranarayanan mentioned that it is an open problem to give a non-trivial estimate for the sum of λ(n) over cubes,i.e.n x λ(n3).In this paper,we are able to use the analytic properties of symmetric power L-functions to solve his problem.More precisely,we prove that Σn≤zλ(n3) x(3/4 +ε),Σn≤zλ(n4) x(97+ε).     

Systematic Study of Selected Diagonalization Methods for Configuration Interaction Matrices

Several modifications to the Davidson algorithm are systematically explored to establish their performance for an assortment of configuration interaction (CI) computations. The combination of a generalized Davidson method, a periodic two‐vector subspace collapse, and a blocked Davidson approach for multiple roots is determined to retain the convergence characteristics of the full subspace method. This approach permits the efficient computation of wave functions for large‐scale CI matrices by eliminating the need to ever store more than three expansion vectors ( b _i) and associated matrix‐vector products ( σ _i), thereby dramatically reducing the I/O requirements relative to the full subspace scheme. The minimal‐storage, single‐vector method of Olsen is found to be a reasonable alternative for obtaining energies of well‐behaved systems to within μE_h accuracy, although it typically requires around 50% more iterations and at times is too inefficient to yield high accuracy (ca. 10^?10 E_h) for very large CI problems. Several approximations to the diagonal elements of the CI Hamiltonian matrix are found to allow simple on‐the‐fly computation of the preconditioning matrix, to maintain the spin symmetry of the determinant‐based wave function, and to preserve the convergence characteristics of the diagonalization procedure. © 2001 John Wiley & Sons, Inc. J Comput Chem 22: 1574–1589, 2001