1. A new high order method of regula falsi type for computing a root of an equation

   • Ned Anderson
   • Åke Björck

   OriginalPaper Pages: 253 - 264

2. Onk-step methods with almost constant coefficients

   • Dagfinn Andreassen

   OriginalPaper Pages: 265 - 271

3. High order stiffly stable composite multistep methods for numerical integration of stiff differential equations

   • Theodore A. Bickart
   • Zdenek Picel

   OriginalPaper Pages: 272 - 286

   

4. Properties of product-type quadrature formulas

   • W. Robert Boland

   OriginalPaper Pages: 287 - 291

5. Calculation of linear bestL _p -approximations

   • Håkan Ekblom

   OriginalPaper Pages: 292 - 300

6. A flow diagram composition of Markov's normal algorithms without concluding formulas

   • G. Germano
   • A. Maggiolo-Schettini

   OriginalPaper Pages: 301 - 312

7. Optimal measurement points for program frequency counts

   • Donald E. Knuth
   • Francis R. Stevenson

   OriginalPaper Pages: 313 - 322

8. Program control of operating systems

   • Søren Lauesen

   OriginalPaper Pages: 323 - 337

9. Error estimates of Hermite interpolation

   • R. D. Riess

   OriginalPaper Pages: 338 - 343

10. On the almost rank deficient case of the least squares problem

    • Per-Åke Wedin

    OriginalPaper Pages: 344 - 354

11. A procedure for parameterizing a constraint in linear programming

    • Hannu Väliaho

    OriginalPaper Pages: 355 - 369

12. New primes of the formn ⁴+1

    • Jan Bohman

    Scientific Notes Pages: 370 - 372

13. An extension of Clenshaw's method for linear differential equations

    • P. D. Tuan

    Scientific Notes Pages: 372 - 374

14. Problems

    Legacy Pages: 375 - 378

15. New books and journals

    Announcement Pages: 378 - 378

16. Notes

    Announcement Pages: 379 - 379