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… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

Computational problem certificates are additional data structures for each output, which can be used by a---possibly randomized… (More)

Is this relevant?

2003

2003

- Thanh Minh Hoang, Thomas Thierauf
- Theor. Comput. Sci.
- 2003

We investigate the complexity of 1) computing the characteristic polynomial, the minimal polynomial, and all the invariant… (More)

Is this relevant?

Review

2002

Review

2002

- J. P. Dumas, Thomas. N. Gautier, +5 authors Jean-Guillaume Dumas
- 2002

Base Class pointers Concrete Field virtual functions Field Archetype Linbox field archetype Figure 1: Black box design. The… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Marc Giusti, Grégoire Lecerf, Bruno Salvy
- J. Complexity
- 2001

Given a system of polynomial equations and inequations with coefficients in the field of rational numbers, we show how to compute… (More)

Is this relevant?

2001

2001

- Avram Sidi
- 2001

The minimal polynomial extrapolation (MPE) and reduced rank extrapolation (RRE) are two very effective techniques that have been… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Erik Frisk, Mattias Nyberg
- Automatica
- 2001

A fundamental part of a fault diagnosis system is the residual generator. Here a new method, the minimal polynomial basis… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Malcolm F. Murphy, Gene H. Golub, Andrew J. Wathen
- SIAM J. Scientific Computing
- 2000

Preconditioners are often conceived as approximate inverses. For nonsingular indeenite matrices of saddle-point (or KKT) form, we… (More)

Is this relevant?

1999

1999

- Erik Frisk, Mattias Nyberg
- 1999 European Control Conference (ECC)
- 1999

A fundamental part of a fault diagnosis system is the residual generator. Design of residual generators to achieve perfect… (More)

Is this relevant?

1992

1992

- Ilan Adler, Peter A. Beling
- Algorithmica
- 1992

We derive an algorithm based on the ellipsoid method that solves linear programs whose coefficients are real algebraic numbers… (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- Douglas H. Wiedemann
- IEEE Trans. Information Theory
- 1986

Ahstruct-A “coordinate recurrence” method for solving sparse systems of linear equations over finite fields is described. The… (More)

Is this relevant?