Proceedings Of The International Conference Numerical Computations Theory And Algorithms

This book contains Proceedings of the International Conference and Summer School NUMTA-2013 “Numerical Computations: Theory and Algorithms”. The Conference is organized jointly by the University of Calabria, Italy, and by the N.I. Lobachevsky State University of Nizhni Novgorod, Russia in cooperation with the Society for Industrial and Applied Mathematics (SIAM), USA. The goal of the Conference is to create a multidisciplinary round table for an open discussion on numerical modeling nature by using traditional and emerging computational paradigms. The Conference discusses all aspects of numerical computations and modeling from foundations and philosophy to advanced numerical techniques. New technological challenges and fundamental ideas from theoretical computer science, linguistic, logic, set theory, and philosophy meet requirements and new fresh applications from physics, chemistry, biology, and economy.

The two-volume set LNCS 11973 and 11974 constitute revised selected papers from the Third International Conference on Numerical Computations: Theory and Algorithms, NUMTA 2019, held in Crotone, Italy, in June 2019. This volume, LNCS 11973, consists of 34 full and 18 short papers chosen among papers presented at special streams and sessions of the Conference. The papers in part I were organized following the topics of these special sessions: approximation: methods, algorithms, and applications; computational methods for data analysis; first order methods in optimization: theory and applications; high performance computing in modelling and simulation; numbers, algorithms, and applications; optimization and management of water supply.

The two-volume set LNCS 11973 and 11974 constitute revised selected papers from the Third International Conference on Numerical Computations: Theory and Algorithms, NUMTA 2019, held in Crotone, Italy, in June 2019. This volume, LNCS 11973, consists of 34 full and 18 short papers chosen among papers presented at special streams and sessions of the Conference. The papers in part I were organized following the topics of these special sessions: approximation: methods, algorithms, and applications; computational methods for data analysis; first order methods in optimization: theory and applications; high performance computing in modelling and simulation; numbers, algorithms, and applications; optimization and management of water supply.

The two-volume set LNCS 11973 and 11974 constitute revised selected papers from the Third International Conference on Numerical Computations: Theory and Algorithms, NUMTA 2019, held in Crotone, Italy, in June 2019. This volume, LNCS 11974, consists of 19 full and 32 short papers chosen among regular papers presented at the the Conference including also the paper of the winner (Lorenzo Fiaschi, Pisa, Italy) of The Springer Young Researcher Prize for the best NUMTA 2019 presentation made by a young scientist. The papers in part II explore the advanced research developments in such interconnected fields as local and global optimization, machine learning, approximation, and differential equations. A special focus is given to advanced ideas related to methods and applications using emerging computational paradigms.

This book constitutes the thoroughly refereed post-conference proceedings of the 6th International Conference on Mathematical Aspects of Computer and Information Sciences, MACIS 2015, held in Berlin, Germany, in November 2015. The 48 revised papers presented together with 7 invited papers were carefully reviewed and selected from numerous submissions. The papers are grouped in topical sections on curves and surfaces, applied algebraic geometry, cryptography, verified numerical computation, polynomial system solving, managing massive data, computational theory of differential and difference equations, data and knowledge exploration, algorithm engineering in geometric computing, real complexity: theory and practice, global optimization, and general session.

This book provides a friendly introduction to the paradigm and proposes a broad panorama of killing applications of the Infinity Computer in optimization: radically new numerical algorithms, great theoretical insights, efficient software implementations, and interesting practical case studies. This is the first book presenting to the readers interested in optimization the advantages of a recently introduced supercomputing paradigm that allows to numerically work with different infinities and infinitesimals on the Infinity Computer patented in several countries. One of the editors of the book is the creator of the Infinity Computer, and another editor was the first who has started to use it in optimization. Their results were awarded by numerous scientific prizes. This engaging book opens new horizons for researchers, engineers, professors, and students with interests in supercomputing paradigms, optimization, decision making, game theory, and foundations of mathematics and computer science. “Mathematicians have never been comfortable handling infinities... But an entirely new type of mathematics looks set to by-pass the problem... Today, Yaroslav Sergeyev, a mathematician at the University of Calabria in Italy solves this problem... ” MIT Technology Review “These ideas and future hardware prototypes may be productive in all fields of science where infinite and infinitesimal numbers (derivatives, integrals, series, fractals) are used.” A. Adamatzky, Editor-in-Chief of the International Journal of Unconventional Computing. “I am sure that the new approach ... will have a very deep impact both on Mathematics and Computer Science.” D. Trigiante, Computational Management Science. “Within the grossone framework, it becomes feasible to deal computationally with infinite quantities, in a way that is both new (in the sense that previously intractable problems become amenable to computation) and natural”. R. Gangle, G. Caterina, F. Tohmé, Soft Computing. “The computational features offered by the Infinity Computer allow us to dynamically change the accuracy of representation and floating-point operations during the flow of a computation. When suitably implemented, this possibility turns out to be particularly advantageous when solving ill-conditioned problems. In fact, compared with a standard multi-precision arithmetic, here the accuracy is improved only when needed, thus not affecting that much the overall computational effort.” P. Amodio, L. Brugnano, F. Iavernaro & F. Mazzia, Soft Computing