Picard splitting method and Picard CG method for solving the absolute value equation
From MaRDI portal
Publication:4631319
DOI10.22436/JNSA.010.07.24zbMATH Open1412.65033OpenAlexW2734376191MaRDI QIDQ4631319FDOQ4631319
Authors: Chang-Qing Lv, Changfeng Ma
Publication date: 24 April 2019
Published in: The Journal of Nonlinear Sciences and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.22436/jnsa.010.07.24
Recommendations
- Matrix multisplitting Picard-iterative method for solving generalized absolute value matrix equation
- The Picard-HSS-SOR iteration method for absolute value equations
- On Picard-SHSS iteration method for absolute value equation
- The Picard-HSS iteration method for absolute value equations
- Iterative schemes induced by block splittings for solving absolute value equations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Absolute value equation solution via concave minimization
- Complementary pivot theory of mathematical programming
- Absolute value equation solution via linear programming
- Absolute value equations
- Absolute value programming
- Absolute value equation solution via dual complementarity
- On unique solvability of the absolute value equation
- A generalized Newton method for absolute value equations
- An iterative method for solving absolute value equations and sufficient conditions for unique solvability
- An algorithm for solving the absolute value equation
- A theorem of the alternatives for the equationAx+B|x| =b
- The Picard-HSS iteration method for absolute value equations
- On HSS-based iteration methods for weakly nonlinear systems
- On equivalent reformulations for absolute value equations
- On an iterative method for solving absolute value equations
- An efficient method for optimal correcting of absolute value equations by minimal changes in the right hand side
- An algorithm for computing all solutions of an absolute value equation
- A note on absolute value equations
- Linear complementarity problems solvable by A single linear program
- Primal-dual bilinear programming solution of the absolute value equation
- Interval algorithm for absolute value equations
- Minimum norm solution to the absolute value equation in the convex case
Cited In (5)
- On the Hermitian and skew-Hermitian splitting-like iteration approach for solving complex continuous-time algebraic Riccati matrix equation
- An improved two-sweep iteration method for absolute value equations
- Matrix multisplitting Picard-iterative method for solving generalized absolute value matrix equation
- The generalized fixed point iteration method for AVE
- A new SOR-like method for solving absolute value equations
This page was built for publication: Picard splitting method and Picard CG method for solving the absolute value equation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4631319)