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

Comparative efficacy and safety between endoscopic submucosal dissection,surgery and definitive chemoradiotherapy in patients with cT1N0M0 esophageal cancer

BACKGROUND Endoscopic submucosal dissection(ESD)and surgical resection are the standard of care for cT1N0M0 esophageal cancer(EC),whereas definitive chemoradiotherapy(d-CRT)is a treatment option.Nevertheless,the comparative efficiency and safety of ESD,surgery and d-CRT for cT1N0M0 EC remain unclear.AIM To compare the efficiency and safety of ESD,surgery and d-CRT for cT1N0M0 EC.METHODS We retrospectively analyzed the hospitalized data of a total of 472 consecutive patients with cT1N0M0 EC treated at Sun Yat-sen University Cancer center between 2017-2019 and followed up until October 30th,2022.We analyzed demographic,medical recorded,histopathologic characteristics,imaging and endoscopic,and follow-up data.The Kaplan-Meier method and Cox proportional hazards modeling were used to analyze the difference of survival outcome by treatments.Inverse probability of treatment weighting(IPTW)was used to minimize potential confounding factors.RESULTS We retrospectively analyzed patients who underwent ESD(n=99)or surgery(n=220)or d-CRT(n=16)at the Sun Yat-sen University Cancer Center from 2017 to 2019.The median follow-up time for the ESD group,the surgery group,and the d-CRT group was 42.0 mo(95%CI:35.0-60.2),45.0 mo(95%CI:34.0-61.75)and 32.5 mo(95%CI:28.3-40.0),respectively.After adjusting for background factors using IPTW,the highest 3-year overall survival(OS)rate and 3-year recurrence-free survival(RFS)rate were observed in the ESD group(3-year OS:99.7% and 94.7% and 79.1%;and 3-year RFS:98.3%,87.4% and 79.1%,in the ESD,surgical,and d-CRT groups,respectively).There was no difference of severe complications occurring between the three groups(P≥0.05).Multivariate analysis showed that treatment method,histology and depth of infiltration were independently associated with OS and RFS.CONCLUSION For cT1N0M0 EC,ESD had better long-term survival and lower hospitalization costs than those who underwent d-CRT and surgery,with a similar rate of severe complications occurring.

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.

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.

Spectrum of a class of fourth order left-definite differential operators

The spectrum of a class of fourth order left-definite differential operators is studied. By using the theory of indefinite differential operators in Krein space and the relationship between left-definite and right-definite operators, the following conclusions are obtained： if a fourth order differential operator with a self-adjoint boundary condition that is left-definite and right-indefinite, then all its eigenvalues are real, and there exist countably infinitely many positive and negative eigenvalues which are unbounded from below and above, have no finite cluster point and can be indexed to satisfy the inequality …≤λ-2≤λ-1≤λ-0〈0〈λ0≤λ1≤λ2≤…

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.

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 .

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.

Optimizing of large-number-patterns string matching algorithms based on definite-state automata

Because the small CACHE size of computers, the scanning speed of DFA based multi-pattern string-matching algorithms slows down rapidly especially when the number of patterns is very large. For solving such problems, we cut down the scanning time of those algorithms (i.e. DFA based) by rearranging the states table and shrinking the DFA alphabet size. Both the methods can decrease the probability of large-scale random memory accessing and increase the probability of continuously memory accessing. Then the hitting rate of the CACHE is increased and the searching time of on the DFA is reduced. Shrinking the alphabet size of the DFA also reduces the storage complication. The AC++algorithm, by optimizing the Aho-Corasick (i.e. AC) algorithm using such methods, proves the theoretical analysis. And the experimentation results show that the scanning time of AC++and the storage occupied is better than that of AC in most cases and the result is much attractive when the number of patterns is very large. Because DFA is a widely used base algorithm in may string matching algorithms, such as DAWG, SBOM etc., the optimizing method discussed is significant in practice.

The Metapositive Definite Self－Conjugate Solution of the Matrix Equation AXB＝C over a Skew Field

ＴｈｅＭｅｔａｐｏｓｉｔｉｖｅＤｅｆｉｎｉｔｅＳｅｌｆ－ＣｏｎｊｕｇａｔｅＳｏｌｕｔｉｏｎｏｆｔｈｅＭａｔｒｉｘＥｑｕａｔｉｏｎＡＸＢ＝Ｃｏｖｅｒ ａ Ｓｋｅｗ ＦｉｅｌｄＷａｎｇＱｉｎｇｗｅｎ（王卿文）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈ．，Ｃｈａｎ...

Positive-Definite Sparse Precision Matrix Estimation

The positive-definiteness and sparsity are the most important property of high-dimensional precision matrices. To better achieve those property, this paper uses a sparse lasso penalized D-trace loss under the positive-definiteness constraint to estimate high-dimensional precision matrices. This paper derives an efficient accelerated gradient method to solve the challenging optimization problem and establish its converges rate as . The numerical simulations illustrated our method have competitive advantage than other methods.

A NOTE ON COMPARISON THEOREM OF TWO-STAGE ITERATIVE METHOD FOR HERMITIAN POSITIVE DEFINITE LINEAR SYSTEMS

We discuss two-stage iterative methods for the solution of linear systemAx = b, and give a new proof of the comparison theorems of two-stage iterative methodfor an Hermitian positive definite matrix. Meanwhile, we put forward two new versionsof well known comparison theorem and apply them to some examples.

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

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.

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-

Inequalities Among Eigenvalues of Left-definite Sturm-Liouville Problems

在权利明确的 SturmLiouville problems.In 的特征值之中有著名不平等这份报纸，我们与分开并且联合的边界条件学习左明确的常规自我伴随 Sturm-Liouville 问题。为任何固定方程，我们为不同边界条件在特征值之中建立不平等的一个序列，它是理论、计算的重要性。

Siemens Definition AS128 CT维修5例

介绍了Siemens Definition AS128 CT的硬件构成,分析并总结了该设备在日常使用中出现的检查床水平移动后机架掉电、图像重建系统(image reconstruction system,IRS)计算机硬盘故障、开机时F1开关脱开、“Exam”按钮灰化等故障产生的原因及维修思路,为临床工程技术人员排除相似故障提供了参考。

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.