Results 101 to 110 of about 3,994 (221)
Blind adaptive Krylov subspace multiuser detection
IEEE 54th Vehicular Technology Conference. VTC Fall 2001. Proceedings (Cat. No.01CH37211), 2002 A new method for low-complexity Multiuser Detection (MUD)based in the Fast Subspace Decomposition (FSD) is proposed. The use of FSD allows the estimation of the number of users along with the multiuser detection on line. This leads to a fast multiuser estimation-detection scheme with ultra-low complexity.
Antonio J. Caamaño +2 more
openaire +2 more sources
Image Deblurring with Krylov Subspace Methods
, 2011 Image deblurring, i.e., reconstruction of a sharper image from a blurred and noisy one, involves the solution of a large and very ill-conditioned system of linear equations, and regularization is needed in order to compute a stable solution.
Hansen, Per Christian
core
Enlarged Krylov Subspace Conjugate Gradient Methods for Reducing Communication
, 2014 In this paper we introduce a new approach for reducing communication in Krylov subspace methods that consists of enlarging the Krylov subspace by a maximum of t vectors per iteration, based on the domain decomposition of the graph of A.
Moufawad, Sophie +2 more
core +2 more sources
Incorporating Krylov Subspace Methods in the ETDRK4 Scheme
, 2014 A modification of the (2,2)-Pade algorithm developed by Wade et al. for implementing the exponential time differencing fourth order Runge-Kutta (ETDRK4) method is introduced.
Allen, Jeffrey H.
core +1 more source
Generalized Preconditioned MHSS Method for a Class of Complex Symmetric Linear Systems
Abstract and Applied Analysis, 2014 Based on the modified Hermitian and skew-Hermitian splitting (MHSS) and preconditioned MHSS (PMHSS) methods, a generalized preconditioned MHSS (GPMHSS) method for a class of complex symmetric linear systems is presented.
Cui-Xia Li, Yan-Jun Liang, Shi-Liang Wu
doaj +1 more source
Journal of Applied Mathematics, 2012 We study the preconditioned iterative method for the unsteady Navier-Stokes equations. The rotation form of the Oseen system is considered. We apply an efficient preconditioner which is derived from the Hermitian/Skew-Hermitian preconditioner to the ...
Jia Liu
doaj +1 more source
Preconditioning Techniques in Krylov Subspace Methods
This study discusses preconditioning approaches to address large, sparse linear systems as well as Krylov subspace methods. Among others, computational fluid dynamics, structural analysis, and electromagnetic simulations use Krylov methods like the ...
Najm, Zina Jabbar
core +1 more source
Randomized Orthogonal Projection Methods for Krylov Subspace Solvers
, 2023 Randomized orthogonal projection methods (ROPMs) can be used to speed up the computation of Krylov subspace methods in various contexts. Through a theoretical and numerical investigation, we establish that these methods produce quasi-optimal ...
Timsit, Edouard +2 more
core
Out-of-Core Krylov-Subspace Methods
, 1995 of operations in every iteration, namely multiplication of a vector by the matrix A, vector operations (additions and multiplication by scalars), and inner products.
Sivan Toledo
core
Journal of Applied MathematicsThis work is aimed at deriving a computationally efficient approach to approximate the second-order Index-1 descriptor systems without exploiting the fundamental structure of the systems, which ensures both the accuracy of the approximation and the ...
Mahtab Uddin +2 more
doaj +1 more source