High temperature superconductor accelerator magnets
J Van Nugteren - 2016 - cds.cern.ch
For future particle accelerators bending dipoles are considered with magnetic fields
exceeding $20 T $. This can only be achieved using high temperature superconductors …
exceeding $20 T $. This can only be achieved using high temperature superconductors …
Parallel sparse approximate inverse preconditioning on graphic processing units
Accelerating numerical algorithms for solving sparse linear systems on parallel architectures
has attracted the attention of many researchers due to their applicability to many …
has attracted the attention of many researchers due to their applicability to many …
Preconditioning parametrized linear systems
Preconditioners are generally essential for fast convergence in the iterative solution of linear
systems of equations. However, the computation of a good preconditioner can be expensive …
systems of equations. However, the computation of a good preconditioner can be expensive …
Sparse approximate inverses for preconditioning, smoothing, and regularization
M Sedlacek - 2012 - mediatum.ub.tum.de
Sparse approximate inverses (SPAI) are suitable parallel preconditioners for the iterative
solution of large-scale ill-conditioned linear systems of equations on supercomputers …
solution of large-scale ill-conditioned linear systems of equations on supercomputers …
A Monte Carlo approach to sparse approximate inverse matrix computations
J Straßburg, VN Alexandrov - Procedia Computer Science, 2013 - Elsevier
In this paper we present a stochastic SPAI pre-conditioner. In contrast to the standard
deterministic SPAI pre-conditioners that use the Frobenius norm, we present a Monte Carlo …
deterministic SPAI pre-conditioners that use the Frobenius norm, we present a Monte Carlo …
[PDF][PDF] Asynchronous parallel solvers for linear systems arising in computational engineering
PK Jimack, MA Walkley - Computational technology reviews, 2011 - academia.edu
Abstract Modern trends in Computational Science and Engineering are moving towards the
use of computer systems with ever increasing numbers of computational cores. A …
use of computer systems with ever increasing numbers of computational cores. A …
[HTML][HTML] Towards Monte Carlo preconditioning approach and hybrid Monte Carlo algorithms for matrix computations
V Alexandrov, OA Esquivel-Flores - Computers & Mathematics with …, 2015 - Elsevier
An enhanced version of a stochastic SParse Approximate Inverse (SPAI) preconditioner for
general matrices is presented in this paper. This method is used in contrast to the standard …
general matrices is presented in this paper. This method is used in contrast to the standard …
On the preconditioned quasi-Monte Carlo algorithm for matrix computations
V Alexandrov, O Esquivel-Flores, S Ivanovska… - Large-Scale Scientific …, 2015 - Springer
In this paper we present a quasi-Monte Carlo Sparse Approximate Inverse (SPAI)
preconditioner. In contrast to the standard deterministic SPAI preconditioners that use the …
preconditioner. In contrast to the standard deterministic SPAI preconditioners that use the …
Enhancing monte carlo preconditioning methods for matrix computations
J Straßburg, V Alexandrov - Procedia Computer Science, 2014 - Elsevier
An enhanced version of a stochastic SParse Approximate Inverse (SPAI) preconditioner for
general matrices is presented. This method is used in contrast to the standard deterministic …
general matrices is presented. This method is used in contrast to the standard deterministic …
A hybrid recursive multilevel incomplete factorization preconditioner for solving general linear systems
Y Bu, B Carpentieri, Z Shen, TZ Huang - Applied Numerical Mathematics, 2016 - Elsevier
In this paper we introduce an algebraic recursive multilevel incomplete factorization
preconditioner, based on a distributed Schur complement formulation, for solving general …
preconditioner, based on a distributed Schur complement formulation, for solving general …