We define a smooth functional calculus for a noncommuting tuple of (unbounded) operators Aj on a Banach space with real spectra and resolvents with temperate growth, by means of an iterated Cauchy formula. The construction is also extended to tuples of more general operators allowing smooth functional calculii. We also discuss the relation to the case with commuting operators.

We develop a calculus for lazy functional programming based on recursion operators associated with data type definitions. For these operators we derive various algebraic laws that are useful in deriving and manipulating programs. We shall show that all example Functions in Bird and Wadler's "Introduction to Functional Programming" can be expressed using these operators.

‎Let $A$ be a $C^{*}$ algebra‎, ‎$T‎: ‎Arightarrow A$ be a linear map which satisfies the functional equation $T(x)T(y)=T^{2}(xy),;;T(x^{*})=T(x)^{*} $‎. ‎We prove that under each of the following conditions‎, ‎$T$ must be the trivial map $T(x)=lambda x$ for some $lambda in mathbb{R}$: ‎‎ ‎i) $A$ is a simple $C^{*}$-algebra‎. ‎ii) $A$ is unital with trivial center and has a faithful trace such ...

in this note, we aim to present some properties of the space of all weakly fuzzy bounded linear operators, with the bag and samanta’s operator norm on felbin’s-type fuzzy normed spaces. in particular, the completeness of this space is studied. by some counterexamples, it is shown that the inverse mapping theorem and the banach-steinhaus’s theorem, are not valid for this fuzzy setting. also...

there are many different ways to subdivide the spectrum of a bounded linear operator; some of them aremotivated by applications to physics (in particular, quantum mechanics). in this study, the relationship betweenthe subdivisions of spectrum which are not required to be disjoint and goldberg's classification are given.moreover, these subdivisions for some summability methods are studied.

Continued fractions lie at the heart of a number of classical algorithms like Euclid's greatest common divisor algorithm or the lattice reduction algorithm of Gauss that constitutes a 2-dimensional generalization. This paper surveys the main properties of functional operators, |transfer operators| due to Ruelle and Mayer (also following L evy, Kuzmin, Wirsing, Hensley, and others) that describe...

This paper intends to lay the theoretical foundation for the method of functional maps, first presented in 2012 by Ovsjanikov, Ben-Chen, Solomon, Butscher and Guibas in the field of the theory and numerics of maps between shapes. We show how to analyze this method by looking at it as an application of the theories of composition operators, of matrix representation of operators on separable Hilb...