Sciweavers

40 search results - page 1 / 8
» Preconditioned iterative methods on sparse subspaces
Sort
View
APPML
2006
56views more  APPML 2006»
13 years 11 months ago
Preconditioned iterative methods on sparse subspaces
Kazufumi Ito, Jari Toivanen
DAC
2001
ACM
14 years 12 months ago
Efficient Large-Scale Power Grid Analysis Based on Preconditioned Krylov-Subspace Iterative Methods
In this paper, we propose preconditioned Krylov-subspace iterative methods to perform efficient DC and transient simulations for large-scale linear circuits with an emphasis on po...
Tsung-Hao Chen, Charlie Chung-Ping Chen
EUROPAR
2009
Springer
14 years 5 months ago
PSPIKE: A Parallel Hybrid Sparse Linear System Solver
The availability of large-scale computing platforms comprised of tens of thousands of multicore processors motivates the need for the next generation of highly scalable sparse line...
Murat Manguoglu, Ahmed H. Sameh, Olaf Schenk
NA
2011
373views Computer Vision» more  NA 2011»
13 years 5 months ago
On preconditioned MHSS iteration methods for complex symmetric linear systems
We propose a preconditioned variant of the modified HSS (MHSS) iteration method for solving a class of complex symmetric systems of linear equations. Under suitable conditions, w...
Zhong-Zhi Bai, Michele Benzi, Fang Chen
SIAMSC
2011
151views more  SIAMSC 2011»
13 years 5 months ago
Inexact Newton Methods with Restricted Additive Schwarz Based Nonlinear Elimination for Problems with High Local Nonlinearity
The classical inexact Newton algorithm is an efficient and popular technique for solving large sparse nonlinear system of equations. When the nonlinearities in the system are wellb...
Xiao-Chuan Cai, Xuefeng Li