An Algorithm for Enclosing a Simple Zero of Nonlinear Equations

We present a modification of an efficient algorithm due to Alefeld et al. for enclosing a simple zero of a nonlinear equation f(x) = 0 in the interval [ a ， b]. Alefeld et al. combine both the bisection method and Newton's method to enclose a simple zero in a stable manner. We modify the methods due to Alefeld et al. to improve their algorithm. Numerical experiments show that our method compares well with the methods of Alefeld et al

Making a Support System for Education with Computer Using X-Window OSF/Motif

For education with computer，a support system with X-Window on Unix workstation is constructed to enable both teachers and students to do efficiently a lot of works such as reporting， bulletining, mailing, and checking student's attendance. The use of OSF/Motif in constructing GUI (Graphical User Interface) is intended to enable users to make mouse operation easy. This system has a good security， because of constructing the system as set-user-ID program

Making Template Interfaces for N umerical Subroutines

An user interface for computing with routines in the mathematical subroutine package NUMPAC is constructed. The interface enables users to compute with NUMPAC by writing simple commands in a single line without taking trouble to write tedious main program ca11ing the subroutines in NUMPAC. The interface is supplied by making corresponding template with awk program for each NUMPAC subroutine

Making a MIDI Daemon on UNIX Operating System

A MIDI controlable system is constructed to provide a music facilities on UNIX-Workstation (WS). The system constructed is a MIDI Daemon for a variety of interfaces to music application programs. Users can usethe present system to enjoy music on UNIX-WS in the same was as on PC

An automatic quadrature method for semi-infinite integrals of exponentially decaying functions and its Matlab code

For the integral of a function f over a semi-infinite interval ［0.∞) with f(x) decaying exponentially as x→∞ , an automatic quadrature scheme is constructed and implemented in Matlab. Three limit formulae of Clenshaw–Curtis-type rules in our recent work (Numerical Algorithms, vol.90, 2022, pp.3–30) are exploited that converge fast for analytic functions. Each formula is expressed by a weighted infinite sum of function values at nodes and so its truncated finite sum is used. The best of the three formulae in accuracy is used as an approximation whose error is estimated with other two formulae and no additional function evaluations, since nodes of the other formulae are included in those of the best one. Numerical results indicate that our automatic scheme is better in performance than the QUADPACK routine for several types of test integrals. Particularly, it copes quite well with oscillatory integrals including the sinusoidal function and/or the Bessel function that are known to be difficult to approximate