Further study on two fixed point iterative schemes for absolute value equations
From MaRDI portal
Recommendations
- Two new fixed point iterative schemes for absolute value equations
- An improvement on a class of fixed point iterative methods for solving absolute value equations
- On an iterative method for solving absolute value equations
- Numerical solution of the absolute value equations using two matrix splitting fixed point iteration methods
- The AOR-base splitting modified fixed point iteration for solving absolute value equations
Cites work
- A dynamic model to solve the absolute value equations
- A generalization of the Gauss-Seidel iteration method for solving absolute value equations
- A generalized Newton method for absolute value equations
- A modified generalized SOR-like method for solving an absolute value equation
- A new concave minimization algorithm for the absolute value equation solution
- A new SOR-like method for solving absolute value equations
- A note on absolute value equations
- A note on unique solvability of the absolute value equation
- A theorem of the alternatives for the equationAx+B|x| =b
- Absolute value equation solution via concave minimization
- Absolute value equations
- Absolute value programming
- An efficient numerical method for the symmetric positive definite second-order cone linear complementarity problem
- An inverse-free dynamical system for solving the absolute value equations
- An iterative method for solving absolute value equations and sufficient conditions for unique solvability
- Bounds for the solutions of absolute value equations
- Error bounds and a condition number for the absolute value equations
- Exact and inexact Douglas–Rachford splitting methods for solving large-scale sparse absolute value equations
- Forty necessary and sufficient conditions for regularity of interval matrices: A survey
- Global and finite convergence of a generalized Newton method for absolute value equations
- scientific article; zbMATH DE number 3366440 (Why is no real title available?)
- Linear complementarity as absolute value equation solution
- Method of alternating projections for the general absolute value equation
- Minimum norm solution to the absolute value equation in the convex case
- New backward error bounds of Rayleigh–Ritz projection methods for quadratic eigenvalue problem
- On equivalent reformulations for absolute value equations
- On finite termination of the generalized Newton method for solving absolute value equations
- On perturbations for spectrum and singular value decompositions followed by deflation techniques
- On the global convergence of the inexact semi-smooth Newton method for absolute value equation
- On the SOR-like iteration method for solving absolute value equations
- On unique solvability of the absolute value equation
- Optimal parameter of the SOR-like iteration method for solving absolute value equations
- Parallel iterative methods for sparse linear systems
- Properties of the Solution Set of Absolute Value Equations and the Related Matrix Classes
- Relaxed-based matrix splitting methods for solving absolute value equations
- Some notes on the solvability conditions for absolute value equations
- SOR-like iteration method for solving absolute value equations
- Systems of linear interval equations
- The general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems
- The modulus-based matrix splitting algorithms for a class of weakly nonlinear complementarity problems.
- The Picard-HSS iteration method for absolute value equations
- Two new fixed point iterative schemes for absolute value equations
- Unsupervised and semisupervised classification via absolute value inequalities
This page was built for publication: Further study on two fixed point iterative schemes for absolute value equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659784)