Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Minimal polynomial (linear algebra)

Known as: Algebraic number minimal polynomial, Minimum polynomial, Existence of the minimal polynomial 
In linear algebra, the minimal polynomial μA of an n × n matrix A over a field F is the monic polynomial P over F of least degree such that P(A) = 0… Expand
Wikipedia

Related topics

Related topics

8 relations
Adjacency matrixArnoldi iterationBlock Wiedemann algorithmCharacteristic polynomial
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
Approximate Factorization Constraint Preconditioners for Saddle-Point Matrices
We consider the application of the conjugate gradient method to the solution of large, symmetric indefinite linear systems… Expand
  • table 5.1
  • table 5.2
  • table 5.3
  • table 5.4
  • table 5.5
Is this relevant?
2000
2000
Analysis of the finite precision bi-conjugate gradient algorithm for nonsymmetric linear systems
In this paper we analyze the bi-conjugate gradient algorithm in finite precision arithmetic, and suggest reasons for its often… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Constraint Preconditioning for Indefinite Linear Systems
The problem of finding good preconditioners for the numerical solution of indefinite linear systems is considered. Special… Expand
  • figure 2.1
  • table 5.1
  • table 5.2
  • table 5.3
Is this relevant?
Highly Cited
1996
Highly Cited
1996
GMRES and the minimal polynomial
We present a qualitative model for the convergence behaviour of the Generalised Minimal Residual (GMRES) method for solving… Expand
Is this relevant?
1995
1995
Coefficient Fields of Solutions in Kovacic's Algorithm
In this paper we prove the following theorem: if the Riccati equation w? + w2 = R(x), R ? Q(x), has algebraic solutions, then… Expand
Is this relevant?
1991
1991
Identification for the control of MIMO industrial processes
A procedure for the identification of industrial processes with the intention of control system design is proposed, discussed… Expand
  • figure 4.1
  • figure 5.1
  • figure 5.2
  • figure 5.3
  • figure 5.4
Is this relevant?
Highly Cited
1987
Highly Cited
1987
The complexity of Boolean functions
Introduction to the Theory of Boolean Functions and Circuits. The Minimimization of Boolean Functions. The Design of Efficient… Expand
  • figure 3.1
  • figure 4.1
  • figure 8.1
  • figure 4.1
  • figure 4.2
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Solving sparse linear equations over finite fields
A "coordinate recurrence" method for solving sparse systems of linear equations over finite fields is described. The algorithms… Expand
Is this relevant?
1982
1982
Multiplexed Sequences: Some Properties of the Minimum Polynomial
In recent years considerable interest has been shown in the generation of binary sequences which have good randomness properties… Expand
Is this relevant?
Highly Cited
1967
Highly Cited
1967
Intersection matrices for finite permutation groups
In this paper we study finite transitive groups G acting on a set Q. The results, which are trivial for multiply-transitive… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE