๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computational acceleration of projection algorithms for the linear best approximation problem

โœ Scribed by Yair Censor

Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
186 KB
Volume
416
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Computational experience with approximat
Computational experience with approximation algorithms for the set covering problem
โœ Tal Grossman; Avishai Wool ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 722 KB

The Set Covering problem (SCP) is a well known combinatorial optimization problem, which is NP-hard. We conducted a comparative study of nine different approximation algorithms for the SCP, including several greedy variants, fractional relaxations, randomized algorithms and a neural network algorith

Computable error estimators for the appr
Computable error estimators for the approximation of nonlinear problems by linearized models
โœ Alexandra L. Chaillou; Manil Suri ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 321 KB

In the modeling of nonlinear phenomena, a nonlinear model may often be replaced by a linear one, giving rise to a modeling or linearization error. This is in addition to the discretization error introduced when this linear model is solved, using, e.g., the finite element method. We investigate the a