𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel algebraic reductions among numerical problems

✍ Scribed by B. Codenotti; M. Leoncini; G. Resta

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
372 KB
Volume
4
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

✦ Synopsis

In this note we consider, for a number of linear algebra problems, an environment allowing approximate computations. Within this framework we show that the relative complexity of these problems should be studied according to a strict notion of reducibility, which corresponds to the well-known many-one reducibility of combinatorial complexity.

πŸ“œ SIMILAR VOLUMES

Data-parallel support for numerical irre
Data-parallel support for numerical irregular problems
✍ E.L. Zapata; O. Plata; R. Asenjo; G.P. Trabado πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 502 KB

A large class of intensive numerical applications show an irregular structure, exhibiting an unpredictable runtime behavior. Two kinds of irregularity can be distinguished in these applications. First, irregular control structures, derived from the use of conditional statements on data only known at