Preconditioned inexact fixed point iteration method for solving tensor absolute value equation
Preconditioning techniques are the most used methods to accelerate the tensor splitting iteration method for solving multi-linear systems. In this paper, we consider the numerical method for solving tensor absolute value equation based on preconditioned techniques and the inexact fixed point iteration method. We present a general form of preconditioned inexact fixed point iteration method for solving tensor absolute value equation. Theoretically, we give the convergence of the proposed method. Numerically, we show the efficiency of the proposed method by three numerical examples.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
A Neural-Operator Preconditioned Newton Method for Accelerated Nonlinear Solvers
We propose a novel neural preconditioned Newton (NP-Newton) method for solving parametric nonlinear systems of equations. To overcome the stagnation or instability of Newton iterations caused by unbalanced nonlinearities…
Computational EfficiencyA Fixed-Point of View on Gradient Methods for Big Data
Interpreting gradient methods as fixed-point iterations, we provide a detailed analysis of those methods for minimizing convex objective functions. Due to their conceptual and algorithmic simplicity, gradient methods are…
A Semi-Lagrangian two-level preconditioned Newton-Krylov solver for constrained diffeomorphic image registration
We propose an efficient numerical algorithm for the solution of diffeomorphic image registration problems. We use a variational formulation constrained by a partial differential equation (PDE), where the constraints are …
Computational EfficiencyConstrained Diffeomorphic Image RegistrationImage RegistrationMedical Image RegistrationA Class of Accelerated Fixed-Point-Based Methods with Delayed Inexact Oracles and Its Applications
In this paper, we develop a novel accelerated fixed-point-based framework using delayed inexact oracles to approximate a fixed point of a nonexpansive operator (or equivalently, a root of a co-coercive operator), a centr…
Inexact Primal-Dual Gradient Projection Methods for Nonlinear Optimization on Convex Set
In this paper, we propose a novel primal-dual inexact gradient projection method for nonlinear optimization problems with convex-set constraint. This method only needs inexact computation of the projections onto the conv…