Reduced rank approximation of matrices has hitherto been possible only by unweighted least squares. This paper presents iterative techniques for obtaining such approximations when weights are ...

We consider polynomial approximation on the unit sphere S² = {(x, y, z) Є R³ : x² + y² + z² = 1} by a class of regularized discrete least squares methods with novel choices for the regularization ...

The element‐free Galerkin (EFG) methods represent a significant progression in numerical analysis, harnessing meshless techniques to overcome challenges associated with conventional meshing. By ...

In this talk we introduce an approach that augments least-squares finite element formulations with user-specified goals or quantities-of-interest. The method incorporates the quantity-of-interest into ...