• 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.

• 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.

• 대한수학회지
• /
• 제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.

• 대한수학회지
• /
• 제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.

• 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.

• 대한수학회지
• /
• 제43권6호
• /
• pp.1159-1167
• /
• 2006

An efficient method for reanalysis of a damaged structures is presented. Perturbation analysis for the equality constrained least squares problem is adapted to handle structural reanalysis, and related theoretical and numerical results are presented.

• 호남수학학술지
• /
• 제37권3호
• /
• pp.299-315
• /
• 2015

In this paper, we study the first-order system least-squares (FOSLS) spectral method for parabolic partial differential equations. There were lots of least-squares approaches to solve elliptic partial differential equations using finite element approximation. Also, some approaches using spectral methods have been studied in recent. In order to solve the parabolic partial differential equations in parallel, we consider a parallel numerical method based on a hybrid method of the frequency-domain method and first-order system least-squares method. First, we transform the parabolic problem in the space-time domain to the elliptic problems in the space-frequency domain. Second, we solve each elliptic problem in parallel for some frequencies using the first-order system least-squares method. And then we take the discrete inverse Fourier transforms in order to obtain the approximate solution in the space-time domain. We will introduce such a hybrid method and then present a numerical experiment.

• East Asian mathematical journal
• /
• 제35권5호
• /
• pp.569-587
• /
• 2019

In this paper, we consider a split least-squares characteristic mixed element method for Sobolev equations with a convection term. First, to manipulate both convection term and time derivative term efficiently, we apply a characteristic mixed element method to get the system of equations in the primal unknown and the flux unknown and then get a least-squares minimization problem and a least-squares characteristic mixed element scheme. Finally, we obtain a split least-squares characteristic mixed element scheme for the given problem whose system is uncoupled in the unknowns. We prove the optimal order in $L^2$ and $H^1$ normed spaces for the primal unknown and the suboptimal order in $L^2$ normed space for the flux unknown.

• East Asian mathematical journal
• /
• 제38권3호
• /
• pp.293-319
• /
• 2022

In this paper, we introduce a higher order split least-squares characteristic mixed element scheme for Sobolev equations. First, we use a characteristic mixed element method to manipulate both convection term and time derivative term efficiently and obtain the system of equations in the primal unknown and the flux unknown. Second, we define a least-squares minimization problem and a least-squares characteristic mixed element scheme. Finally, we obtain a split least-squares characteristic mixed element scheme for the given problem whose system is uncoupled in the unknowns. We establish the convergence results for the primal unknown and the flux unknown with the second order in a time increment.

• 대한수학회지
• /
• 제54권2호
• /
• pp.613-626
• /
• 2017

For the overdetermined linear system, when both the data matrix and the observed data are contaminated by noise, Total Least Squares method is an appropriate approach. Since an ill-conditioned data matrix with noise causes a large perturbation in the solution, some kind of regularization technique is required to filter out such noise. In this paper, we consider a Dual regularized Total Least Squares problem. Unlike the Tikhonov regularization which constrains the size of the solution, a Dual regularized Total Least Squares problem considers two constraints; one constrains the size of the error in the data matrix, the other constrains the size of the error in the observed data. Our method derives two nonlinear equations to construct the iterative method. However, since the Jacobian matrix of two nonlinear equations is not guaranteed to be nonsingular, we adopt a trust-region based iteration method to obtain the solution.