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 20 of 20 for “"BiCGSTAB"”.
-
Recycling Bi-Lanczos Algorithms: BiCG, CGS, and BiCGSTAB
… approach is extended to the CGS and the BiCGSTAB algorithms. Experiments on a convection-diffusion problem give promising results.
-
A Smoothing Newton-BICGStab Method for Least Squares Matrix Nuclear Norm Problems
In this thesis, we study a smoothing Newton-BiCGStab method for the least squares nonsymmetric matrix nuclear norm problems. For this type of problems, when linear inequality and second-order cone constraints are present, the dual problem is equivalent to a system of nonsmooth equations. Some …
-
Simulation of borehole electromagnetic measurements in dipping and anisotropic rock formations and inversion of array induction data
… technique is a full-wave modeling technique: the BiCGSTAB(L)-FFT (Bi-Conjugate Gradient STABilized(L)-Fast Fourier Transform). This technique is efficient both in terms of computational speed [~ ( ) 2 ON N log ] and computer memory storage [~O N( )], where N is the number of spatial discretization …
-
Precondicionador multiescala aplicado à geomecânica
… of linear solvers such as Conjugate Gradient and Bicgstab. The results show comparisons between the use of additive and multiplicative coupled preconditioners showing that, in cases where the coarsening is sufficiently high, the lower complexity of the additive can speed up the solution process. …
-
Preconditioned iterative methods for highly sparse, nonsymmetric, unstructured linear algebra problems
… Methods tested include Craig’s method, GMRES(k), BiCGSTAB, QMR, KACZ (a row-projection method) and LSQR. The convergence rates of these methods may be improved by use of a suitable preconditioner. Several such techniques are considered, including incomplete LU factorization (ILU), sparse submatrix …
-
Recycling Krylov Subspaces and Preconditioners
… of other bi-Lanczos based methods like CGS, BiCGSTAB, BiCGSTAB2, BiCGSTAB(l), QMR, and TFQMR. We develop a generalized bi-Lanczos algorithm, where the two matrices of the bi-Lanczos procedure are not each other's conjugate transpose but satisfy this relation over the generated Krylov …
-
Development of a Parallel Computational Framework to Solve Flow and Transport in Integrated Surface-Subsurface Hydrologic Systems
… and the sparse-matrix solver, preconditioned BiCGSTAB. The Jacobian matrix assembly is parallelized by using a static scheduling scheme with taking account into data racing conditions, which may occur during the matrix construction. The parallelization of the solver is achieved by partitioning …
-
Analysis of the BiCG Method
… basis of several very popular methods, such as BiCGStab. The short recurrence makes BiCG preferable to other Krylov methods because of decreased memory usage and CPU time. However, BiCG does not satisfy any optimality conditions and it has been shown that for up to n/2-1 iterations, a special …
-
Structured Low Rank Matrix Optimization Problems: A Penalty Approach
… a quadratically convergent smoothing Newton-BiCGStab method to solve the resulted sub-problems. Numerical results indicate that our approach is able to handle both the rank and the linear constraints effectively, in particular in the situations when the rank is not very small.
-
On multigrid methods for solving electromagnetic scattering problems
… failed to converge, the multigrid-preconditioned BICGSTAB proved to be the most reliable and the fastest from the tested algorithms, for both model problems and any type of boundary conditions.
-
Iterative Methods and Multiscale Methods for Linear Systems in Modal Discontinuous Galerkin Discretizations
… as the conjugate gradient method, GMRES, and BiCGStab have remained popular and relevant, and they have proven themselves to be scalable tools in eras of exponential growth in computing power and increasing heterogeneity of computing hardware. In this thesis, I evaluate the convergence and …
-
Distributed analysis of Markov chains
… are surveyed and two iterative methods, BiCG and BiCGSTAB, were chosen for a parallel implementation to show that this stage of analysis also benefits from a distributed approach. The results from the distributed generation algorithm show a good speed up of the state space generation phase and that …
-
Parallel Black Oil Solvers on GPU
… based on GPU. For solvers, it has GMRES, BICGSTAB, ORTHOMIN etc, which are commonly used in reservoir simulators. For preconditioners, a group of ILU preconditioners are developed on GPU, including ILU(0), ILUT, block ILU(0), block ILUT. In the numerical experiments performed, the SPE10 …
-
An Incompressible Navier-Stokes Equations Solver on the GPU Using CUDA
… has been evaluated. The CG, GMRES and BiCGStab iterative solvers have been implemented on the CUDA GPGPU platform and evaluated together with the Jacobi, and Least Square Polynomial preconditioners. A double precision Navier-Stokes solver has been implemented using CUDA, adopting a …
-
Αριθμητικές μέθοδοι σε σύγχρονες υπολογιστικές αρχιτεκτονικές για προβλήματα πολλαπλών χωρίων
… linear system, methods such as the BiCGSTAB iterative method and Cyclic Reduction are being used. The solver is designed to be implemented on multicore computational systems and parallel architectures using the OpenMP standard, with low memory requirements, and is extensible to …
-
Interfacing The CFD Code MFiX With The PETSc Linear Solver Library To Achieve Reduced Computation Times
… right-side Block Jacobi preconditioning to the BiCGSTAB iterative solver in MFiX-PETSc was 28-40% faster than MFiX's native solver at the finest mesh resolution. Similarly, the left-side Block Jacobi preconditioner in MFiX-PETSc was 27â46% faster for the same fine meshing. Further assessments …
-
A family of preconditioned iterative solvers for sparse linear systems
… show that even though methods like CGS and BiCGSTAB may converge faster for many problems, EN-like methods are in general more robust, since, like GMRES, they have the option of increasing the size of the Krylov subspace. Additionally, they often require less memory than GMRES or ORTHOMIN. …
-
Performance of Krylov subspace methods In equivariant Branch following
… (GMRES), Bi-Conjugate Gradients - Stabilized (BiCGSTAB), and Transpose-Free Quasi-Minimal Residual (TFQMR) used in nonlinear solver routines during branch-following analysis in the presence of symmetry is measured and evaluated. Group theory provides that along branches of symmetric …
-
Parallel computational methods for solving large linear systems
… iterative schemes include the preconditioned BiCGSTAB (PBiCGSTAB) method enhanced with the modified generic factored approximate sparse inverse (MGenFASpI) matrix for solving the unsymmetric linear systems. Whereas, the preconditioned conjugate gradient method in conjunction with the SFASI …
-
Computational Aspects and Application of Numerical Simulations of Development of Biofilms Modelled with Systems of Stiff Evolutionary Partial Differential Equations
This paper considers biofilm growth models, a subclass of mesoscopic models, with multiple biological species and multiple chemical substrates, on which the growth of species is dependent, as well as with a molecular inter-species signal. The mathematical models are realized as systems of stiff …