English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

For the large sparse linear complementarity problem, by reformulating it as implicit fixed-point equations, we establish a modulus-based iteration method with the aid of an inexact non-alternating preconditioned matrix splitting iteration method used as an inner iteration to solve the module equations rapidly in each iteration step. The convergence properties of this method are carefully demonstrated under certain conditions. Numerical results, including the numbers of iteration steps and the computing times, validate that our method is superior to the other three iteration methods.

Modulus-based inexact non-alternating preconditioned splitting method for linear complementarity problems