共查询到20条相似文献,搜索用时 15 毫秒
1.
To solving multiparameter problems of algebra. 7. The PG-q factorization method and its applications
V. N. Kublanovskaya 《Journal of Mathematical Sciences》2006,137(3):4844-4851
The paper continues the development of rank-factorization methods for solving certain algebraic problems for multi-parameter
polynomial matrices and introduces a new rank factorization of a q-parameter polynomial m × n matrix F of full row rank (called
the PG-q factorization) of the form F = PG, where
is the greatest left divisor of F; Δ
i
(k)
i is a regular (q-k)-parameter polynomial matrix the characteristic polynomial of which is a primitive polynomial over the
ring of polynomials in q-k-1 variables, and G is a q-parameter polynomial matrix of rank m. The PG-q algorithm is suggested,
and its applications to solving some problems of algebra are presented. Bibliography: 6 titles.
__________
Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 323, 2005, pp. 150–163. 相似文献
2.
V. N. Kublanovskaya 《Journal of Mathematical Sciences》2006,137(3):4835-4843
For a q-parameter polynomial m × n matrix F of rank ρ, solutions of the equation Fx = 0 at points of the spectrum of the matrix
F determined by the (q −1)-dimensional solutions of the system Z[F] = 0 are considered. Here, Z[F] is the polynomial vector
whose components are all possible minors of order ρ of the matrix F. A classification of spectral pairs in terms of the matrix
A[F], with which the vector Z[F] is associated, is suggested. For matrices F of full rank, a classification and properties
of spectral pairs in terms of the so-called levels of heredity of points of the spectrum of F are also presented. Bibliography:
4 titles.
__________
Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 323, 2005, pp. 132–149. 相似文献
3.
V. N. Kublanovskaya 《Journal of Mathematical Sciences》2008,150(2):1982-1988
The paper considers the problem of computing zeros of scalar polynomials in several variables. The zeros of a polynomial are
subdivided into the regular (eigen-and mixed) zeros and the singular ones. An algorithm for computing regular zeros, based
on a decomposition of a given polynomial into a product of primitive polynomials, is suggested. The algorithm is applied to
solving systems of nonlinear algebraic equations. Bibliography: 5 titles.
__________
Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 346, 2007, pp. 119–130. 相似文献
4.
V. N. Kublanovskaya 《Journal of Mathematical Sciences》2007,141(6):1654-1662
A new method (the RP-q method) for factorizing scalar polynomials in q variables and q-parameter polynomial matrices (q ≥
1) of full rank is suggested. Applications of the algorithm to solving systems of nonlinear algebraic equations and some spectral
problems for a q-parameter polynomial matrix F (such as separation of the eigenspectrum and mixed spectrum of F, computation
of bases with prescribed spectral properties of the null-space of polynomial solutions of F, and computation of the hereditary
polynomials of F) are considered. Bibliography: 10 titles.
__________
Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 334, 2006, pp. 149–164. 相似文献
5.
V. N. Kublanovskaya 《Journal of Mathematical Sciences》2008,150(2):1989-1997
For a general multiparameter polynomial matrix
, solution of the equation
at points of the finite spectrum of
is considered. Points of the spectrum of
are classified in terms of solutions of the determinantal system of nonlinear algebraic equations and also in terms of zeros
of certain scalar polynomials (in particular, the characteristic polynomial of the matrix). Algorithms for computing points
of the finite regular spectrum of the matrix and the corresponding vectors are presented. Bibliography: 7 titles.
__________
Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 346, 2007, pp. 131–148. 相似文献
6.
V. N. Kublanovskaya 《Journal of Mathematical Sciences》2005,127(3):2016-2023
Methods for computing polynomials (complete polynomials) whose zeros form cylindrical manifolds of the regular spectrum of a q-parameter polynomial matrix in the space q are considered. Based on the method of partial relative factorization of matrices, new methods for computing cylindrical manifolds are suggested. The W and V methods, previously proposed for computing complete polynomials of q-parameter polynomial matrices whose regular spectrum is independent of one of the parameters, are extended to a wider class of matrices. Bibliography: 4 titles._______Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 296, 2003, pp. 108–121. 相似文献
7.
V. N. Kublanovskaya 《Journal of Mathematical Sciences》2007,141(6):1663-1667
A new method (the ΨF-q method) for computing the invariant polynomials of a q-parameter (q ≥ 1) polynomial matrix F is suggested.
Invariant polynomials are computed in factored form, which permits one to analyze the structure of the regular spectrum of
the matrix F, to isolate the divisors of each of the invariant polynomials whose zeros belong to the invariant polynomial
in question, to find the divisors whose zeros belong to at least two of the neighboring invariant polynomials, and to determine
the heredity levels of points of the spectrum for each of the invariant polynomials. Applications of the ΨF-q method to representing
a polynomial matrix F(λ) as a product of matrices whose spectra coincide with the zeros of the corresponding divisors of the
characteristic polynomial and, in particular, with the zeros of an arbitrary invariant polynomial or its divisors are considered.
Bibliography: 5 titles.
__________
Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 334, 2006, pp. 165–173. 相似文献
8.
V. B. Khazanov 《Journal of Mathematical Sciences》2007,141(6):1690-1700
An approach to solving spectral problems for multiparameter polynomial matrices based on passing to accompanying pencils of
matrices is described. Also reduction of spectral problems for multiparameter pencils of complex matrices to the corresponding
real problems is considered. Bibliography: 6 titles.
__________
Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 323, 2006, pp. 212–231. 相似文献
9.
10.
11.
The paper continues the series of papers devoted to surveying and developing methods for solving algebraic problems for two-parameter
polynomial and rational matrices of general form. It considers linearization methods, which allow one to reduce the problem
of solving an equation F(λ, μ)x = 0 with a polynomial two-parameter matrix F(λ, μ) to solving an equation of the form D(λ,
μ)y = 0, where D(λ, μ) = A(μ)-λB(μ) is a pencil of polynomial matrices. Consistent pencils and their application to solving
spectral problems for the matrix F(λ, μ) are discussed. The notion of reducing subspace is generalized to the case of a pencil
of polynomial matrices. An algorithm for transforming a general pencil of polynomial matrices to a quasitriangular pencil
is suggested. For a pencil with multiple eigenvalues, algorithms for computing the Jordan chains of vectors are developed.
Bibliography: 8 titles.
Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 359, 2008, pp. 166–207. 相似文献
12.
V. N. Kublanovskaya 《Journal of Mathematical Sciences》2009,157(5):731-752
This paper starts a series of publications devoted to surveying and developing methods for solving algebraic problems for
two-parameter polynomial and rational matrices. The paper considers rank factorizations and, in particular, the relatively
irreducible and ΔW-2 factorizations, which are used in solving spectral problems for two-parameter polynomial matrices F(λ,
μ). Algorithms for computing these factorizations are suggested and applied to computing points of the regular, singular,
and regular-singular spectra and the corresponding spectral vectors of F(λ, μ). The computation of spectrum points reduces
to solving algebraic equations in one variable. A new method for computing spectral vectors for given spectrum points is suggested.
Algorithms for computing critical points and for constructing a relatively free basis of the right null-space of F(λ, μ) are
presented. Conditions sufficient for the existence of a free basis are established, and algorithms for checking them are provided.
An algorithm for computing the zero-dimensional solutions of a system of nonlinear algebraic equations in two variables is
presented. The spectral properties of the ΔW-2 method are studied. Bibliography: 4 titles.
Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 359, 2008, pp. 107–149. 相似文献
13.
The paper continues the series of papers devoted to surveying and developing methods for solving problems for two-parameter
polynomial and rational matrices. Different types of factorizations of two-parameter rational matrices (including irreducible
and minimal ones), methods for computing them, and their applications to solving spectral problems are considered. Bibliography:
6 titles. 相似文献
14.
V. N. Kublanovskaya 《Journal of Mathematical Sciences》2009,157(5):753-760
This paper is one of the series of survey papers dedicated to the development of methods for solving problems of algebra for
two-parameter polynomial matrices of general form. The paper considers the AB-algorithm and the ∇V-2 factorization algorithm,
together with their applications. Bibliography: 4 titles.
Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 359, 2008, pp. 150–165. 相似文献
15.
V. N. Kublanovskaya 《Journal of Mathematical Sciences》2010,165(5):562-573
This paper continues the series of publications devoted to surveying and developing methods for solving the following problems
for a two-parameter matrix F (λ, μ) of general form: exhausting points of the mixed regular spectrum of F (λ, μ); performing operations on polynomials in two variables (computing the GCD and LCM of a few polynomials, division of
polynomials, and factorization); computing a minimal basis of the null-space of polynomial solutions of the matrix F (λ, μ) and separation of its regular kernel; inversion and pseudo in version of polynomial and rational matrices in two variables,
and solution of systems of nonlinear algebraic equations in two unknowns. Most of the methods suggested are based on rank
factorizations of a two-parameter polynomial matrix and on the method of hereditary pencils. Bibliography: 8 titles. 相似文献
16.
V. N. Kublanovskaya 《Journal of Mathematical Sciences》2011,176(1):83-92
The paper discusses the method of hereditary pencils for computing points of the regular and singular spectra of a general
two-parameter polynomial matrix. The method allows one to reduce the spectral problems considered to eigenproblems for polynomial
matrices and pencils of constant matrices. Algorithms realizing the method are suggested and justified. Bibliography: 4 titles. 相似文献
17.
18.
The paper discusses the method of rank factorization for solving spectral problems for two-parameter polynomial matrices.
New forms of rank factorization, which are computed using unimodular matrices only, are suggested. Applications of these factorizations
to solving spectral problems for two-parameter polynomial matrices of both general and special forms are presented. In particular,
matrices free of the singular spectrum are considered. Conditions sufficient for a matrix to be free of the singular spectrum
and also conditions sufficient for a basis matrix of the null-space to have neither the finite regular nor the finite singular
spectrum are provided. Bibliography: 3 titles. 相似文献
19.