Deterministic computation of the weak Popov form
of an operator matrix
Received: 09 Nov 2026 Accepted: 13 Nov 2026
Published: 2026, vol. 30, issue 4, pp. 459–462
Abstract
For first-order differential operator matrices with a nonsingular leading matrix, a deterministic algorithm dWPF is proposed that constructs a weak Popov form of minimum total coefficient degree among the results of WPF. The optimum for one column is given by a minimum spanning tree; columns are coordinated by branch and bound. The results are compared with WPF implementations in SageMath and AbstractAlgebra.jl.
Keywords: symbolic computation, operator matrices, weak Popov form, coefficient growth.
BibTeX
@article{IS-Nosov2026,
author = {Nosov, Anatoly Vladimirovich},
title = {{Deterministic computation of the weak Popov form\\of an operator matrix}},
journal = {Intelligent Systems. Theory and Applications},
year = {2026},
volume = {30},
number = {4},
pages = {459--462},
}
AMSBIB
\Bibitem{IS-Nosov2026}
\by A.\,V.~Nosov
\paper Deterministic computation of the weak Popov form\\of an operator matrix
\jour Intelligent Systems. Theory and Applications
\yr 2026
\vol 30
\issue 4
\pages 459--462
\lang In Russian
Published under
Creative Commons Attribution 4.0 International (CC BY 4.0)
RU