In this paper, a three dimensional matrix valued rational interpolant (TGMRI) is first constructed by making use of the generalized inverse of matrices. The interpolants are of the Thiele type branched continued fra...In this paper, a three dimensional matrix valued rational interpolant (TGMRI) is first constructed by making use of the generalized inverse of matrices. The interpolants are of the Thiele type branched continued fraction form, with matrix numerator and scalar denominator. Some properties of TGMRI are given. An efficient recursive algorithm is proposed. The results in the paper can be extend to n variable.展开更多
Solving large scale system of Simultaneous Linear Equations (SLE) has been (and continue to be) a major challenging problem for many real-world engineering and science applications. Solving SLE with singular coefficie...Solving large scale system of Simultaneous Linear Equations (SLE) has been (and continue to be) a major challenging problem for many real-world engineering and science applications. Solving SLE with singular coefficient matrices arises from various engineering and sciences applications [1]-[6]. In this paper, efficient numerical procedures for finding the generalized (or pseudo) inverse of a general (square/rectangle, symmetrical/unsymmetrical, non-singular/singular) matrix and solving systems of Simultaneous Linear Equations (SLE) are formulated and explained. The developed procedures and its associated computer software (under MATLAB [7] computer environment) have been based on “special Cholesky factorization schemes” (for a singular matrix). Test matrices from different fields of applications have been chosen, tested and compared with other existing algorithms. The results of the numerical tests have indicated that the developed procedures are far more efficient than the existing algorithms.展开更多
This paper proposes a new technique based on inverse Markov chain Monte Carlo algorithm for finding the smallest generalized eigenpair of the large scale matrices. Some numerical examples show that the proposed method...This paper proposes a new technique based on inverse Markov chain Monte Carlo algorithm for finding the smallest generalized eigenpair of the large scale matrices. Some numerical examples show that the proposed method is efficient.展开更多
Investigates three various algorithms for computation and implementation of general limit representations of generalized inverses. Introduction and preliminaries; Details of the generalized imbedding method; Limit rep...Investigates three various algorithms for computation and implementation of general limit representations of generalized inverses. Introduction and preliminaries; Details of the generalized imbedding method; Limit representation and orthogonal systems.展开更多
Artificial neural network is a new approach to pattern recognition and classification. The model of multilayer perceptron （MLP） and back-propagation （BP） is used to train the algorithm in the artificial neural net...Artificial neural network is a new approach to pattern recognition and classification. The model of multilayer perceptron （MLP） and back-propagation （BP） is used to train the algorithm in the artificial neural network. An improved fast algorithm of the BP network was presented, which adopts a singular value decomposition （SVD） and a generalized inverse matrix. It not only increases the speed of network learning but also achieves a satisfying precision. The simulation and experiment results show the effect of improvement of BP algorithm on the classification of the surface defects of steel plate.展开更多
Surface wave methods have received much attention due to their efficient, flexible and convenient characteristics. However, there are still critical issues regarding a key step in surface wave inversion. In most exist...Surface wave methods have received much attention due to their efficient, flexible and convenient characteristics. However, there are still critical issues regarding a key step in surface wave inversion. In most existing methods, the number of layers is assumed to be known prior to the process of inversion. However, improper assignment of this parameter leads to erroneous inversion results. A Bayesian nonparametric method for Rayleigh wave inversion is proposed herein to address this problem. In this method, each model class represents a particular number of layers with unknown S-wave velocity and thickness of each layer. As a result, determination of the number of layers is equivalent to selection of the most applicable model class. Regarding each model class, the optimization search of S-wave velocity and thickness of each layer is implemented by using a genetic algorithm. Then, each model class is assessed in view of its efficiency under the Bayesian framework and the most efficient class is selected. Simulated and actual examples verify that the proposed Bayesian nonparametric approach is reliable and efficient for Rayleigh wave inversion, especially for its capability to determine the number of layers.展开更多
This paper presents a new highly parallel algorithm for computing the minimum-norm least-squares solution of inconsistent linear equations Ax = b(A∈Rm×n,b∈R (A)). By this algorithm the solution x = A + b is obt...This paper presents a new highly parallel algorithm for computing the minimum-norm least-squares solution of inconsistent linear equations Ax = b(A∈Rm×n,b∈R (A)). By this algorithm the solution x = A + b is obtained in T = n(log2m + log2(n - r + 1) + 5) + log2m + 1 steps with P=mn processors when m × 2(n - 1) and with P = 2n(n - 1) processors otherwise.展开更多
A recursive rational algorithm for matrix exponentials was obtained by making use of the generalized inverse of a matrix in this paper. On the basis of the n th convergence of Thiele type continued fraction expa...A recursive rational algorithm for matrix exponentials was obtained by making use of the generalized inverse of a matrix in this paper. On the basis of the n th convergence of Thiele type continued fraction expansion, a new type of the generalized inverse matrix valued Padé approximant (GMPA) for matrix exponentials was defined and its remainder formula was proved. The results of this paper were illustrated by some examples.展开更多
Several kinds of stream ciphers—complementary sequences of period sequences,partial sum of period sequences,inverse order sequences and finitely generated sequences,arestudied by using techniques of generating functi...Several kinds of stream ciphers—complementary sequences of period sequences,partial sum of period sequences,inverse order sequences and finitely generated sequences,arestudied by using techniques of generating functions.Their minimal polynomials,periods,as wellas generating functions are given.As to finitely generated sequences,the change of their linearcomplexity profiles as well as the relationship between the two generated sequences usder thecase in which the degree of connected polynomials are fixed,are discussed.展开更多
Different from the extended Euclidean algorithm which can compute directly only the multiplicative inverse of an element in Zm^＊ and the greatest common divisor of two integers, a recursive algorithm called REESSE is...Different from the extended Euclidean algorithm which can compute directly only the multiplicative inverse of an element in Zm^＊ and the greatest common divisor of two integers, a recursive algorithm called REESSE is designed by the authors, which can not only seek directly the multiplicative inverse and the greatest common divisor, but also solve directly a simple congruence for general solutions. This paper presents the definition and the two valuable properties of a simple congruence, analyzes in detail the reduction and recursion process of solving simple congruences, induces the recursive formula for solving simple congruences, and describes formally and implements in C language the recursive algorithm. At last, the paper compares REESSE with the extended Euclidean algorithm in thought, applicability and time complexity.展开更多
文摘In this paper, a three dimensional matrix valued rational interpolant (TGMRI) is first constructed by making use of the generalized inverse of matrices. The interpolants are of the Thiele type branched continued fraction form, with matrix numerator and scalar denominator. Some properties of TGMRI are given. An efficient recursive algorithm is proposed. The results in the paper can be extend to n variable.
文摘Solving large scale system of Simultaneous Linear Equations (SLE) has been (and continue to be) a major challenging problem for many real-world engineering and science applications. Solving SLE with singular coefficient matrices arises from various engineering and sciences applications [1]-[6]. In this paper, efficient numerical procedures for finding the generalized (or pseudo) inverse of a general (square/rectangle, symmetrical/unsymmetrical, non-singular/singular) matrix and solving systems of Simultaneous Linear Equations (SLE) are formulated and explained. The developed procedures and its associated computer software (under MATLAB [7] computer environment) have been based on “special Cholesky factorization schemes” (for a singular matrix). Test matrices from different fields of applications have been chosen, tested and compared with other existing algorithms. The results of the numerical tests have indicated that the developed procedures are far more efficient than the existing algorithms.
文摘This paper proposes a new technique based on inverse Markov chain Monte Carlo algorithm for finding the smallest generalized eigenpair of the large scale matrices. Some numerical examples show that the proposed method is efficient.
文摘Investigates three various algorithms for computation and implementation of general limit representations of generalized inverses. Introduction and preliminaries; Details of the generalized imbedding method; Limit representation and orthogonal systems.
基金Item Sponsored by National Natural Science Foundation of China (60277029)
文摘Artificial neural network is a new approach to pattern recognition and classification. The model of multilayer perceptron （MLP） and back-propagation （BP） is used to train the algorithm in the artificial neural network. An improved fast algorithm of the BP network was presented, which adopts a singular value decomposition （SVD） and a generalized inverse matrix. It not only increases the speed of network learning but also achieves a satisfying precision. The simulation and experiment results show the effect of improvement of BP algorithm on the classification of the surface defects of steel plate.
基金Science and Technology Development Fund of the Macao SAR under research grant SKL-IOTSC-2018-2020the Research Committee of University of Macao under Research Grant MYRG2016-00029-FST。
文摘Surface wave methods have received much attention due to their efficient, flexible and convenient characteristics. However, there are still critical issues regarding a key step in surface wave inversion. In most existing methods, the number of layers is assumed to be known prior to the process of inversion. However, improper assignment of this parameter leads to erroneous inversion results. A Bayesian nonparametric method for Rayleigh wave inversion is proposed herein to address this problem. In this method, each model class represents a particular number of layers with unknown S-wave velocity and thickness of each layer. As a result, determination of the number of layers is equivalent to selection of the most applicable model class. Regarding each model class, the optimization search of S-wave velocity and thickness of each layer is implemented by using a genetic algorithm. Then, each model class is assessed in view of its efficiency under the Bayesian framework and the most efficient class is selected. Simulated and actual examples verify that the proposed Bayesian nonparametric approach is reliable and efficient for Rayleigh wave inversion, especially for its capability to determine the number of layers.
基金This project is supported by the National Natural Science Foundation of China
文摘This paper presents a new highly parallel algorithm for computing the minimum-norm least-squares solution of inconsistent linear equations Ax = b(A∈Rm×n,b∈R (A)). By this algorithm the solution x = A + b is obtained in T = n(log2m + log2(n - r + 1) + 5) + log2m + 1 steps with P=mn processors when m × 2(n - 1) and with P = 2n(n - 1) processors otherwise.
文摘A recursive rational algorithm for matrix exponentials was obtained by making use of the generalized inverse of a matrix in this paper. On the basis of the n th convergence of Thiele type continued fraction expansion, a new type of the generalized inverse matrix valued Padé approximant (GMPA) for matrix exponentials was defined and its remainder formula was proved. The results of this paper were illustrated by some examples.
文摘Several kinds of stream ciphers—complementary sequences of period sequences,partial sum of period sequences,inverse order sequences and finitely generated sequences,arestudied by using techniques of generating functions.Their minimal polynomials,periods,as wellas generating functions are given.As to finitely generated sequences,the change of their linearcomplexity profiles as well as the relationship between the two generated sequences usder thecase in which the degree of connected polynomials are fixed,are discussed.
基金Supported by the National Key Promotion Plan for Science and Technology Results (2003EC000001)
文摘Different from the extended Euclidean algorithm which can compute directly only the multiplicative inverse of an element in Zm^＊ and the greatest common divisor of two integers, a recursive algorithm called REESSE is designed by the authors, which can not only seek directly the multiplicative inverse and the greatest common divisor, but also solve directly a simple congruence for general solutions. This paper presents the definition and the two valuable properties of a simple congruence, analyzes in detail the reduction and recursion process of solving simple congruences, induces the recursive formula for solving simple congruences, and describes formally and implements in C language the recursive algorithm. At last, the paper compares REESSE with the extended Euclidean algorithm in thought, applicability and time complexity.
