Results 1 to 10 of about 213 (32)

A CENTER OF A POLYTOPE: AN EXPOSITORY REVIEW AND A PARALLEL IMPLEMENTATION [PDF]

open access: yes, 1992
. The solution space of the rectangular linear system Az b, subject to x> 0, is called a polytope. An attempt is made to provide a deeper geometric insight, with numerical examples, into the condensed paper by Lord, et al.
D. W. Fausett, Hongwei Du, S. K. Sen
core   +6 more sources

Iterative Solution of Weighted Linear Least Squares Problems

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2020
In this report we show that the iterated regularization scheme due to Riley and Golub, sometimes also called the iterated Tikhonov regularization, can be generalized to damped least squares problems where the weights matrix D is not necessarily the ...
Carp Doina   +3 more
doaj   +1 more source

The Variation of the Salt Concentration at the Discharge of a River into a Saline Water

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2020
A plume model is used to describe the variation of the salt concentration at the discharge of a river into a saline water. The integral model of the plume behavior consists of a set of ordinary differential equations derived from conservation of mass ...
Juncu Gheorghe   +2 more
doaj   +1 more source

Solving systems of phaseless equations via Kaczmarz methods: A proof of concept study [PDF]

open access: yes, 2015
We study the Kaczmarz methods for solving systems of quadratic equations, i.e., the generalized phase retrieval problem. The methods extend the Kaczmarz methods for solving systems of linear equations by integrating a phase selection heuristic in each ...
Wei, Ke
core   +1 more source

A Gauss--Newton iteration for Total Least Squares problems [PDF]

open access: yes, 2017
The Total Least Squares solution of an overdetermined, approximate linear equation $Ax \approx b$ minimizes a nonlinear function which characterizes the backward error.
Fasino, Dario, Fazzi, Antonio
core   +2 more sources

A novel interpretation of least squares solution

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 15, Issue 1, Page 41-46, 1992., 1991
We show that the well‐known least squares (LS) solution of an overdetermined system of linear equations is a convex combination of all the non‐trivial solutions weighed by the squares of the corresponding denominator determinants of the Cramer′s rule. This Least Squares Decomposition (LSD) gives an alternate statistical interpretation of least squares,
Jack-Kang Chan
wiley   +1 more source

On Remotest set and Random controls in Kaczmarz algorithm

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2018
In this paper we analyse the Kaczmarz projection algorithm with Remotest set and Random control of projection indices and provide a suficient condition such that each projection index appears infinitely many times during the iterations.
Popa Constantin
doaj   +1 more source

A fast semi-direct least squares algorithm for hierarchically block separable matrices [PDF]

open access: yes, 2014
We present a fast algorithm for linear least squares problems governed by hierarchically block separable (HBS) matrices. Such matrices are generally dense but data-sparse and can describe many important operators including those derived from ...
Greengard, Leslie, Ho, Kenneth L.
core   +2 more sources

Weaker assumptions for convergence of extended block Kaczmarz and Jacobi projection algorithms

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2017
Recent developments in the field of image reconstruction have given rise to the use of projective iterative methods, such as Kaczmarz and Jacobi, when solving inconsistent linear least squares problems. In this paper we try to generalize previous results
Carp Doina   +2 more
doaj   +1 more source

Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods [PDF]

open access: yes, 2017
The efficient solution of large linear least-squares problems in which the system matrix A contains rows with very different densities is challenging.
Davis T. A.   +4 more
core   +2 more sources

Home - About - Disclaimer - Privacy