Least-squares solution of AXB = D with respect to symmetric positive semidefinite matrix X is considered. By making use of the generalized singular value decomposition, we derive general analytic formulas, and present...Least-squares solution of AXB = D with respect to symmetric positive semidefinite matrix X is considered. By making use of the generalized singular value decomposition, we derive general analytic formulas, and present necessary and sufficient conditions for guaranteeing the existence of the solution. By applying MATLAB 5.2, we give some numerical examples to show the feasibility and accuracy of this construction technique in the finite precision arithmetic.展开更多
We analyze three one parameter families of approximations and show that they are symplectic in Lagrangian sence and can be related to symplectic schemes in Hamiltonian sense by different symplectic mappings. We also g...We analyze three one parameter families of approximations and show that they are symplectic in Lagrangian sence and can be related to symplectic schemes in Hamiltonian sense by different symplectic mappings. We also give a direct generalization of Veselov variational principle for construction of scheme of higher order differential equations. At last, we present numerical experiments.展开更多
基金Subsidized by The Special Funds For Major State Basic Research Project G1999032803.
文摘Least-squares solution of AXB = D with respect to symmetric positive semidefinite matrix X is considered. By making use of the generalized singular value decomposition, we derive general analytic formulas, and present necessary and sufficient conditions for guaranteeing the existence of the solution. By applying MATLAB 5.2, we give some numerical examples to show the feasibility and accuracy of this construction technique in the finite precision arithmetic.
基金Supported by the special founds for Major State Basic Reserch Project, G1999, 023800.
文摘We analyze three one parameter families of approximations and show that they are symplectic in Lagrangian sence and can be related to symplectic schemes in Hamiltonian sense by different symplectic mappings. We also give a direct generalization of Veselov variational principle for construction of scheme of higher order differential equations. At last, we present numerical experiments.
