نتایج جستجو برای: linear predictor

تعداد نتایج: 554168  

2012
G. Mehdiyeva M. Imanova V. Ibrahimov

Beginning from the creator of integro-differential equations Volterra, many scientists have investigated these equations. Classic method for solving integro-differential equations is the quadratures method that is successfully applied up today. Unlike these methods, Makroglou applied hybrid methods that are modified and generalized in this paper and applied to the numerical solution of Volterra...

Journal: :SIAM Journal on Optimization 2013
Tomonari Kitahara Takashi Tsuchiya

In this paper, we propose a simple variant of the Mizuno-Todd-Ye predictor-corrector algorithm for linear programming problem (LP). Our variants execute a natural finite termination procedure at each iteration and it is easy to implement the algorithm. Our algorithm admits an objective-function free polynomial-time complexity when it is applied to LPs whose dual feasible region is bounded.

Journal: :Math. Program. 1994
Florian A. Potra

A predictor-corrector method for solving linear programs from infeasible starting points is analyzed. The method is quadratically convergent and can be combined with Ye's finite termination scheme under very general assumptions. If the starting points are large enough then the algorithm has O(nL) iteration complexity. If the ratio between feasibility and optimality at the starting points is sma...

Journal: :Optimization Methods and Software 2006
Florian A. Potra Xing Liu

The higher order predictor (43) from [1] has to be modified in the degenerate case in order for the asymptotic convergence results from Lemma 4.6 and Theorem 4.7 to hold. More precisely equation (43) should be replaced by: where = 0 , if HLCP is nondegenerate 1 , if HLCP is degenerate. (2) The computational complexity results hold for the new algorithm, with slight modifications in the proof. C...

Journal: :Mathematics and Computers in Simulation 2004
Gholamreza Hojjati M. Y. Rahimi-Ardabili S. M. Hosseini

In this paper a one parameter predictor–corrector method, which we call it A-EBDF, is introduced and analyzed. With a modification of A-BDF and EBDF methods we propose a multistep method whose region of absolute stability is larger than those of A-BDF and EBDF methods. © 2004 IMACS. Published by Elsevier B.V. All rights reserved. MSC: 65L05

1999
Mathieu Desbrun Peter Schröder Alan H. Barr

In this paper, we propose a stable and efficient algorithm for animating mass-spring systems. An integration scheme derived from implicit integration allows us to obtain interactive realistic animation of any mass-spring network. We alleviate the need to solve a linear system through the use of a predictor-corrector approach: We first compute a rapid approximation of the implicit integration, t...

2000
Mathieu Desbrun Mark Meyer Alan H. Barr

In this chapter, we propose a stable and efficient algorithm for animating cloth-like materials using mass-spring systems. An integration scheme derived from implicit integration allows us to obtain interactive realistic animation of any mass-spring network. We alleviate the need to solve a linear system through the use of a predictor-corrector approach: We first compute a rapid approximation o...

2009
Yildiray Yildiz Anuradha Annaswamy Ilya V. Kolmanovsky Diana Yanakiev

In this paper, we present an Adaptive Posicast Controller that deals with parametric uncertainties in linear systems with delays. It is assumed that the plant has no right half plane zeros and the delay is known. The adaptive controller is based on the Smith Predictor and Finite-Spectrum Assignment with time-varying parameters adjusted online. A novel Lyapunov-Krasovskii functional is used to s...

Journal: :international journal of preventive medicine 0
elahe kazemi seyed mohsen hosseini abbass bahrampour elham faghihimani masood amini

------

Journal: :IEEE Trans. Information Theory 2002
Andrew C. Singer Suleyman Serdar Kozat Meir Feder

We consider the problem of sequential linear prediction of real-valued sequences under the square-error loss function. For this problem, a prediction algorithm has been demonstrated [1]–[3] whose accumulated squared prediction error, for every bounded sequence, is asymptotically as small as the best fixed linear predictor for that sequence, taken from the class of all linear predictors of a giv...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید