Results 41 to 50 of about 3,994 (221)
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
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
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
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
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
Compact models for wireless systems [PDF]
, 2010 For the design and analysis of wireless systems, complex simulations are required and performed. Model order reduction techniques enable greater efficiencies to be achieved and concomitantly, a reduction in memory-resource usage. However, maintaining a
Condon, Marissa, Grahovski, Georgi G.
core
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
An Augmented Lagrangian Preconditioner for Navier–Stokes Equations With Runge–Kutta in Time
Numerical Linear Algebra with Applications, Volume 33, Issue 3, June 2026.ABSTRACT We consider an implicit Runge–Kutta method for the numerical time integration of the nonstationary incompressible Navier–Stokes equations. This yields a sequence of nonlinear problems to be solved for the stages of the Runge–Kutta method. The resulting nonlinear system of differential equations is discretized using a finite element method.
Santolo Leveque +2 more
wiley +1 more source