نتایج جستجو برای: golub kahan bidiagonalization
تعداد نتایج: 707 فیلتر نتایج به سال:
We consider the solution of large linear systems of equations that arise from the discretization of ill-posed problems. The matrix has a Kronecker product structure and the right-hand side is contaminated by measurement error. Problems of this kind arise, for instance, from the discretization of Fredholm integral equations of the first kind in two space-dimensions with a separable kernel and in...
This paper discusses the implementation and evaluation of the reduction of a dense matrix to bidiagonal form on the Trident processor. The standard Golub and Kahan Householder bidiagonalization algorithm, which is rich in matrix-vector operations, and the LAPACK subroutine _GEBRD, which is rich in a mixture of vector, matrix-vector, and matrix operations, are simulated on the Trident processor....
Abstract Randomized methods can be competitive for the solution of problems with a large matrix low rank. They also have been applied successfully to large-scale linear discrete ill-posed by Tikhonov regularization (Xiang and Zou in Inverse Probl 29:085008, 2013). This entails computation an approximation partial singular value decomposition A that is numerical The present paper compares random...
An iterative method LSMR is presented for solving linear systems Ax = b and leastsquares problems min ‖Ax−b‖2, with A being sparse or a fast linear operator. LSMR is based on the Golub-Kahan bidiagonalization process. It is analytically equivalent to the MINRES method applied to the normal equation ATAx = ATb, so that the quantities ‖Ark‖ are monotonically decreasing (where rk = b−Axk is the re...
The present paper is concerned with developing tensor iterative Krylov subspace methods to solve large multi-linear equations. We use the T-product for two tensors define tubal global Arnoldi and Golub-Kahan bidiagonalization algorithms. Furthermore, we illustrate how tensor-based approaches can be exploited ill-posed problems arising from recovering blurry multichannel (color) images videos, u...
In theory, the Lanczos algorithm generates an orthogonal basis of corresponding Krylov subspace. However, in finite precision arithmetic orthogonality and linear independence computed vectors is usually lost quickly. this paper we study a class matrices starting having special nonzero structure that guarantees exact computations whenever floating point satisfying IEEE 754 standard used. Analogo...
This paper is concerned with estimating the solutions of numerically ill-posed least squares problems through Tikhonov regularization. Given a priori estimates on the covariance structure of errors in the measurement data b, and a suitable statistically-chosen σ, the Tikhonov regularized least squares functional J(σ) = ‖Ax − b‖2Wb + 1/σ 2‖D(x − x0)‖2, evaluated at its minimizer x(σ), approximat...
The reduction of a large-scale symmetric linear discrete ill-posed problem with multiple right-hand sides to smaller block tridiagonal matrix can easily be carried out by the application small number steps Lanczos method. We show that subdiagonal blocks reduced converge zero fairly rapidly increasing number. This quick convergence indicates there is little advantage in expressing solutions prob...
This paper discusses several transform-based methods for solving linear discrete ill-posed problems third order tensor equations based on a tensor-tensor product defined by an invertible transform. Linear products were first introduced in Kernfeld et al. (2015) [16]. These are applied to derive Tikhonov regularization Golub-Kahan-type bidiagonalization and Arnoldi-type processes. GMRES-type sol...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید