Ifact
  Home FAQ Contact Sign in
 
Advanced search
MATCHING GROUPS



more...
POPULAR GROUPS

more...

found 6 articles for 0.000 sec
Re: Automatically transform or expand do loop in a subroutine     

Group: comp.lang.fortran · Group Profile · Search for Ifact in comp.lang.fortran
Author: glen herrmannsfeldt
Date: Jan 31, 2008 18:05

...similar, although it was called "compile-time computations" and not a preprocessor: .ifact = 1 .do i = 1, 5 .ifact = ifact*i A(i) = B(i) / ifact .end do This would turn into the following 5 lines: A(1...(4) / 24 A(5) = B(5) / 120 The variables ifact and i are both compile-time varaibles and don't even exist ...
Show full article (1.33Kb) · Show article thread
Re: Automatically transform or expand do loop in a subroutine     

Group: comp.lang.fortran · Group Profile · Search for Ifact in comp.lang.fortran
Author: James Giles
Date: Jan 31, 2008 12:31

... something similar, although it was called "compile-time computations" and not a preprocessor: .ifact = 1 .do i = 1, 5 .ifact = ifact*i A(i) = B(i) / ifact .end do This would turn into the following 5 lines: A(1) =...= B(4) / 24 A(5) = B(5) / 120 The variables ifact and i are both compile-time varaibles and don't even exist at ...
Show full article (1.45Kb) · Show article thread
Re: (very) slow recursive function     

Group: comp.lang.fortran · Group Profile · Search for Ifact in comp.lang.fortran
Author: robin
Date: Dec 26, 2006 15:09

.... 247). ! 'Ordinary' Legendre polynomals are given for m=0. ! ! Calls: pure recursive function ifact -> double factorial n!! implicit none real(dp) :: Plm real(dp), intent(in)...m) then Plm = (-1)**m (-1)**M is an inefficient way to change sign. * ifact(2.0d0*m-1.0d0) 2.0D0*M is an inefficient way to double M (...
Show full article (2.46Kb) · Show article thread
Re: (very) slow recursive function     

Group: comp.lang.fortran · Group Profile · Search for Ifact in comp.lang.fortran
Author: mecej4
Date: Oct 30, 2006 08:09

.... 247). ! 'Ordinary' Legendre polynomals are given for m=0. ! ! Calls: pure recursive function ifact -> double factorial n!! implicit none real(dp) :: Plm real(dp), intent(in)... integer, intent(in) :: l if(l == m) then Plm = (-1)**m * ifact(2.0d0*m-1.0d0) * (1.0d0-x**2)**(m/2.0d0) elseif(...
Show full article (2.83Kb) · Show article thread
Re: (very) slow recursive function     

Group: comp.lang.fortran · Group Profile · Search for Ifact in comp.lang.fortran
Author: Louis Krupp
Date: Oct 30, 2006 00:34

...' Legendre polynomals are given for m=0. ! ! Calls: pure recursive function ifact -> double factorial n!! implicit none real(dp) :: Plm... l if(l == m) then Plm = (-1)**m * ifact(2.0d0*m-1.0d0) * (1.0d0-x**2)**(m... once for (x, m, l-1). Then there's ifact; if you're computing the factorial recursively, that will slow ...
Show full article (3.02Kb) · Show article thread
(very) slow recursive function     

Group: comp.lang.fortran · Group Profile · Search for Ifact in comp.lang.fortran
Author: Ralf Schaa
Date: Oct 29, 2006 18:22

... p. 247). ! 'Ordinary' Legendre polynomals are given for m=0. ! ! Calls: pure recursive function ifact -> double factorial n!! implicit none real(dp) :: Plm real(dp), intent(in) :: x...in) :: m integer, intent(in) :: l if(l == m) then Plm = (-1)**m * ifact(2.0d0*m-1.0d0) * (1.0d0-x**2)**(m/2.0d0) elseif(l ==...
Show full article (1.81Kb)