DeepAI
Log In Sign Up

Numerical Algorithmic Science and Engineering within Computer Science: Rationale, Foundations and Organization

03/20/2019
by   John Lawrence Nazareth, et al.
0

A re-calibration is proposed for "numerical analysis" as it arises specifically within the broader, embracing field of modern computer science (CS). This would facilitate research into theoretical and practicable models of real-number computation at the foundations of CS, and it would also advance the instructional objectives of the CS field. Our approach is premised on the key observation that the great "watershed" in numerical computation is much more between finite- and infinite-dimensional numerical problems than it is between discrete and continuous numerical problems. A revitalized discipline for numerical computation within modern CS can more accurately be defined as "numerical algorithmic science engineering (NAS E), or more compactly, as "numerical algorithmics," its focus being the algorithmic solution of numerical problems that are either discrete, or continuous over a space of finite dimension, or a combination of the two. It is the counterpart within modern CS of the numerical analysis discipline, whose primary focus is the algorithmic solution of continuous, infinite-dimensional numerical problems and their finite-dimensional approximates, and whose specialists today have largely been repatriated to departments of mathematics. Our detailed overview of NAS E from the viewpoints of rationale, foundations, and organization is preceded by a recounting of the role played by numerical analysts in the evolution of academic departments of computer science, in order to provide background for NAS E and place the newly-emerging discipline within its larger historical context.

READ FULL TEXT

page 3

page 6

page 9

page 12

page 13

page 14

page 21

page 23

10/13/2022

CS-Insights: A System for Analyzing Computer Science Research

This paper presents CS-Insights, an interactive web application to analy...
01/19/2018

Invitation to Real Complexity Theory: Algorithmic Foundations to Reliable Numerics with Bit-Costs

While concepts and tools from Theoretical Computer Science are regularly...
06/21/2020

Kolmogorov's legacy: Algorithmic Theory of Informatics and Kolmogorov Programmable Technology

In this survey, we explore Andrei Nikolayevich Kolmogorov's seminal work...
06/25/2022

A Theoretical Computer Science Perspective on Free Will

We consider the paradoxical concept of free will from the perspective of...
12/01/2022

Analyzing the State of Computer Science Research with the DBLP Discovery Dataset

The number of scientific publications continues to rise exponentially, e...
01/09/2023

Scholar Ranking 2023: Ranking of Computer Science Departments Based on Faculty Citations

Scholar Ranking 2023 is the second edition of U.S. Computer Science (CS)...