Kategoria BISAC: Mathematics >> Numerical Analysis

Vector Quantization, a pioneering discretization method based on nearest neighbor search, emerged in the 1950s primarily in signal processing, electrical engineering, and information theory. Later in the 1960s, it evolved into an automatic classification technique for generating prototypes of extensive datasets. In modern terms, it can be recognized as a seminal contribution to unsupervised learning through the k-means clustering algorithm in data science.

In contrast, Functional Quantization, a more recent area of study dating back to the early 2000s, focuses on the quantization...

This book is focused on connecting two interesting research areas, mathematics and computational intelligence, by means of appealing contributions devoted to give solutions to different challenges of the current technological age.

It continues the collection of articles dealing with the important and efficient combination of these both areas, with a stress of fuzzy systems and fuzzy logic.

It also includes relevant papers on the development and application of mathematics, artificial intelligence, and automatic reasoning tools to Digital Forensics, which have been...

These are the proceedings of the 27th International Conference on Domain Decomposition Methods in Science and Engineering, which was held in Prague, Czech Republic, in July 2022.

Domain decomposition methods are iterative methods for solving the often very large systems of equations that arise when engineering problems are discretized, frequently using finite elements or other modern techniques. These methods are specifically designed to make effective use of massively parallel, high-performance computing systems.

The book presents both theoretical and...

The book is devoted to the study of approximate solutions of fixed point problems in the presence of computational errors. It begins with a study of approximate solutions of star-shaped feasibility problems in the presence of perturbations. The goal is to show the convergence of algorithms, which are known as important tools for solving convex feasibility problems and common fixed point problems.The text also presents studies of algorithms based on unions of nonexpansive maps, inconsistent convex feasibility problems, and split common fixed point problems. A number of algorithms are...