Results 31 to 40 of about 644 (117)
The core inverse and constrained matrix approximation problem
In this article, we study the constrained matrix approximation problem in the Frobenius norm by using the core inverse:||Mx−b||F=minsubjecttox∈ℛ(M),||Mx-b|{|}_{F}=\hspace{.25em}\min \hspace{1em}\text{subject}\hspace{.25em}\text{to}\hspace{1em}x\in ...
Wang Hongxing, Zhang Xiaoyan
doaj +1 more source
Positive definite solutions of certain nonlinear matrix equations
We investigate positive definite solutions of nonlinear matrix equations X− f (Φ(X))= Q and X −∑i=1 f (Φi(X)) = Q , where Q is a positive definite matrix, Φ and Φi (1 i m) are positive linear maps on Mn(C) and f is a nonnegative matrix monotone or matrix
Z. Mousavi, F. Mirzapour, M. Moslehian
semanticscholar +1 more source
Inverse problems for self-adjoint Dirac systems: explicit solutions and stability of the procedure [PDF]
A procedure to recover explicitly self-adjoint matrix Dirac systems on semi-axis (with both discrete and continuous components of spectrum) from rational Weyl functions is considered. Its stability is proved.
A. Sakhnovich
semanticscholar +1 more source
Direct methods for matrix Sylvester and Lyapunov equations
We revisit the two standard dense methods for matrix Sylvester and Lyapunov equations: the Bartels‐Stewart method for A1X + XA2 + D = 0 and Hammarling′s method for AX + XAT + BBT = 0 with A stable. We construct three schemes for solving the unitarily reduced quasitriangular systems. We also construct a new rank‐1 updating scheme in Hammarling′s method.
Danny C. Sorensen, Yunkai Zhou
wiley +1 more source
The iterative methods for solving nonlinear matrix equation X+A⋆X−1A+B⋆X−1B=Q
In this paper, we study the matrix equation X+A⋆X−1A+B⋆X−1B=Q, where A and B are square matrices, and Q is a positive definite matrix, and propose the iterative methods for finding positive definite solutions of the matrix equation.
S. Vaezzadeh +3 more
semanticscholar +1 more source
The Cayley transform of Banach algebras
The main result of Haynes (1991) is that a square matrix is convergent (limn→∞Dn = 0) if and only if it is the Cayley transform CA = (I−A)−1(I + A) of a stable matrix A. In this note, we show, with a simple proof, that the above is true in a much more general setting of complex Banach algebras.
Zhidong Pan
wiley +1 more source
Conservation laws for multidimensional systems and related linear algebra problems [PDF]
We consider multidimensional systems of PDEs of generalized evolution form with t-derivatives of arbitrary order on the left-hand side and with the right-hand side dependent on lower order t-derivatives and arbitrary space derivatives.
Bocharov A V +11 more
core +8 more sources
Un algoritmo tipo Newton globalizado para resolver la ecuación cuadrática matricial
Resumen. En este artículo se presenta una globalización del algoritmo cuasiNewton local propuesto en [16] para resolver la ecuación cuadrática matricial.
Mauricio Macías +2 more
semanticscholar +1 more source
Skew-selfadjoint Dirac systems: stability of the procedure of explicit solving the inverse problem [PDF]
Procedures to recover explicitly discrete and continuous skew-selfadjoint Dirac systems on semi-axis from rational Weyl matrix functions are considered. Their stability is shown.
B. Fritzsche +3 more
semanticscholar +1 more source
Invariance of recurrence sequences under a galois group
Let F be a Galois field of order q, k a fixed positive integer and R = Fk×k[D] where D is an indeterminate. Let L be a field extension of F of degree k. We identify Lf with fk×1 via a fixed normal basis B of L over F. The F‐vector space Γk(F)( = Γ(L)) of all sequences over Fk×1 is a left R‐module. For any regular f(D) ∈ R, Ωk(f(D)) = {S ∈ Γk(F) : f(D)S
Hassan Al-Zaid, Surjeet Singh
wiley +1 more source

