Results 61 to 70 of about 12,661,880 (175)
A Method of Indefinite Krylov Subspace for Eigenvalue Problem [PDF]
We describe an indefinite state of Arnoldi’s method for solving the eigenvalues problems. In the following, we scrutinize the indefinite state of Lanczos’ method for solving the eigenvalue problems and we show that this method for the J-Hermitian matrices works much better than Arnoldi’s method.
M. Aliyari, M. Ghasemi Kamalvand
openaire +1 more source
Compile‐Once Block Encodings for Masked Similarity‐Transformed Effective Hamiltonians
Composer transforms structured electronic‐structure operators into a reusable quantum‐circuit fabric. Once compiled, the same block‐encoding architecture is re‐dialed through coefficients, rotation angles, and masks to generate similarity‐transformed effective Hamiltonians across related problem instances, avoiding repeated structural recompilation ...
Bo Peng, Yuan Liu, Karol Kowalski
wiley +1 more source
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
Detecting When One Probe Vector is Enough for Preconditioned Log‐Determinant Approximation
ABSTRACT We present randomized algorithms for estimating the log‐determinant of regularized symmetric positive semi‐definite matrices. The algorithms access the matrix only through matrix vector products, and are based on the introduction of a preconditioner and stochastic trace estimator.
Alice Cortinovis, Daniele Toni
wiley +1 more source
Krylov Implicit Integration Factor Methods for Semilinear Fourth-Order Equations
Implicit integration factor (IIF) methods were developed for solving time-dependent stiff partial differential equations (PDEs) in literature. In [Jiang and Zhang, Journal of Computational Physics, 253 (2013) 368–388], IIF methods are designed to ...
Michael Machen, Yong-Tao Zhang
doaj +1 more source
ABSTRACT We derive eigenvalue bounds for symmetric block‐tridiagonal multiple saddle‐point systems preconditioned with block‐diagonal Schur complement matrices. This analysis applies to an arbitrary number of blocks and accounts for the case where the Schur complements are approximated, generalizing the findings in [11, Bergamaschi et al., Linear ...
Marco Pilotto +2 more
wiley +1 more source
After nearly two decades of development, transient electromagnetic (TEM) 3D forward modeling technology has significantly improved both numerical precision and computational efficiency, primarily through advancements in mesh generation and the ...
Ya’nan Fan +3 more
doaj +1 more source
A note on augmented unprojected Krylov subspace methods
14 pages, 4 ...
openaire +4 more sources
The Use of Restarted Krylov Methods for Large Sparse Least Squares Problems
ABSTRACT The use of restarted Krylov methods for solving large sparse linear least squares problems suffers from certain inherited difficulties. One of them arises in ill‐conditioned problems, when part of the residual vector is spanned by singular vectors that correspond to small singular values.
Achiya Dax
wiley +1 more source
Mixed Precision Augmented GMRES
ABSTRACT We aim to accelerate the restarted generalized minimal residual (GMRES) method for the solutions of linear systems by combining two types of techniques. On the one hand, mixed precision GMRES algorithms, which use lower precision in certain steps of the inner cycles, offer significant reductions in computational and memory costs.
Yongseok Jang +2 more
wiley +1 more source

