Sciweavers

21 search results - page 3 / 5
» Iteratively constructing preconditioners via the conjugate g...
Sort
View
SAC
2009
ACM
14 years 17 days ago
Bulk based preconditioning for quantum dot computations
Abstract— This article describes how to accelerate the convergence of Preconditioned Conjugate Gradient (PCG) type eigensolvers for the computation of several states around the b...
Christof Vömel, Stanimire Tomov, Osni Marques
DAC
2001
ACM
14 years 6 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
JMLR
2012
11 years 8 months ago
Krylov Subspace Descent for Deep Learning
In this paper, we propose a second order optimization method to learn models where both the dimensionality of the parameter space and the number of training samples is high. In ou...
Oriol Vinyals, Daniel Povey
SPAA
2004
ACM
13 years 11 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
SIAMNUM
2010
95views more  SIAMNUM 2010»
13 years 16 days ago
Robust BDDC Preconditioners for Reissner-Mindlin Plate Bending Problems and MITC Elements
A Balancing Domain Decomposition Method by Constraints (BDDC) is constructed and analyzed for the Reissner-Mindlin plate bending problem discretized with MITC finite elements. This...
L. Beirão da Veiga, C. Chinosi, Carlo Lovad...