A class of formulas for converting linear matrix mappings into conventional linear mappings are presented. Using them, an easily computable numerical method for complete parameterized solutions of the Sylvester matrix...A class of formulas for converting linear matrix mappings into conventional linear mappings are presented. Using them, an easily computable numerical method for complete parameterized solutions of the Sylvester matrix equation AX - EXF = BY and its dual equation XA - FXE = YC are provided. It is also shown that the results obtained can be used easily for observer design. The method proposed in this paper is universally applicable to linear matrix equations.展开更多
The volcanics matrix parameters are variable in different areas and even in different intervals of a same well,due to its complicated mineral compositions and variable mineral contents. The determination of matrix par...The volcanics matrix parameters are variable in different areas and even in different intervals of a same well,due to its complicated mineral compositions and variable mineral contents. The determination of matrix parameters is significant because it has an effect on the porosity calculation accuracy. The authors proposed a simple but useful dual-component model to calculate porosity,and the results are compatible with the core porosity.展开更多
The matrix least squares （LS） problem minx ｜｜AXB^T--T｜｜F is trivial and its solution can be simply formulated in terms of the generalized inverse of A and B. Its generalized problem minx1,x2 ｜｜A1X1B1^T ＋ A2X2...The matrix least squares （LS） problem minx ｜｜AXB^T--T｜｜F is trivial and its solution can be simply formulated in terms of the generalized inverse of A and B. Its generalized problem minx1,x2 ｜｜A1X1B1^T ＋ A2X2B2^T - T｜｜F can also be regarded as the constrained LS problem minx=diag（x1,x2） ｜｜AXB^T -T｜｜F with A = [A1, A2] and B = [B1, B2]. The authors transform T to T such that min x1,x2 ｜｜A1X1B1^T＋A2X2B2^T -T｜｜F is equivalent to min x=diag（x1 ,x2） ｜｜AXB^T - T｜｜F whose solutions are included in the solution set of unconstrained problem minx ｜｜AXB^T - T｜｜F. So the general solutions of min x1,x2 ｜｜A1X1B^T ＋ A2X2B2^T -T｜｜F are reconstructed by selecting the parameter matrix in that of minx ｜｜AXB^T - T｜｜F.展开更多
This paper presents a gradient based iterative algorithm for Sylvester-conjugate matrix equations with a unique solution. By introducing a relaxation parameter and applying the hierarchical identification principle, a...This paper presents a gradient based iterative algorithm for Sylvester-conjugate matrix equations with a unique solution. By introducing a relaxation parameter and applying the hierarchical identification principle, an iterative algorithm is constructed to solve Sylvester matrix equations. By applying a real representation of a complex matrix as a tool and using some properties of the real representation, convergence analysis indicates that the iterative solutions converge to the exact solutions for any initial values under certain assumptions.Numerical examples are given to illustrate the efficiency of the proposed approach.展开更多
In this paper, a carangiform robotic fish with 4-DoF （degree of freedom） tail has been developed. The robotic fish has capability of swimming under two modes that are radio control and autonomous swimming. Experimen...In this paper, a carangiform robotic fish with 4-DoF （degree of freedom） tail has been developed. The robotic fish has capability of swimming under two modes that are radio control and autonomous swimming. Experiments were conducted to investigate the influences of characteristic parameters including the frequency, the amplitude, the wave length, the phase difference and the coefficient on forward velocity. The experimental results shown that the swimming performance of the robotic fish is affected mostly by the characteristic parameters observed.展开更多
In recent years,many efforts have been made to numerically solving the constrained optimization distributed control problems,in which the most common one is to discretize the partial differential equation first and th...In recent years,many efforts have been made to numerically solving the constrained optimization distributed control problems,in which the most common one is to discretize the partial differential equation first and then solve the resulting system of linear equations.A number of preconditioned Krylov subspace methods have been constructed to solve the resulting system of linear equations in the literature.In this paper,by analyzing the block-diagonal preconditioner presented by Zhang,et al.(Zhang X Y,Yan H Y,Huang Y M.On preconditioned MINRES method for solving the distributed control problems.Commun Appl Math Comput,2014,28:128-132.),we propose a parameterized block-diagonally preconditioned linear system where a parameterized preconditioner is utilized and the preconditioned MINRES method is applied to solve the system of linear equations.The spectral analysis of the proposed preconditioned matrix shows that the spectral distribution of the parameterized preconditioning matrix should be much more clustered if the parameter is greater than 1.Numerical Experiments show that the preconditioned MINRES method is efficient for solving the distributed control problems.展开更多
基金supported by National Natural Science Foundation of China (No. 60736022, No. 60821091)
文摘A class of formulas for converting linear matrix mappings into conventional linear mappings are presented. Using them, an easily computable numerical method for complete parameterized solutions of the Sylvester matrix equation AX - EXF = BY and its dual equation XA - FXE = YC are provided. It is also shown that the results obtained can be used easily for observer design. The method proposed in this paper is universally applicable to linear matrix equations.
基金Supported by projects of the National Natural Science Foundation of China (No. 41174096)the Ministry of Science and Technology of China (No.2011ZX05009 No. 2011ZX05044)
文摘The volcanics matrix parameters are variable in different areas and even in different intervals of a same well,due to its complicated mineral compositions and variable mineral contents. The determination of matrix parameters is significant because it has an effect on the porosity calculation accuracy. The authors proposed a simple but useful dual-component model to calculate porosity,and the results are compatible with the core porosity.
基金supported in part by the Social Science Foundation of Ministry of Education(07JJD790154)the National Science Foundation for Young Scholars (60803076)+2 种基金the Natural Science Foundation of Zhejiang Province (Y6090211)Foundation of Education Department of Zhejiang Province (20070590)the Young Talent Foundation of Zhejiang Gongshang University
文摘The matrix least squares （LS） problem minx ｜｜AXB^T--T｜｜F is trivial and its solution can be simply formulated in terms of the generalized inverse of A and B. Its generalized problem minx1,x2 ｜｜A1X1B1^T ＋ A2X2B2^T - T｜｜F can also be regarded as the constrained LS problem minx=diag（x1,x2） ｜｜AXB^T -T｜｜F with A = [A1, A2] and B = [B1, B2]. The authors transform T to T such that min x1,x2 ｜｜A1X1B1^T＋A2X2B2^T -T｜｜F is equivalent to min x=diag（x1 ,x2） ｜｜AXB^T - T｜｜F whose solutions are included in the solution set of unconstrained problem minx ｜｜AXB^T - T｜｜F. So the general solutions of min x1,x2 ｜｜A1X1B^T ＋ A2X2B2^T -T｜｜F are reconstructed by selecting the parameter matrix in that of minx ｜｜AXB^T - T｜｜F.
基金Supported by the National Natural Science Foundation of China(Grant No.11071033)
文摘This paper presents a gradient based iterative algorithm for Sylvester-conjugate matrix equations with a unique solution. By introducing a relaxation parameter and applying the hierarchical identification principle, an iterative algorithm is constructed to solve Sylvester matrix equations. By applying a real representation of a complex matrix as a tool and using some properties of the real representation, convergence analysis indicates that the iterative solutions converge to the exact solutions for any initial values under certain assumptions.Numerical examples are given to illustrate the efficiency of the proposed approach.
文摘In this paper, a carangiform robotic fish with 4-DoF （degree of freedom） tail has been developed. The robotic fish has capability of swimming under two modes that are radio control and autonomous swimming. Experiments were conducted to investigate the influences of characteristic parameters including the frequency, the amplitude, the wave length, the phase difference and the coefficient on forward velocity. The experimental results shown that the swimming performance of the robotic fish is affected mostly by the characteristic parameters observed.
基金Project supported by the National Natural Science Foundation of China(11571156)
文摘In recent years,many efforts have been made to numerically solving the constrained optimization distributed control problems,in which the most common one is to discretize the partial differential equation first and then solve the resulting system of linear equations.A number of preconditioned Krylov subspace methods have been constructed to solve the resulting system of linear equations in the literature.In this paper,by analyzing the block-diagonal preconditioner presented by Zhang,et al.(Zhang X Y,Yan H Y,Huang Y M.On preconditioned MINRES method for solving the distributed control problems.Commun Appl Math Comput,2014,28:128-132.),we propose a parameterized block-diagonally preconditioned linear system where a parameterized preconditioner is utilized and the preconditioned MINRES method is applied to solve the system of linear equations.The spectral analysis of the proposed preconditioned matrix shows that the spectral distribution of the parameterized preconditioning matrix should be much more clustered if the parameter is greater than 1.Numerical Experiments show that the preconditioned MINRES method is efficient for solving the distributed control problems.
