Sciweavers

16 search results - page 1 / 4
» Sharpness in rates of convergence for the symmetric Lanczos ...
Sort
View
MOC
2010
12 years 11 months ago
Sharpness in rates of convergence for the symmetric Lanczos method
The Lanczos method is often used to solve a large and sparse symmetric matrix eigenvalue problem. There is a well-established convergence theory that produces bounds to predict the...
Ren-Cang Li
MOC
2002
120views more  MOC 2002»
13 years 4 months ago
Analysis of iterative methods for saddle point problems: a unified approach
In this paper two classes of iterative methods for saddle point problems are considered: inexact Uzawa algorithms and a class of methods with symmetric preconditioners. In both cas...
Walter Zulehner
CDC
2010
IEEE
196views Control Systems» more  CDC 2010»
12 years 12 months ago
Convergence and convergence rate of stochastic gradient search in the case of multiple and non-isolated extrema
The asymptotic behavior of stochastic gradient algorithms is studied. Relying on some results of differential geometry (Lojasiewicz gradient inequality), the almost sure pointconve...
Vladislav B. Tadic
SIAMNUM
2010
150views more  SIAMNUM 2010»
12 years 11 months ago
Quasi-Optimal Convergence Rate of an Adaptive Discontinuous Galerkin Method
We analyze an adaptive discontinuous finite element method (ADFEM) for symmetric second order linear elliptic operators. The method is formulated on nonconforming meshes made of si...
Andrea Bonito, Ricardo H. Nochetto
SPAA
1990
ACM
13 years 9 months ago
A New Preconditioner for the Parallel Solution of Positive Definite Toeplitz Systems
We introduce a new preconditioner for solving a symmetric Toeplitz system of equations by the conjugate gradient method. This choice leads to an algorithm which is particularly sui...
Dario Bini, Fabio Di Benedetto