Reliable Computing Special issue:

Bernstein Polynomials in Reliable Computing

Guest Editors: Jürgen Garloff

Andrew P. Smith

In recent decades, because of their polynomial range enclosing property, Bernstein polynomials have become a useful tool in many fields, such as robust control, automatic theorem proving, global optimization, and computer aided geometric design. Other fields where Bernstein polynomials have recently been applied include image processing, pattern recognition, and ordinary differential equations, with potential for verified computations as well.  These developments have matured sufficiently to warrant a special issue devoted to this approach and to invite submission of papers for this issue. If you are interested in submitting a paper to this special issue, please send us the tentative title and an abstract as soon as possible. Papers should be submitted electronically through EasyChair, according to the guidelines in:

http://interval.louisiana.edu/reliable-computing-journal/#Instructions_for_Authors

(When entering your title in the EasyChair system, preface your title with "Bernstein Issue:")

Andrew P. Smith, smith@htwg-konstanz.de

University of Applied Sciences / HTWG Konstanz Faculty of Computer Science, Konstanz, Germany