factor/libs/math/polynomials.factor

77 lines
2.1 KiB
Factor
Raw Permalink Normal View History

IN: polynomials-internals
2006-10-06 01:03:30 -04:00
USING: arrays kernel sequences vectors math math-internals namespaces arrays
sequences-contrib ;
2005-10-19 23:19:42 -04:00
! Polynomials are vectors with the highest powers on the right:
! { 1 1 0 1 } -> 1 + x + x^3
2005-11-01 01:28:29 -05:00
! { } -> 0
2006-09-28 01:11:47 -04:00
: 2pad-left ( p p n -- p p ) 0 [ pad-left swap ] 2keep pad-left swap ;
: 2pad-right ( p p n -- p p ) 0 [ pad-right swap ] 2keep pad-right swap ;
: pextend ( p p -- p p ) 2dup [ length ] 2apply max 2pad-right ;
: pextend-left ( p p -- p p ) 2dup [ length ] 2apply max 2pad-left ;
: unempty ( seq -- seq ) dup empty? [ drop { 0 } ] when ;
: 2unempty ( seq seq -- seq seq ) [ unempty ] 2apply ;
2005-10-19 23:19:42 -04:00
IN: math-contrib
: p= ( p p -- ? ) pextend = ;
2005-10-19 23:19:42 -04:00
2006-10-19 16:38:00 -04:00
: ptrim ( p -- p ) dup length 1 = [ [ zero? ] rtrim* ] unless ;
2005-10-19 23:19:42 -04:00
: 2ptrim ( p p -- p p ) [ ptrim ] 2apply ;
: p+ ( p p -- p ) pextend v+ ;
: p- ( p p -- p ) pextend v- ;
: n*p ( n p -- n*p ) n*v ;
2005-10-19 23:19:42 -04:00
! convolution
: pextend-conv ( p p -- p p )
#! extend to: p_m + p_n - 1
2006-09-28 01:11:47 -04:00
2dup [ length ] 2apply + 1- 2pad-right [ >vector ] 2apply ;
2005-10-19 23:19:42 -04:00
: p* ( p p -- p )
#! Multiply two polynomials.
2unempty pextend-conv <reversed> dup length
[ over length pick <slice> pick [ * ] 2map sum ] map 2nip reverse ;
2005-10-19 23:19:42 -04:00
: p-sq ( p -- p-sq )
dup p* ;
IN: polynomials-internals
2005-10-19 23:19:42 -04:00
: pop-front ( seq -- seq )
2006-10-06 01:03:30 -04:00
1 tail-slice ;
2005-10-19 23:19:42 -04:00
: /-last ( seq seq -- a )
#! divide the last two numbers in the sequences
2006-09-28 01:11:47 -04:00
[ peek ] 2apply / ;
: p/mod-setup ( p p -- p p n )
2ptrim 2dup [ length ] 2apply - dup 1 < [ drop 1 ] when
dup >r over length + 0 pad-left pextend r> 1+ ;
2005-10-19 23:19:42 -04:00
: (p/mod)
2006-09-28 01:11:47 -04:00
2dup /-last 2dup , n*p swapd p- >vector dup pop drop swap pop-front ;
2005-10-19 23:19:42 -04:00
IN: math-contrib
2005-10-19 23:19:42 -04:00
: p/mod
2006-09-28 01:11:47 -04:00
p/mod-setup [ [ (p/mod) ] times ] V{ } make
reverse nip swap 2ptrim pextend ;
2005-10-19 23:19:42 -04:00
: (pgcd) ( b a y x -- a d )
dup V{ 0 } clone p= [
2005-10-19 23:19:42 -04:00
drop nip
] [
tuck p/mod >r pick p* swap >r swapd p- r> r> (pgcd)
] if ;
2006-09-28 01:11:47 -04:00
: pgcd ( p p -- p q )
swap V{ 0 } clone V{ 1 } clone 2swap (pgcd) [ >array ] 2apply ;
2005-10-19 23:19:42 -04:00
: pdiff ( p -- p' )
#! Polynomial derivative.
2006-01-17 03:08:47 -05:00
dup length v* { 0 } ?head drop ;
2006-01-17 03:08:47 -05:00
: polyval ( p x -- p[x] )
2005-12-07 19:43:29 -05:00
#! Evaluate a polynomial.
2006-01-17 03:08:47 -05:00
>r dup length r> powers v. ;