منابع مشابه
Customizable triangular factorizations of matrices
Customizable triangular factorizations of matrices find their applications in computer graphics and lossless transform coding. In this paper, we prove that any N ×N nonsingular matrix A can be factorized into 3 triangular matrices, A = PLUS, where P is a permutation matrix, L is a unit lower triangular matrix, U is an upper triangular matrix of which the diagonal entries are customizable and ca...
متن کاملFACTORIZATIONS FOR nD POLYNOMIAL MATRICES*
In this paper, a constructive general matrix factorization scheme is developed for extracting a nontrivial factor from a given nD (n > 2) polynomial matrix whose maximal order minors satisfy certain conditions. It is shown that three classes of nD polynomial matrices admit this kind of general matrix factorization. It turns out that minor prime factorization and determinantal factorization are ...
متن کاملComputation of Coprime Factorizations of Rational Matrices
We propose a numerically reliable state space algorithm for computing coprime factorizations of rational matrices with factors having poles in a given stability domain. The new algorithm is based on a recursive generalized Schur technique for poles dislocation by means of proportional-derivative state feedback. The proposed algorithm is generally applicable regardless the underlying descriptor ...
متن کاملOn twisted factorizations of block tridiagonal matrices
Non-symmetric and symmetric twisted block factorizations of block tridiagonal matrices are discussed. In contrast to non-blocked factorizations of this type, localized pivoting strategies can be integrated which improves numerical stability without causing any extra fill-in. Moreover, the application of such factorizations for approximating an eigenvector of a block tridiagonal matrix, given an...
متن کاملCholesky-like Factorizations of Skew-symmetric Matrices
As will be shown in this paper, there always exists an R such that (1.1) holds. We present a stable O(n3) algorithm that computes an R that has the form of a permuted triangular matrix. Our motivation comes from eigenvalue problems with Hamiltonian structure. A matrix H ∈ R is said to be Hamiltonian if (JH) = JH and skew-Hamiltonian if (JH) = −JH . EXAMPLE 1. The study of corner singularities i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1997
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(97)00150-7