Results 11 to 20 of about 44 (44)
Solving systems of nonlinear equations and inequalities is of critical importance in many engineering problems. In general, the existence of inequalities in the problem adds to its difficulty. We propose a new projected Hessian Gauss‐Newton algorithm for solving general nonlinear systems of equalities and inequalities.
Mahmoud M. El-Alem +2 more
wiley +1 more source
The systematic analysis of convergence conditions, used in comparison theorems proven for different matrix splittings, is presented. The central idea of this analysis is the scheme of condition implications derived from the properties of regular splittings of a monotone matrix A = M1 − N1 = M2 − N2.
Zbigniew I. Woźnicki
wiley +1 more source
Bound for the largest singular value of nonnegative rectangular tensors
In this paper, we give a new bound for the largest singular value of nonnegative rectangular tensors when m = n, which is tighter than the bound provided by Yang and Yang in “Singular values of nonnegative rectangular tensors”, Front. Math.
He Jun +4 more
doaj +1 more source
A fully parallel method for tridiagonal eigenvalue problem
In this paper, a fully parallel method for finding all eigenvalues of a real matrix pencil (A, B) is given, where A and B are real symmetric tridiagonal and B is positive definite. The method is based on the homotopy continuation coupled with the strategy ?Divide‐Conquer? and Laguerre iterations.
Kuiyuan Li
wiley +1 more source
On the Yang-Baxter-like matrix equation for rank-two matrices
Let A = PQT, where P and Q are two n × 2 complex matrices of full column rank such that QTP is singular. We solve the quadratic matrix equation AXA = XAX.
Zhou Duanmei, Chen Guoliang, Ding Jiu
doaj +1 more source
Rayleigh-Ritz Majorization Error Bounds for the Linear Response Eigenvalue Problem
In the linear response eigenvalue problem arising from computational quantum chemistry and physics, one needs to compute a few of smallest positive eigenvalues together with the corresponding eigenvectors.
Teng Zhongming, Zhong Hong-Xiu
doaj +1 more source
Computing the smallest singular triplets of a large matrix
In this paper we present a new type of restarted Krylov methods for calculating the smallest singular triplets of a large sparse matrix, A. The new framework avoids the Lanczos bidiagonalization process and the use of polynomial filtering.
Achiya Dax
doaj +1 more source
THE HYPERBOLIC QUADRATIC EIGENVALUE PROBLEM
The hyperbolic quadratic eigenvalue problem (HQEP) was shown to admit Courant–Fischer type min–max principles in 1955 by Duffin and Cauchy type interlacing inequalities in 2010 by Veselić.
XIN LIANG, REN-CANG LI
doaj +1 more source
A note on certain ergodicity coeflcients
We investigate two ergodicity coefficients ɸ ∥∥ and τn−1, originally introduced to bound the subdominant eigenvalues of nonnegative matrices. The former has been generalized to complex matrices in recent years and several properties for such generalized ...
Tudisco Francesco
doaj +1 more source
The smallest singular value anomaly: The reasons behind sharp anomaly
Let AA be an arbitrary matrix in which the number of rows, mm, is considerably larger than the number of columns, nn. Let the submatrix Ai,i=1,…,m{A}_{i},\hspace{0.33em}i=1,\ldots ,m, be composed from the first ii rows of AA, and let βi{\beta }_{i ...
Dax Achiya
doaj +1 more source

