! C02AFF Example Program Text ! Mark 23 Release. NAG Copyright 2011. MODULE c02affe_mod ! C02AFF Example Program Module: ! Parameters ! .. Implicit None Statement .. IMPLICIT NONE ! .. Parameters .. INTEGER, PARAMETER :: nin = 5, nout = 6 LOGICAL, PARAMETER :: scal = .TRUE. END MODULE c02affe_mod PROGRAM c02affe ! C02AFF Example Main Program ! .. Use Statements .. USE c02affe_mod, ONLY : nout ! .. Implicit None Statement .. IMPLICIT NONE ! .. Executable Statements .. WRITE (nout,*) 'C02AFF Example Program Results' CALL ex1 CALL ex2 CONTAINS SUBROUTINE ex1 ! .. Use Statements .. USE nag_library, ONLY : c02aff, nag_wp USE c02affe_mod, ONLY : nin, scal ! .. Implicit None Statement .. IMPLICIT NONE ! .. Local Scalars .. INTEGER :: i, ifail, n ! .. Local Arrays .. REAL (KIND=nag_wp), ALLOCATABLE :: a(:,:), w(:), z(:,:) ! .. Executable Statements .. WRITE (nout,*) WRITE (nout,*) WRITE (nout,*) 'Example 1' ! Skip heading in data file READ (nin,*) READ (nin,*) READ (nin,*) READ (nin,*) n ALLOCATE (a(2,0:n),w(4*(n+1)),z(2,n)) READ (nin,*) (a(1,i),a(2,i),i=0,n) ifail = 0 CALL c02aff(a,n,scal,z,w,ifail) WRITE (nout,*) WRITE (nout,99999) 'Degree of polynomial = ', n WRITE (nout,*) WRITE (nout,*) 'Computed roots of polynomial' WRITE (nout,*) DO i = 1, n WRITE (nout,99998) 'z = ', z(1,i), z(2,i), '*i' END DO 99999 FORMAT (1X,A,I4) 99998 FORMAT (1X,A,1P,E12.4,SP,E12.4,A) END SUBROUTINE ex1 SUBROUTINE ex2 ! .. Use Statements .. USE nag_library, ONLY : a02abf, c02aff, nag_wp, x02ajf, x02alf USE c02affe_mod, ONLY : nin, scal ! .. Implicit None Statement .. IMPLICIT NONE ! .. Local Scalars .. REAL (KIND=nag_wp) :: deltac, deltai, di, eps, epsbar, & f, r1, r2, r3, rmax INTEGER :: i, ifail, j, jmin, n ! .. Local Arrays .. REAL (KIND=nag_wp), ALLOCATABLE :: a(:,:), abar(:,:), r(:), w(:), & z(:,:), zbar(:,:) INTEGER, ALLOCATABLE :: m(:) ! .. Intrinsic Functions .. INTRINSIC abs, max, min ! .. Executable Statements .. WRITE (nout,*) WRITE (nout,*) WRITE (nout,*) 'Example 2' ! Skip heading in data file READ (nin,*) READ (nin,*) READ (nin,*) n ALLOCATE (a(2,0:n),abar(2,0:n),r(n),w(4*(n+ & 1)),z(2,n),zbar(2,n),m(n)) ! Read in the coefficients of the original polynomial. READ (nin,*) (a(1,i),a(2,i),i=0,n) ! Compute the roots of the original polynomial. ifail = 0 CALL c02aff(a,n,scal,z,w,ifail) ! Form the coefficients of the perturbed polynomial. eps = x02ajf() epsbar = 3.0E0_nag_wp*eps DO i = 0, n IF (a(1,i)/=0.0E0_nag_wp) THEN f = 1.0E0_nag_wp + epsbar epsbar = -epsbar abar(1,i) = f*a(1,i) IF (a(2,i)/=0.0E0_nag_wp) THEN abar(2,i) = f*a(2,i) ELSE abar(2,i) = 0.0E0_nag_wp END IF ELSE abar(1,i) = 0.0E0_nag_wp IF (a(2,i)/=0.0E0_nag_wp) THEN f = 1.0E0_nag_wp + epsbar epsbar = -epsbar abar(2,i) = f*a(2,i) ELSE abar(2,i) = 0.0E0_nag_wp END IF END IF END DO ! Compute the roots of the perturbed polynomial. ifail = 0 CALL c02aff(abar,n,scal,zbar,w,ifail) ! Perform error analysis. ! Initialize markers to 0 (unmarked). m(1:n) = 0 rmax = x02alf() ! Loop over all unperturbed roots (stored in Z). DO i = 1, n deltai = rmax r1 = a02abf(z(1,i),z(2,i)) ! Loop over all perturbed roots (stored in ZBAR). DO j = 1, n ! Compare the current unperturbed root to all unmarked ! perturbed roots. IF (m(j)==0) THEN r2 = a02abf(zbar(1,j),zbar(2,j)) deltac = abs(r1-r2) IF (deltac