Domain decomposition preconditioners for the spectral collocation method | Zendy

Alfio Quarteroni | Zendy; G. Sacchi-Landriani | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Domain decomposition preconditioners for the spectral collocation method

Author(s) -

Alfio Quarteroni,

G. Sacchi-Landriani

Publication year - 1988

Publication title -

journal of scientific computing

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.53

H-Index - 80

eISSN - 1573-7691

pISSN - 0885-7474

DOI - 10.1007/bf01066482

Subject(s) - mathematics , collocation (remote sensing) , domain decomposition methods , block (permutation group theory) , convergence (economics) , degree (music) , rate of convergence , collocation method , iterative method , polynomial , domain (mathematical analysis) , degree of a polynomial , spectral method , orthogonal collocation , algorithm , mathematical analysis , combinatorics , computer science , differential equation , finite element method , ordinary differential equation , physics , machine learning , thermodynamics , computer network , channel (broadcasting) , acoustics , economics , economic growth

We propose and analyze several block iteration preconditioners for the solution of elliptic problems by spectral collocation methods in a region partitioned into several rectangles. It is shown that convergence is achieved with a rate that does not depend on the polynomial degree of the spectral solution. The iterative methods here presented can be effectively implemented on multiprocessor systems due to their high degree of parallelism. © 1988 Plenum Publishing Corporation

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research