共查询到20条相似文献,搜索用时 15 毫秒
1.
In this paper we are concerned with the problem of solving numerically isospectral flows. These flows are characterized by the differential equation
where is a symmetric matrix, is a skew-symmetric matrix function of and is the Lie bracket operator. We show that standard Runge-Kutta schemes fail in recovering the main qualitative feature of these flows, that is isospectrality, since they cannot recover arbitrary cubic conservation laws. This failure motivates us to introduce an alternative approach and establish a framework for generation of isospectral methods of arbitrarily high order.
2.
Some improvements for two-sided bounds on the inverse of diagonally dominant tridiagonal matrices 总被引:2,自引:0,他引:2
In this paper, we obtain lower and upper bounds for the entries of the inverses of diagonally dominant tridiagonal matrices. First of all we derive the bounds for off-diagonal elements of the inverse as a function of the diagonal ones, then we improve the two-sided bounds for the diagonal entries obtaining sharper lower and upper bounds for all the elements of the inverse. 相似文献
3.
In this paper, we present an eigendecomposition of a tridiagonal matrix. Tridiagonal matrix powers and inverse are derived. As consequence, we get some relations verified by the coefficients of the inverse and the powers of a tridiagonal matrix. 相似文献
4.
Raf Vandebril 《Linear algebra and its applications》2010,432(12):3079-3099
In this article the unitary equivalence transformation of normal matrices to tridiagonal form is studied.It is well-known that any matrix is unitarily equivalent to a tridiagonal matrix. In case of a normal matrix the resulting tridiagonal inherits a strong relation between its super- and subdiagonal elements. The corresponding elements of the super- and subdiagonal will have the same absolute value.In this article some basic facts about a unitary equivalence transformation of an arbitrary matrix to tridiagonal form are firstly studied. Both an iterative reduction based on Krylov sequences as a direct tridiagonalization procedure via Householder transformations are reconsidered. This equivalence transformation is then applied to the normal case and equality of the absolute value between the super- and subdiagonals is proved. Self-adjointness of the resulting tridiagonal matrix with regard to a specific scalar product is proved. Properties when applying the reduction on symmetric, skew-symmetric, Hermitian, skew-Hermitian and unitary matrices and their relations with, e.g., complex symmetric and pseudo-symmetric matrices are presented.It is shown that the reduction can then be used to compute the singular value decomposition of normal matrices making use of the Takagi factorization. Finally some extra properties of the reduction as well as an efficient method for computing a unitary complex symmetric decomposition of a normal matrix are given. 相似文献
5.
This paper is an extension of the work [J. Rimas, On computing of arbitrary positive integer powers for one type of even order tridiagonal matrices with eigenvalues on imaginary axis – I, Appl. Math. Comput., in press] in which the general expression of the lth power (lN) for one type of even order tridiagonal matrices is given. In this new paper we present the complete derivation of this general expression. Expressions of eigenvectors of the matrix and of the transforming matrix and its inverse are given, too. 相似文献
6.
This paper addresses two different but related questions regarding an unbounded symmetric tridiagonal operator: its self-adjointness and the approximation of its spectrum by the eigenvalues of its finite truncations. The sufficient conditions given in both cases improve and generalize previously known results. It turns out that, not only self-adjointness helps to study limit points of eigenvalues of truncated operators, but the analysis of such limit points is a key help to prove self-adjointness. Several examples show the advantages of these new results compared with previous ones. Besides, an application to the theory of continued fractions is pointed out. 相似文献
7.
Philip Brockman Timothy Carson Yun Cheng T.M. Elgindi K. Jensen X. Zhoun M.B.M. Elgindi 《Journal of Computational and Applied Mathematics》2013
We will present the homotopy method for finding eigenvalues of symmetric, tridiagonal matrices. This method finds eigenvalues separately, which can be a large advantage on systems with parallel processors. We will introduce the method and establish some bounds that justify the use of Newton’s method in constructing the homotopy curves. 相似文献
8.
In this paper we address the problem of efficiently computing all the eigenvalues of a large N×N Hermitian matrix modified by a possibly non Hermitian perturbation of low rank. Previously proposed fast adaptations of the
QR algorithm are considerably simplified by performing a preliminary transformation of the matrix by similarity into an upper
Hessenberg form. The transformed matrix can be specified by a small set of parameters which are easily updated during the
QR process. The resulting structured QR iteration can be carried out in linear time using linear memory storage. Moreover,
it is proved to be backward stable. Numerical experiments show that the novel algorithm outperforms available implementations
of the Hessenberg QR algorithm already for small values of N.
相似文献
9.
Shengguo Li Xiangke Liao Jie Liu Hao Jiang 《Numerical Linear Algebra with Applications》2016,23(4):656-673
In this paper, two accelerated divide‐and‐conquer (ADC) algorithms are proposed for the symmetric tridiagonal eigenvalue problem, which cost O(N2r) flops in the worst case, where N is the dimension of the matrix and r is a modest number depending on the distribution of eigenvalues. Both of these algorithms use hierarchically semiseparable (HSS) matrices to approximate some intermediate eigenvector matrices, which are Cauchy‐like matrices and are off‐diagonally low‐rank. The difference of these two versions lies in using different HSS construction algorithms, one (denoted by ADC1) uses a structured low‐rank approximation method and the other (ADC2) uses a randomized HSS construction algorithm. For the ADC2 algorithm, a method is proposed to estimate the off‐diagonal rank. Numerous experiments have been carried out to show their stability and efficiency. These algorithms are implemented in parallel in a shared memory environment, and some parallel implementation details are included. Comparing the ADCs with highly optimized multithreaded libraries such as Intel MKL, we find that ADCs could be more than six times faster for some large matrices with few deflations. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
10.
In this paper, we give some structured perturbation bounds for generalized saddle point matrices and Hermitian block tridiagonal matrices. Our bounds improve some existing ones. In particular, the proposed bounds reveal the sensitivity of the eigenvalues with respect to perturbations of different blocks. Numerical examples confirm the theoretical results. 相似文献
11.
The LBLT factorization of Bunch for solving linear systems involving a symmetric indefinite tridiagonal matrix T is a stable, efficient method. It computes a unit lower triangular matrix L and a block 1 × 1 and 2 × 2 matrix B such that T=LBLT. Choosing the pivot size requires knowing a priori the largest element σ of T in magnitude. In some applications, it is required to factor T as it is formed without necessarily knowing σ. In this paper, we present a modification of the Bunch algorithm that can satisfy this requirement. We demonstrate that this modification exhibits the same bound on the growth factor as the Bunch algorithm and is likewise normwise backward stable. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
12.
We use the classical results of Baxter and Golinskii–Ibragimov to prove a new spectral equivalence for Jacobi matrices on . In particular, we consider the class of Jacobi matrices with conditionally summable parameter sequences and find necessary and sufficient conditions on the spectral measure such that and lie in or for s1. 相似文献
13.
Raf Vandebril Marc Van Barel Nicola Mastronardi 《Numerical Linear Algebra with Applications》2005,12(7):625-658
The QR algorithm is one of the classical methods to compute the eigendecomposition of a matrix. If it is applied on a dense n × n matrix, this algorithm requires O(n3) operations per iteration step. To reduce this complexity for a symmetric matrix to O(n), the original matrix is first reduced to tridiagonal form using orthogonal similarity transformations. In the report (Report TW360, May 2003) a reduction from a symmetric matrix into a similar semiseparable one is described. In this paper a QR algorithm to compute the eigenvalues of semiseparable matrices is designed where each iteration step requires O(n) operations. Hence, combined with the reduction to semiseparable form, the eigenvalues of symmetric matrices can be computed via intermediate semiseparable matrices, instead of tridiagonal ones. The eigenvectors of the intermediate semiseparable matrix will be computed by applying inverse iteration to this matrix. This will be achieved by using an O(n) system solver, for semiseparable matrices. A combination of the previous steps leads to an algorithm for computing the eigenvalue decompositions of semiseparable matrices. Combined with the reduction of a symmetric matrix towards semiseparable form, this algorithm can also be used to calculate the eigenvalue decomposition of symmetric matrices. The presented algorithm has the same order of complexity as the tridiagonal approach, but has larger lower order terms. Numerical experiments illustrate the complexity and the numerical accuracy of the proposed method. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
14.
The pivoting strategy of Bunch and Marcia for solving systems involving symmetric indefinite tridiagonal matrices uses two different methods for solving 2 × 2 systems when a 2 × 2 pivot is chosen. In this paper, we eliminate this need for two methods by adding another criterion for choosing a 1 × 1 pivot. We demonstrate that all the results from the Bunch and Marcia pivoting strategy still hold. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
15.
The eigenvalue bounds of interval matrices are often required in some mechanical and engineering fields. In this paper, we consider an interval eigenvalue problem with symmetric tridiagonal matrices. A theoretical result is obtained that under certain assumptions the upper and lower bounds of interval eigenvalues of the problem must be achieved just at some vertex matrices of the interval matrix. Then a sufficient condition is provided to guarantee the assumption to be satisfied. The conclusion is illustrated also by a numerical example. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
16.
We present a fast algorithm for computing the QR factorization of Cauchy matrices with real nodes. The algorithm works for almost any input matrix, does not require squaring the matrix, and fully exploits the displacement structure of Cauchy matrices. We prove that, if the determinant of a certain semiseparable matrix is non‐zero, a three term recurrence relation among the rows or columns of the factors exists. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
17.
Barry Simon 《Journal of Functional Analysis》2004,214(2):396-409
We prove a general canonical factorization for meromorphic Herglotz functions on the unit disk whose notable elements are that there is no restriction (other than interlacing) on the zeros and poles for their Blaschke product to converge and there is no singular inner function. We use this result to provide a significant simplification in the proof of Killip-Simon (Ann. Math. 158 (2003) 253) of their result characterizing the spectral measures of Jacobi matrices, J, with J−J0 Hilbert-Schmidt. We prove a nonlocal version of Case and step-by-step sum rules. 相似文献
18.
Plamen Y. Yalamov 《BIT Numerical Mathematics》1995,35(3):428-447
Componentwise error analysis for a modification of the cyclic reduction without back substitution for a tridiagonal system is presented. We consider relative roundoff errors and equivalent perturbations, so the main supposition is that all the data is nonzero. First, backward analysis for the computation of each component of the solution in separate is presented. Bounds on the relative equivalent perturbations are obtained depending on two constants. From these bounds it is easy to obtain a componentwise forward error analysis. Then the two constants are defined for some special classes of matrices, i.e. diagonally dominant (row or column), symmetric positive definite, totally nonnegative andM-matrices, and it is shown that the bounds for these classes of matrices are small.The author was supported by Grants MM-211/92 and MM-434/94 from the National Scientific Research Fund of the Bulgarian Ministry of Education and Science. 相似文献
19.
Suely Oliveira. 《Mathematics of Computation》1998,67(221):221-235
Rutishauser, Gragg and Harrod and finally H.Y. Zha used the same class of chasing algorithms for transforming arrowhead matrices to tridiagonal form. Using a graphical theoretical approach, we propose a new chasing algorithm. Although this algorithm has the same sequential computational complexity and backward error properties as the old algorithms, it is better suited for a pipelined approach. The parallel algorithm for this new chasing method is described, with performance results on the Paragon and nCUBE. Comparison results between the old and the new algorithms are also presented.
20.
In this note, we propose an explicit representation with the nested sums for the entries of the inverses of general tridiagonal nonsingular matrices. Its equivalence with other particular representations, based on the combinatorial expressions or the continued fractions, is considered. In addition, an analytical representation for the entries of the finite sections of the resolvent of Jacobi matrices, in terms of its related orthogonal polynomials, is observed. 相似文献