Sciweavers

6105 search results - page 1192 / 1221
» A Parallel Algorithm for Bound-Smoothing
Sort
View
CORR
2011
Springer
235views Education» more  CORR 2011»
13 years 3 months ago
On the accuracy of language trees
Historical linguistics aims at inferring the most likely language phylogenetic tree starting from information concerning the evolutionary relatedness of languages. The available i...
Simone Pompei, Vittorio Loreto, Francesca Tria
SIAMJO
2011
13 years 3 months ago
Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...
Min Tao, Xiaoming Yuan
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
« Prev « First page 1192 / 1221 Last » Next »