Results 71 to 80 of about 3,994 (221)
Krylov Subspace Methods in the Electronic Industry [PDF]
In most practical cases, the convergence of the GMRES method applied to a linear algebraic system Ax -- b is determined by the distribution of eigenvalues of A. In theory, however, the information about the eigenvalues alone is not sufficient for determining the convergence. In this paper the previous work of Greenbaum et al.
Heres, P.J., Schilders, W.H.A.
openaire +2 more sources
The proposed work implements a direct flux reconstruction method for spatial discretization and a stiffness‐resilient exponential time integration method for temporal discretization on the cube‐sphere grid. A space‐time tensor formalism is employed to provide a general representation in any curvilinear coordinate system. This combination enables highly
Stéphane Gaudreault +6 more
wiley +1 more source
A Class of Preconditioners for Large Indefinite Linear Systems, as by-product of Krylov subspace Methods: Part II [PDF]
In this paper we consider the parameter dependent class of preconditioners M(a,d,D) defined in the companion paper The latter was constructed by using information from a Krylov subspace method, adopted to solve the large symmetric linear system Ax = b ...
Massimo Roma, Giovanni Fasano
core
Performance of relaxed iterative methods for image deblurring problems
In this paper, we consider performance of relaxation iterative methods for four types of image deblurring problems with different regularization terms.
Jae H Yun
doaj +1 more source
This paper presents a finite element method for simulating highly viscoelastic flows of pure polymer melts using the Elastic Viscous Stress Splitting formulation. The method avoids higher‐order derivatives in the weak formulation by reformulating the convective term in the constitutive equation.
R. Ahmad, P. Zajac, S. Turek
wiley +1 more source
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
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
In this work, we propose a nonlinear dynamic inverse solution to the diffusion problem based on Krylov Subspace Methods with spatiotemporal constraints. The proposed approach is applied by considering, as a forward problem, a 1D diffusion problem with a ...
Luis Fernando Alvarez-Velasquez +1 more
doaj +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

