Sciweavers

378 search results - page 26 / 76
» Convergence of rank-type equations
Sort
View
MOC
2002
77views more  MOC 2002»
14 years 9 months ago
Directional Newton methods in n variables
Directional Newton methods for functions f of n variables are shown to converge, under standard assumptions, to a solution of f(x) = 0. The rate of convergence is quadratic, for ne...
Yuri Levin, Adi Ben-Israel
IPPS
2009
IEEE
15 years 4 months ago
Dynamic iterations for the solution of ordinary differential equations on multicore processors
In the past few years, there has been a trend of providing increased computing power through greater number of cores on a chip, rather than through higher clock speeds. In order t...
Yanan Yu, Ashok Srinivasan
ADCM
2000
45views more  ADCM 2000»
14 years 9 months ago
Training neural networks with noisy data as an ill-posed problem
This paper is devoted to the analysis of network approximation in the framework of approximation and regularization theory. It is shown that training neural networks and similar n...
Martin Burger, Heinz W. Engl
JSCIC
2010
97views more  JSCIC 2010»
14 years 4 months ago
Finite Element Characteristic Methods Requiring no Quadrature
The characteristic methods are known to be very efficient for convection-diffusion problems including the Navier-Stokes equations. Convergence is established when the integrals ar...
Olivier Pironneau
SIAMMA
2011
97views more  SIAMMA 2011»
14 years 9 days ago
Convergence Rates for Greedy Algorithms in Reduced Basis Methods
The reduced basis method was introduced for the accurate online evaluation of solutions to a parameter dependent family of elliptic partial differential equations. ly, it can be ...
Peter Binev, Albert Cohen, Wolfgang Dahmen, Ronald...