Hermite Positive Definite Solution of the Quaternion Matrix Equation Xm + B*XB = C

This paper discusses the necessary and sufficient conditions for the existence of Hermite positive definite solutions of the quaternion matrix equation Xm+ B*XB = C (m > 0) and its iterative solution method. According to the characteristics of the coefficient matrix, a corresponding algebraic equation system is ingeniously constructed, and by discussing the equation system’s solvability, the matrix equation’s existence interval is obtained. Based on the characteristics of the coefficient matrix, some necessary and sufficient conditions for the existence of Hermitian positive definite solutions of the matrix equation are derived. Then, the upper and lower bounds of the positive actual solutions are estimated by using matrix inequalities. Four iteration formats are constructed according to the given conditions and existence intervals, and their convergence is proven. The selection method for the initial matrix is also provided. Finally, using the complexification operator of quaternion matrices, an equivalent iteration on the complex field is established to solve the equation in the Matlab environment. Two numerical examples are used to test the effectiveness and feasibility of the given method. .

Study on the Relation of Definite Integral and Indefinite Integral

Relation of definite integral and indefinite integral was discussed and an important result was gotten. If f(x) is bounded and has primary function, the formal definite integral x s f(t)dt is the indefinite integral of f(x), where x is a self-variable, s is a parameter,~f(x) is a function defined in(-∞, +∞), which comes from f(x) by restriction and extension. In other words, the indefinite integral is a special form of definite integral, its lower integral limit and upper integral limit are all indefinite.

DIAGONALLY COMPENSATED REDUCTION AND MULTISPLITTING OF A SYMMETRIC POSITIVE DEFINITE MATRIX

To solve the symmetric positive definite linear system Ax = b on parallel and vector machines, multisplitting methods are considered. Here the s.p.d. (symmetric positive definite) matrix A need not be assumed in a special form (e.g. the dissection form [11]). The main tool for deriving our methods is the diagonally compensated reduction (cf. [1]). The convergence of such methods is also discussed by using this tool. [WT5,5”HZ]

Thermal Sense Prediction Model for Definite Human Group in Indoor Case

In order to build a prediction model of the indoor thermal comfort for a given human group, the original predicted mean vote （PMV） equation is reconstructed and simplified, the modified PMV equation is named PMVR （PMV for region） , where five variables are needed to be fitted with the dataset of actual thermal sense of a definite human group. As the fitting algorithm, the particle swarm optimization algorithm is used to optimize the solution, and a fixed PMVR can be finally determined. Experiment results indicate that for a definite human group, PMVR is more accurate on the prediction of thermal sense compared with some other models.

ON RUBIN'S HARMONIC ANALYSIS AND ITS RELATED POSITIVE DEFINITE FUNCTIONS

In this paper,a new formulation of the Rubin’s q-translation is given,which leads to a reliable q-harmonic analysis.Next,related q-positive definite functions are introduced and studied,and a Bochner’s theorem is proved.

THE PARALLEL MULTISPLITTING METHOD FOR CONSISTENT SYMMETRIC POSITIVE(SEMI-)DEFINITE SYSTEMS

Main resultsTheorem 1 Let A be an n×n symmetric positive semidefinite matrix and let

Two Structure-Preserving-Doubling Like Algorithms to Solve the Positive Definite Solution of the Equation X-A^(H)X^(-1)A=Q

In this paper,we study the nonlinear matrix equation X-A^(H)X^(-1)A=Q,where A,Q∈C^(n×n),Q is a Hermitian positive definite matrix and X∈C^(n×n)is an unknown matrix.We prove that the equation always has a unique Hermitian positive definite solution.We present two structure-preserving-doubling like algorithms to find the Hermitian positive definite solution of the equation,and the convergence theories are established.Finally,we show the effectiveness of the algorithms by numerical experiments.

DEFINITE PURSUITS IN AN INDEFINITE ERA

Today’s world has witnessed economic changes,political upheavals and restructuring of international relations.Europe since 2008 has experienced many problems including those from Greek debt crisis to euro zone crisis,from ownership of Crimea to Ukraine crisis,from long-lasting illegal migra-

SEMI-DEFINITE RELAXATION ALGORITHM OF MULTIPLE KNAPSACK PROBLEM

The multiple knapsack problem denoted by MKP (B,S,m,n) can be defined as fol- lows.A set B of n items and a set Sof m knapsacks are given such thateach item j has a profit pjand weightwj,and each knapsack i has a capacity Ci.The goal is to find a subset of items of maximum profit such that they have a feasible packing in the knapsacks.MKP(B,S,m,n) is strongly NP- Complete and no polynomial- time approximation algorithm can have an approxima- tion ratio better than0 .5 .In the last ten years,semi- definite programming has been empolyed to solve some combinatorial problems successfully.This paper firstly presents a semi- definite re- laxation algorithm (MKPS) for MKP (B,S,m,n) .It is proved that MKPS have a approxima- tion ratio better than 0 .5 for a subclass of MKP (B,S,m,n) with n≤ 1 0 0 ,m≤ 5 and maxnj=1{ wj} minmi=1{ Ci} ≤ 2 3 .

A Matrix Inequality for the Inversions of the Restrictions of a Positive Definite Hermitian Matrix

We exploit the theory of reproducing kernels to deduce a matrix inequality for the inverse of the restriction of a positive definite Hermitian matrix.

Robust Design Rule with Definite Purpose Character Based on Fuzzy Probability and Study of its Characteristics

The design target with definite purpose character of product quality wasdescribed in a real fuzzy number ( named fuzzy target for short in this paper), and its membershipjunctions in common use were given. According to the fuzzy probability theory and the robust designprinciple, the robust design rule based on fuzzy probability (named fuzzy robust design rule forshort) was put forward and its validity and practicability were analyzed and tested with a designexample. The theoretical analysis and the design examples make clear that, while the fuzzy robustdesign rule was used, the fine design effect can be obtained and the fuzzy robust design rule can bevery suitable for the choice of the membership function of the fuzzy target; so it has a particularadvantage.

Indefinite metacavities coupled to a mirror:bound states in the continuum with anomalous resonance scaling

Indefinite metacavities(IMCs)made of hyperbolic metamaterials show great advantages in terms of extremely small mode volume due to large wave vectors endowed by the unique hyperbolic dispersion.However,quality(Q)factors of IMCs are limited by Ohmic loss of metals and radiative loss of leaked waves.Despite the fact that Ohmic loss of metals is inevitable in IMCs,the radiative loss can be further suppressed by leakage engineering.Here we propose a mirror coupled IMC structure which is able to operate at Fabry–Pérot bound states in the continuum(BICs)while the hyperbolic nature of IMCs is retained.At the BIC point,the radiative loss of magnetic dipolar cavity modes in IMCs is completely absent,resulting in a considerably increased Q factor(>90).Deviating from the BIC point,perfect absorption bands(>0.99)along with a strong near-field intensity enhancement(>1.8×10^(4))appear when the condition of critical coupling is almost fulfilled.The proposed BICs are robust to the geometry and material composition of IMCs and anomalous scaling law of resonance is verified during the tuning of optical responses.We also demonstrate that the Purcell effect of the structure can be significantly improved under BIC and quasi-BIC regimes due to the further enhanced Q factor to mode volume ratio.Our results provide a new train of thought to design ultra-small optical nanocavities that may find many applications benefitting from strong light–matter interactions.

Positive definiteness of real quadratic forms resulting from the variable-step L1-type approximations of convolution operators

The positive definiteness of real quadratic forms with convolution structures plays an important rolein stability analysis for time-stepping schemes for nonlocal operators. In this work, we present a novel analysistool to handle discrete convolution kernels resulting from variable-step approximations for convolution operators.More precisely, for a class of discrete convolution kernels relevant to variable-step L1-type time discretizations, weshow that the associated quadratic form is positive definite under some easy-to-check algebraic conditions. Ourproof is based on an elementary constructing strategy by using the properties of discrete orthogonal convolutionkernels and discrete complementary convolution kernels. To our knowledge, this is the first general result onsimple algebraic conditions for the positive definiteness of variable-step discrete convolution kernels. Using theunified theory, we obtain the stability for some simple nonuniform time-stepping schemes straightforwardly.

A SHIFT-SPLITTING PRECONDITIONER FOR NON-HERMITIAN POSITIVE DEFINITE MATRICES

A shift splitting concept is introduced and, correspondingly, a shift-splitting iteration scheme and a shift-splitting preconditioner are presented, for solving the large sparse system of linear equations of which the coefficient matrix is an ill-conditioned non-Hermitian positive definite matrix. The convergence property of the shift-splitting iteration method and the eigenvalue distribution of the shift-splitting preconditioned matrix are discussed in depth, and the best possible choice of the shift is investigated in detail. Numerical computations show that the shift-splitting preconditioner can induce accurate, robust and effective preconditioned Krylov subspace iteration methods for solving the large sparse non-Hermitian positive definite systems of linear equations.

ON HERMITIAN POSITIVE DEFINITE SOLUTION OF NONLINEAR MATRIX EQUATION X＋A^＊X^-2A=Q

Based on the fixed-point theory, we study the existence and the uniqueness of the maximal Hermitian positive definite solution of the nonlinear matrix equation X＋A^＊X^-2A=Q, where Q is a square Hermitian positive definite matrix and A＊ is the conjugate transpose of the matrix A. We also demonstrate some essential properties and analyze the sensitivity of this solution. In addition, we derive computable error bounds about the approximations to the maximal Hermitian positive definite solution of the nonlinear matrix equation X＋A^＊X^-2A=Q. At last, we further generalize these results to the nonlinear matrix equation X＋A^＊X^-nA=Q, where n≥2 is a given positive integer.

Superconvergence Analysis of Splitting Positive Definite Nonconforming Mixed Finite Element Method for Pseudo-hyperbolic Equations

In this paper, a new splitting positive definite nonconforming mixed finite element method is proposed for pseudo-hyperbolic equations, in which a quasi-Wilson quadrilateral element is used for the flux p, and the bilinear element is used for u. Superconvergence results in ｜｜·｜｜div,h norm for p and optimal error estimates in L2 norm for u are derived for both semi-discrete and fully discrete schemes under almost uniform meshes.

The α-Geometric Structures on Manifold of Positive Definite Hermite Matrices

Geometric structures of a manifold of positive definite Hermite matrices are considered from the viewpoint of information geometry.A Riemannian metric is defined and dual α-connections are introduced.Then the fact that the manifold is ±l-flat is shown.Moreover,the divergence of two points on the manifold is given through dual potential functions.Furthermore,the optimal approximation of a point onto the submanifold is gotten.Finally,some simulations are given to illustrate our results.

ON HERMITIAN POSITIVE DEFINITE SOLUTIONS OF MATRIX EQUATION X-A^＊X^-2 A=I

The Hermitian positive definite solutions of the matrix equation X-A^＊X^-2 A=I are studied. A theorem for existence of solutions is given for every complex matrix A. A solution in case A is normal is given. The basic fixed point iterations for the equation are discussed in detail. Some convergence conditions of the basic fixed point iterations to approximate the solutions to the equation are given.

ON THE CONVERGENCE OF THE RELAXATION METHODS FOR POSITIVE DEFINITE LINEAR SYSTEMS

We establish the convergence theories of the symmetric relaxation methods for the system of linear equations with symmetric positive definite coefficient matrix, and more generally, those of the unsymmetric relaxation methods for the system of linear equations with positive definite matrix.

LIMIT CYCLES FOR A CLASS OF DIFFERENTIAL SYSTEM WITH POSITIVE DEFINITE POLYNOMIAL

In this paper we consider a class of differential systems with positive definite polynomial having exactly one and two limit cycles. Such a system is more extensive than paper [1,2].