POSITIVE DEFINITE KERNEL IN SUPPORT VECTOR MACHINE(SVM)

The relationship among Mercer kernel, reproducing kernel and positive definite kernel in support vector machine （SVM） is proved and their roles in SVM are discussed. The quadratic form of the kernel matrix is used to confirm the positive definiteness and their construction. Based on the Bochner theorem, some translation invariant kernels are checked in their Fourier domain. Some rotation invariant radial kernels are inspected according to the Schoenberg theorem. Finally, the construction of discrete scaling and wavelet kernels, the kernel selection and the kernel parameter learning are discussed.

SYMMETRIC POSITIVE DEFINITE SOLUTIONS OF MATRIX EQUATIONS (AX,XB)=(C,D) AND AXB=C

The symmetric positive definite solutions of matrix equations (AX,XB)=(C,D) and AXB=C are considered in this paper. Necessary and sufficient conditions for the matrix equations to have symmetric positive definite solutions are derived using the singular value and the generalized singular value decompositions. The expressions for the general symmetric positive definite solutions are given when certain conditions hold.

The Classification of Positive Definite Unimodular Lattices Over Z[(1+21^(1/2))/2]

In this paper, the author applies adjacent lattice method and Siegel mass formula to determine the classes of positive definite unimodular lattices of rank 4 over Z , and obtains that the class number of unit genus gen( I 4 ) is nine and the class number of even unimodular lattices is three, and also gives the representative lattices of each class.

The Classification of Positive Definite Unimodular Lattices Over Z[(1+211/2)/2]

In this paper, the author applies adjacent lattice method and Siegel mass formula to determine the classes of positive definite unimodular lattices of rank 4 over Z , and obtains that the class number of unit genus gen( I 4 ) is nine and the class number of even unimodular lattices is three, and also gives the representative lattices of each class.

A Remark on the Positive Definite Problem of a Binary Quartic Form

In this paper,we discussed the positive definite problem of binary quartic forms and obtained a necessary and sufficient conditions.

Some new bound estimates of the Hermitian positive definite solutions of the nonlinear matrix equation X^s+ A~*X^(-t) A = Q

The range and existence conditions of the Hermitian positive definite solutions of nonlinear matrix equations Xs+A*X-tA=Q are studied, where A is an n×n non-singular complex matrix and Q is an n×n Hermitian positive definite matrix and parameters s,t>0. Based on the matrix geometry theory, relevant matrix inequality and linear algebra technology, according to the different value ranges of the parameters s,t, the existence intervals of the Hermitian positive definite solution and the necessary conditions for equation solvability are presented, respectively. Comparing the existing correlation results, the proposed upper and lower bounds of the Hermitian positive definite solution are more accurate and applicable.

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.

Completely Positive Definite Maps Over Topological-algebras

In this paper, we discuss completely positive definite maps over topological algebras. A Schwarz type inequality for n-positive definite maps, and the Stinespring representation theorem for completely positive definite maps over topological algebras are given.

Some Notes on the Positive Definite Problem of a Binary Quartic Form

In this paper, we discuss the positive definite problem of a binary quartic form and obtain a necessary and sufficient condition. In addition we give two examples to show that there are some errors in the paper [1].

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.

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. .

Some Opinions on the Paper “Several Inequalities of Matrix Traces”

In this paper,we find some mistakes in the paper “Several Inequalities of Matrix Traces” which was published in Chinese Quarterly Journal of Mathematics,Vol.10,No.2.

A Two-Step Shape-Preserving Advection Scheme

This paper proposes a new two-step non-oscillatory shape-preserving positive definite finite difference advection transport scheme, which merges the advantages of small dispersion error in the simple first-order upstream scheme and small dissipation error in the simple second-order Lax-Wendroff scheme and is completely different from most of present positive definite advection schemes which are based on revising the upstream scheme results. The proposed scheme is much less time consuming than present shape-preserving or non-oscillatory advection transport schemes and produces results which are comparable to the results obtained from the present more complicated schemes. Elementary tests are also presented to examine the behavior of the scheme.

Construction and Analysis of Structured Preconditioners for Block Two-by-Two Matrices

For the large sparse block two-by-two real nonsingular matrices, we establish a general framework of structured preconditioners through matrix transformation and matrix approximations. For the specific versions such as modified block Jacobi-type, modified block Gauss-Seidel-type, and modified block unsymmetric (symmetric) Gauss-Seidel-type preconditioners, we precisely describe their concrete expressions and deliberately analyze eigenvalue distributions and positive definiteness of the preconditioned matrices. Also, we show that when these structured preconditioners are employed to precondition the Krylov subspace methods such as GMRES and restarted GMRES, fast and effective iteration solvers can be obtained for the large sparse systems of linear equations with block two-by-two coefficient matrices. In particular, these structured preconditioners can lead to high-quality preconditioning matrices for some typical matrices from the real-world applications.

A POD REDUCED-ORDER SPDMFE EXTRAPOLATING ALGORITHM FOR HYPERBOLIC EQUATIONS

In this article, a proper orthogonal decomposition （POD） method is used to study a classical splitting positive definite mixed finite element （SPDMFE） formulation for second- order hyperbolic equations. A POD reduced-order SPDMFE extrapolating algorithm with lower dimensions and sufficiently high accuracy is established for second-order hyperbolic equations. The error estimates between the classical SPDMFE solutions and the reduced-order SPDMFE solutions obtained from the POD reduced-order SPDMFE extrapolating algorithm are provided. The implementation for solving the POD reduced-order SPDMFE extrapolating algorithm is given. Some numerical experiments are presented illustrating that the results of numerical computation are consistent with theoretical conclusions, thus validating that the POD reduced-order SPDMFE extrapolating algorithm is feasible and efficient for solving second-order hyperbolic equations.

Necessary and Sufficient Condition for Generalized Diagonal Dominance Matrices

In the paper,a necessary and sufficeent condition for generalized diagonal domiance matrices is given.Further, the relations among all generalized positive definite matrices are shown, also,some flaws and mistakes in the references are corrected.

A MATRIX EQUATION FROM AN INVERSE PROBLEM OF VIBRATION THEORY

The symmetric,positive semidefinite,and positive definite real solutions of the matrix equation XA=YAD from an inverse problem of vibration theory are considered.When D=T the necessary and sufficient conditions for the existence of such solutions and their general forms are derived.

ON THE APPROXIMATE COMPUTATION OF EXTREME EIGENVALUES AND THE CONDITION NUMBER OF NONSINGULAR MATRICES

From the formulas of the conjugate gradient, a similarity between a symmetric positive definite (SPD) matrix A and a tridiagonal matrix B is obtained. The elements of the matrix B are determined by the parameters of the conjugate gradient. The computation of eigenvalues of A is then reduced to the case of the tridiagonal matrix B. The approximation of extreme eigenvalues of A can be obtained as a 'by-product' in the computation of the conjugate gradient if a computational cost of O(s) arithmetic operations is added, where s is the number of iterations This computational cost is negligible compared with the conjugate gradient. If the matrix A is not SPD, the approximation of the condition number of A can be obtained from the computation of the conjugate gradient on AT A. Numerical results show that this is a convenient and highly efficient method for computing extreme eigenvalues and the condition number of nonsingular matrices.

On the Nonlinear Matrix Equation X＋A~＊f_1（X）A＋B~＊f_2（X）B=Q

In this paper, nonlinear matrix equations of the form X ＋ A＊f1 （X）A ＋ B＊f2 （X）B = Q are discussed. Some necessary and sufficient conditions for the existence of solutions for this equation are derived. It is shown that under some conditions this equation has a unique solution, and an iterative method is proposed to obtain this unique solution. Finally, a numerical example is given to identify the efficiency of the results obtained.

奇异鞍点问题中广义位移分裂迭代方法的半收敛性分析

Recently,some authors(Shen and Shi,2016)studied the generalized shiftsplitting(GSS)iteration method for singular saddle point problem with nonsymmetric positive definite(1,1)-block and symmetric positive semidefinite(2,2)-block.In this paper,we further apply the GSS iteration method to solve singular saddle point problem with nonsymmetric positive semidefinite(1,1)-block and symmetric positive semidefinite(2,2)-block,prove the semi-convergence of the GSS iteration method and analyze the spectral properties of the corresponding preconditioned matrix.Numerical experiment is given to indicate that the GSS iteration method with appropriate iteration parameters is effective and competitive for practical use.