Efficient solution of lattice equations by the recovery method. I: Scalar elliptic problems (Q1780889): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Ivo M. Babuška / rank
Normal rank
 
Property / author
 
Property / author: Q179984 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Myron M. Sussman / rank
Normal rank
 
Property / author
 
Property / author: Ivo M. Babuška / rank
 
Normal rank
Property / author
 
Property / author: Stefan A. Sauter / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Myron M. Sussman / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Triangle / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00791-004-0146-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977087483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5439702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic algorithms for the analysis of mechanical trusses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bridging the gap between geometric and algebraic multi-grid methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4356329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4513819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cubic lattice Green functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Energy optimization of algebraic multigrid bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The auxiliary space method and optimal multigrid preconditioning techniques for unstructured grids / rank
 
Normal rank

Latest revision as of 12:38, 10 June 2024

scientific article
Language Label Description Also known as
English
Efficient solution of lattice equations by the recovery method. I: Scalar elliptic problems
scientific article

    Statements

    Efficient solution of lattice equations by the recovery method. I: Scalar elliptic problems (English)
    0 references
    14 June 2005
    0 references
    The authors describe their work in the following way. ``An efficient solver for high dimensional lattice equations will be introduced. We will present a new concept, the recovery method, to define a bilinear form on the continuous level which has equivalent energy as the original lattice equation. The finite element discretisation of the continuous bilinear form will lead to a stiffness matrix which serves as an quasi-optimal preconditioner for the lattice equations.'' For definiteness, the authors focus on a heat conductivity model, but the analysis is easily generalized. The recovery method consists of several steps. Start with an arbitrary lattice defined by a set of nodal points \(\Theta\) and edges \(\mathcal E\) and a symmetric, positive definite bilinear form \(B(u,v)\) defined for lattice functions \(u\) and \(v\). The nodal set \(\Theta\) is used to generate a finite element type mesh \({\mathcal G}_{FE}\) using Delaunay/Voronoi methods. This process introduces a new edge set \({\mathcal E}_{FE}\) that is likely larger than \(\mathcal E\) but not a superset of \(\mathcal E\). The form \(B(u,v)\) is extended as \(B_{FE}(u,v)\) to \({\mathcal G}_{FE}\) in such a way that \[ 1/C B(u,v) \leq B_{FE}(u,v) \leq C B(u,v) \tag{*} \] for a constant \(C\) that is explicitly determined during the construction. The discrete form \(B_{FE}\) is then extended to a continuous bilinear form by reversing the usual derivation of a discrete equation from a continuous one using piecewise linear shape functions. The energy equivalence condition \((*)\) remains true. The bilinear form \(B_{FE}\) and mesh \({\mathcal G}_{FE}\) give rise to a finite element system of linear equations that is the same size but with different density pattern than the original. Efficient solution methods for the finite element system are well-known, however. The authors prove that the finite element solution can be used as a quasi-optimal preconditioner for the original lattice system.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    preconditioning
    0 references
    lattice differential model
    0 references
    lattice equations
    0 references
    recovery method
    0 references
    finite element
    0 references
    heat conductivity model
    0 references
    Delaunay method
    0 references
    Voronoi method
    0 references
    piecewise linear shape functions
    0 references
    0 references
    0 references
    0 references