Results 11 to 20 of about 33,836 (264)
The Kalman filter requires knowledge of the noise statistics; however, the noise covariances are generally unknown. Although this problem has a long history, reliable algorithms for their estimation are scant, and necessary and sufficient conditions for ...
Lingyi Zhang +5 more
doaj +1 more source
Embedding of Unimodular Row Vectors
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
Computing Minimal Polynomials of Matrices [PDF]
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
Minimizing polynomial functions [PDF]
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
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
This paper consists of proposal of two constructions of balanced Boolean functions by using powers of primitive elements ...
Dheeraj Kumar Sharma, Rajoo Pandey
doaj +1 more source
A Computational Model for q-Bernstein Quasi-Minimal Bézier Surface
A computational model is presented to find the q-Bernstein quasi-minimal Bézier surfaces as the extremal of Dirichlet functional, and the Bézier surfaces are used quite frequently in the literature of computer science for computer graphics and the ...
Daud Ahmad +5 more
doaj +1 more source
Formalizing Termination Proofs under Polynomial Quasi-interpretations [PDF]
Usual termination proofs for a functional program require to check all the possible reduction paths. Due to an exponential gap between the height and size of such the reduction tree, no naive formalization of termination proofs yields a connection to the
Naohi Eguchi
doaj +1 more source
Pseudorandom sequences with large linear complexity have been widely applied in electronic countermeasures, mobile communication and cryptography.
Jiang Ma +3 more
doaj +1 more source
Minimal polynomials of singular moduli [PDF]
Given a properly normalized parametrization of a genus-0 modular curve, the complex multiplication points map to algebraic numbers called singular moduli. In both cases there are known algorithms for algebraically computing the rational norms of the singular moduli without relying on the the recognition of a decimal or
openaire +2 more sources

