用Symbolic Computation计算毛细重力波六阶解

本文首先运用Symbolic Computation在半物理平面(x,)上计算了毛细重力波的六阶解,得到了波形与色散关系,低阶解与 Hogan 结果一致。

Symbolic computation and perfect fluids in general relativity

Focuses on two areas within the field of general relativity. Firstly, the history and implications of the long-standing conjecture that general relativistic, shear-free perfect fluids which obey a barotropic equation of state p = p(w) such that w + p = 0, are either non-expanding or non-rotating. Secondly the application of the computer algebra system Maple to the area of tetrad formalisms in general relativity.

FracSym: automated symbolic computation of Lie symmetries of fractional differential equations

In this paper, we present an algorithm for the systematic calculation of Lie point symmetries for fractional order differential equations (FDEs) using the method as described by Buckwar & Luchko (1998) and Gazizov, Kasatkin & Lukashchuk (2007, 2009, 2011). The method has been generalised here to allow for the determination of symmetries for FDEs with n independent variables and for systems of partial FDEs. The algorithm has been implemented in the new MAPLE package FracSym (Jefferson and Carminati 2013) which uses routines from the MAPLE symmetry packages DESOLVII (Vu, Jefferson and Carminati, 2012) and ASP (Jefferson and Carminati, 2013). We introduce FracSym by investigating the symmetries of a number of FDEs; specific forms of any arbitrary functions, which may extend the symmetry algebras, are also determined. For each of the FDEs discussed, selected invariant solutions are then presented. © 2013 Elsevier B.V. All rights reserved.

On Optimal Quadratic Lagrange Interpolation: Extremal Node Systems with Minimal Lebesgue Constant via Symbolic Computation

ACM Computing Classification System (1998): G.1.1, G.1.2.

Space saving calculation of symbolic resultants

Lloyd, Noel G., and Pearson, Jane M., 'Space saving calculation of symbolic resultants', Mathematics in Computer Science, 1 (2007), 267-290.

A novel neural/symbolic hybrid approach to heuristically optimized fuel allocation and automated revision of heuristics in nuclear engineering

FUELCON is an expert system for optimized refueling design in nuclear engineering. This task is crucial for keeping down operating costs at a plant without compromising safety. FUELCON proposes sets of alternative configurations of allocation of fuel assemblies that are each positioned in the planar grid of a horizontal section of a reactor core. Results are simulated, and an expert user can also use FUELCON to revise rulesets and improve on his or her heuristics. The successful completion of FUELCON led this research team into undertaking a panoply of sequel projects, of which we provide a meta-architectural comparative formal discussion. In this paper, we demonstrate a novel adaptive technique that learns the optimal allocation heuristic for the various cores. The algorithm is a hybrid of a fine-grained neural network and symbolic computation components. This hybrid architecture is sensitive enough to learn the particular characteristics of the ‘in-core fuel management problem’ at hand, and is powerful enough to use this information fully to automatically revise heuristics, thus improving upon those provided by a human expert.

Pool Evolution: A Parallel Pattern for Evolutionary and Symbolic Computing

We introduce a new parallel pattern derived from a specific application domain and show how it turns out to have application beyond its domain of origin. The pool evolution pattern models the parallel evolution of a population subject to mutations and evolving in such a way that a given fitness function is optimized. The pattern has been demonstrated to be suitable for capturing and modeling the parallel patterns underpinning various evolutionary algorithms, as well as other parallel patterns typical of symbolic computation. In this paper we introduce the pattern, we discuss its implementation on modern multi/many core architectures and finally present experimental results obtained with FastFlow and Erlang implementations to assess its feasibility and scalability.

Towards a high-level implementation of flexible parallelism primitives for symbolic languages

An abstract is not available.

The renormalization group and the implicit function theorem for amplitude equations

This article lays down the foundations of the renormalization group (RG) approach for differential equations characterized by multiple scales. The renormalization of constants through an elimination process and the subsequent derivation of the amplitude equation [Chen, Phys. Rev. E 54, 376 (1996)] are given a rigorous but not abstract mathematical form whose justification is based on the implicit function theorem. Developing the theoretical framework that underlies the RG approach leads to a systematization of the renormalization process and to the derivation of explicit closed-form expressions for the amplitude equations that can be carried out with symbolic computation for both linear and nonlinear scalar differential equations and first order systems but independently of their particular forms. Certain nonlinear singular perturbation problems are considered that illustrate the formalism and recover well-known results from the literature as special cases. © 2008 American Institute of Physics.

Analytical model of reactive transport processes with spatially variable coefficients

Analytical solutions of partial differential equation (PDE) models describing reactive transport phenomena in saturated porous media are often used as screening tools to provide insight into contaminant fate and transport processes. While many practical modelling scenarios involve spatially variable coefficients, such as spatially variable flow velocity, v(x), or spatially variable decay rate, k(x), most analytical models deal with constant coefficients. Here we present a framework for constructing exact solutions of PDE models of reactive transport. Our approach is relevant for advection-dominant problems, and is based on a regular perturbation technique. We present a description of the solution technique for a range of one-dimensional scenarios involving constant and variable coefficients, and we show that the solutions compare well with numerical approximations. Our general approach applies to a range of initial conditions and various forms of v(x) and k(x). Instead of simply documenting specific solutions for particular cases, we present a symbolic worksheet, as supplementary material, which enables the solution to be evaluated for different choices of the initial condition, v(x) and k(x). We also discuss how the technique generalizes to apply to models of coupled multispecies reactive transport as well as higher dimensional problems.

Asymptotic analysis for the coupled wavenumbers in an infinite fluid-filled flexible cylindrical shell: The beam mode

Using asymptotics, the coupled wavenumbers in an infinite fluid-filled flexible cylindrical shell vibrating in the beam mode (viz. circumferential wave order n = 1) are studied. Initially, the uncoupled wavenumbers of the acoustic fluid and the cylindrical shell structure are discussed. Simple closed form expressions for the structural wavenumbers (longitudinal, torsional and bending) are derived using asymptotic methods for low- and high-frequencies. It is found that at low frequencies the cylinder in the beam mode behaves like a Timoshenko beam. Next, the coupled dispersion equation of the system is rewritten in the form of the uncoupled dispersion equation of the structure and the acoustic fluid, with an added fluid-loading term involving a parameter mu due to the coupling. An asymptotic expansion involving mu is substituted in this equation. Analytical expressions are derived for the coupled wavenumbers (as modifications to the uncoupled wavenumbers) separately for low- and high-frequency ranges and further, within each frequency range, for large and small values of mu. Only the flexural wavenumber, the first rigid duct acoustic cut-on wavenumber and the first pressure-release acoustic cut-on wavenumber are considered. The general trend found is that for small mu, the coupled wavenumbers are close to the in vacuo structural wavenumber and the wavenumbers of the rigid-acoustic duct. With increasing mu, the perturbations increase, until the coupled wavenumbers are better identified as perturbations to the pressure-release wavenumbers. The systematic derivation for the separate cases of small and large mu gives more insight into the physics and helps to continuously track the wavenumber solutions as the fluid-loading parameter is varied from small to large values. Also, it is found that at any frequency where two wavenumbers intersect in the uncoupled analysis, there is no more an intersection in the coupled case, but a gap is created at that frequency. This method of asymptotics is simple to implement using a symbolic computation package (like Maple). (C) 2008 Elsevier Ltd. All rights reserved.

Kinematics of pantograph masts

This paper deals with the kinematics of pantograph masts. Pantograph masts have widespread use in space application as deployable structures. They are over constrained mechanisms with degree-of-freedom, evaluated by the Grübler–Kutzback formula, as less than one. In this paper, a numerical algorithm is used to evaluate the degree-of-freedom of pantograph masts by obtaining the null space of a constraint Jacobian matrix. In the process redundant joints in the masts are obtained. A method based on symbolic computation, to obtain the closed-form kinematics equations of triangular and box shaped pantograph masts, is presented. In the process, the various configurations such masts can attain during deployment, are obtained. The closed-form solution also helps in identifying the redundant joints in the masts. The symbolic computations involving the Jacobian matrix also leads to a method to evaluate the global degree-of-freedom for these masts.