Results 141 to 150 of about 564,243 (186)

New Numerical Iteration Schemes Based on Perturbation Iteration Algorithms

International Journal of Computational Methods, 2023
Perturbation–Iteration algorithms (PIA) have been developed recently to solve differential equations analytically. A continuous solution in terms of closed form functions as an approximation of the original equation can be found using the method.
openaire   +1 more source

Algorithms for Iterative Array Multiplication

IEEE Transactions on Computers, 1986
Summary: Algorithms for the parallel multiplication of two n-bit binary numbers by an iterative array of logic cells are discussed. The regular interconnection structures of the multiplier array cell elements, which are ideal for VLSI implementation, are described.
openaire   +2 more sources

Iterative Algorithms for Nonlinear Operators

Journal of the London Mathematical Society, 2002
This article deals with the following approximations \[ x_{n+1} := \alpha_n x_0 + (1 - \alpha_n)(I + c_n T)^{-1}(x_n) +e_n,\quad n = 0, 1, 2,\dots, \] to a solution \(x^*\) of the inclusion \(0\in Tx\) with a maximal monotone operator \(T\) in a Hilbert space \(H\).
openaire   +2 more sources

Algorithms and Iterators

2013
The previous Exploration introduced vectors and iterators using std::sort to sort a vector of integers. This Exploration examines iterators in more depth and introduces generic algorithms, which perform useful operations on iterators.
openaire   +1 more source

Constrained iterative restoration algorithms

Proceedings of the IEEE, 1981
This paper describes a rather broad class of iterative signal restoration techniques which can be applied to remove the effects of many different types of distortions. These techniques also allow for the incorporation of prior knowledge of the signal in terms of the specification of a constraint operator.
R.W. Schafer, R.M. Mersereau, M.A. Richards   +2 more
openaire   +1 more source

Modified iterative aggregation algorithms

Russian Mathematics, 2007
The iterative aggregation methods were developed in 1960s due to the necessity of practical solution of problems in mathematical economy; so they admit an economical interpretation. These methods are still insufficiently investigated from the mathematical point of view and not well-known. The development of the iterative aggregation methods, as well as
B. A. Shuvar, M. I. Kopach
openaire   +1 more source

Parallel Iterative Algorithms

2007
Focusing on grid computing and asynchronism, Parallel Iterative Algorithms explores the theoretical and practical aspects of parallel numerical algorithms. Each chapter contains a theoretical discussion of the topic, an algorithmic section that fully details implementation examples and specific algorithms, and an evaluation of the advantages and ...
Bahi, Jacques, Contassot-Vivier, Sylvain, Couturier, Raphaël   +2 more
openaire   +2 more sources

Iterative-Shrinkage Algorithms

2010
In 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, Justina Lavinia STĂNICĂ   +1 more
openaire  

Dynamic precision iterative algorithms

[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation, 2003
The 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