Tikhonov solutions of approximately given systems of linear algebraic equations under finite perturbations of their matrices

The properties of a mathematical programming problem that arises in finding a stable (in the sense of Tikhonov) solution to a system of linear algebraic equations with an approximately given augmented coefficient matrix are examined. Conditions are obtained that determine whether this problem can be reduced to the minimization of a smoothing functional or to the minimal matrix correction of the underlying system of linear algebraic equations. A method for constructing (exact or approximately given) model systems of linear algebraic equations with known Tikhonov solutions is described. Sharp lower bounds are derived for the maximal error in the solution of an approximately given system of linear algebraic equations under finite perturbations of its coefficient matrix. Numerical examples are given.     

Exponential estimates for singularly perturbed linear fuctional differential equations

Exponential estimates on the fundamental matrix, uniform on the perturbation parameter, are obtained for singularly perturbed systems of linear retarded functional differential equations, under the assumption that the eigenvalues of a certain coefficient matrix in the system have negative real parts. The exponential rates in the estimates are computable from upper bounds on the real parts of the characteristic values of the system or of associated simpler equations. Differences between differential-difference equations and equations with distributed delays are emphasized.     

Extending the notions of companion and infinite companion to matrix polynomials

The notion of infinite companion matrix is extended to the case of matrix polynomials (including polynomials with singular leading coefficient). For row reduced polynomials a finite companion is introduced as the compression of the shift matrix. The methods are based on ideas of dilation theory. Connections with systems theory are indicated. Applications to the problem of linearization of matrix polynomials, solution of systems of difference and differential equations and new factorization formulae for infinite block Hankel matrices having finite rank are shown. As a consequence, any system of linear difference or differential equations with constant coefficients can be transformed into a first order system of dimension n = deg det D.     

Parallel multisplitting two-stage iterative methods for large sparse systems of weakly nonlinear equations

The finite difference or the finite element discretizations of many differential or integral equations often result in a class of systems of weakly nonlinear equations. In this paper, by reasonably applying both the multisplitting and the two-stage iteration techniques, and in accordance with the special properties of this system of weakly nonlinear equations, we first propose a general multisplitting two-stage iteration method through the two-stage multiple splittings of the system matrix. Then, by applying the accelerated overrelaxation (AOR) technique of the linear iterative methods, we present a multisplitting two-stage AOR method, which particularly uses the AOR-like iteration as inner iteration and is substantially a relaxed variant of the afore-presented method. These two methods have a forceful parallel computing function and are much more suitable to the high-speed multiprocessor systems. For these two classes of methods, we establish their local convergence theories, and precisely estimate their asymptotic convergence factors under some suitable assumptions when the involved nonlinear mapping is only directionally differentiable. When the system matrix is either an H-matrix or a monotone matrix, and the nonlinear mapping is a P-bounded mapping, we thoroughly set up the global convergence theories of these new methods. Moreover, under the assumptions that the system matrix is monotone and the nonlinear mapping is isotone, we discuss the monotone convergence properties of the new multisplitting two-stage iteration methods, and investigate the influence of the multiple splittings as well as the relaxation parameters upon the convergence behaviours of these methods. Numerical computations show that our new methods are feasible and efficient for parallel solving of the system of weakly nonlinear equations. This revised version was published online in August 2006 with corrections to the Cover Date.     

含参数线性方程组解的判别方法注记

当线性方程组中含有未知参数时,线性方程组解的情况往往需要进行讨论.本文给出了在非齐次线性方程组系数矩阵中含有未知参数且系数行列式等于零的情况下,判定对应参数值下方程组的解是无解还是有无穷多解的两个判定定理.和以前的方法比较,本文提出的讨论方法更直接.     

A class of two‐stage iterative methods for systems of weakly nonlinear equations

The discretizations of many differential equations by the finite difference or the finite element methods can often result in a class of system of weakly nonlinear equations. In this paper, by applying the two-tage iteration technique and in accordance with the special properties of this weakly nonlinear system, we first propose a general two-tage iterative method through the two-tage splitting of the system matrix. Then, by applying the accelerated overrelaxation (AOR) technique of the linear iterative methods, we present a two-tage AOR method, which particularly uses the AOR iteration as the inner iteration and is substantially a relaxed variant of the afore-presented method. For these two classes of methods, we establish their local convergence theories, and precisely estimate their asymptotic convergence factors under some suitable assumptions when the involved nonlinear mapping is only B-differentiable. When the system matrix is either a monotone matrix or an H-matrix, and the nonlinear mapping is a P-bounded mapping, we thoroughly set up the global convergence theories of these new methods. Moreover, under the assumptions that the system matrix is monotone and the nonlinear mapping is isotone, we discuss the monotone convergence properties of the new two-tage iteration methods, and investigate the influence of the matrix splittings as well as the relaxation parameters on the convergence behaviours of these methods. Numerical computations show that our new methods are feasible and efficient for solving the system of weakly nonlinear equations. This revised version was published online in June 2006 with corrections to the Cover Date.     

The discrete linear restricted Chebyshev approximation

A numerically stable simplex algorithm for calculating the restricted Chebyshev solution of overdetermined systems of linear equations is described. In this algorithm minimum computer storage is required and no conditions are imposed on the coefficient matrix or on the right hand side of the system of equations. Also a new way of implementing a triangular decomposition method to the basis matrix is used. The ordinary Chebyshev solution, the one-sided Chebyshev solutions and the Chebyshev approximation by non-negative functions are obtained as special cases in this algorithm. Numerical results are given.     

The Inverse Problem Method on the Half-Line and a Nested System of Riccati Equations

A mixed problem for the nonlinear Bogoyavlenskii system on the half-line is studied by the inverse problem method. The solution of the mixed problem is reduced to the solution of the inverse spectral problem of recovering a forth-order differential operator on the half-line from the Weyl matrix. We derive evolution equations for the elements of the Weyl matrix and give an algorithm for the solution of the mixed problem. Evolution equations of the elements of the Weyl matrix are nonlinear. It is shown that they can be reduced to a nested system of three successively solvable matrix Riccati equations.     

The use of splitting of the equations of motion in the numerical solution of problems of the dynamics of elastic systems

Linear elastic systems with a finite number of degrees of freedom, the initial equations of motion of which are constructed using the finite element method or other discretization methods, are considered. Since, in applied dynamics problems, the motions are usually investigated in a frequency range with an upper bound, the degrees of freedom of the initial system of equations are split into dynamic and quasi-dynamic degrees. Finally, the initial system of equations is split into a small number of differential equations for the dynamic degrees of freedom and into a system of algebraic equations for determining the quasi-static displacements, represented in the form of a matrix series. The number of terms of the series taken into account depends on the accuracy required.     

Ellipsoidal approximation of attainability sets of a linear system with indeterminate matrix

Linear dynamical systems described by finite-difference or differential equations are considered. It is assumed that the matrix of the system is either completely known or is subject to uncontrollable perturbations, so that each element is known only to within a certain possible interval. Outer approximations, by means of ellipsoids, are constructed for the attainability sets of such systems. The equations of evolution of the approximating ellipsoids are obtained. An example is presented.     

三阶线性常微分方程Sinc方程组的结构预处理方法

三阶线性常微分方程在天文学和流体力学等学科的研究中有着广泛的应用.本文介绍求解三阶线性常微分方程由Sinc方法离散所得到的线性方程组的结构预处理方法.首先, 我们利用Sinc方法对三阶线性常微分方程进行离散,证明了离散解以指数阶收敛到原问题的精确解.针对离散后线性方程组的系数矩阵的特殊结构, 提出了结构化的带状预处理子,并证明了预处理矩阵的特征值位于复平面上的一个矩形区域之内.然后, 我们引入新的变量将三阶线性常微分方程等价地转化为由两个二阶线性常微分方程构成的常微分方程组, 并利用Sinc方法对降阶后的常微分方程组进行离散.离散后线性方程组的系数矩阵是分块2×2的, 且每一块都是Toeplitz矩阵与对角矩阵的组合.为了利用Krylov子空间方法有效地求解离散后的线性方程组,我们给出了块对角预处理子, 并分析了预处理矩阵的性质.最后, 我们对降阶后二阶线性常微分方程组进行了一些比较研究.数值结果证实了Sinc方法能够有效地求解三阶线性常微分方程.     

Partitioning of invariant imbedding systems

The choice of partitioning the system matrix for a system of N linear ordinary differential equations may determine the ease or difficulty of obtaining a solution by the invariant imbedding method of Scott. This paper shows how the configuration and partitioning of the system matrix is reflected in the fundamental matrix. The partitioning of the fundamental matrix is the key to the ease or difficulty of obtaining a solution. If the fundamental matrix is known for a given system matrix configuration and partitioning, then the fundamental matrix associated with a new system matrix configuration may be derived by the same row and column interchanges that transformed the old system matrix into the new system matrix. The fundamental matrix for the new system matrix does not have to be recalculated anew from the Kronecker delta initial conditions.     

Haar wavelet operational matrix of fractional order integration and its applications in solving the fractional order differential equations

Haar wavelet operational matrix has been widely applied in system analysis, system identification, optimal control and numerical solution of integral and differential equations. In the present paper we derive the Haar wavelet operational matrix of the fractional order integration, and use it to solve the fractional order differential equations including the Bagley-Torvik, Ricatti and composite fractional oscillation equations. The results obtained are in good agreement with the existing ones in open literatures and it is shown that the technique introduced here is robust and easy to apply.     

具变时滞的非线性退化微分系统的渐近稳定性判据

In this paper, the asymptotic stability for singular differential nonlinear systems with multiple time-varying delays is considered. The V-functional method for general singular differential delay system is investigated. The asymptotic stability criteria for singular differential nonlinear systems with multiple time-varying delays are derived based on V-functional method and some analytical techniques, which are described as matrix equations or matrix inequalities. The results obtained are computationally flexible and efficient.     

The method of determining all real nonmultiple roots of systems of nonlinear equations

A method for determining all nonmultiple roots of the system of nonlinear equations in an n-dimensional parallelepiped is proposed. The main idea of the method is that the original set, in which the roots are sought, is divided into subsets where either the system of equations does not have solutions or its Jacobian matrix is nonsingular. A partition algorithm is presented and its convergence is proved. The application of the method is demonstrated using several examples.     

Chebyshev polynomial approximation for high‐order partial differential equations with complicated conditions

In this article, a new method is presented for the solution of high‐order linear partial differential equations (PDEs) with variable coefficients under the most general conditions. The method is based on the approximation by the truncated double Chebyshev series. PDE and conditions are transformed into the matrix equations, which corresponds to a system of linear algebraic equations with the unknown Chebyshev coefficients, via Chebyshev collocation points. Combining these matrix equations and then solving the system yields the Chebyshev coefficients of the solution function. Some numerical results are included to demonstrate the validity and applicability of the method. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

A CLASS OF NEW PARALLEL HYBRID ALGEBRAIC MULTILEVEL ITERATIONS

1. IntroductionConsider the large sparse system of linear equationsAx = b, (1.1)where, for a fixed positive integer cr, A e L(R") is a symmetric positive definite (SPD) matrir,having the bloCked formx,b E R" are the uDknwn and the known vectors, respectively, having the correspondingblocked formsni(ni S n, i = 1, 2,', a) are a given positthe integers, satisfying Z ni = n. This systemi= 1of linear equations often arises in sultable finite element discretizations of many secondorderseifad…     

Preconditioning techniques for an image deblurring problem

In this paper, we consider the solution of a large linear system of equations, which is obtained from discretizing the Euler–Lagrange equations associated with the image deblurring problem. The coefficient matrix of this system is of the generalized saddle point form with high condition number. One of the blocks of this matrix has the block Toeplitz with Toeplitz block structure. This system can be efficiently solved using the minimal residual iteration method with preconditioners based on the fast Fourier transform. Eigenvalue bounds for the preconditioner matrix are obtained. Numerical results are presented. Copyright © 2016 John Wiley & Sons, Ltd.     

On the boundedness of outer polyhedral estimates for reachable sets of linear systems

New properties of outer polyhedral (parallelepipedal) estimates for reachable sets of linear differential systems are studied. For systems with a stable matrix, it is determined what the orientation matrices are for which the estimates possessing the generalized semigroup property are bounded/unbounded on an infinite time interval. In particular, criteria are found (formulated in terms of the eigenvalues of the system’s matrix and the properties of bounding sets) that guarantee for previously mentioned tangent estimates and estimates with a constant orientation matrix that either there are initial orientation matrices for which the corresponding estimate tubes are bounded or all these tubes are unbounded. For linear stationary systems, a system of ordinary differential equations and algebraic relations is derived that determines estimates with constant orientation matrices for reachable sets that have no generalized semigroup property but are tangent and also bounded if the matrix of the system is stable.     

RIEMANN-HILBERT PROBLEMS OF A SIX-COMPONENT MKDV SYSTEM AND ITS SOLITON SOLUTIONS

Based on a 4 x 4 matrix spectral problem, an AKNS soliton hierarchy with six potentials is generated. Associated with this spectral problem, a kind of Riemann-Hilbert problems is formulated for a six-component system of mKdV equations in the resulting AKNS hierarchy. Soliton solutions to the considered system of coupled mKdV equations are computed, through a reduced Riemann-Hilbert problem where an identity jump matrix is taken.