Results 41 to 50 of about 281 (133)
Krylov Subspace Restarting for Matrix Laplace Transforms
SIAM Journal on Matrix Analysis and Applications, 2023 A common way to approximate $F(A)b$ -- the action of a matrix function on a vector -- is to use the Arnoldi approximation. Since a new vector needs to be generated and stored in every iteration, one is often forced to rely on restart algorithms which are either not efficient, not stable or only applicable to restricted classes of functions.
Andreas Frommer +3 more
openaire +2 more sources
Sparse Regularization Least-Squares Reverse Time Migration Based on the Krylov Subspace Method
Remote SensingLeast-squares reverse time migration (LSRTM) is an advanced seismic imaging technique that reconstructs subsurface models by minimizing the residuals between simulated and observed data. Mathematically, the LSRTM inversion of the sub-surface reflectivity
Guangshuai Peng +4 more
doaj +1 more source
ILU preconditioning based on the FAPINV algorithm [PDF]
Opuscula Mathematica, 2015 A technique for computing an ILU preconditioner based on the factored approximate inverse (FAPINV) algorithm is presented. We show that this algorithm is well-defined for H-matrices.
Davod Khojasteh Salkuyeh +2 more
doaj +1 more source
Mixed Precision Augmented GMRES
Numerical Linear Algebra with Applications, Volume 33, Issue 4, August 2026.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
Studies in Applied Mathematics, Volume 157, Issue 2, August 2026.ABSTRACT We consider the extended Korteweg–de Vries (eKdV) equation as a model for long moderately nonlinear surface water waves and use it to describe the evolution of initial conditions generating solitary waves with and without significant dispersive radiation, as well as cases of pure dispersive radiation without any solitary waves.
Benjamin Martin +2 more
wiley +1 more source
On Numerical Approximations of the Koopman Operator
Mathematics, 2022 We study numerical approaches to computation of spectral properties of composition operators. We provide a characterization of Koopman Modes in Banach spaces using Generalized Laplace Analysis.
Igor Mezić
doaj +1 more source
A Matrix‐Free, Scalable, and Robust Implicit Material Point Method
International Journal for Numerical Methods in Engineering, Volume 127, Issue 14, 30 July 2026.ABSTRACT An implicit material point method is presented using a new dynamic relaxation solver, allowing for a simple and efficient quasi‐static formulation that may be readily implemented in existing explicit‐dynamic codes. The use of dynamic relaxation and aggregation is shown to produce an extremely robust material point method scheme, with good ...
Sam J. V. Sutcliffe +5 more
wiley +1 more source
Dynamics of monitored SSH model in Krylov space: from complexity to quantum Fisher information
Journal of High Energy PhysicsIn this paper, we investigate the dynamics of a non-Hermitian Su-Schrieffer-Heeger model that arises out of the no-click limit of a monitored SSH model in the Krylov space.
Nilachal Chakrabarti +2 more
doaj +1 more source
A structurally localized ensemble Kalman filtering approach
Quarterly Journal of the Royal Meteorological Society, Volume 152, Issue 778, July 2026 Part A.We derive an inherently localized ensemble Kalman filtering (EnKF) approach, avoiding the need for any auxiliary localization technique. The idea is to first use the variational Bayesian optimization to approximate the (continuous) state analysis probability density function (pdf) by a product of independent marginal pdfs corresponding to small ...
Boujemaa Ait‐El‐Fquih +1 more
wiley +1 more source
Solid Mechanics Segregated Solver Acceleration With Jacobian‐Free Newton‐Krylov
International Journal for Numerical Methods in Engineering, Volume 127, Issue 11, 15 June 2026.ABSTRACT The segregated algorithm is a common approach for finite volumes solvers in solid mechanics, providing a memory‐efficient and straightforward implementation. Due to the inter‐coupling of the components through the source terms, it suffers from a slow convergence behavior in specific scenarios, such as geometries with significantly uneven ...
Andry Monlon +5 more
wiley +1 more source