Results 71 to 80 of about 244 (170)
Backward Errors for Eigenvalue and Singular Value Decompositions
, 1994 . We present bounds on the backward errors for the symmetric eigenvalue decomposition and the singular value decomposition in the two-norm and in the Frobenius norm.
I.C.F. Ipsen, S. Chandrasekaran
core
On the Yang-Baxter-like matrix equation for rank-two matrices
Open Mathematics, 2017 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
, 2013 In (Das et al. in J. Inequal. Appl. 2013:44, 2013), a new graph [InlineEquation not available: see fulltext.] on monogenic semigroups [InlineEquation not available: see fulltext.] (with zero) having elements [InlineEquation not available: see fulltext ...
Çevik, A. +3 more
core +1 more source
AN EFFICIENT GAUSS-NEWTON ALGORITHM FOR SYMMETRIC LOW-RANK PRODUCT MATRIX APPROXIMATIONS
, 2015 . We derive and study a Gauss-Newton method for computing a symmetric low-rank product XXT, where X ∈ Rn×k for k < n, that is the closest to a given symmetric matrix A ∈ Rn×n in Frobenius norm.
Wen, Zaiwen +5 more
core +1 more source
A Newton-like Method for Nonlinear Semidefinite Inequalities
, 2007 A matrix map F (x) is said to be (matricially) convex, if u T F (x)u is a convex function for every u. In this paper, semidefinite systems of the type F (x) ¯ 0, where F (x) is matricially convex, are considered. This class of problems generalizes both
Motakuri Ramana, A. J. Goldman
core
Eigenvalues of the Adjacency Tensor on Products of Hypergraphs [PDF]
, 2013 We consider the generalized notions of Cartesian and tensor products on m-uniform hypergraphs. The adjacency tensor is analogous to the adjacency matrix and two different notions of eigenvalues of the adjacency tensor on the products of hypergraphs are ...
Kelly J Pearson, Tan Zhang
core
, 1999 . Replace certain edges of a directed graph by chains and consider the eect on the spectrum of the graph. It is shown that the spectral radius decreases monotonically with the expansion and that, for a strongly connected graph that is not a single cycle,
Hans Schneider +2 more
core +1 more source
Esophageal Stenting: How I Do It. [PDF]
GE Port J Gastroenterol, 2023 Silva R.
europepmc +1 more source
Gegenbauer polynomials and semiseparable matrices
, 2007 . In this paper, we develop a new O(n log n) algorithm for converting coefficients between expansions in different families of Gegenbauer polynomials up to a finite degree n.
Jens Keiner
core
Construction of 4 x 4 symmetric stochastic matrices with given spectra
Open MathematicsThe symmetric stochastic inverse eigenvalue problem (SSIEP) asks which lists of real numbers occur as the spectra of symmetric stochastic matrices. When the cardinality of a list is 4, Kaddoura and Mourad provided a sufficient condition for SSIEP by a ...
Jung Jaewon, Kim Donggyun
doaj +1 more source