浅述多元数据处理的一种简化拟合形式及算法剖析

在实际工程试验与研究中 ,多元数据处理经常遇到 ,根据 Weierstrass定理 ,采用多项式拟合是一种常见的数据处理方法。对于多元多项式的系数求解问题 ,可以归结为超定方程组的求解问题。该文以超定方程组的 SVD求解算法为核心 ,阐述了在工程实际中关于多元数据处理的一种应用方法 ,并尝试给出多元多项式拟合的一种简化方法     

System for normalization of a hamiltonian function based on lie series

A software system for normalization of a Hamiltonian function is described. A few examples of its applications are given. It is written in PASCAL and runs on an IBM XT/AT with 640 KB memory.     

用历史数据库实现对GIS时态属性的管理

从有效管理ＧＩＳ时态属性数据的目的出发，设计了一个历史数据库系统，详细 了时态属性以及它的更新操作规则，并提供了历史关系的５种基本运算和历史查询语言。     

Scaling procedures for heterogeneous unconfined aquifers

Complex flows in heterogeneous confined and unconfined aquifers is a phenomenon that continues to present difficulties in flow mapping and modelling in the field, laboratory, and through numerical simulations. It is often the case with complicated phenomena that transformative scaling and reduction of the problem through symmetry is of great efficacy in the formation of predictive models in both the laboratory and computational settings. A detailed a study of the application of a broad class of Lie scaling transformations on a set of equations representing the groundwater flows in heterogeneous confined and unconfined aquifers has produced a set of scaling relationships between the spatial variables, hydrologic variables, and parameters. The set of scaling transformations preserve the structure of the equations in the sense that the scaling transformations leave the initial‐boundary value system representing the invariant groundwater flows. This theoretical approach elucidates not only the scaling relationships but also the properties that hydrologic variables and parameters must satisfy in order for calling to be possible. Validation of the theory developed is carried out through a series of four numerical simulations using the USGS modflow ‐2005 software package. The results of these experiments demonstrate that the derived scaling transformations can effectively form predictive models of large‐scale phenomena at small scales with negligible error in many cases. Comments on the limitations of the approach and directions for future research are made in the closing sections. Copyright © 2016 John Wiley & Sons, Ltd.     

点、线符号相关处理的代数方法

本文阐述了采用地图代数的理论自动地处理各类地学信息系统编绘地图中点、线符号相关问题的技术方法——交会运算。     

地图代数的符号化方法

根据地学数据库中符号的定位数据和符号码，使用点阵符号库中的符号数据进行符号化，由此得出的图形美观，生动，河流具有粗细变化，该方法简洁通用，具备数据独立性和程序独立性。     

The Relegation Algorithm

The relegation algorithm extends the method of normalization by Lie transformations. Given a Hamiltonian that is a power series = ₀+ ₁+ ... of a small parameter , normalization constructs a map which converts the principal part ₀into an integral of the transformed system — relegation does the same for an arbitrary function [G]. If the Lie derivative induced by [G] is semi-simple, a double recursion produces the generator of the relegating transformation. The relegation algorithm is illustrated with an elementary example borrowed from galactic dynamics; the exercise serves as a standard against which to test software implementations. Relegation is also applied to the more substantial example of a Keplerian system perturbed by radiation pressure emanating from a rotating source.This revised version was published online in October 2005 with corrections to the Cover Date.     

Completely Integrable Systems Connected with Lie Algebras

In a recent paper Ballersteros and Ragnisco (1998) have proposed a new method of constructing integrable Hamiltonian systems. A new class of integrable systems may be devised using the following sequence: , where A is a Lie algebra is a Lie–Poisson structure on R ₃, C is a Casimir for is a reduced Poisson bracket and (A, ▵) is a bialgebra. We study the relation between a Lie-Poisson stucture Λ and a reduced Poisson bracket , which is a key element in using the Lie algebra A to constructing this sequence. New examples of Lie algebras and their related integrable Hamiltonian systems are given. This revised version was published online in July 2006 with corrections to the Cover Date.