• 제목/요약/키워드: least-norm least-squares solution

검색결과 19건 처리시간 0.018초

EFFICIENT ESTIMATION OF THE REGULARIZATION PARAMETERS VIA L-CURVE METHOD FOR TOTAL LEAST SQUARES PROBLEMS

  • Lee, Geunseop
    • 대한수학회지
    • /
    • 제54권5호
    • /
    • pp.1557-1571
    • /
    • 2017
  • The L-curve method is a parametric plot of interrelation between the residual norm of the least squares problem and the solution norm. However, the L-curve method may be hard to apply to the total least squares problem due to its no closed form solution of the regularized total least squares problems. Thus the sequence of the solution norm under the fixed regularization parameter and its corresponding residual need to be found with an efficient manner. In this paper, we suggest an efficient algorithm to find the sequence of the solutions and its residual in order to plot the L-curve for the total least squares problems. In the numerical experiments, we present that the proposed algorithm successfully and efficiently plots fairly 'L' like shape for some practical regularized total least squares problems.

AN ITERATIVE ALGORITHM FOR SOLVING THE LEAST-SQUARES PROBLEM OF MATRIX EQUATION AXB+CYD=E

  • Shen, Kai-Juan;You, Chuan-Hua;Du, Yu-Xia
    • Journal of applied mathematics & informatics
    • /
    • 제26권5_6호
    • /
    • pp.1233-1245
    • /
    • 2008
  • In this paper, an iterative method is proposed to solve the least-squares problem of matrix equation AXB+CYD=E over unknown matrix pair [X, Y]. By this iterative method, for any initial matrix pair [$X_1,\;Y_1$], a solution pair or the least-norm least-squares solution pair of which can be obtained within finite iterative steps in the absence of roundoff errors. In addition, we also consider the optimal approximation problem for the given matrix pair [$X_0,\;Y_0$] in Frobenius norm. Given numerical examples show that the algorithm is efficient.

  • PDF

PRECONDITIONED KACZMARZ-EXTENDED ALGORITHM WITH RELAXATION PARAMETERS

  • Popa, Constantin
    • Journal of applied mathematics & informatics
    • /
    • 제6권3호
    • /
    • pp.757-770
    • /
    • 1999
  • We analyse in this paper the possibility of using preconditioning techniques as for square non-singular systems, also in the case of inconsistent least-squares problems. We find conditions in which the minimal norm solution of the preconditioned least-wquares problem equals that of the original prblem. We also find conditions such that thd Kaczmarz-Extendid algorithm with relaxation parameters (analysed by the author in [4]), cna be adapted to the preconditioned least-squares problem. In the last section of the paper we present numerical experiments, with two variants of preconditioning, applied to an inconsistent linear least-squares model probelm.

로버스트추정에 의한 지구물리자료의 역산 (Inversion of Geophysical Data with Robust Estimation)

  • 김희준
    • 자원환경지질
    • /
    • 제28권4호
    • /
    • pp.433-438
    • /
    • 1995
  • The most popular minimization method is based on the least-squares criterion, which uses the $L_2$ norm to quantify the misfit between observed and synthetic data. The solution of the least-squares problem is the maximum likelihood point of a probability density containing data with Gaussian uncertainties. The distribution of errors in the geophysical data is, however, seldom Gaussian. Using the $L_2$ norm, large and sparsely distributed errors adversely affect the solution, and the estimated model parameters may even be completely unphysical. On the other hand, the least-absolute-deviation optimization, which is based on the $L_1$ norm, has much more robust statistical properties in the presence of noise. The solution of the $L_1$ problem is the maximum likelihood point of a probability density containing data with longer-tailed errors than the Gaussian distribution. Thus, the $L_1$ norm gives more reliable estimates when a small number of large errors contaminate the data. The effect of outliers is further reduced by M-fitting method with Cauchy error criterion, which can be performed by iteratively reweighted least-squares method.

  • PDF

ITERATIVE ALGORITHMS FOR THE LEAST-SQUARES SYMMETRIC SOLUTION OF AXB = C WITH A SUBMATRIX CONSTRAINT

  • Wang, Minghui;Feng, Yan
    • Journal of applied mathematics & informatics
    • /
    • 제27권1_2호
    • /
    • pp.1-12
    • /
    • 2009
  • Iterative algorithms are proposed for the least-squares symmetric solution of AXB = E with a submatrix constraint. We characterize the linear mappings from their independent element space to the constrained solution sets, study their properties and use these properties to propose two matrix iterative algorithms that can find the minimum and quasi-minimum norm solution based on the classical LSQR algorithm for solving the unconstrained LS problem. Numerical results are provided that show the efficiency of the proposed methods.

  • PDF

AN ITERATIVE ALGORITHM FOR THE LEAST SQUARES SOLUTIONS OF MATRIX EQUATIONS OVER SYMMETRIC ARROWHEAD MATRICES

  • Ali Beik, Fatemeh Panjeh;Salkuyeh, Davod Khojasteh
    • 대한수학회지
    • /
    • 제52권2호
    • /
    • pp.349-372
    • /
    • 2015
  • This paper concerns with exploiting an oblique projection technique to solve a general class of large and sparse least squares problem over symmetric arrowhead matrices. As a matter of fact, we develop the conjugate gradient least squares (CGLS) algorithm to obtain the minimum norm symmetric arrowhead least squares solution of the general coupled matrix equations. Furthermore, an approach is offered for computing the optimal approximate symmetric arrowhead solution of the mentioned least squares problem corresponding to a given arbitrary matrix group. In addition, the minimization property of the proposed algorithm is established by utilizing the feature of approximate solutions derived by the projection method. Finally, some numerical experiments are examined which reveal the applicability and feasibility of the handled algorithm.

ON THE PURE IMAGINARY QUATERNIONIC LEAST SQUARES SOLUTIONS OF MATRIX EQUATION

  • WANG, MINGHUI;ZHANG, JUNTAO
    • Journal of applied mathematics & informatics
    • /
    • 제34권1_2호
    • /
    • pp.95-106
    • /
    • 2016
  • In this paper, according to the classical LSQR algorithm forsolving least squares (LS) problem, an iterative method is proposed for finding the minimum-norm pure imaginary solution of the quaternionic least squares (QLS) problem. By means of real representation of quaternion matrix, the QLS's correspongding vector algorithm is rewrited back to the matrix-form algorthm without Kronecker product and long vectors. Finally, numerical examples are reported that show the favorable numerical properties of the method.

THE (R,S)-SYMMETRIC SOLUTIONS TO THE LEAST-SQUARES PROBLEM OF MATRIX EQUATION AXB = C

  • Liang, Mao-Lin;Dai, Li-Fang;Wang, San-Fu
    • Journal of applied mathematics & informatics
    • /
    • 제27권5_6호
    • /
    • pp.1061-1071
    • /
    • 2009
  • For real generalized reflexive matrices R, S, i.e., $R^T$ = R, $R^2$ = I, $S^T$ = S, $S^2$ = I, we say that real matrix X is (R,S)-symmetric, if RXS = X. In this paper, an iterative algorithm is proposed to solve the least-squares problem of matrix equation AXB = C with (R,S)-symmetric X. Furthermore, the optimal approximation solution to given matrix $X_0$ is also derived by this iterative algorithm. Finally, given numerical example and its convergent curve show that this method is feasible and efficient.

  • PDF

NONCONFORMING SPECTRAL ELEMENT METHOD FOR ELASTICITY INTERFACE PROBLEMS

  • Kumar, N. Kishore
    • Journal of applied mathematics & informatics
    • /
    • 제32권5_6호
    • /
    • pp.761-781
    • /
    • 2014
  • An exponentially accurate nonconforming spectral element method for elasticity systems with discontinuities in the coefficients and the flux across the interface is proposed in this paper. The method is least-squares spectral element method. The jump in the flux across the interface is incorporated (in appropriate Sobolev norm) in the functional to be minimized. The interface is resolved exactly using blending elements. The solution is obtained by the preconditioned conjugate gradient method. The numerical solution for different examples with discontinuous coefficients and non-homogeneous jump in the flux across the interface are presented to show the efficiency of the proposed method.