期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
同时估计电离层延迟的单频精密单点定位方法 被引量:18
1
作者 阮仁桂 吴显兵 +1 位作者 冯来平 王夕伟 《测绘学报》 EI CSCD 北大核心 2012年第4期490-495,共6页
提出一种基于单频码和相位观测量的单频精密单点定位方法,将每个观测量的电离层延迟量与接收机钟差、对流层天顶延迟、接收机位置、相位模糊度一起作为未知参数。采用约化参数的平方根信息滤波与平滑算法进行参数解算。该方法适用于实... 提出一种基于单频码和相位观测量的单频精密单点定位方法,将每个观测量的电离层延迟量与接收机钟差、对流层天顶延迟、接收机位置、相位模糊度一起作为未知参数。采用约化参数的平方根信息滤波与平滑算法进行参数解算。该方法适用于实时定位和事后处理,且不需要外部的电离层模型。采用全球分布的32个IGS监测站16 d实测数据进行静态解算试验,结果表明E、N、U方向的RMS分别为0.023 m、0.018 m、0.059 m;基于一组机载GPS数据进行动态解算试验,得到E、N、U方向的RMS(与载波相位动态相对定位结果比较)分别为0.168 m、0.151 m、0.172 m。 展开更多
关键词 单频精密单点定位 电离层 延迟估计 参数约化 平方根信息滤波 平方根信息平滑
下载PDF
Spherical parametrization of genus-zero meshes by minimizing discrete harmonic energy 被引量:2
2
作者 LI Ying YANG Zhou-wang DENG Jian-song 《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 SCIE EI CAS CSCD 2006年第9期1589-1595,共7页
The problem of spherical parametrization is that of mapping a genus-zero mesh onto a spherical surface. For a given mesh, different parametrizations can be obtained by different methods. And for a certain application,... The problem of spherical parametrization is that of mapping a genus-zero mesh onto a spherical surface. For a given mesh, different parametrizations can be obtained by different methods. And for a certain application, some parametrization results might behave better than others. In this paper, we will propose a method to parametrize a genus-zero mesh so that a surface fitting algorithm with PHT-splines can generate good result. Here the parametrization results are obtained by minimizing discrete har- monic energy subject to spherical constraints. Then some applications are given to illustrate the advantages of our results. Based on PHT-splines, parametric surfaces can be constructed efficiently and adaptively to fit genus-zero meshes after their spherical parametrization has been obtained. 展开更多
关键词 Genus-zero meshes Spherical parametrization Discrete harmonic energy Constrained optimization
下载PDF
Exact Solutions of Supersymmetric KdV-a System via Bosonization Approach 被引量:1
3
作者 高晓楠 杨旭东 楼森岳 《Communications in Theoretical Physics》 SCIE CAS CSCD 2012年第11期617-622,共6页
Bosonization approach is applied in solving the most general ;N= 1 supersymmetric Korteweg de-Vries equation with an arbitrary parameter a (sKdV-a) equation. By introducing some fermionic parameters in the expansion... Bosonization approach is applied in solving the most general ;N= 1 supersymmetric Korteweg de-Vries equation with an arbitrary parameter a (sKdV-a) equation. By introducing some fermionic parameters in the expansion of the superfield, the sKdV-a equation is transformed to a new coupled bosoNic system. The Lie point symmetries of this model are considered and similarity reductions of it are conducted. Several types of similarity reduction solutions of the coupled bosonie equations are simply obtained for all values of a, Some kinds of exact solutions of the sKdV-a equation are discussed which was not considered integrable previously. 展开更多
关键词 supersymmetric KdV-a equation BOSONIZATION symmetry reductions exact solutions
原文传递
An M-Objective Penalty Function Algorithm Under Big Penalty Parameters
4
作者 ZHENG Ying MENG Zhiqing SHEN Rui 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2016年第2期455-471,共17页
Some classical penalty function algorithms may not always be convergent under big penalty parameters in Matlab software,which makes them impossible to find out an optimal solution to constrained optimization problems.... Some classical penalty function algorithms may not always be convergent under big penalty parameters in Matlab software,which makes them impossible to find out an optimal solution to constrained optimization problems.In this paper,a novel penalty function(called M-objective penalty function) with one penalty parameter added to both objective and constrained functions of inequality constrained optimization problems is proposed.Based on the M-objective penalty function,an algorithm is developed to solve an optimal solution to the inequality constrained optimization problems,with its convergence proved under some conditions.Furthermore,numerical results show that the proposed algorithm has a much better convergence than the classical penalty function algorithms under big penalty parameters,and is efficient in choosing a penalty parameter in a large range in Matlab software. 展开更多
关键词 ALGORITHM constrained optimization problem M-objective penalty function stability.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部