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 Tools annual

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

A key component of domain decomposition solvers for  hp  discretizations of elliptic equations is the solver for internal stiffness matrices of  p -elements. We consider an algorithm which belongs to the family of secondary domain decomposition solvers, based on the finite-difference like preconditioning of  p -elements, and was outlined by the author earlier. We remove the uncertainty in the choice of the coarse (decomposition) grid solver and suggest the new interface Schur complement preconditioner. The latter essentially uses the boundary norm for discrete harmonic functions induced by orthotropic discretizations on slim rectangles, which was derived recently. We prove that the algorithm has linear arithmetical complexity.

Fast Domain Decomposition Type Solver for Stiffness Matrices of Reference p -Elements