Sunday, July 12, 2015
Shikonkan building, Surugadai Campus, Meiji University, Tokyo
Computability Theory, the study of inherent limitations of dicrete algorithmic processes, has been applied to a wide range of problems involving real numbers and other continuous data types. This field, called Recursive Analysis, has been refined to the level of limited resources (such as polynomial time) and has gained increased interest recently.
Also from the practical side of numerical analysis, there is a long history of research on techniques based on interval arithmetic for obtaining guaranteed error bounds. This approach has proved successful in many applications, both for providing reliable and yet fast methods for practical computational needs as well as for numerically answering mathematical questions that defy theoretical analysis.
The aim of the workshop is to bring the two communities together and provide a forum where researchers from both fields look for new connections between computational comlexity and validated numerical algorithms. The talks will feature both introduction to the basic ideas and recent research directions.
Announcement on the DWIH website
This workshop is associated with the Twelfth International Conference on Computability and Complexity in Analysis (CCA 2015), which will be held on July 12–15 at the same venue.
09:10 | Registration opens | |
09:35 | Opening | |
09:50 | Computational Complexity of Real Functions | |
10:30 | Coffee | |
11:00 | Algorithm Engineering in Reliable Numerics | |
11:40 | On the Complexity of the Feigenbaum Constant | |
12:20 | Lunch break | |
13:45 | Constructive Reals and Error Free Transformations | |
14:25 | Principles of Computer-Assisted Proofs Using Floating-Point | |
15:05 | Coffee | |
15:35 | Iterative Refinement for Symmetric Eigenvalue Problems | |
16:15 | Rigorous Verification of the Crossed Mapping Condition for Holomorphic Dynamical Systems |
German Research and Innovation Forum Tokyo | JSPS Kakenhi |
See the local information page for CCA 2015.