Results 201 to 210 of about 1,777 (237)

Factorization of Singular Matrices

Proceedings of the American Mathematical Society, 1992
We give a necessary and sufficient condition that a singular square matrix A A over an arbitrary field can be written as a product of two matrices with prescribed eigenvalues. Except when A A is a 2 × 2 2 \times 2 nonzero nilpotent, the condition is that the number of zeros ...
Sourour, A. R., Tang, Kunikyo
openaire   +1 more source

Factorization of matrices with grades

Fuzzy Sets and Systems, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Radim Belohlávek, Vilém Vychodil
openaire   +1 more source

The Antitriangular Factorization of Symmetric Matrices

SIAM Journal on Matrix Analysis and Applications, 2013
Indefinite symmetric matrices occur in many applications, such as optimization, least squares problems, partial differential equations and variational problems. In these applications one is often interested in computing a factorization of the indefinite matrix that puts into evidence the inertia of the matrix or possibly provides an estimate of its ...
Mastronardi Nicola, Van Dooren Paul
openaire   +4 more sources

On the factorization of rational matrices

IEEE Transactions on Information Theory, 1961
Many problems in electrical engineering, such as the synthesis of linear n ports and the detection and filtration of multivariable systems corrupted by stationary additive noise, depend for their successful solution upon the factorization of a matrix-valued function of a complex variable p .
openaire   +1 more source

On the factorization of scattering matrices, chain matrices and transfer matrices

Annali di Matematica Pura ed Applicata, 1975
Sia J una matrice (finita) Hermitiana di elementi reali, tale che J 2=1. Una matrice S(p) (p=x+iy) e detta J-contrattiva reale, se per essa valgono, nel semipianoRe p>0, le relazioni(0.1), (0.2) e (0.5). Denotiamo col simbolo CRJ la famiglia di queste matrici.
openaire   +2 more sources

Parallel Factorizations for Tridiagonal Matrices

SIAM Journal on Numerical Analysis, 1993
Summary: The authors analyze the problem of solving tridiagonal linear systems on parallel computers. A wide class of efficient parallel solvers is derived by considering different parallel factorizations of partitioned matrices. These solvers have a minimum requirement of data transmission. In fact, communication is only needed for solving a ``reduced
P. AMODIO, BRUGNANO, LUIGI, T. POLITI
openaire   +3 more sources

Factoring matrices into the product of two matrices

BIT Numerical Mathematics, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Incomplete Factorizations of Matrices and Connections with H-Matrices

SIAM Journal on Numerical Analysis, 1980
There has been much recent interest in the use of incomplete factorizations of matrices, in conjunction with applications of the generalized conjugate gradient method, for approximating solutions of large sparse systems of linear equations. Underlying many of these recent developments is the theory of H-matrices, introduced by A. M. Ostrowski.
Varga, R. S., Saff, E. B., Mehrmann, V.
openaire   +2 more sources

On the LU factorization of Hessenberg matrices

IEEE Transactions on Systems, Man, and Cybernetics, 1989
The LU factorization of the Hessenberg matrix is explicitly presented. The matrix is recognized for reliable and robust numerical computation. >
openaire   +1 more source

Factorization of Matrices With Grades With Overcovering

IEEE Transactions on Fuzzy Systems, 2023
Radim Belohlávek, Marketa Trneckova
openaire   +1 more source