Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 7 of 7 for “"Sparse Approximate Inverse"”.
-
A study of advanced computational methods: high performance generic sparse approximate inverse preconditioning and multilevel techniques
In this thesis we introduce new generic sparse approximate inverse matrix techniques as well as multilevel techniques for solving general sparse linear systems. Such linear systems are derived mainly from the Finite Difference method, the Finite Element method, multigrid or multilevel methods. …
-
Modeling viscoelastic free surface and interfacial flows, with applications to the deformation of droplets and blood cells
… solved by parallel GMRES preconditioned by a new sparse approximate inverse preconditioner (SPAI). The parallel solver together with SPAI is scalable in a wide range of capillary and Weissenberg numbers; tests on benchmark viscoelastic free surface flows show that problems with millions of …
-
A quantum computer amenable sparse matrix equation solver
… system. The procedure is most useful for sparse matrix equations, as it allows for the inverse of a matrix to be applied with O(N_nz log (N)) complexity, where N is the number of unknowns, and N_nz is the total number of nonzero elements in the system matrix. This efficiency is independent …
-
Early Verification of the Power Delivery Network in Integrated Circuits
… introduces an efficient method based on a sparse approximate inverse technique to greatly reduce the size of the required linear programs while ensuring a user-specified over-estimation margin on the exact solution. The application of the method is exhibited under both R and RC grid models. …
-
Analysis of an Aggregation-based Algebraic Multigrid Method and its Parallelization
… of conjugate gradient iterations, a parallel sparse approximate inverse (SAI) algorithm is used to construct an approximate inverse of the original matrix in order to replace the preconditioner solving step, which is inherently sequential, by matrix-vector multiplications. The linear systems …
-
Reusing and Updating Preconditioners for Sequences of Matrices
… with special focus on ILUTP and factorized sparse approximate inverses and proposes an update that we refer to as a sparse approximate map or SAM update. Analysis of the residual and eigenvalues of the map will be provided. Applications include the Quantum Monte Carlo method, model …
-
Strategies For Recycling Krylov Subspace Methods and Bilinear Form Estimation
The main theme of this work is effectiveness and efficiency of Krylov subspace methods and Krylov subspace recycling. While solving long, slowly changing sequences of large linear systems, such as the ones that arise in engineering, there are many issues we need to consider if we want to make the …