Domain decomposition-finite difference approximate inverse preconditioned schemes for solving fourth-order equations

DOI10.1023/A:1020538522302zbMath1016.65098OpenAlexW1560613294MaRDI QIDQ1868493

George A. Gravvanis

Publication date: 27 April 2003

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1020538522302

zbMATH Keywords

finite difference methodnumerical examplespreconditioningconjugate gradient methoddomain decomposition methodbiharmonic equationsparallel iterative methodsapproximate inverse matrix techniquesapproximate factorization procedure

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Boundary value problems for higher-order elliptic equations (35J40) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05) Finite difference methods for boundary value problems involving PDEs (65N06) Complexity and performance of numerical algorithms (65Y20)

Related Items (3)

Software rejuvenation for resource optimization based on explicit approximate inverse preconditioning ⋮ Software rejuvenation and resource reservation policies for optimizing server resource availability using cyclic nonhomogeneous Markov chains ⋮ Optimal server resource reservation policies for priority classes of users under cyclic non-homogeneous Markov modeling

This page was built for publication: Domain decomposition-finite difference approximate inverse preconditioned schemes for solving fourth-order equations