Add to ORKGWe discuss estimates for the rate of convergence of the method of successive subspace corrections in terms of condition number estimate for the method of parallel subspace corrections. We provide upper bounds and in a special case, a lower bound for preconditioners defined via the method of successive subspace corrections.http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000207471200003&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=8e1609b174ce4e31116a60747a720701Mathematics, AppliedMathematicsSCI(E)13ARTICLE144-56
We consider multigrid methods with V-cycle for symmetric positive definite linear systems. We compar...
The problem under consideration is the nonlinear optimization problem min f(x) text{ subject to } x ...
Iterative algorithms for large-scale eigenpair computation are mostly based subspace projections con...
Given a reflexive Banach ¡ space and a convex ¢¤£¥¡§ ¦ ¨� © functional, we shall consider the follow...
. Iterative methods for the solution of linear systems on parallel computer architectures are prese...
Abstract. We discuss the construction of algebraic multilevel preconditioners for the conjugate grad...
In subspace iteration method (SIM), the relative difference of approximated eigenvalues between two ...
The "novel information criterion" (NIC) algorithm was developed by Miao and Hua in 1998 for fast ada...
The spectral deferred correction (SDC) method is an iterative solver for ordinary differential equat...
In many iterative optimization methods, fixed-point theory enables the analysis of the convergence r...
In this paper we consider the parallel subspace correction (PSC) methods for the nearly singular sys...
It is known that for SSOR and ILU preconditionings for solving systems of linear equations, ordering...
We consider an incremental approximation method for solving variational problems in infinite-dimensi...
A class of fast subspace tracking methods such as the Oja method, the projection approximation subsp...
International audienceState-of-the-art methods for solving smooth optimization problems are nonlinea...
We consider multigrid methods with V-cycle for symmetric positive definite linear systems. We compar...
The problem under consideration is the nonlinear optimization problem min f(x) text{ subject to } x ...
Iterative algorithms for large-scale eigenpair computation are mostly based subspace projections con...
Given a reflexive Banach ¡ space and a convex ¢¤£¥¡§ ¦ ¨� © functional, we shall consider the follow...
. Iterative methods for the solution of linear systems on parallel computer architectures are prese...
Abstract. We discuss the construction of algebraic multilevel preconditioners for the conjugate grad...
In subspace iteration method (SIM), the relative difference of approximated eigenvalues between two ...
The "novel information criterion" (NIC) algorithm was developed by Miao and Hua in 1998 for fast ada...
The spectral deferred correction (SDC) method is an iterative solver for ordinary differential equat...
In many iterative optimization methods, fixed-point theory enables the analysis of the convergence r...
In this paper we consider the parallel subspace correction (PSC) methods for the nearly singular sys...
It is known that for SSOR and ILU preconditionings for solving systems of linear equations, ordering...
We consider an incremental approximation method for solving variational problems in infinite-dimensi...
A class of fast subspace tracking methods such as the Oja method, the projection approximation subsp...
International audienceState-of-the-art methods for solving smooth optimization problems are nonlinea...
We consider multigrid methods with V-cycle for symmetric positive definite linear systems. We compar...
The problem under consideration is the nonlinear optimization problem min f(x) text{ subject to } x ...
Iterative algorithms for large-scale eigenpair computation are mostly based subspace projections con...