Inverting linear combinations of identity and generalized Catalan matrices

We introduce the notion of the generalized Catalan matrix as a kind of lower triangular Toeplitz matrix whose nonzero elements involve the generalized Catalan numbers. Inverse of the linear combination of the Pascal matrix with the identity matrix is computed in Aggarwala and Lamoureux (2002) [1]. In this paper, continuing this idea, we invert various linear combinations of the generalized Catalan matrix with the identity matrix. A simple and efficient approach to invert the Pascal matrix plus one in terms of the Hadamard product of the Pascal matrix and appropriate lower triangular Toeplitz matrices is considered in Yang and Liu (2006) [14]. We derive representations for inverses of linear combinations of the generalized Catalan matrix and the identity matrix, in terms of the Hadamard product which includes the Generalized Catalan matrix and appropriate lower triangular Toeplitz matrix.     

Properties of the inverses of a set of band matrices

Those regions where the elements of the inverse of a Toeplitz matrix of band width four and order nalternate in sign are determined. A similar result concerning the elements of the inverse of a commonly occurring symmetric positive definite Toeplitz matrix of band width five and order nis extended to cover the case when the first and last rows of the matrix are modified through a change in the boundary conditions of the associated application. A method for economically obtaining the infinity norm of the pent-diagonal symmetric positive definite Toeplitz matrix is then derived.     

Order invariant properties of some matrices

Certain important Toeplitz and composite Toeplitz matrices have order invariant properties. A class of matrices is defined, and a notation for sign patterns of vector and matrix elements is developed which enables some order invariant properties of the matrices to be described. Several examples are given to show how these ideas apply to some important matrices, including those commonly arising from the numerical solution of elliptic partial differential equations. The following information about the inverse of these matrices is obtained: the signs of the elements, the row in which the maximum row sum occurs, and the signs of the elements of the eigenvector corresponding to its dominant eigenvalue.     

Bound-state soliton and rogue wave solutions for the sixth-order nonlinear Schrödinger equation via inverse scattering transform method

In this work, inverse scattering transform for the sixth-order nonlinear Schrödinger equation with both zero and nonzero boundary conditions at infinity is given, respectively. For the case of zero boundary conditions, in terms of the Laurent's series and generalization of the residue theorem, the bound-state soliton is derived. For nonzero boundary conditions, using the robust inverse scattering transform, we present a matrix Riemann–Hilbert problem of the sixth-order nonlinear Schrödinger equation. Then, based on the obtained Riemann–Hilbert problem, the rogue wave solutions are derived through a modified Darboux transformation. Besides, according to some appropriate parameters choices, several graphical analysis are provided to discuss the dynamical behaviors of the rogue wave solutions and analyze how the higher-order terms affect the rogue wave.     

Bounds for the extremal eigenvalues of a class of symmetric tridiagonal matrices with applications

We consider a class of symmetric tridiagonal matrices which may be viewed as perturbations of Toeplitz matrices. The Toeplitz structure is destroyed since two elements on each off-diagonal are perturbed. Based on a careful analysis, we derive sharp bounds for the extremal eigenvalues of this class of matrices in terms of the original data of the given matrix. In this way, we also obtain a lower bound for the smallest singular value of certain matrices. Some numerical results indicate that our bounds are extremely good.     

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

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

Uniform bounds on the 1-norm of the inverse of lower triangular Toeplitz matrices

A uniform bound on the 1-norm is given for the inverse of a lower triangular Toeplitz matrix with non-negative monotonically decreasing entries whose limit is zero. The new bound is sharp under certain specified constraints. This result is then employed to throw light upon a long standing open problem posed by Brunner concerning the convergence of the one-point collocation method for the Abel equation. In addition, the recent conjecture of Gauthier et al. is proved.     

Matrix Continued Fraction for the Resolvent Function of the Band Operator

The aim of this paper is the expansion of a matrix function in terms of a matrix-continued fraction as defined by Sorokin and Van Iseghem. The function under study is the Weyl function or resolvent function of an operator, given in the standard basis by a bi-infinite band matrix, with p subdiagonals and q superdiagonals, where the p + q – 1 intermediate diagonals are zero. The main goal of this paper is to find, for the moments, an explicit form in terms of the coefficients of the continued fraction, called genetic sums, which lead to a generalization of the notion of a Stieltjes continued fraction. These results are extension of some results already found for the vector case (p = 1) and are a step in the direction towards the solution of the direct and inverse spectral problem. The actual computation of the approximants of the given function as the convergents of the continued fraction is shown to be effective. Some possible extensions are considered.     

On the inverses of a class of toeplitz matrices of band width five

For a symmetric positive definite Toeplitz matrix of band width five and order n, those regions where the elements of the inverse alternative in sign are determined.     

关于<用初等行变换解一类线性规划问题>一文的注记

本指出，在献[1]提出的求解线性规划的方法中，对于初始可行基、最优解和零解的存在性问题所得出的某些结论是错误的，特殊是如果含n个变量的约束条件的增广矩阵经初等行变换后，其中某行的前n个分量非正，而最后一个分量为0时，应认为该线性规划问题可能有非零解，且不一定存在零解，而非[1]所述的结论。     

Inverses of tridiagonal Toeplitz and periodic matrices with applications to mechanics

The linear algebraic equation Ax = b with tridiagonal coefficient matrix of A is solved by the analytical matrix inversion. An explicit formula is known if A is a Toeplitz matrix. New formulas are presented for the following cases: (1) A is of Toeplitz type except that A(1, 1) and A(n, n) are different from the remaining diagonal elements. (2) A is p-periodic (p > 1), by which is meant that in each of the three bands of A a group of p elements is periodically repeated. (3) The tridiagonal matrix A is composed of periodic submatrices of different periods. In cases (2) and(3) the problem of matrix inversion is reduced to a second-order difference equation with periodic coefficients. The solution is based on Floquet's theorem. It is shown that for p = 1 the formulae found for periodic matrices reduce to special forms valid for Toeplitz matrices. The results are applied to problems of elastostatics and of vibration theory.     

Reducing the bandwidth of a sparse matrix with tabu search

The bandwidth of a matrix A={a_ij} is defined as the maximum absolute difference between i and j for which a_ij≠0. The problem of reducing the bandwidth of a matrix consists of finding a permutation of the rows and columns that keeps the nonzero elements in a band that is as close as possible to the main diagonal of the matrix. This NP-complete problem can also be formulated as a labeling of vertices on a graph, where edges are the nonzero elements of the corresponding symmetrical matrix. Many bandwidth reduction algorithms have been developed since the 1960s and applied to structural engineering, fluid dynamics and network analysis. For the most part, these procedures do not incorporate metaheuristic elements, which is one of the main goals of our current development. Another equally important goal is to design and test a special type of candidate list strategy and a move mechanism to be embedded in a tabu search procedure for the bandwidth reduction problem. This candidate list strategy accelerates the selection of a move in the neighborhood of the current solution in any given iteration. Our extensive experimentation shows that the proposed procedure outperforms the best-known algorithms in terms of solution quality consuming a reasonable computational effort.     

A direct method to solve block banded block Toeplitz systems with non-banded Toeplitz blocks

A fast solution algorithm is proposed for solving block banded block Toeplitz systems with non-banded Toeplitz blocks. The algorithm constructs the circulant transformation of a given Toeplitz system and then by means of the Sherman-Morrison-Woodbury formula transforms its inverse to an inverse of the original matrix. The block circulant matrix with Toeplitz blocks is converted to a block diagonal matrix with Toeplitz blocks, and the resulting Toeplitz systems are solved by means of a fast Toeplitz solver.The computational complexity in the case one uses fast Toeplitz solvers is equal to ξ(m,n,k)=O(mn³)+O(k³n³) flops, there are m block rows and m block columns in the matrix, n is the order of blocks, 2k+1 is the bandwidth. The validity of the approach is illustrated by numerical experiments.     

Deconvolution and Regularization with Toeplitz Matrices

By deconvolution we mean the solution of a linear first-kind integral equation with a convolution-type kernel, i.e., a kernel that depends only on the difference between the two independent variables. Deconvolution problems are special cases of linear first-kind Fredholm integral equations, whose treatment requires the use of regularization methods. The corresponding computational problem takes the form of structured matrix problem with a Toeplitz or block Toeplitz coefficient matrix. The aim of this paper is to present a tutorial survey of numerical algorithms for the practical treatment of these discretized deconvolution problems, with emphasis on methods that take the special structure of the matrix into account. Wherever possible, analogies to classical DFT-based deconvolution problems are drawn. Among other things, we present direct methods for regularization with Toeplitz matrices, and we show how Toeplitz matrix–vector products are computed by means of FFT, being useful in iterative methods. We also introduce the Kronecker product and show how it is used in the discretization and solution of 2-D deconvolution problems whose variables separate.     

Nouveau noyau de Green associé au problème de Poisson–Dirichlet sur un rectangle

This work is focused on the study of a ‘discretization’ method for the Laplacian operator, in the two-dimensional Poisson problem on a rectangle, with Dirichlet boundary conditions. The Laplacian operator is approximated by a block Toeplitz matrix, the blocks of which are Toeplitz matrices again, and a formula of the inverse matrix blocks is given. Then an asymptotic development of the inverse matrix trace and the Toeplitz matrix determinant are obtained. Finally, the continuum expression of the Laplacian operator is found by calculating the ergodic limit of the inverse matrix. A new asymptotic formula for the well known Green function for the Poisson problem that we obtain converges more rapidly than the usual one. To cite this article: J. Chanzy, C. R. Acad. Sci. Paris, Ser. I 341 (2005).     

Algebraic characterizations of chordality

Several characterizations of chordal graphs are given via algebraic formulae that hold in terms of the pattern of the nonzero entries of the inverse of a matrix or of the specified entries of a partial matrix.     

Existence of matrices with prescribed Off-diagonal block element sums

Necessary and sufficient conditions are proven for the existence of a square matrix, over an arbitrary field, such that for every principal submatrix the sum of the elements in the row complement of the submatrix is prescribed. The problem is solved in the cases where the positions of the nonzero elements of A are contained in a given set of positions, and where there is no restriction on the positions of the nonzero elements of A. The uniqueness of the solution is studied as well. The results are used to solve the cases where the matrix is required to be symmetric and/or nonnegative entrywise.     

关于实方阵的几个问题

本文讨论如下内容：１．把有关对称正定（半正定）的一些性质推广到广义正定（半正定）。２．给定ｘ∈Ｒｍ×ｍ，∧为对角阵，求ＡＸ＝ｘ∧在对称半正定矩阵类中解存在的充要条件及一般形式，并讨论了对任意给定的对称正定（半正定）矩阵Ａ，在上述解的集合中求得Ａ，使得     

Analysis of a novel preconditioner for a class of p‐level lower rank extracted systems

This paper proposes and studies the performance of a preconditioner suitable for solving a class of symmetric positive definite systems, Âx=b, which we call p‐level lower rank extracted systems (p‐level LRES), by the preconditioned conjugate gradient method. The study of these systems is motivated by the numerical approximation of integral equations with convolution kernels defined on arbitrary p‐dimensional domains. This is in contrast to p‐level Toeplitz systems which only apply to rectangular domains. The coefficient matrix, Â, is a principal submatrix of a p‐level Toeplitz matrix, A, and the preconditioner for the preconditioned conjugate gradient algorithm is provided in terms of the inverse of a p‐level circulant matrix constructed from the elements of A. The preconditioner is shown to yield clustering in the spectrum of the preconditioned matrix which leads to a substantial reduction in the computational cost of solving LRE systems. Copyright © 2006 John Wiley & Sons, Ltd.