Changeset 980120f in git
- Timestamp:
- Jul 19, 2006, 3:48:17 PM (17 years ago)
- Branches:
- (u'spielwiese', '8e0ad00ce244dfd0756200662572aef8402f13d5')
- Children:
- 8901e693207b4cf1f88fd620c1c1314748edaf7d
- Parents:
- 0e13197fe674e9329ab3192e4c0846e36d63f01f
- File:
-
- 1 edited
-
Singular/LIB/zeroset.lib (modified) (11 diffs)
Legend:
- Unmodified
- Added
- Removed
-
Singular/LIB/zeroset.lib
r0e1319 r980120f 1 1 // Last change 12.02.2001 (Eric Westenberger) 2 2 /////////////////////////////////////////////////////////////////////////////// 3 version="$Id: zeroset.lib,v 1.1 5 2006-07-18 15:48:31Singular Exp $";3 version="$Id: zeroset.lib,v 1.16 2006-07-19 13:48:17 Singular Exp $"; 4 4 category="Symbolic-numerical solving"; 5 5 info=" … … 412 412 RETURN: poly 1/f 413 413 ASSUME: basering = Q[x_1,...,x_n,a], ideal mpoly must be defined and != 0 ! 414 NOTE: outdated, use / instead 414 415 " 415 416 { … … 478 479 @end format 479 480 ASSUME: basering = Q[x] or Q(a)[x] 481 NOTE: outdated, use div/mod instead 480 482 EXAMPLE: example Quotient; shows an example 481 483 " … … 515 517 ASSUME: basering = Q[x,a] and ideal mpoly is defined (it might be 0), 516 518 this represents the ring Q(a)[x] together with its minimal polynomial. 519 NOTE: outdated, use div/mod instead 517 520 EXAMPLE: example Quotient; shows an example 518 521 " … … 537 540 RETURN: poly 538 541 ASSUME: basering = Q[x] or Q(a)[x] 542 NOTE: outdated, use mod/reduce instead 539 543 " 540 544 { … … 567 571 ASSUME: basering = Q[x,a] and ideal mpoly is defined (it might be 0), 568 572 this represents the ring Q(a)[x] together with its minimal polynomial. 573 NOTE: outdated, use mod/reduce instead 569 574 " 570 575 { … … 589 594 necessarily monic) 590 595 ASSUME: basering = Q(a)[t] 596 NOTE: outdated, use gcd instead 591 597 EXAMPLE: example EGCD; shows an example 592 598 " … … 620 626 ASSUME: basering = Q[x,a] and ideal mpoly is defined (it might be 0), 621 627 this represents the ring Q(a)[x] together with its minimal polynomial. 628 NOTE: outdated, use gcd instead 622 629 EXAMPLE: example EGCD; shows an example 623 630 " … … 772 779 is Q or a simple extension of Q given by a minpoly. 773 780 NOTE: if basering = Q[t] then this is the built-in @code{factorize} 781 NOTE: outdated, use factorize instead 774 782 EXAMPLE: example Factor; shows an example 775 783 " … … 810 818 ASSUME: basering = Q[x,a], representing Q(a)[x]. An ideal mpoly must 811 819 be defined, representing the minimal polynomial (it might be 0!). 820 NOTE: outdated, use factorize instead 812 821 EXAMPLE: example Factor; shows an example 813 822 " … … 1396 1405 ASSUME: basering = Q[x_1,...,x_n,a] 1397 1406 ideal mpoly must be defined, it might be 0 ! 1407 NOTE: outdated, use reduce instead 1398 1408 " 1399 1409 {
Note: See TracChangeset
for help on using the changeset viewer.
