In this paper, the minimal residual （MRES） method for solving nonsymmetric equation systems was improved, the recurrence relation was deduced between the approximate solutions of the linear equation system Ax = b, a...In this paper, the minimal residual （MRES） method for solving nonsymmetric equation systems was improved, the recurrence relation was deduced between the approximate solutions of the linear equation system Ax = b, and a more effective method was presented, which can reduce the operational count and the storage.展开更多
Arithmetic coding is a relatively new loss-less data compression technique that has attracted much attention in recent years. We show the iteration of bit-level arithmetic coding can be specified by a continuous funct...Arithmetic coding is a relatively new loss-less data compression technique that has attracted much attention in recent years. We show the iteration of bit-level arithmetic coding can be specified by a continuous function. The analysis expression and some properties of this function are discussed. An application of the function is provided for exploring the security of arithmetic codes when they are used for data encryption.展开更多
QL(QR) method is an efficient method to find eigenvalues of a matrix. Especially we use QL(QR) method to find eigenvalues of a symmetric tridiagonal matrix. In this case it only costs O(n2) flops, to find all eigenval...QL(QR) method is an efficient method to find eigenvalues of a matrix. Especially we use QL(QR) method to find eigenvalues of a symmetric tridiagonal matrix. In this case it only costs O(n2) flops, to find all eigenvalues. So it is one of the most efficient method for symmetric tridiagonal matrices. Many experts have researched it. Even the method is mature, it still has many problems need to be researched. We put forward five problems here. They are: (1) Convergence and convergence rate; (2) The convergence of diagonal elements; (3) Shift designed to produce the eigenvalues in monotone order; (4) QL algorithm with multi-shift; (5) Error bound. We intoduce our works on these problems, some of them were published and some are new.展开更多
In this paper,we demonstrate that the double-shift QL algorithm for an irreducible anti-symmetric iridiagonal matrix with the shifts being two eigenvalues of the 2×2 matrix in the left upper corner of this matrix...In this paper,we demonstrate that the double-shift QL algorithm for an irreducible anti-symmetric iridiagonal matrix with the shifts being two eigenvalues of the 2×2 matrix in the left upper corner of this matrix is convergent and the convergence rale of Ms kind of algorithm is generally cubic.展开更多
The Bjorck and Pereyra algorithms used for solving Vandermonde systemof equation are modified for the case where the points are symmetricly situated aroundzero. The working operation is saved about half. A forward err...The Bjorck and Pereyra algorithms used for solving Vandermonde systemof equation are modified for the case where the points are symmetricly situated aroundzero. The working operation is saved about half. A forward error analysis is presentedfor the modified algorithms, and it's shown that if the points are situated in some order,the error bound are as good as Higham's result in 1987.展开更多
The tridiagonal coefficient matrix for the ＂fixed-fixed＂ spring-mass system was obtained by changing spring length. And then a new algorithm of the inverse problem was designed to construct the masses and the spring...The tridiagonal coefficient matrix for the ＂fixed-fixed＂ spring-mass system was obtained by changing spring length. And then a new algorithm of the inverse problem was designed to construct the masses and the spring constants from the natural frequencies of the ＂fixed-fixed＂ and ＂fixed-fres＂ spring-mass systems. An example was given to illustrate the results.展开更多
Let ∑, Г be two n-by-n diagonal matrices with σi,γi as their diagonals. For the inverse eigenvalue problem: look for y∈Rn such that Г + yyT is similar to ∑, we prove thatu also the sufficient condition for the ...Let ∑, Г be two n-by-n diagonal matrices with σi,γi as their diagonals. For the inverse eigenvalue problem: look for y∈Rn such that Г + yyT is similar to ∑, we prove thatu also the sufficient condition for the solvability of this inverse problem. Its solution (set) is given explicitly. In some case, the problem is unstable. But we prove that the sums of the square of some contigious components keep stable, i.e., small sum keeps small, large sum has a small relative perturbation, see Theorem 3.展开更多
The estimate of the eigenvalues is given when the off-diagonal elements in symmetric tridiagonal matrix are replaced by zero. The result can be applied to QR or QL algorithm. It is a generalization of Jiang’ s result...The estimate of the eigenvalues is given when the off-diagonal elements in symmetric tridiagonal matrix are replaced by zero. The result can be applied to QR or QL algorithm. It is a generalization of Jiang’ s result in 1987. This estimate is sharper than Hager’s result in 1982 and could not展开更多
In this paper, an inverse problem on Jacobi matrices presented by Shieh in 2004 is studied. Shieh＇s result is improved and a new and stable algorithm to reconstruct its solution is given. The numerical examples is al...In this paper, an inverse problem on Jacobi matrices presented by Shieh in 2004 is studied. Shieh＇s result is improved and a new and stable algorithm to reconstruct its solution is given. The numerical examples is also given.展开更多
文摘In this paper, the minimal residual （MRES） method for solving nonsymmetric equation systems was improved, the recurrence relation was deduced between the approximate solutions of the linear equation system Ax = b, and a more effective method was presented, which can reduce the operational count and the storage.
文摘Arithmetic coding is a relatively new loss-less data compression technique that has attracted much attention in recent years. We show the iteration of bit-level arithmetic coding can be specified by a continuous function. The analysis expression and some properties of this function are discussed. An application of the function is provided for exploring the security of arithmetic codes when they are used for data encryption.
文摘QL(QR) method is an efficient method to find eigenvalues of a matrix. Especially we use QL(QR) method to find eigenvalues of a symmetric tridiagonal matrix. In this case it only costs O(n2) flops, to find all eigenvalues. So it is one of the most efficient method for symmetric tridiagonal matrices. Many experts have researched it. Even the method is mature, it still has many problems need to be researched. We put forward five problems here. They are: (1) Convergence and convergence rate; (2) The convergence of diagonal elements; (3) Shift designed to produce the eigenvalues in monotone order; (4) QL algorithm with multi-shift; (5) Error bound. We intoduce our works on these problems, some of them were published and some are new.
基金The author is supported by the State Major Key Project for Basic Researches of China the National Science Ponndation of China
文摘In this paper,we demonstrate that the double-shift QL algorithm for an irreducible anti-symmetric iridiagonal matrix with the shifts being two eigenvalues of the 2×2 matrix in the left upper corner of this matrix is convergent and the convergence rale of Ms kind of algorithm is generally cubic.
基金Supported by National Natural Science Foundation of China,under Grant Number 60175008.and Natural Science Foundation of Fujian Province under Grant A0110004.
文摘The Bjorck and Pereyra algorithms used for solving Vandermonde systemof equation are modified for the case where the points are symmetricly situated aroundzero. The working operation is saved about half. A forward error analysis is presentedfor the modified algorithms, and it's shown that if the points are situated in some order,the error bound are as good as Higham's result in 1987.
基金Project supported by the National Natural Science Foundation of China(Grant No.10271074)
文摘The tridiagonal coefficient matrix for the ＂fixed-fixed＂ spring-mass system was obtained by changing spring length. And then a new algorithm of the inverse problem was designed to construct the masses and the spring constants from the natural frequencies of the ＂fixed-fixed＂ and ＂fixed-fres＂ spring-mass systems. An example was given to illustrate the results.
文摘Let ∑, Г be two n-by-n diagonal matrices with σi,γi as their diagonals. For the inverse eigenvalue problem: look for y∈Rn such that Г + yyT is similar to ∑, we prove thatu also the sufficient condition for the solvability of this inverse problem. Its solution (set) is given explicitly. In some case, the problem is unstable. But we prove that the sums of the square of some contigious components keep stable, i.e., small sum keeps small, large sum has a small relative perturbation, see Theorem 3.
文摘The estimate of the eigenvalues is given when the off-diagonal elements in symmetric tridiagonal matrix are replaced by zero. The result can be applied to QR or QL algorithm. It is a generalization of Jiang’ s result in 1987. This estimate is sharper than Hager’s result in 1982 and could not
基金Project supported by the National Natural Science Foundation of China （Grant No.10271074）
文摘In this paper, an inverse problem on Jacobi matrices presented by Shieh in 2004 is studied. Shieh＇s result is improved and a new and stable algorithm to reconstruct its solution is given. The numerical examples is also given.
