Sciweavers

6542 search results - page 1274 / 1309
» The tao of parallelism in algorithms
Sort
View
SIAMSC
2011
151views more  SIAMSC 2011»
13 years 3 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
SIAMREV
2010
174views more  SIAMREV 2010»
13 years 3 months ago
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
Benjamin Recht, Maryam Fazel, Pablo A. Parrilo
SIAMSC
2010
104views more  SIAMSC 2010»
13 years 3 months ago
BDDC Preconditioners for Spectral Element Discretizations of Almost Incompressible Elasticity in Three Dimensions
Abstract. BDDC algorithms are constructed and analyzed for the system of almost incompressible elasticity discretized with Gauss-Lobatto-Legendre spectral elements in three dimensi...
Luca F. Pavarino, Olof B. Widlund, Stefano Zampini
TCBB
2010
108views more  TCBB 2010»
13 years 3 months ago
Identification of Full and Partial Class Relevant Genes
Multiclass cancer classification on microarray data has provided the feasibility of cancer diagnosis across all of the common malignancies in parallel. Using multiclass cancer feat...
Zexuan Zhu, Yew-Soon Ong, Jacek M. Zurada
TSP
2010
13 years 3 months ago
Distributed sparse linear regression
The Lasso is a popular technique for joint estimation and continuous variable selection, especially well-suited for sparse and possibly under-determined linear regression problems....
Gonzalo Mateos, Juan Andrés Bazerque, Georg...
« Prev « First page 1274 / 1309 Last » Next »