| Home | Trees | Indices | Help |
|---|
|
|
Univariate Polynomials
AUTHORS:
-- William Stein: first version
-- Martin Albrecht: Added singular coercion.
-- David Harvey: split off polynomial_integer_dense_ntl.pyx (2007-09)
-- Robert Bradshaw: split off polynomial_modn_dense_ntl.pyx (2007-09)
TESTS:
We test coercion in a particularly complicated situation:
sage: W.<w>=QQ['w']
sage: WZ.<z>=W['z']
sage: m = matrix(WZ,2,2,[1,z,z,z^2])
sage: a = m.charpoly()
sage: R.<x> = WZ[]
sage: R(a)
x^2 + ((-1)*z^2 - 1)*x
|
|||
|
Polynomial_generic_sparse A generic sparse polynomial. |
|||
| Polynomial_generic_domain | |||
| Polynomial_generic_field | |||
|
Polynomial_generic_sparse_field EXAMPLES:... |
|||
| Polynomial_generic_dense_field | |||
|
Polynomial_rational_dense A dense polynomial over the rational numbers. |
|||
| Polynomial_padic_generic_dense | |||
| Polynomial_padic_ring_dense | |||
| Polynomial_padic_field_dense | |||
| Polynomial_padic_ring_lazy_dense | |||
| Polynomial_padic_field_lazy_dense | |||
| Home | Trees | Indices | Help |
|---|
| Generated by Epydoc 3.0beta1 on Thu Jul 17 04:23:28 2008 | http://epydoc.sourceforge.net |