Computations of Uniform Recurrence Equations Using Minimal Memory Size
نویسندگان
چکیده
We consider a system of uniform recurrence equations (URE) of dimension one. We show how its computation can be carried out using minimal memory size with several synchronous processors. This result is then applied to register minimization for digital circuits and parallel computation of task graphs.
منابع مشابه
Minimal Representation of Uniform Recurrence Equations 1
We consider a system of uniform recurrence equations of dimension one. We show how the computation can be carried using minimal memory size with several synchronous processors. This result has applications in register minimization for digital circuitry and parallel simulation of timed event graphs.
متن کاملMINIMAL SOLUTION OF INCONSISTENT FUZZY MATRIX EQUATIONS
Fuzzy liner systems of equations, play a major role in several applications in various area such as engineering, physics and economics. In this paper, we investigate the existence of a minimal solution of inconsistent fuzzy matrix equation. Also some numerical examples are considered.
متن کاملA MODIFIED STEFFENSEN'S METHOD WITH MEMORY FOR NONLINEAR EQUATIONS
In this note, we propose a modification of Steffensen's method with some free parameters. These parameters are then be used for further acceleration via the concept of with memorization. In this way, we derive a fast Steffensen-type method with memory for solving nonlinear equations. Numerical results are also given to support the underlying theory of the article.
متن کاملRevisiting the Decomposition of Karp, Miller and Winograd
This paper is devoted to the construction of multi-dimensional schedules f o r a system of uniform recurrence equations. W e show that this problem is dual to the problem oj com-putability of a system of uniform recurrence equations. W e propose a new study of the decomposition algorithm j r s t proposed by Karp, Milliller and Winograd: we base our implementation on linear programming resolutio...
متن کاملA NEW TWO STEP CLASS OF METHODS WITH MEMORY FOR SOLVING NONLINEAR EQUATIONS WITH HIGH EFFICIENCY INDEX
It is attempted to extend a two-step without memory method to it's with memory. Then, a new two-step derivative free class of without memory methods, requiring three function evaluations per step, is suggested by using a convenient weight function for solving nonlinear equations. Eventually, we obtain a new class of methods by employing a self-accelerating parameter calculated in each iterative...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 30 شماره
صفحات -
تاریخ انتشار 2000