Results 241 to 250 of about 728,251 (279)
Some of the next articles are maybe not open access.
Iterative-Shrinkage Algorithms
2010In this chapter, our goal is the minimization of a function of the form $$f\left({\mathbf{x}}\right)=\lambda \mathbf{1}^T \rho{\left({\mathbf{x}}\right)}+\frac{1}{2}\parallel \mathbf{b}-\mathbf{A}\mathbf{x}{\parallel^{2}_{2}},$$ which we have seen before in several forms. The function ρ(x) operates entry-wise on the vector x.
openaire +1 more source
THE RANDOM ITERATION ALGORITHM [PDF]
Journal of Information Systems and Operation Management, 2008 In the last decades, many researchers concerned their attention on fractals properties of objects. Fractals can be use to describe natural shapes so their applications are various in many fields such as informatics, economics, engineering, medical studies. In this paper we present a way to describe fractal, using the Iterated Function System (IFS).
Daniela Alexandra CRIŞAN +1 more
openaire
Dynamic precision iterative algorithms
[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation, 2003The authors address the use of DP (dynamic precision) in fixed point iterative numerical algorithms. These algorithms are used in a wide range of numerically intensive scientific applications. One such algorithm, Muller's method, detects complex roots of an arbitrary function.
D.A. Kramer, I.D. Scherson
openaire +1 more source
1997
In this tutorial paper we present iterative algorithms which can be used for decoding of concatenated codes. The decoding operation is based on either a maximum a posteriori (MAP) algorithm or a Viterbi algorithm generating a weighted soft estimate of the input sequence.
openaire +1 more source
In this tutorial paper we present iterative algorithms which can be used for decoding of concatenated codes. The decoding operation is based on either a maximum a posteriori (MAP) algorithm or a Viterbi algorithm generating a weighted soft estimate of the input sequence.
openaire +1 more source
Accelerating the EMML algorithm and related iterative algorithms by rescaled block-iterative methods
IEEE Transactions on Image Processing, 1998Analysis of convergence of the algebraic reconstruction technique (ART) shows it to be predisposed to converge to a solution faster than simultaneous methods, such as those of the Cimmino-Landweber type, the expectation maximization maximum likelihood method for the Poisson model (EMML), and the simultaneous multiplicative ART (SMART), which use all ...
openaire +3 more sources
Iterative reconstruction algorithms
2020Daniele Panetta, Niccoló Camarlinghi
openaire +1 more source