Some iterative algorithms for positive definite solution to nonlinear matrix equations

This paper is concerned with the unique positive definite solution to a system of nonlinear matrix equations $X-A^*\bar{Y}^{-1}A=I_n$ and $Y-B^*\bar{X}^{-1}B=I_n$, where $A,B\in\mathbb{C}^{n\times n}$ are given matrices. Based on the special structure of the system of nonlinear matrix equations, the system can be equivalently reformulated as $V-C^*\bar{V}^{-1}C=I_{2n}$. Moreover, by means of Sherman-Moorison-Woodbury formula, we derive the relationship between the solutions of $V-C^*\bar{V}^{-1}C =I_{2n}$ and the well studied standard nonlinear matrix equation $Z+D^*Z^{-1}D=Q$, where $D$, $Q$ are uniquely determined by $C$. Then, we present a structure-preserving doubling algorithm and two modified structure-preserving doubling algorithms to compute the positive definite solution of the system. Furthermore, cyclic reduction algorithm and two modified cyclic reduction algorithms for the positive definite solution of the system are proposed. Finally, some numerical examples are presented to illustrate the efficiency of the theoretical results and the behavior of the considered algorithms.     

On positive definite solution of a nonlinear matrix equation

In this paper, some necessary and sufficient conditions for the existence of the positive definite solutions for the matrix equation X + A^*X^?αA = Q with α ∈ (0, ∞) are given. Iterative methods to obtain the positive definite solutions are established and the rates of convergence of the considered methods are obtained. Copyright © 2006 John Wiley & Sons, Ltd.     

Iterative solution of two matrix equations

We study iterative methods for finding the maximal Hermitian positive definite solutions of the matrix equations and , where is Hermitian positive definite. General convergence results are given for the basic fixed point iteration for both equations. Newton's method and inversion free variants of the basic fixed point iteration are discussed in some detail for the first equation. Numerical results are reported to illustrate the convergence behaviour of various algorithms.

     

The common bisymmetric nonnegative definite solutions with extreme ranks and inertias to a pair of matrix equations

We in this paper consider the bisymmetric nonnegative definite solution with extremal ranks and inertias to a system of quaternion matrix equations AX = C, XB = D. We derive the extremal ranks and inertias of the common bisymmetric nonnegative definite solution to the system. The general expressions of the bisymmetric nonnegative definite solution with extremal ranks and inertias to the system mentioned above are also presented. In addition, we give a numerical example to illustrate the results of this paper.     

On the Hermitian positive defnite solution of the nonlinear matrix equation X + A*X −1 A + B*X −1 B = I

In this paper, we study the matrix equation X + A*X ⁻¹ A + B*X ⁻¹ B = I, where A, B are square matrices, and obtain some conditions for the existence of the positive definite solution of this equation. Two iterative algorithms to find the positive definite solution are given. Some numerical results are reported to illustrate the effectiveness of the algorithms. This research supported by the National Natural Science Foundation of China 10571047 and Doctorate Foundation of the Ministry of Education of China 20060532014.     

Iterative methods for the extremal positive definite solution of the matrix equation

In this paper, the inversion free variant of the basic fixed point iteration methods for obtaining the maximal positive definite solution of the nonlinear matrix equation X+A^*X^-A=Q with the case 0<1 and the minimal positive definite solution of the same matrix equation with the case 1 are proposed. Some necessary conditions and sufficient conditions for the existence of positive definite solutions for the matrix equation are derived. Numerical examples to illustrate the behavior of the considered algorithms are also given.     

Numerical solution of the nonlinear Fredholm integral equations by positive definite functions

A numerical method for solving the nonlinear Fredholom integral equations is presented. The method is based on interpolation by radial basis functions (RBF) to approximate the solution of the Fredholm nonlinear integral equations. Several examples are given and numerical examples are presented to demonstrate the validity and applicability of the method.     

A splitting positive definite mixed element method for second‐order hyperbolic equations

In this article, we establish a new mixed finite element procedure, in which the mixed element system is symmetric positive definite, to solve the second‐order hyperbolic equations. The convergence of the mixed element methods with continuous‐ and discrete‐time scheme is proved. And the corresponding error estimates are given. Finally some numerical results are presented. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

除环上左线性方程组反问题的右高解和次亚(半)正定解

继续文[1]的工作,给出了除环上左线性方程组反问题（简称IP）的右高解的表达式,导出了IP有次自共轭解和次亚（半）正定解的充要条件及其解集结构。     

Localization of the eigenvalues of a pencil of positive definite matrices

Let A and B be real square positive definite matrices close to each other. A domain S on the complex plane that contains all the eigenvalues λ of the problem Az = λBz is constructed analytically. The boundary ?S of S is a curve known as the limacon of Pascal. Using the standard conformal mapping of the exterior of this curve (or of the exterior of an enveloping circular lune) onto the exterior of the unit disc, new analytical bounds are obtained for the convergence rate of the minimal residual method (GMRES) as applied to solving the linear system Ax = b with the preconditioner B.     

Superconvergence of fully discrete splitting positive definite mixed FEM for hyperbolic equations

In this article, we use a splitting positive definite mixed finite element procedure to solve the second‐order hyperbolic equation. We analyze the superconvergence property of the mixed element methods with discrete‐time approximation for the hyperbolic equation. Some numerical examples are presented to illustrate our theoretical results. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 175–186, 2014     

On the Hermitian positive definite solutions of nonlinear matrix equation X + A∗XA = Q

Nonlinear matrix equation X^s + A∗X^−tA = Q, where A, Q are n × n complex matrices with Q Hermitian positive definite, has widely applied background. In this paper, we consider the Hermitian positive definite solutions of this matrix equation with two cases: s ? 1, 0 < t ? 1 and 0 < s ? 1, t ? 1. We derive necessary conditions and sufficient conditions for the existence of Hermitian positive definite solutions for the matrix equation and obtain some properties of the solutions. We also propose iterative methods for obtaining the extremal Hermitian positive definite solution of the matrix equation. Finally, we give some numerical examples to show the efficiency of the proposed iterative methods.     

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.     

New existence results of positive solution for a class of nonlinear fractional differential equations

In this article, the existence and uniqueness of positive solution for a class of nonlinear fractional differential equations is proved by constructing the upper and lower control functions of the nonlinear term without any monotone requirement. Our main method to the problem is the method of upper and lower solutions and Schauder fixed point theorem. Finally, we give an example to illuminate our results.     

The modulus‐based matrix splitting algorithms for a class of weakly nonlinear complementarity problems

In this paper, we study a class of weakly nonlinear complementarity problems arising from the discretization of free boundary problems. By reformulating the complementarity problems as implicit fixed‐point equations based on splitting of the system matrices, we propose a class of modulus‐based matrix splitting algorithms. We show their convergence by assuming that the system matrix is positive definite. Moreover, we give several kinds of typical practical choices of the modulus‐based matrix splitting iteration methods based on the different splitting of the system matrix. Numerical experiments on two model problems are presented to illustrate the theoretical results and examine the numerical effectiveness of our modulus‐based matrix splitting algorithms. Copyright © 2016 John Wiley & Sons, Ltd.     

The existence of a positive solution for a singular coupled system of nonlinear fractional differential equations

In this paper we establish the existence of a positive solution to a singular coupled system of nonlinear fractional differential equations. Our analysis rely on a nonlinear alternative of Leray–Schauder type and Krasnoselskii’s fixed point theorem in a cone.     

A fast algorithm for computing the smallest eigenvalue of a symmetric positive‐definite Toeplitz matrix

Recent progress in signal processing and estimation has generated considerable interest in the problem of computing the smallest eigenvalue of a symmetric positive‐definite (SPD) Toeplitz matrix. An algorithm for computing upper and lower bounds to the smallest eigenvalue of a SPD Toeplitz matrix has been recently derived (Linear Algebra Appl. 2007; DOI: 10.1016/j.laa.2007.05.008 ). The algorithm relies on the computation of the R factor of the QR factorization of the Toeplitz matrix and the inverse of R. The simultaneous computation of R and R^?1 is efficiently accomplished by the generalized Schur algorithm. In this paper, exploiting the properties of the latter algorithm, a numerical method to compute the smallest eigenvalue and the corresponding eigenvector of SPD Toeplitz matrices in an accurate way is proposed. Copyright © 2008 John Wiley & Sons, Ltd.