Results 231 to 240 of about 1,610,795 (266)
Some of the next articles are maybe not open access.

A note on a criterion for M-matrix

Computational Mathematics and Modeling, 2009
There are many ways to characterize \(M\)-matrices. One of these is: a real \(n\times n\) matrix \(A\) is an \(M\)-matrix if and only if all its off-diagonal entries are \(\leq0\) and all leading principal minors are positive. The authors present a further criterion which may be simpler to verify.
Hashimoto, Tomoaki, Amemiya, Takashi
openaire   +2 more sources

Accurate solutions of M-matrix Sylvester equations

Numerische Mathematik, 2011
The authors present a relative perturbation theory for an \(M\)-matrix Sylvester equation (MSE). Specifically, the MSE is meant by the matrix equation \(AX + XB = C\) where \(A\) and \(B\) have positive diagonal entries and nonpositive off-diagonal entries; \(P = I_m \otimes A + B^T \otimes I_n\) is a nonsingular \(M\)-matrix; and \(C\) is entry-wise ...
Jungong Xue, Shufang Xu, Ren-Cang Li
openaire   +1 more source

Computing the Smallest Eigenvalue of an M-Matrix

SIAM Journal on Matrix Analysis and Applications, 1996
A computation of the smallest eigenvalue and the corresponding eigenvector of an irreducible nonsingular \(\text{M}\)-matrix \(A\) is considered. Section 2 introduces some lemmas for M-matrices. Sections 3 and 4 discuss perturbation theory for the eigenvalues and for each component of the corresponding eigenvector.
openaire   +1 more source

Convergence of SSOR multisplitting method for an M-matrix

Journal of Applied Mathematics and Computing, 2007
The authors consider the multisplitting method and the relaxed multisplitting method for solving a linear system of equations with a large sparse \(M\)-matrix. They prove convergence results for both classes of methods under appropriate assumptions on the relaxation parameters.
Yun, Jae Heon, Han, Yu Du, Oh, Seyoung
openaire   +1 more source

Preconditioned AOR Iterative Method for M-Matrix

2013 Ninth International Conference on Computational Intelligence and Security, 2013
In this paper, we propose a new selection mode of 'r, t' for the preconditioner I+C and analyze the convergence performance of the preconditioned AOR iterative method induced by this preconditioner. For a nonsingular M-matrix, we show that the preconditioned AOR iterative method with this choice and the preconditioned methods advised by Evans et al ...
Qiufang Xue   +2 more
openaire   +1 more source

On iterative methods for the quadratic matrix equation with M-matrix

Applied Mathematics and Computation, 2011
The authors consider a kind of quadratic matrix equations (QME) arising from an overdamped vibrating system.Under the assumed \(M\)-matrix structure for the coefficient matrices the authors show that Newton's method and Bernoulli's method with an initial zero matrix converge nonincreasingly to the primary solvent of the QME.
Bo Yu 0022   +3 more
openaire   +2 more sources

Accurate solutions of M-matrix algebraic Riccati equations

Numerische Mathematik, 2011
This paper is concerned with the relative perturbation theory and its entrywise relatively accurate numerical solutions of an Riccati equation \(XDX-AX-B+C=0\), where the block-matrix \([{B\atop -C}{-D\atop A}]\) is a nonsingular or an irreducible singular \(M\)-matrix. Such Riccati equation has a unique nonnegative solution.
Jungong Xue, Shufang Xu, Ren-Cang Li
openaire   +2 more sources

M-Matrix Properties

1989
We now proceed to consider some main properties of M-matrices. They are of general interest, and besides they bear some direct relationship to discretization methods as will be seen later on. Referring to the literature, we shall omit the proofs, which are far from being elementary.
openaire   +1 more source

On a quadratic matrix equation associated with an M-matrix

IMA Journal of Numerical Analysis, 2003
The main purpose of this work is to study the quadratic matrix equation \( X^{2}-EX-F=0\) where \(E,F,X\in \mathbb{R}^{n\times n}\), \(E\) is diagonal and \(F\) is an \( M\)-matrix. The main approach that the authors are using for solving the above quadratic matrix equation, is by transforming it into an equation that belongs to a special class of non ...
openaire   +2 more sources

PSD estimation in beamspace using property of M-matrix

2016 IEEE International Workshop on Acoustic Signal Enhancement (IWAENC), 2016
Microphone array Wiener filtering has been studied for practical sound source enhancement in noisy environments. In our previous work, the power spectral density (PSD)-estimation-in-beamspace method was proposed for estimating PSDs of target sources and surrounding noises. Assuming that source signals are uncorrelated with each other, the relationships
Kenta Niwa   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy