On the numerical analtsys of generated sylvester equations

The sensivtiity of the solution of the matrix Sylvester equation AX-XB=C is considered in the context of the classical perturbation theory. Our purpose is to find the most influent parameters in the sensitivity of the solution under perturbations in the data, and to compare the theoretical error bounds with numerical evidence.     

Computational Krylov‐based methods for large‐scale differential Sylvester matrix problems

In the present paper, we propose Krylov‐based methods for solving large‐scale differential Sylvester matrix equations having a low‐rank constant term. We present two new approaches for solving such differential matrix equations. The first approach is based on the integral expression of the exact solution and a Krylov method for the computation of the exponential of a matrix times a block of vectors. In the second approach, we first project the initial problem onto a block (or extended block) Krylov subspace and get a low‐dimensional differential Sylvester matrix equation. The latter problem is then solved by some integration numerical methods such as the backward differentiation formula or Rosenbrock method, and the obtained solution is used to build the low‐rank approximate solution of the original problem. We give some new theoretical results such as a simple expression of the residual norm and upper bounds for the norm of the error. Some numerical experiments are given in order to compare the two approaches.     

Sylvester与Lyapunov方程向后误差分析

利用矩阵Kronecker积的性质,研究Sylvester矩阵方程Ax YB=C与Lyapunov矩阵方程ATX XA=-Q(Q0)的向后误差,获得了这两类矩阵方程向后误差η(X,Y)与η(X)的精确表达式及其更易计算的上下界.这些结果是对有关文献相应结果的改进与补充.     

Block Krylov Subspace Methods for Solving Large Sylvester Equations

In the present paper, we propose block Krylov subspace methods for solving the Sylvester matrix equation AX–XB=C. We first consider the case when A is large and B is of small size. We use block Krylov subspace methods such as the block Arnoldi and the block Lanczos algorithms to compute approximations to the solution of the Sylvester matrix equation. When both matrices are large and the right-hand side matrix is of small rank, we will show how to extract low-rank approximations. We give some theoretical results such as perturbation results and bounds of the norm of the error. Numerical experiments will also be given to show the effectiveness of these block methods.     

Mixed,componentwise condition numbers and small sample statistical condition estimation of Sylvester equations

We present a componentwise perturbation analysis for the continuous‐time Sylvester equations. Componentwise, mixed condition numbers and new perturbation bounds are derived for the matrix equations. The small sample statistical method can also be applied for the condition estimation. These condition numbers and perturbation bounds are tested on numerical examples and compared with the normwise condition number. The numerical examples illustrate that the mixed condition number gives sharper bounds than the normwise one. Copyright © 2011 John Wiley & Sons, Ltd.     

矩阵方程X-A~*X~(-1)A=Q的Hermite正定解及其扰动分析

考虑非线性矩阵方程X-A*X-1A=Q,其中A是n阶复矩阵,Q是n阶Hermite正定解,A*是矩阵A的共轭转置.本文证明了此方程存在唯一的正定解,并推导出此正定解的扰动边界和条件数的显式表达式.以上结果用数值例子加以说明.     

A finite element method for the Sivashinsky equation

The Sivashinsky equation is a nonlinear evolutionary equation of fourth order in space. In this paper we have analyzed a semidiscrete finite element method and completely discrete scheme based on the backward Euler method and Crank–Nicolson–Galerkin scheme. A linearized backward Euler method have been developed and error bounds are derived for an L² projection.     

Backward error,sensitivity, and refinement of computed solutions of algebraic Riccati equations

In this paper, a new backward error criterion, together with a sensitivity measure, is presented for assessing solution accuracy of nonsymmetric and symmetric algebraic Riccati equations (AREs). The usual approach to assessing reliability of computed solutions is to employ standard perturbation and sensitivity results for linear systems and to extend them further to AREs. However, such methods are not altogether appropriate since they do not take account of the underlying structure of these matrix equations. The approach considered here is to first compute the backward error of a computed solution X? that measures the amount by which data must be perturbed so that X? is the exact solution of the perturbed original system. Conventional perturbation theory is used to define structured condition numbers that fully respect the special structure of these matrix equations. The new condition number, together with the backward error of computed solutions, provides accurate estimates for the sensitivity of solutions. Optimal perturbations are then used in an iterative refinement procedure to give further more accurate approximations of actual solutions. The results are derived in their most general setting for nonsymmetric and symmetric AREs. This in turn offers a unifying framework through which it is possible to establish similar results for Sylvester equations, Lyapunov equations, linear systems, and matrix inversions.     

Sylvester方程在矩阵扰动分析中的应用

§1.引言 矩阵扰动分析的研究对于矩阵论的发展及数值分析问题计算结果的分析和处理都有重要意义.有关特征值、广义特征值及最小二乘问题的主要研究结果均含于[1]中,[5]运用二次方程根的判别法通过对代数Ricatti方程的解的估计给出了QR分解因子及Cholesky因子的扰动分析,但论证方法及所得结果都比较复杂且所求条件很强.[3]和     

矩阵方程ATXA=D的条件数与向后扰动分析

讨论矩阵方程ATXA=D,该方程源于振动反问题和结构模型修正.本文利用Moore-Penrose广义逆的性质,给出该方程解的条件数的上、下界估计.同时,利用Schauder不动点理论给出该方程的向后扰动界,这些结果可用于该矩阵方程的数值计算.     

A new version of the Smith method for solving Sylvester equation and discrete-time Sylvester equation

Recently, Xue etc. \cite{28} discussed the Smith method for solving Sylvester equation $AX+XB=C$, where one of the matrices $A$ and $B$ is at least a nonsingular $M$-matrix and the other is an (singular or nonsingular) $M$-matrix. Furthermore, in order to find the minimal non-negative solution of a certain class of non-symmetric algebraic Riccati equations, Gao and Bai \cite{gao-2010} considered a doubling iteration scheme to inexactly solve the Sylvester equations. This paper discusses the iterative error of the standard Smith method used in \cite{gao-2010} and presents the prior estimations of the accurate solution $X$ for the Sylvester equation. Furthermore, we give a new version of the Smith method for solving discrete-time Sylvester equation or Stein equation $AXB+X=C$, while the new version of the Smith method can also be used to solve Sylvester equation $AX+XB=C$, where both $A$ and $B$ are positive definite. % matrices. We also study the convergence rate of the new Smith method. At last, numerical examples are given to illustrate the effectiveness of our methods     

Accuracy and Stability of the Null Space Method for Solving the Equality Constrained Least Squares Problem

The null space method is a standard method for solving the linear least squares problem subject to equality constraints (the LSE problem). We show that three variants of the method, including one used in LAPACK that is based on the generalized QR factorization, are numerically stable. We derive two perturbation bounds for the LSE problem: one of standard form that is not attainable, and a bound that yields the condition number of the LSE problem to within a small constant factor. By combining the backward error analysis and perturbation bounds we derive an approximate forward error bound suitable for practical computation. Numerical experiments are given to illustrate the sharpness of this bound.     

Perturbation theory and backward error forAX−XB=C

Because of the special structure of the equationsAX–XB=C the usual relation for linear equations backward error = relative residual does not hold, and application of the standard perturbation result forAx=b yields a perturbation bound involving sep (A, B)^–1 that is not always attainable. An expression is derived for the backward error of an approximate solutionY; it shows that the backward error can exceed the relative residual by an arbitrary factor. A sharp perturbation bound is derived and it is shown that the condition number it defines can be arbitrarily smaller than the sep(A, B)^–1-based quantity that is usually used to measure sensitivity. For practical error estimation using the residual of a computed solution an LAPACK-style bound is shown to be efficiently computable and potentially much smaller than a sep-based bound. A Fortran 77 code has been written that solves the Sylvester equation and computes this bound, making use of LAPACK routines.Nuffield Science Research Fellow. This work was carried out while the author was a visitor at the Institute for Mathematics and its Applications, University of Minnesota.     

Mixed finite element methods for a fourth order reaction diffusion equation

Mixed finite element methods are applied to a fourth order reaction diffusion equation with different types of boundary conditions. Some a priori bounds are established with the help of Lyapunov functional. The semidiscrete schemes are derived using C⁰‐piecewise linear finite elements in spatial direction and error estimates are obtained. The semidiscrete problem is then discretized in the temporal direction using backward Euler method and the wellposedness of the completely discrete scheme is discussed. Finally, a priori error estimates are established. While deriving a priori error estimates, Gronwall's lemma is applied and the constants involved in the error bounds do not depend exponentially on $\frac{1}{\gamma}$, where γ is a parameter appeared in the fourth order derivative. © 2011Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2012     

对称矩阵方程Q+BKS+(BKS)~T+BKRK~TB~T=0的向后误差分析

本文研究了对称矩阵方程Q+BKS+(BKS)~T+BKRK~TB~T=0近似解的最佳向后误差,得到了向后误差量的上界与下界,并用一个简单的数值例子来说明所得结论     

Edge residuals dominate a posteriori error estimates for linear finite element methods on anisotropic triangular and tetrahedral meshes

Summary. Both for the - and -norms, we prove that, up to higher order perturbation terms, edge residuals yield global upper and local lower bounds on the error of linear finite element methods on anisotropic triangular or tetrahedral meshes. We also show that, with a correct scaling, edge residuals yield a robust error estimator for a singularly perturbed reaction-diffusion equation. Received April 19, 1999 / Published online April 20, 2000     

Effective condition numbers and small sample statistical condition estimation for the generalized Sylvester equation

In this paper,we investigate the effective condition numbers for the generalized Sylvester equation(AX-YB,DX-YE)=(C,F),where A,D∈R m×m,B,E∈R n×n and C,F ∈ R m×n.We apply the small sample statistical method for the fast condition estimation of the generalized Sylvester equation,which requires O(m2n+mn2) flops,comparing with O(m3+n3) flops for the generalized Schur and generalized HessenbergSchur methods for solving the generalized Sylvester equation.Numerical examples illustrate the sharpness of our perturbation bounds.     

矩阵方程X—A*X~qA=I(0＜q＜1)Hermite正定解的扰动分析

首先证明了非线性矩阵方程X-A~*X~qA=I(0相似文献   

Robust a posteriori error estimators for a singularly perturbed reaction-diffusion equation

We derive robust a posteriori error estimators for a singularly perturbed reaction-diffusion equation. Here, robust means that the estimators yield global upper and local lower bounds on the error measured in the energy norm such that the ratio of the upper and lower bounds is bounded from below and from above by constants which do neither depend on any meshsize nor on the perturbation parameter. The estimators are based either on the evaluation of local residuals or on the solution of discrete local Dirichlet or Neumann problems. Received June 5, 1996     

关于QR分解的注记

1 引言 在信号处理、时间序列分析中,QR分解有重要应用.设X_n={x_1~H…x_n~H}为n×p矩阵，每个x_i~H都是落入某个正则区间的数据样本。若序列{X_i~H}非平稳，则需要压缩老数据以抑制其污染新数据所带的信息。指数窗法是解决这个问题的一种重要而又常用