Results 11 to 20 of about 1,148,447 (292)
On the minimal polynomial of a resolvent [PDF]
Linear Algebra and its Applications, 1987 The connection between the minimal polynomial of an operator and the minimal polynomial of its resolvent is derived. An analogous result is obtained for the minimal polynomials of iterated resolvents.
Elezović, Neven
openaire +4 more sources
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width [PDF]
, 1998 It is known that evaluating the Tutte polynomial, $T(G; x, y)$, of a graph, $G$, is $\#$P-hard at all but eight specific points and one specific curve of the $(x, y)$-plane.
Noble, S D
core +7 more sources
Cointegration, Root Functions and Minimal Bases
Econometrics, 2021 This paper discusses the notion of cointegrating space for linear processes integrated of any order. It first shows that the notions of (polynomial) cointegrating vectors and of root functions coincide.
Massimo Franchi, Paolo Paruolo
doaj +1 more source
APPLICATION OF INCREMENTAL SATISFIABILITY PROBLEM SOLVERS FOR NON-DETERMINISTIC POLYNOMIAL-TIME HARD PROBLEMS AS ILLUSTRATED BY MINIMAL BOOLEAN FORMULA SYNTHESIS PROBLEM [PDF]
Научно-технический вестник информационных технологий, механики и оптики, 2020 Subject of Research. The paper considers a method for solution of the nondeterministic polynomial hard problem (NP-hard problem) of a minimal Boolean formula synthesis from a given truth table.
Konstantin I. Chukharev
doaj +1 more source
Computing Minimal Polynomials of Matrices [PDF]
LMS Journal of Computation and Mathematics, 2008 AbstractWe present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of ann × nmatrix over a finite field that requiresO(n3) field operations andO(n) random vectors, and is well suited for successful practical implementation. The algorithm, and its complexity analysis, use standard algorithms for polynomial and matrix operations. We
Max Neunhöffer, Cheryl E. Praeger
openaire +3 more sources
Embedding of Unimodular Row Vectors
Mathematics, 2023 In this paper, we mainly study the embedding problem of unimodular row vectors, focusing on avoiding the identification of polynomial zeros. We investigate the existence of the minimal syzygy module of the ZLP polynomial matrix and demonstrate that the ...
Tao Wu, Jinwang Liu, Jiancheng Guan
doaj +1 more source
Minimizing polynomial functions [PDF]
, 2003 We compare algorithms for global optimization of polynomial functions in many variables. It is demonstrated that existing algebraic methods (Gröbner bases, resultants, homotopy methods) are dramatically outperformed by a relaxation technique, due to N.Z. Shor and the first author, which involves sums of squares and semidefinite programming.
Pablo A. Parrilo, Bernd Sturmfels
openaire +2 more sources
Polynomial cubic splines with tension properties [PDF]
, 2010 In this paper we present a new class of spline functions with tension properties. These splines are composed by polynomial cubic pieces and therefore are conformal to the standard, NURBS based CAD/CAM ...
Costantini, P. +2 more
core +4 more sources
Drones, 2022 This paper studies the robust formation flying problem for a swarm of drones, which are modeled as uncertain second order systems. By making use of minimal virtual leader information, a fully distributed robust control scheme is proposed, which includes ...
Huanli Gao, Wei Li, He Cai
doaj +1 more source
On computing minimal proper nullspace bases with applications in fault detection [PDF]
, 2011 We discuss computationally efficient and numerically reliable algorithms to compute minimal proper nullspace bases of a rational or polynomial matrix.
Andras Varga, Varga, Andreas
core +1 more source