PreprintarXiv licencearXiv
Iterative Methods for Solving New Generalized Absolute Value Equations
Abstract
In this paper, we propose two iterative methods, the modified Picard method (MPM) and the generalized Traub method (GTM), to solve a new generalized absolute value equation (NGAVE). We establish their convergence under appropriate assumptions. Additionally, numerical examples demonstrate the effectiveness and applicability of the developed algorithms.
Related
- Grad-div stabilized finite element Picard-Newton iterative methods for the Navier-Stokes equations
- A higher order family of iterative methods for approximating inverse and generalized inverse matrices
- Analytical Methods for Solving Non-Autonomous Higher-Order Nonlinear Difference Equations
- A Relaxed Maximum-Based Normal S-Iteration Method for Generalized Absolute Value Equations
- Extended Generalized Contractions, Metric Completeness, and Applications to Solving Nonlinear Diophantine Equations
BibTeX
@misc{kumar2026iterative,
title = {{Iterative Methods for Solving New Generalized Absolute Value Equations}},
author = {Shubham Kumar and Joydip Dhar},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.39933},
eprint = {2610.39933},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.39933},
}
RIS
TY - UNPB
TI - Iterative Methods for Solving New Generalized Absolute Value Equations
AU - Shubham Kumar
AU - Joydip Dhar
PY - 2026
DA - 2026/10/29
PB - arXiv
DO - 10.48550/arxiv.2610.39933
UR - https://arxiv.org/abs/2610.39933
AB - In this paper, we propose two iterative methods, the modified Picard method (MPM) and the generalized Traub method (GTM), to solve a new generalized absolute value equation (NGAVE). We establish their convergence under appropriate assumptions. Additionally, numerical examples demonstrate the effectiveness and applicability of the developed algorithms.
ER -