A discontinuous Galerkin method/HLLC solver for the Euler equations

This paper proposes a fully three‐dimensional non‐linear Euler methodology for solving aerodynamic and acoustic problems in the presence of strong shocks and rarefactions. It uses a discontinuous Galerkin method (DGM) within the element, and a Riemann solver (HLLC) at the boundaries to propagate rarefactions while preserving the entropy condition and capturing shocks with no spurious oscillations. This approach is thought to marry the best aspects of finite element and finite volume methods, achieving conservation while not requiring the solution of a large matrix. Examples in which shock and rarefaction waves are well captured are presented and the propagation of acoustic pulses is well demonstrated. Copyright © 2003 John Wiley & Sons, Ltd.     

An adaptive pruning algorithm for the discrete L-curve criterion

We describe a robust and adaptive implementation of the L-curve criterion. The algorithm locates the corner of a discrete L-curve which is a log–log plot of corresponding residual norms and solution norms of regularized solutions from a method with a discrete regularization parameter (such as truncated SVD or regularizing CG iterations). Our algorithm needs no predefined parameters, and in order to capture the global features of the curve in an adaptive fashion, we use a sequence of pruned L-curves that correspond to considering the curves at different scales. We compare our new algorithm to existing algorithms and demonstrate its robustness by numerical examples.     

一个反应扩散方程的自由边界问题

该文研究了一个描述原细胞生长的反应扩散方程的自由边界问题.利用非线性分析中的线性化思想和偏微分方程的估计理论,证明了该自由边界问题局部古典解的存在唯一性.     

Indirect boundary element method for unsteady linearized flow over prolate and oblate spheroids and hemispheroidal protuberances

The indirect boundary element method was used to study the hydrodynamics of oscillatory viscous flow over prolate and oblate spheroids, and over hemispheroidal bodies hinged to a plate. Analytic techniques, such as spheroidal coordinates, method of images, and series representations, were used to make the numerical methods more efficient. A novel method for computing the hydrodynamic torque was used, since for oscillatory flow the torque cannot be computed directly from the weightings. Instead, a Green's function for torque was derived to compute the torque indirectly from the weightings. For full spheroids, the method was checked by comparing the results to exact solutions at low and high frequencies, and to results computed using the singularity method. For hemispheroids hinged to a plate, the method for low frequencies was checked by comparing the results to previous results, and to exact solutions at high frequencies. Copyright © 2004 John Wiley & Sons, Ltd.     

A projection method for solving incompressible viscous flows on domains with moving boundaries

In this paper, a projection method is presented for solving the flow problems in domains with moving boundaries. In order to track the movement of the domain boundaries, arbitrary‐Lagrangian–Eulerian (ALE) co‐ordinates are used. The unsteady incompressible Navier–Stokes equations on the ALE co‐ordinates are solved by using a projection method developed in this paper. This projection method is based on the Bell's Godunov‐projection method. However, substantial changes are made so that this algorithm is capable of solving the ALE form of incompressible Navier–Stokes equations. Multi‐block structured grids are used to discretize the flow domains. The grid velocity is not explicitly computed; instead the volume change is used to account for the effect of grid movement. A new method is also proposed to compute the freestream capturing metrics so that the geometric conservation law (GCL) can be satisfied exactly in this algorithm. This projection method is also parallelized so that the state of the art high performance computers can be used to match the computation cost associated with the moving grid calculations. Several test cases are solved to verify the performance of this moving‐grid projection method. Copyright © 2004 John Wiley Sons, Ltd.     

<Emphasis FontCategory="NonProportional">L</Emphasis>-Matrices and solvability of linear complementarity problems by a linear program-Matrices and solvability of linear complementarity problems by a linear program

The classes ofL ₁-matrices,L ₂-matrices,L ₃-matrices andW-matrices are introduced to study solvability of a linear complementarity problem via solving a linear program. Three sufficient conditions are presented to guarantee that a linear complementarity problem is solvable via a linear program. The new sufficient conditions are weaker than the ones introduced by Mangasarian. This fact is also illustrated by an example. Partially supported by NSFC. This author is also with College of Business Administration of Human University as a Lotus chair professor.     

Point-to-Periodic and Periodic-to-Periodic Connections

In this work we consider computing and continuing connecting orbits in parameter dependent dynamical systems. We give details of algorithms for computing connections between equilibria and periodic orbits, and between periodic orbits. The theoretical foundation for these techniques is given by the seminal work of Beyn in 1994, “On well-posed problems for connecting orbits in dynamical systems”, where a numerical technique is also proposed. Our algorithms consist of splitting the computation of the connection from that of the periodic orbit(s). To set up appropriate boundary conditions, we follow the algorithmic approach used by Demmel, Dieci, and Friedman, for the case of connecting orbits between equilibria, and we construct and exploit the smooth block Schur decomposition of the monodromy matrices associated to the periodic orbits. Numerical examples illustrate the performance of the algorithms. This revised version was published online in July 2006 with corrections to the Cover Date.     

Equivalence of inverse Sturm-Liouville problems with boundary conditions rationally dependent on the eigenparameter

Three inverse problems for a Sturm-Liouville boundary value problem −y″+qy=λy, y(0)cosα=y′(0)sinα and y′(1)=f(λ)y(1) are considered for rational f. It is shown that the Weyl m-function uniquely determines α, f, and q, and is in turn uniquely determined by either two spectra from different values of α or by the Prüfer angle. For this it is necessary to produce direct results, of independent interest, on asymptotics and oscillation.     

Propagation of singularities in Cauchy problems for quasilinear thermoelastic systems in three space variables

By using microlocal analysis, the propagation of weak singularities in Cauchy problems for quasilinear thermoelastic systems in three space variables are investigated. First, paradifferential operators are employed to decouple the quasilinear thermoelastic systems. Second, by investigating the decoupled hyperbolic-parabolic systems and using the classical bootstrap argument, the property of finite propagation speeds of singularities in Cauchy problems for the quasilinear thermoelastic systems is obtained. Finally, it is shown that the microlocal weak singularities for Cauchy problems of the thermoelastic systems are propagated along the null bicharacteristics of the hyperbolic operators.     

Structural properties and tractability results for linear synteny

The syntenic distance between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic distance, a restricted form of this model, has been shown to be close to the syntenic distance. Both models are computationally difficult to compute and have resisted efficient approximation algorithms with non-trivial performance guarantees. In this paper, we prove that many useful properties of syntenic distance carry over to linear syntenic distance. We also give a reduction from the general linear synteny problem to the question of whether a given instance can be solved using the maximum possible number of translocations. Our main contribution is an algorithm exactly computing linear syntenic distance in nested instances of the problem. This is the first polynomial time algorithm exactly solving linear synteny for a non-trivial class of instances. It is based on a novel connection between the syntenic distance and a scheduling problem that has been studied in the operations research literature.