Results 81 to 90 of about 2,786 (218)
Approximation of the Pseudospectral Abscissa via Eigenvalue Perturbation Theory
ABSTRACT Reliable and efficient computation of the pseudospectral abscissa in the large‐scale setting is still not settled. Unlike the small‐scale setting where there are globally convergent criss‐cross algorithms, all algorithms in the large‐scale setting proposed to date are at best locally convergent.
Waqar Ahmed, Emre Mengi
wiley +1 more source
Toward Genuine Efficiency and Cluster Robustness of Preconditioned CG‐Like Eigensolvers
ABSTRACT The locally optimal block preconditioned conjugate gradient (LOBPCG) method is a popular solver for large and sparse Hermitian eigenvalue problems. However, recently proposed alternatives for its single‐vector version LOPCG indicate certain problematic cases with less accurate preconditioners and clustered target eigenvalues.
Ming Zhou, Klaus Neymeyr
wiley +1 more source
Kω ? Open-source library for the shifted Krylov subspace method of the form (zI?H)x=b [PDF]
We develop Kω, an open-source linear algebra library for the shifted Krylov subspace methods. The methods solve a set of shifted linear equations (zkI−H)x(k)=b(k=0,1,2,…) for a given matrix H and a vector b, simultaneously.
26508 +21 more
core
Krylov Subspace Methods on Parallel Computers
The aspects of implementing Krylov subspace methods on parallel computers are investigated. It is shown how to increase the parallel performance by restructuring standard sequential versions of the algorithms, with some trade-off in stability.
Patrik Skogqvist
core
Model-Order Reduction of Magnetoquasi-Static Problems Based on POD and Arnoldi-Based Krylov Methods [PDF]
The proper orthogonal decomposition method and Arnoldi-based Krylov projection method are investigated in order to reduce a finite-element model of a quasi-static problem.
CLENET, Stephane +3 more
core +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
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
Information Retrieval Using Krylov Subspace Methods
In this dissertation we discuss how simple Krylov subspace methods can be used for information retrieval (IR). The dissertation consists of two parts.
Blom, Katarina
core
Recently, digital transformation has become crucial for the safe operation and extended lifespan of ships and offshore structures. Structural health management is gaining importance and driving interest in digital twin technology for monitoring ...
Kichan Sim +3 more
doaj +1 more source
Conformable fractional order variation-based image deblurring
Image deblurring (ID) plays a vital role in various applications, including photography, medical imaging, and surveillance. Traditional ID methods often face challenges in preserving fine details and handling complex blurring scenarios due to expensive ...
Shahid Saleem +4 more
doaj +1 more source

