𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the sets of exact and approximate solutions

✍ Scribed by Jacek Tabor; Józef Tabor

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
97 KB
Volume
285
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

✦ Synopsis

We consider the problem how big is the set of solutions of a given functional equation in the set of approximate solutions. It happens that in the cases of linear functional equations (like Cauchy, Jensen) or linear inequalities (like convex, Jensen convex) the sets of solutions are very small subsets of the sets of approximate solutions. The situation is different in the cases of superstable equations (like exponential or d'Alembert).

📜 SIMILAR VOLUMES

Exact and approximate solutions of some
Exact and approximate solutions of some operator equations based on the Cayley transform
✍ Ivan P. Gavrilyuk; Vladimir L. Makarov 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 1021 KB

We consider the operator equation SX -~)~t i U, XV, = Y where { U, }. { t~ } are some commutative sets of operators but in general { U, } need not commute with { 1,)}. Particular cases of this equation are the Syivester and Ljaptmov equations. We give a new representation and an approximation of the

Exact and approximate computational geom
Exact and approximate computational geometry solutions of an unrestricted point set stereo matching problem
✍ Frank Dehne; Katia Guimarães 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 746 KB

In this paper we study the problem of computing an exact, or arbitrarily close to exact, solution of an unrestricted point set stereo matching problem. Within the context of classical approaches like the Marr-Poggio algorithm, this means that we study how to solve the unrestricted basic subproblems