نتایج جستجو برای: least squares boundary residual method
تعداد نتایج: 2145619 فیلتر نتایج به سال:
lsmr (least squares minimal residual) is an iterative method for the solution of the linear system of equations and leastsquares problems. this paper presents a block version of the lsmr algorithm for solving linear systems with multiple right-hand sides. the new algorithm is based on the block bidiagonalization and derived by minimizing the frobenius norm of the resid ual matrix of normal equa...
(2000) Meshless local Petrov–Galerkin (MLPG) method in combination with finite element and boundary element approaches. Abstract The Meshless Local Petrov-Galerkin (MLPG) method is an effective truly meshless method for solving partial differential equations using Moving Least Squares (MLS) interpolants. It is, however, computationally expensive for some problems. A coupled MLPG/Finite Element ...
We study an interior-point gradient method for solving a class of so-called totally nonnegative least squares problems. At each iteration, the method decreases the residual norm along a diagonally scaled negative gradient direction with a special scaling. We establish the global convergence of the method, and present some numerical examples to compare the proposed method with a few similar meth...
The standard approaches to solving overdetermined linear systems Bx ≈ c construct minimal corrections to the data to make the corrected system compatible. In ordinary least squares (LS) the correction is restricted to the right hand side c, while in scaled total least squares (STLS) [14, 12] corrections to both c and B are allowed, and their relative sizes are determined by a real positive para...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید