Skip to search formSkip to main contentSkip to account menu

Monic polynomial

Known as: Monic 
In algebra, a monic polynomial is a univariate polynomial in which the leading coefficient (the nonzero coefficient of highest degree) is equal to 1… 
Wikipedia (opens in a new tab)

Related topics

Related topics

37 relations
Arnoldi iterationBernstein–Sato polynomialCasus irreducibilisCharacteristic polynomial

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Pencils of quadrics and Jacobians of hyperelliptic curves
Using pencils of quadrics, we study a construction of torsors of Jacobians of hyperelliptic curves twice of which is Pic. We then… 
2013
2013
Monic Chebyshev Approximations for Solving Optimal Control Problem with Volterra Integro Differential Equations
In this paper, we formulate and analyze a new model for solving optimal control problems governed by Volterra integro-diffe… 
Highly Cited
2005
Highly Cited
2005
An information-theoretic framework for deriving canonical decision-feedback receivers in Gaussian channels
A framework is presented that allows a number of known results relating feedback equalization, linear prediction, and mutual… 
2001
2001
Quartic-Spline Collocation Methods for Fourth-Order Two-Point Boundary Value Problems
Quartic-Spline Collocation Methods for Fourth-Order Two-Point Boundary Value Problems Ying Zhu Mas ter of Science Graduate… 
2001
2001
ON ℚ-DERIVED POLYNOMIALS
Abstract It is known that ℚ-derived univariate polynomials (polynomials defined over ℚ, with the property that they and all their… 
2000
2000
Bias-free adaptive IIR filtering
We present a new family of algorithms that solve the bias problem in the equation-error based adaptive infinite impulse response… 
1997
1997
Stimulated emission of phonons in an acoustical cavity
Stimulated emission is studied of phonons resonant with the metastable Zeeman-split Ē(E) doublet in ruby. Initial population… 
1985
1985
Monic polynomials and generating ideals efficiently
If I is an ideal containing a monic polynomial in R[T] where R is a semilocal ring, then I and 1/12 require the same minimal… 
1974
1974
Computational aspects of Hensel-type univariate polynomial greatest common divisor algorithms
Two Hensel-type univariate polynomial Greatest Common Divisor (GCD) algorithms are presented and compared. The regular linear… 
1968
1968
ON CONSTRUCTING DISTRIBUTION FUNCTIONS; WITH APPLICATIONS TO LOMMEL POLYNOMIALS AND BESSEL FUNCTIONS
where the polynomials On(x) are recursively defined by: - 1(x) = 0, O(x) = 1, and (I-A) n+ (x) = (x - anX)-(x) - bnn- i(X) (n > 0… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)