Computable Function Representations Using Effective Chebyshev Polynomial

TL;DR: A new Chebyshev slant range function approximation is presented that is shown to increase the accuracy of the analytical approximation of the bistatic point target spectrum and yield a more accurate spectrum that can be exploited in bistatics SAR focusing algorithms.

TL;DR: In this article, the integro-differential equation of the point kinetics of nuclear reactor was solved by approximating the neutron density with piecewise polynomial and exponential functions.

TL;DR: In this paper, a linear stability analysis for the Taylor-Dean flow, a viscous flow between concentric horizontal cylinders with a constant azimuthal pressure gradient, keeping the cylinders at different temperatures, when the inner cylinder is rotating and outer one is stationary has been implemented under the assumption that the gap spacing between the cylinders is small compared to the mean radius.

TL;DR: The computational results show that the active learning along with PSO optimized FLANN greatly improves the performance of the model and its variants for software development effort estimation.

TL;DR: This work treats numerical analysis from a mathematical point of view, demonstrating that the many computational algorithms and intriguing questions of computer science arise from theorems and proofs.

TL;DR: This book represents the first treatment of computable analysis at the graduate level within the tradition of classical mathematical reasoning and is sufficiently detailed to provide an introduction to research in this area.

TL;DR: I found the book well written and containing much interesting material, most of the time disseminated in specialized papers published in specialized journals difficult to find.

TL;DR: " polynomial complexity theory extends the notions and tools of the theory of computability to provide a solid theoretical foundation for the study of computational complexity of practical problems.