5. 6. I. 8. 9. IO. Introduction Review of deterministic iterative restoration algorithms 2.1. Basic iterative algorithm 2.1.1. Derivation 2.1.2. Convergence 2.2. Basic iterative algorithm with reblurring 2.2.1. Derivation 2.2.2. Convergence and rate of convergence 2.3. Basic iterative algorithm with constraints 2.3. I. Derivation and convergence 2.3.2. Experiment I 2.4. Method of projecting ont...

‎Let $mathcal{A}$ be a unital Banach algebra‎, ‎$mathcal{M}$ be a left $mathcal{A}$-module‎, ‎and $W$ in $mathcal{Z}(mathcal{A})$ be a left separating point of $mathcal{M}$‎. ‎We show that if $mathcal{M}$ is a unital left $mathcal{A}$-module and $delta$ is a linear mapping from $mathcal{A}$ into $mathcal{M}$‎, ‎then the following four conditions are equivalent‎: ‎(i) $delta$ is a Jordan left de...

Let $R$ be a 2-torsion free ring and $U$ be a square closed Lie ideal of $R$. Suppose that $alpha, beta$ are automorphisms of $R$. An additive mapping $delta: R longrightarrow R$ is said to be a Jordan left $(alpha,beta)$-derivation of $R$ if $delta(x^2)=alpha(x)delta(x)+beta(x)delta(x)$ holds for all $xin R$. In this paper it is established that if $R$ admits an additive mapping $G : Rlongrigh...

We present a methodology that allows endogenous derivation of the moments of the probability distributions. In doing so, we, present an alternative objective function and alternative concept of risk aversion. In addition, we show that the risk measure depends on the preferences. Moreover, we show that a higher level of risk aversion yields higher values of the risk measure.

Parallel and distributed programming are much more diicult than the development of sequential algorithms due to data distribution issues and communication requirements. This paper presents a methodology that enables the abstract description of the distribution of data structures by means of overlapping covers that form data distribution algebras. Algorithms are formulated and derived by transfo...

An approach, called SAT (Stages And Transformations), is introduced to support the derivation of parallel distributed-memory programs. During the design, a program is viewed as a single thread of stages, with parallelism concentrated within stages; the target program is of the SPMD format. The design process is based on the transformation rules of the Bird-Meertens formalism of higher-order fun...

A recently developed perturbation theory for solving self-consistent-eld equations is applied to the hydrogen atom in a strong magnetic eld. This system has been extensively studied using other methods and is therefore a good test case for the new method. The perturbation theory yields summable large-order expansions. The accuracy of the self-consistent-eld approximation varies according to eld...

Martindale proved that under some conditions every multiplicative isomorphism between two rings is additive. In this paper, we extend this theorem to a larger class of mappings and conclude that every multiplicative $(alpha, beta)-$derivation is additive.

In this paper, we apply the compare the collocation methods of meshfree RBF over differential equation containing partial derivation of one dimension time dependent with a compound boundary nonlocal condition.