Solutions to the generalized Sylvester matrixequations by a singular value decomposition

In this paper, solutions to the generalized Sylvester matrix equations AX -XF = BY and MXN -X = TY with A, M ∈ R^n×n, B, T ∈ Rn×r, F, N ∈ R^p×p and the matrices N, F being in companion form, are established by a singular value decomposition of a matrix with dimensions n × （n ＋ pr）. The algorithm proposed in this paper for the euqation AX - XF = BY does not require the controllability of matrix pair （A, B） and the restriction that A, F do not have common eigenvalues. Since singular value decomposition is adopted, the algorithm is numerically stable and may provide great convenience to the computation of the solution to these equations, and can perform important functions in many design problems in control systems theory.

On Accelerated Singular Value Thresholding Algorithm for Matrix Completion

An accelerated singular value thresholding (SVT) algorithm was introduced for matrix completion in a recent paper [1], which applies an adaptive line search scheme and improves the convergence rate from O(1/N) for SVT to O(1/N2), where N is the number of iterations. In this paper, we show that it is the same as the Nemirovski’s approach, and then modify it to obtain an accelerate Nemirovski’s technique and prove the convergence. Our preliminary computational results are very favorable.

DIRECT PERTURBATION METHOD FOR REANALYSIS OF MATRIX SINGULAR VALUE DECOMPOSITION

The perturbational reanalysis technique of matrix singular value decomposition is applicable to many theoretical and practical problems in mathematics, mechanics, control theory, engineering, etc.. An indirect perturbation method has previously been proposed by the author in this journal, and now the direct perturbation method has also been presented in this paper. The second-order perturbation results of non-repeated singular values and the corresponding left and right singular vectors are obtained. The results can meet the general needs of most problems of various practical applications. A numerical example is presented to demonstrate the effectiveness of the direct perturbation method.

PERTURBATION METHOD FOR REANALYSIS OF THE MATRIX SINGULAR VALUE DECOMPOSITION

The perturbation method for the reanalysis of the singular value decomposition (SVD) of general real matrices is presented in this paper. This is a simple but efficient reanalysis technique for the SVD, which is of great worth to enhance computational efficiency of the iterative analysis problems that require matrix singular value decomposition repeatedly. The asymptotic estimate formulas for the singular values and the corresponding left and right singular vectors up to second-order perturbation components are derived. At the end of the paper the way to extend the perturbation method to the case of general complex matrices is advanced.

Matrix Boundary Value Problem on Hyperbola

We study a special class of lower trigonometric matrix value boundary value problems on hyperbolas. Firstly, the pseudo-orthogonal polynomial on hyperbola is given in bilinear form and it is shown that it is the only one. Secondly, a special boundary value problem of lower triangular matrix is presented and transformed into four related boundary value problems. Finally, Liouville theorem and Painlevé theorem and pseudo-orthogonal polynomials are used to give solutions.

A Color Image Encryption Scheme Based on Singular Values and Chaos

The security of digital images transmitted via the Internet or other public media is of the utmost importance.Image encryption is a method of keeping an image secure while it travels across a non-secure communication medium where it could be intercepted by unauthorized entities.This study provides an approach to color image encryption that could find practical use in various contexts.The proposed method,which combines four chaotic systems,employs singular value decomposition and a chaotic sequence,making it both secure and compression-friendly.The unified average change intensity,the number of pixels’change rate,information entropy analysis,correlation coefficient analysis,compression friendliness,and security against brute force,statistical analysis and differential attacks are all used to evaluate the algorithm’s performance.Following a thorough investigation of the experimental data,it is concluded that the proposed image encryption approach is secure against a wide range of attacks and provides superior compression friendliness when compared to chaos-based alternatives.

Robust Damage Detection and Localization Under Complex Environmental Conditions Using Singular Value Decomposition-based Feature Extraction and One-dimensional Convolutional Neural Network

Ultrasonic guided wave is an attractive monitoring technique for large-scale structures but is vulnerable to changes in environmental and operational conditions(EOC),which are inevitable in the normal inspection of civil and mechanical structures.This paper thus presents a robust guided wave-based method for damage detection and localization under complex environmental conditions by singular value decomposition-based feature extraction and one-dimensional convolutional neural network(1D-CNN).After singular value decomposition-based feature extraction processing,a temporal robust damage index(TRDI)is extracted,and the effect of EOCs is well removed.Hence,even for the signals with a very large temperature-varying range and low signal-to-noise ratios(SNRs),the final damage detection and localization accuracy retain perfect 100%.Verifications are conducted on two different experimental datasets.The first dataset consists of guided wave signals collected from a thin aluminum plate with artificial noises,and the second is a publicly available experimental dataset of guided wave signals acquired on a composite plate with a temperature ranging from 20℃to 60℃.It is demonstrated that the proposed method can detect and localize the damage accurately and rapidly,showing great potential for application in complex and unknown EOC.

Continuous-Time and Discrete-Time Singular Value Decomposition of an Impulse Response Function

This paper proposes the continuous-time singular value decomposition (SVD) for the impulse response function, a special kind of Green’s functions, in order to find a set of singular functions and singular values so that the convolutions of such function with the set of singular functions on a specified domain are the solutions to the inhomogeneous differential equations for those singular functions. A numerical example was illustrated to verify the proposed method. Besides the continuous-time SVD, a discrete-time SVD is also presented for the impulse response function, which is modeled using a Toeplitz matrix in the discrete system. The proposed method has broad applications in signal processing, dynamic system analysis, acoustic analysis, thermal analysis, as well as macroeconomic modeling.

Contourlet watermarking algorithm based on Arnold scrambling and singular value decomposition

A new digital watermarking algorithm based on the contourlet transform is proposed to improve the robustness and anti-attack performances of digital watermarking. The algorithm uses the Arnold scrambling technique and the singular value decomposition （SVD） scheme. The Arnold scrambling technique is used to preprocess the watermark, and the SVD scheme is used to find the best suitable hiding points. After the contourlet transform of the carrier image, intermediate frequency sub-bands are decomposed to obtain the singularity values. Then the watermark bits scrambled in the Arnold rules are dispersedly embedded into the selected SVD points. Finally, the inverse contourlet transform is applied to obtain the carrier image with the watermark. In the extraction part, the watermark can be extracted by the semi-blind watermark extracting algorithm. Simulation results show that the proposed algorithm has better hiding and robustness performances than the traditional contourlet watermarking algorithm and the contourlet watermarking algorithm with SVD. Meanwhile, it has good robustness performances when the embedded watermark is attacked by Gaussian noise, salt- and-pepper noise, multiplicative noise, image scaling and image cutting attacks, etc. while security is ensured.

The Singular Value Decomposition Analysis between Summer Precipitation in the Dongting Lake Region and the Global Sea Surface Temperature

By dint of the summer precipitation data from 21 stations in the Dongting Lake region during 1960-2008 and the sea surface temperature(SST) data from NOAA,the spatial and temporal distributions of summer precipitation and their correlations with SST are analyzed.The coupling relationship between the anomalous distribution in summer precipitation and the variation of SST has between studied with the Singular Value Decomposition(SVD) analysis.The increase or decrease of summer precipitation in the Dongting Lake region is closely associated with the SST anomalies in three key regions.The variation of SST in the three key regions has been proved to be a significant previous signal to anomaly of summer rainfall in Dongting region.

Coupled Cross-correlation Neural Network Algorithm for Principal Singular Triplet Extraction of a Cross-covariance Matrix

This paper proposes a novel coupled neural network learning algorithm to extract the principal singular triplet (PST) of a cross-correlation matrix between two high-dimensional data streams. We firstly introduce a novel information criterion (NIC), in which the stationary points are singular triplet of the crosscorrelation matrix. Then, based on Newton's method, we obtain a coupled system of ordinary differential equations (ODEs) from the NIC. The ODEs have the same equilibria as the gradient of NIC, however, only the first PST of the system is stable (which is also the desired solution), and all others are (unstable) saddle points. Based on the system, we finally obtain a fast and stable algorithm for PST extraction. The proposed algorithm can solve the speed-stability problem that plagues most noncoupled learning rules. Moreover, the proposed algorithm can also be used to extract multiple PSTs effectively by using sequential method. © 2014 Chinese Association of Automation.

MATRIX ALGORITHMS AND ERROR FORMULA FOR BIVARIATE THIELE-TYPE RECTANGULAR MATRIX VALUED RATIONAL INTERPOLATION

A new method for the construction of bivariate matrix valued rational interpolants (BGIRI) on a rectangular grid is presented in [6]. The rational interpolants are of Thiele-type continued fraction form with scalar denominator. The generalized inverse introduced by [3]is gen-eralized to rectangular matrix case in this paper. An exact error formula for interpolation is ob-tained, which is an extension in matrix form of bivariate scalar and vector valued rational interpola-tion discussed by Siemaszko[l2] and by Gu Chuangqing [7] respectively. By defining row and col-umn-transformation in the sense of the partial inverted differences for matrices, two type matrix algorithms are established to construct corresponding two different BGIRI, which hold for the vec-tor case and the scalar case.

A SEMI-CONJUGATE MATRIX BOUNDARY VALUE PROBLEM FOR GENERAL ORTHOGONAL POLYNOMIALS ON AN ARBITRARY SMOOTH JORDAN CURVE

In this article, the author characterizes orthogonal polynomials on an arbitrary smooth Jordan curve by a semi-conjugate matrix boundary value problem, which is different from the Riemann-Hilbert problems that appear in the theory of Riemann -Hilbert approach to asymptotic analysis for orthogonal polynomials on a real interval introduced by Fokas, Its, and Kitaev and on the unit circle introduced by Baik, Deift, and Johansson. The author hopes that their characterization may be applied to asymptotic analysis for general orthogonal polynomials by combining with a new extension of steepest descent method which we are looking for.

Werner-Type Matrix Valued Rational Interpolation and Its Recurrence Algorithms

In this paper, a practical Werner-type continued fraction method for solving matrix valued rational interpolation problem is provided by using a generalized inverse of matrices. In order to reduce the continued fraction form to rational function form of the interpolants, an efficient forward recurrence algorithm is obtained.

Randomized Generalized Singular Value Decomposition

The generalized singular value decomposition(GSVD)of two matrices with the same number of columns is a very useful tool in many practical applications.However,the GSVD may suffer from heavy computational time and memory requirement when the scale of the matrices is quite large.In this paper,we use random projections to capture the most of the action of the matrices and propose randomized algorithms for computing a low-rank approximation of the GSVD.Serval error bounds of the approximation are also presented for the proposed randomized algorithms.Finally,some experimental results show that the proposed randomized algorithms can achieve a good accuracy with less computational cost and storage requirement.

A CHARACTERIZATION OF SCHECHTER'S ESSENTIAL SPECTRUM BY MEAN OF MEASURE OF NON-STRICT-SINGULARITY AND APPLICATION TO MATRIX OPERATOR

In this paper we use the notion of measure of non-strict-singularity to give some results on Fredholm operators and we establish a fine description of the Schechter essential spectrum of a closed densely defined linear operator.

NEW RESULTS ON ESTIMATES FOR SINGULAR VALUES

WT5,5”BX]New results are provided to estimate matrix singular values in terms of partial absolute deleted row sums and column sums. Illustrative examples are presented to show comparisons with results in literature.[WT5,5”HZ]

Investigation on Singularity, Signature Matrix and Spectrum of Mixed Graphs

The spectral theory of graph is an important branch of graph theory,and the main part of this theory is the connection between the spectral properties and the structural properties,characterization of the structural properties of graphs.We discuss the problems about singularity,signature matrix and spectrum of mixed graphs.Without loss of generality,parallel edges and loops are permitted in mixed graphs.Let G1 and G2 be connected mixed graphs which are obtained from an underlying graph G.When G1 and G2 have the same singularity,the number of induced cycles in Gi(i=1,2)is l(l=1,l>1),the length of the smallest induced cycles is 1,2,at least 3.According to conclusions and mathematics induction,we find that the singularity of corresponding induced cycles in G1 and G2 are the same if and only if there exists a signature matrix D such that L(G2)=DTL(G1)D.D may be the product of some signature matrices.If L(G2)=D^TL(G1)D,G1 and G2 have the same spectrum.

Study on singularity analysis with differential transform method for 3-RRUR parallel robot based on Jacobian matrix

Parallel robot is used in many different fields nowadays, but the singularity of 3-RRUR parallel robot is more complicated, so a method to analyze the singularity of the 3-RRUR parallel robot is very necessary. First, the Jacobian matrix was built based on the differential transform method through the transfer matrixes between the poles. The connection between the position parameters and singularity condition was built through the analysis of the Jacobian matrix. Second, the effect on the singularity from the position parameters was analyzed, and then the singularity condition was confirmed. The effect on the singularity condition from position parameters was displayed by the curved surface charts to provide a basic method for the designing of the parallel robot. With this method, the singularity condition could be got when the length of each link is firmed, so it can be judged that if a group of parameters are appropriate or not, and the method also provides warrant for workspace and path planning of the parallel robot.

On the Inequalities for Traces and Singular Values of the Quaternion Matrices

In this paper we derive some inequalities for traces and singular values of the quaternion matrices,extend and improve some of the corresponding results appeared in other papers we know.