A preconditioning technique based on element matrix factorizations (Q1064735): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q114215195 / 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.1016/0045-7825(86)90053-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989316443 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of iterative methods for finite element equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preconditioning and Two-Level Multigrid Methods of Arbitrary Degree of Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The natural factor formulation of the stiffness for the matrix displacement method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An element-by-element solution algorithm for problems of structural and solid mechanics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A frontal solution program for finite element analysis / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:14, 14 June 2024

scientific article
Language Label Description Also known as
English
A preconditioning technique based on element matrix factorizations
scientific article

    Statements

    A preconditioning technique based on element matrix factorizations (English)
    0 references
    0 references
    0 references
    1986
    0 references
    The task of making an incomplete factorization of the finite element stiffness matrix using only element matrices is concerned. We present a technique for realizing this and obtain a method which, for many problems solved in practice, requires an amount of core storage that is independent of the number of unknowns in the discrete model, i.e., of the mesh size parameter. On the other hand data transfers from/to the desk and more arithmetic operations than in a corresponding completely-in-core method are required. Theoretical estimates of the rate of convergence of the corresponding preconditioned conjugate gradient method are derived for a model problem and a number of test examples are examined.
    0 references
    incomplete factorization
    0 references
    finite element stiffness matrix
    0 references
    data transfers
    0 references
    rate of convergence
    0 references
    preconditioned conjugate gradient method
    0 references
    test examples
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references