Domain Decomposition Preconditioners for Hermite Collocation Problems
Accelerating the convergence rate of Krylov subspace methods with parallelizable preconditioners is essential for obtaining effective iterative solvers for very large linear systems of equations. Substructuring provides a framework for constructing robust and parallel preconditioners for linear syst...
Main Author: | Mateescu, Gabriel |
---|---|
Other Authors: | Computer Science |
Format: | Others |
Published: |
Virginia Tech
2014
|
Subjects: | |
Online Access: | http://hdl.handle.net/10919/26014 http://scholar.lib.vt.edu/theses/available/etd-011999-204811/ |
Similar Items
-
Parallel Preconditioners for Plate Problem
by: Matthes, H.
Published: (1998) -
Scalable Block Preconditioners for Linearized Navier-Stokes Equations at High Reynolds Number
by: Filippo Zanetti, et al.
Published: (2020-08-01) -
On the preconditioning in the domain decomposition technique for the p-version finite element method. Part II
by: Ivanov, S. A., et al.
Published: (1998) -
ILU preconditioning based on the FAPINV algorithm
by: Davod Khojasteh Salkuyeh, et al.
Published: (2015-01-01) -
A Robust Approximation of the Schur Complement
Preconditioner for an Efficient Numerical Solution of
the Elliptic Optimal Control Problems
by: Kizito Muzhinji, et al.
Published: (2020-07-01)