Minimal polynomial (field theory)

Known as: Extension field minimal polynomial, Minimal polynomial 
In field theory, a branch of mathematics, a minimal polynomial is defined relative to a field extension E/F and an element of the extension field E… (More)
Wikipedia

Related topics

Related topics

17 relations
BCH codeBerlekamp–Massey algorithmConway polynomial (finite fields)Cyclotomic polynomial
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
A RELAXED HSS PRECONDITIONER FOR SADDLE POINT PROBLEMS FROM MESHFREE DISCRETIZATION
In this paper, a relaxed Hermitian and skew-Hermitian splitting (RHSS) preconditioner is proposed for saddle point problems from… (More)
  • figure 2.1
  • figure 4.1
  • table 4.2
  • figure 4.2
  • table 4.3
Is this relevant?
2010
2010
The Berlekamp-Massey Algorithm via Minimal Polynomials
We present a recursive minimal polynomial theorem for finite sequences over a commutative integral domain D. This theorem is… (More)
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2009
2009
On-line structured subspace identification with application to switched linear systems
This article is concerned with the identification of switched linear multiple-inputs–multiple-outputs state-space systems in a… (More)
  • table 1
  • figure 1
  • figure 3
  • figure 2
  • figure 4
Is this relevant?
2005
2005
Numerical computation of minimal polynomial bases: A generalized resultant approach
We propose a new algorithm for the computation of a minimal polynomial basis of the left kernel of a given polynomial matrix F(s… (More)
Is this relevant?
2005
2005
A complete complexity classification of the role assignment problem
In social network theory a simple graph G is called R-role assignable, if there is a locally surjective homomorphism from G to a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
A Gröbner Free Alternative for Polynomial System Solving
Given a system of polynomial equations and inequations with coefficients in the field of rational numbers, we show how to compute… (More)
  • table I
Is this relevant?
1998
1998
An O(n3) Algorithm for the Frobenius Normal Form
We describe an O(n) eld operations algorithm for computing the Frobenius normal form of an n n matrix. As applications we get O(n… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
GMREs and the minimal polynomial
We present bounds on the convergence rate of the Generalized Minimal Residual (GMRES) method for solving nonsingular systems of… (More)
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Extrapolation methods for vector sequences
This is an expository paper that describes and compares five methods for extrapolating to the limit (or anti-limit) of a vector… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 7
Is this relevant?
1984
1984
The mean values of totally real algebraic integers
Let Mp'a) be thepth root of the mean absolute values of the/?th powers of a totally real algebraic integer a. For each fixedp > 0… (More)
  • table 2
  • table 3
  • table 4
Is this relevant?