Sciweavers

1997 search results - page 94 / 400
» On the convergence of Hill's method
Sort
View
107
Voted
SIAMSC
2008
140views more  SIAMSC 2008»
15 years 23 days ago
Compact Fourier Analysis for Designing Multigrid Methods
The convergence of Multigrid methods can be analyzed based on a Fourier analysis of the method or by proving certain inequalities that have to be fulfilled by the smoother and by t...
Thomas K. Huckle
91
Voted
MOC
2000
105views more  MOC 2000»
15 years 18 days ago
On the iteratively regularized Gauss-Newton method for solving nonlinear ill-posed problems
The iteratively regularized Gauss-Newton method is applied to compute the stable solutions to nonlinear ill-posed problems F (x) = y when the data y is given approximately by y wit...
Jin Qi-nian
SADM
2008
178views more  SADM 2008»
15 years 9 days ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
123
Voted
ECCV
2008
Springer
16 years 2 months ago
A Lattice-Preserving Multigrid Method for Solving the Inhomogeneous Poisson Equations Used in Image Analysis
Abstract. The inhomogeneous Poisson (Laplace) equation with internal Dirichlet boundary conditions has recently appeared in several applications ranging from image segmentation [1,...
Leo Grady
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
15 years 4 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali