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

In this work, we study the parametric Sylvester matrix equationwhose elements are linear functions of uncertain parameters varying within some intervals. We first explore some properties of its solution set and then present some sufficient conditions for boundedness of the solution set. The main work is developing a modified variant of the parametric Krawczyk operator which reduces the computational complexity of enclosing the solution set significantly, compared to the parametric Krawczyk operator on the Kronecker product form. Some numerical experiments are given to illustrate the effectiveness of the proposed method.

Fast enclosing the solution set of the parametric Sylvester matrix equations