Pages that link to "Item:Q3090806"

The following pages link to Modulus-based matrix splitting iteration methods for linear complementarity problems (Q3090806):

Displaying 50 items.

• The modulus-based matrix double splitting iteration method for linear complementarity problems (Q2004426) (← links)
• A preconditioned two-step modulus-based matrix splitting iteration method for linear complementarity problem (Q2008851) (← links)
• Two-step modulus-based matrix splitting iteration methods for implicit complementarity problems (Q2009061) (← links)
• On the equivalence between some projected and modulus-based splitting methods for linear complementarity problems (Q2009765) (← links)
• A direct preconditioned modulus-based iteration method for solving nonlinear complementarity problems of \(H\)-matrices (Q2010757) (← links)
• MSSOR-based alternating direction method for symmetric positive-definite linear complementarity problems (Q2017625) (← links)
• Numerical efficiency of modified modulus-based multigrid cycles with application to free boundary problems (Q2022270) (← links)
• Modulus-based matrix splitting methods for a class of horizontal nonlinear complementarity problems (Q2028033) (← links)
• Newton-based matrix splitting method for generalized absolute value equation (Q2029446) (← links)
• A modulus-based nonsmooth Newton's method for solving horizontal linear complementarity problems (Q2037902) (← links)
• Accelerated relaxation modulus-based matrix splitting iteration method for linear complementarity problems (Q2045254) (← links)
• On the unique solution of the generalized absolute value equation (Q2047196) (← links)
• A modulus-based iterative method for sparse signal recovery (Q2048821) (← links)
• A generalized modulus-based Newton method for solving a class of non-linear complementarity problems with \(P\)-matrices (Q2066231) (← links)
• A preconditioned general two-step modulus-based accelerated overrelaxation iteration method for nonlinear complementarity problems (Q2070153) (← links)
• Modulus-based multisplitting iteration method for a class of weakly nonlinear complementarity problem (Q2077781) (← links)
• Modulus-based successive overrelaxation iteration method for pricing American options with the two-asset Black-Scholes and Heston's models based on finite volume discretization (Q2078260) (← links)
• New convergence results of the modulus-based methods for vertical linear complementarity problems (Q2080888) (← links)
• A sign-based linear method for horizontal linear complementarity problems (Q2084255) (← links)
• A generalization of the equivalence relations between modulus-based and projected splitting methods (Q2084585) (← links)
• Fast modulus-based matrix splitting iteration methods for implicit complementarity problems (Q2085647) (← links)
• The GUS-property and modulus-based methods for tensor complementarity problems (Q2095570) (← links)
• A two-step parallel iteration method for large sparse horizontal linear complementarity problems (Q2096344) (← links)
• A relaxation two-sweep modulus-based matrix splitting iteration method for horizontal linear complementarity problems (Q2111550) (← links)
• Two new fixed point iterative schemes for absolute value equations (Q2111558) (← links)
• A relaxation general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems (Q2114416) (← links)
• Newton-based matrix splitting iteration methods for the weakly nonlinear system (Q2122055) (← links)
• An improved two-sweep iteration method for absolute value equations (Q2125919) (← links)
• A generalization of the AOR iteration method for solving absolute value equations (Q2127549) (← links)
• A relaxed generalized Newton iteration method for generalized absolute value equations (Q2131536) (← links)
• On the convergence of two-step modulus-based matrix splitting iteration method (Q2134993) (← links)
• A class of new modulus-based matrix splitting methods for linear complementarity problem (Q2136881) (← links)
• Projected splitting methods for vertical linear complementarity problems (Q2139273) (← links)
• The convergence of the modulus-based Jacobi (MJ) iteration method for solving horizontal linear complementarity problems (Q2140763) (← links)
• The convergence of modulus-based matrix splitting iteration methods for implicit complementarity problems (Q2141569) (← links)
• General fixed-point method for solving the linear complementarity problem (Q2142788) (← links)
• Modified relaxation two-sweep modulus-based matrix splitting iteration method for solving a class of implicit complementarity problems (Q2146338) (← links)
• On RGI algorithms for solving Sylvester tensor equations (Q2154934) (← links)
• Numerical solution of the absolute value equations using two matrix splitting fixed point iteration methods (Q2158465) (← links)
• Upper norm bounds for the inverse of locally doubly strictly diagonally dominant matrices with its applications in linear complementarity problems (Q2159420) (← links)
• A modulus-based formulation for the vertical linear complementarity problem (Q2159423) (← links)
• New modulus-based matrix splitting methods for implicit complementarity problem (Q2159433) (← links)
• A modulus-based cascadic multigrid method for elliptic variational inequality problems (Q2159435) (← links)
• A variant of two-step modulus-based matrix splitting iteration method for retinex problem (Q2167376) (← links)
• A new kind of modulus-based matrix splitting methods for vertical linear complementarity problems (Q2171161) (← links)
• The reduced order method for solving the linear complementarity problem with an \(M\)-matrix (Q2172919) (← links)
• Improved error bounds based on \(\alpha (M)\) for the linear complementarity problem (Q2174476) (← links)
• Superlinearly convergent methods for solving a class of implicit complementarity problems based on sign analysis (Q2174792) (← links)
• The accelerated overrelaxation splitting method for solving symmetric tensor equations (Q2185052) (← links)
• A new SOR-like method for solving absolute value equations (Q2189704) (← links)