Interaction Between Computer Algebra and Interval Computations
Special Session at
For many years there is a considerable interaction between symbolic-algebraic and result-verification methods. The usage of validated computations at critical points of some algebraic algorithms improves the stability of the complete solution. Several hybrid algorithms using floating-point and/or interval arithmetic in intermediate computations combine the speed of numerical computations with the exactness of symbolic methods providing still guaranteed correct results and a dramatic speed up of the corresponding algebraic algorithm. Embedding of interval data structures, hybrid and result-verification methods in computer algebra systems turn the latter into valuable tool for reliable scientific computing while by applying symbolic-algebraic methods interval computations expand the methodology tools and get an increased efficiency.
This special session continues the tradition established by previous conferences and special sessions (including e.g. the conferences Interval-xx, ACA 2000 and 2003 sessions) on interval and computer-algebraic methods in science and engineering. The aim is to bring together participants from diverse areas of mathematics, computer science, various life & engineering/science disciplines that will demonstrate the progress in the interaction between symbolic-algebraic and result-verification methods. The meeting goal is to stimulate the communication, coordination, integration, and cross-fertilization of ideas capable to meet the research challenges.
TALKS scheduled for Monday, June 26, 2006, Room 3
10:30 - 12:30
12:30 - 14:00 Lunch
14:00 - 15:30
15:30 - 16:00 Coffee break
16:00 - 16:30
Papers presented at the special session are published in
Serdica Journal of Computing volume 1, no. 4, 2007.