Sciweavers

1997 search results - page 175 / 400
» On the convergence of Hill's method
Sort
View
PARA
2004
Springer
15 years 6 months ago
Parallel Hybrid Sparse Solvers Through Flexible Incomplete Cholesky Preconditioning
Abstract. We consider parallel preconditioning schemes to accelerate the convergence of Conjugate Gradients (CG) for sparse linear system solution. We develop methods for construct...
Keita Teranishi, Padma Raghavan
ISCIS
2003
Springer
15 years 6 months ago
A New Continuous Action-Set Learning Automaton for Function Optimization
In this paper, we study an adaptive random search method based on continuous action-set learning automaton for solving stochastic optimization problems in which only the noisecorr...
Hamid Beigy, Mohammad Reza Meybodi
SWARM
2010
SPRINGER
231views Optimization» more  SWARM 2010»
15 years 6 months ago
Hybrid Particle Swarm and Conjugate Gradient Optimization Algorithm
Abstract. In this work we propose a different particle swarm optimization (PSO) algorithm that employs two key features of the conjugate gradient (CG) method. Namely, adaptive wei...
Abdallah Qteish, Mohammad Hamdan
CDC
2009
IEEE
127views Control Systems» more  CDC 2009»
15 years 6 months ago
A moving horizon scheme for distributed state estimation
— This paper presents a novel distributed estimation algorithm based on the concept of moving horizon estimation. Under weak observability conditions we prove convergence of the ...
Marcello Farina, Giancarlo Ferrari-Trecate, Riccar...
ICANN
2001
Springer
15 years 5 months ago
Fast Curvature Matrix-Vector Products
The method of conjugate gradients provides a very effective way to optimize large, deterministic systems by gradient descent. In its standard form, however, it is not amenable to ...
Nicol N. Schraudolph