Results 31 to 40 of about 18,434 (156)
A Geometric Multigrid Method for 3D Magnetotelluric Forward Modeling Using Finite-Element Method
Remote Sensing, 2023 The traditional three-dimensional (3D) magnetotelluric (MT) forward modeling using Krylov subspace algorithms has the problem of low modeling efficiency.
Xianyang Huang +8 more
doaj +1 more source
GMRES for oscillatory matrix-valued differential equations [PDF]
, 2009 We investigate the use of Krylov subspace methods to solve linear, oscillatory ODEs. When we apply a Krylov subspace method to a properly formulated equation, we retain the asymptotic accuracy of the asymptotic expansion whilst converging to the exact ...
Olver, Sheehan
core
MATEX: A Distributed Framework for Transient Simulation of Power Distribution Networks
, 2014 We proposed MATEX, a distributed framework for transient simulation of power distribution networks (PDNs). MATEX utilizes matrix exponential kernel with Krylov subspace approximations to solve differential equations of linear circuit.
Cheng, Chung-Kuan +3 more
core +1 more source
High Voltage, EarlyView.ABSTRACT Structural mechanics field simulation plays a critical role in the vibration characteristic analysis of electrical equipment. Existing structural field analysis of equipment based on numerical simulation faces challenges such as convergence difficulties and prolonged computational time, failing to meet the demand for real‐time prediction of ...
Wanqing Wang +6 more
wiley +1 more source
, 2009 It is well known that the block Krylov subspace solvers work efficiently for some cases of the solution of differential equations with multiple right-hand sides.
Abdel-Rehim +17 more
core +1 more source
Coupled Clustering in Hierarchical Matrices for the Oseen Problem
International Journal for Numerical Methods in Fluids, Volume 98, Issue 6, Page 751-765, June 2026.Fluid flow problems can be modelled by the Navier‐Stokes or, after linearization, by the Oseen equations. Their discretization results in linear systems in saddle point form which are typically very large and need to be solved iteratively. We propose a novel block structure for hierarchical matrices which is then used to build preconditioners for the ...
Jonas Grams, Sabine Le Borne
wiley +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
A Preconditioned Majorization‐Minimization Method for ℓ2$$ {\ell}^2 $$‐ℓq$$ {\ell}^q $$ Minimization
Numerical Linear Algebra with Applications, Volume 33, Issue 3, June 2026.ABSTRACT The need to minimize a linear combination of an expression that involves an ℓq$$ {\ell}^q $$‐norm of a linear transformation of the computed solution and the ℓ2$$ {\ell}^2 $$‐norm of the residual error arises in image restoration as well as in statistics.
A. Buccini +3 more
wiley +1 more source
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
Robust Reduced-Rank Adaptive Processing Based on Parallel Subgradient Projection and Krylov Subspace Techniques [PDF]
, 2013 In this paper, we propose a novel reduced-rank adaptive filtering algorithm by blending the idea of the Krylov subspace methods with the set-theoretic adaptive filtering framework.
Isao Yamada +3 more
core