The Lagrange-Newton method for nonlinear optimal control problems

We investigate local convergence of the Lagrange-Newton method for nonlinear optimal control problems subject to control constraints including the situation where the terminal state is fixed. Sufficient conditions for local quadratic convergence of the method based on stability results for the solutions of nonlinear control problems are discussed.     

The Lagrange-Newton method for state constrained optimal control problems

Local convergence of the Lagrange-Newton method for optimization problems with two-norm discrepancy in abstract Banach spaces is investigated. Based on stability analysis of optimization problems with two-norm discrepancy, sufficient conditions for local superlinear convergence are derived. The abstract results are applied to optimal control problems for nonlinear ordinary differential equations subject to control and state constraints.This research was completed while the second author was a visitor at the University of Bayreuth, Germany, supported by grant No. CIPA3510CT920789 from the Commission of the European Communities.     

Cramer法则在数值计算中的若干应用

用Cramer法则给出了Lagrange插值公式和Newton插值公式的简洁证明,同时得到了Vandermonde矩阵的逆矩阵的LU分解.     

Reduction and transformation formulae for bivariate basic hypergeometric series

The main object of this paper is to establish several bivariate basic hypergeometric series identities by means of elementary series manipulation. Some of them can be applied to yield transformation and reduction formulae for q-Kampé de Fériet functions.     

A unified approach to evaluation algorithms for multivariate polynomials

We present a unified framework for most of the known and a few new evaluation algorithms for multivariate polynomials expressed in a wide variety of bases including the Bernstein-Bézier, multinomial (or Taylor), Lagrange and Newton bases. This unification is achieved by considering evaluation algorithms for multivariate polynomials expressed in terms of L-bases, a class of bases that include the Bernstein-Bézier, multinomial, and a rich subclass of Lagrange and Newton bases. All of the known evaluation algorithms can be generated either by considering up recursive evaluation algorithms for L-bases or by examining change of basis algorithms for L-bases. For polynomials of degree in variables, the class of up recursive evaluation algorithms includes a parallel up recurrence algorithm with computational complexity , a nested multiplication algorithm with computational complexity and a ladder recurrence algorithm with computational complexity . These algorithms also generate a new generalization of the Aitken-Neville algorithm for evaluation of multivariate polynomials expressed in terms of Lagrange L-bases. The second class of algorithms, based on certain change of basis algorithms between L-bases, include a nested multiplication algorithm with computational complexity , a divided difference algorithm, a forward difference algorithm, and a Lagrange evaluation algorithm with computational complexities , and per point respectively for the evaluation of multivariate polynomials at several points.

     

Lattice basis reduction algorithms and multi-dimensional continued fractions

In this paper we develop a new multi-dimensional continued fraction algorithm and three known multi-dimensional continued fraction algorithms from the lattice basis reduction multisequence synthesis (LBRMS) algorithm with respect to the different choice of a parameter and so a continued fraction expansion is associated with a basis transformation. The new algorithm is similar to Dai's continued fraction algorithm [Z.D. Dai, K.P. Wang, D.F. Ye, m-Continued fraction algorithm on multi-Laurent series, Acta Arith. (2006) 1–21] but improves the latter effectively.     

Edge-swapping algorithms for the minimum fundamental cycle basis problem

We consider the problem of finding a fundamental cycle basis with minimum total cost in an undirected graph. This problem is NP-hard and has several interesting applications. Since fundamental cycle bases correspond to spanning trees, we propose a local search algorithm, a tabu search and variable neighborhood search in which edge swaps are iteratively applied to a current spanning tree. We also present a mixed integer programming formulation of the problem whose linear relaxation yields tighter lower bounds than other known formulations. Computational results obtained with our algorithms are compared with those from the best available constructive heuristic on several types of graphs. This article extends the conference paper (Amaldi et al. 2004).     

一类E-Vandermonde矩阵的求逆及逆的迭代公式

本文给出一类E-Vandermonde矩阵和广义E-Vandermonde矩阵可逆的条件及逆的矩阵表达式，并给出了求逆的迭代公式．     

The Newton transformation and new integral formulae for foliated manifolds

In this article, we show that the Newton transformations of the shape operator can be applied successfully to foliated manifolds. Using these transformations, we generalize known integral formulae (due to Brito–Langevin–Rosenberg, Ranjan, Walczak, etc.) for foliations of codimension one. We obtain integral formulae involving rth mean curvature of the second fundamental form of a foliation, the Jacobi operator in the direction orthogonal to the foliation, and their products. We apply our formulae to totally umbilical foliations and foliations whose leaves have constant second order mean curvature.     

Radial basis collocation method and quasi‐Newton iteration for nonlinear elliptic problems

This work presents a radial basis collocation method combined with the quasi‐Newton iteration method for solving semilinear elliptic partial differential equations. The main result in this study is that there exists an exponential convergence rate in the radial basis collocation discretization and a superlinear convergence rate in the quasi‐Newton iteration of the nonlinear partial differential equations. In this work, the numerical error associated with the employed quadrature rule is considered. It is shown that the errors in Sobolev norms for linear elliptic partial differential equations using radial basis collocation method are bounded by the truncation error of the RBF. The combined errors due to radial basis approximation, quadrature rules, and quasi‐Newton and Newton iterations are also presented. This result can be extended to finite element or finite difference method combined with any iteration methods discussed in this work. The numerical example demonstrates a good agreement between numerical results and analytical predictions. The numerical results also show that although the convergence rate of order 1.62 of the quasi‐Newton iteration scheme is slightly slower than rate of order 2 in the Newton iteration scheme, the former is more stable and less sensitive to the initial guess. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008     

Some algorithms for equivalent transformation of nondeterministic finite automata

In this paper we consider algorithms which allow one to combine several states of a nondeterministic finite automaton into one state. Along with the algorithms for combining states, we adduce one more algorithm for the equivalent transformation of a non-deterministic finite automaton, namely, an algorithm for adding cycles. Problems under consideration imply the development of robust computer programs.     

基于矩阵列变换的标准正交基求法

给出了将R<'n>的一个基化为标准正交基的新方法.     

行列式detVn-(x1,...,xn)的准确值及其应用

本文给出行列式Ｖ_n^-(x₁,...,x_n)的准确值，它是通常的Ｖａｎｄｅｒｍｏｄｅ行列式计算公式的推广，以及它在理论上的一些重要应用．     

Analysis of stationary subdivision schemes for curve design based on radial basis function interpolation

This paper provides a large family of interpolatory stationary subdivision schemes based on radial basis functions (RBFs) which are positive definite or conditionally positive definite. A radial basis function considered in this study has a tension parameter λ>0 such that it provides design flexibility. We prove that for a sufficiently large , the proposed 2L-point (L∈N) scheme has the same smoothness as the well-known 2L-point Deslauriers-Dubuc scheme, which is based on 2L-1 degree polynomial interpolation. Some numerical examples are presented to illustrate the performance of the new schemes, adapting subdivision rules on bounded intervals in a way of keeping the same smoothness and accuracy of the pre-existing schemes on R. We observe that, with proper tension parameters, the new scheme can alleviate undesirable artifacts near boundaries, which usually appear to interpolatory schemes with irregularly distributed control points.     

Geometric properties of root vectors for equation of nonhomogeneous damped string: transformation operators method

The spectral decomposition theorem for a class of nonselfadjoint operators in a Hilbert space is obtained in the paper. These operators are the dynamics generators for the systems governed by 1–dim hyperbolic equations with spatially nonhomogeneous coefficients containing first order damping terms and subject to linear nonselfadjoint boundary conditions. These equations and boundary conditions describe, in particular, a spatially nonhomogeneous string subject to a distributed viscous damping and also damped at the boundary points. The main result leading to the spectral decomposition is the fact that the generalized eigenvectors (root vectors) of the above operators form Riesz bases in the corresponding energy spaces. The proofs are based on the transformation operators method. The classical concept of transformation operators is extended to the equation of damped string. Originally, this concept was developed by I. M. Gelfand, B. M. Levitan and V. A. Marchenko for 1–dim Schrödinger equation in connection with the inverse scattering problem. In the classical case, the transformation operator maps the exponential function (stationary wave function of the free particle) into the Jost solution of the perturbed Schrödinger equation. For the equation of a nonhomogeneous damped string, it is natural to introduce two transformation operators (outgoing and incoming transformation operators). The terminology is motivated by an analog with the Lax—Phillips scattering theory. The transformation operators method is used to reduce the Riesz bases property problem for the generalized eigenvectors to the similar problem for a system of nonharmonic exponentials whose complex frequencies are precisely the eigenvalues of our operators. The latter problem is solved based on the spectral asymptotics and known facts about exponential families. The main result presented in the paper means that the generator of a finite string with damping both in the equation and in the boundary conditions is a Riesz spectral operator. The latter result provides a class of nontrivial examples of non—selfadjoint operators which admit an analog of the spectral decomposition. The result also has significant applications in the control theory of distributed parameter systems.     

On inverse eigenvalue problems for block Toeplitz matrices with Toeplitz blocks

We propose an algorithm for solving the inverse eigenvalue problem for real symmetric block Toeplitz matrices with symmetric Toeplitz blocks. It is based upon an algorithm which has been used before by others to solve the inverse eigenvalue problem for general real symmetric matrices and also for Toeplitz matrices. First we expose the structure of the eigenvectors of the so-called generalized centrosymmetric matrices. Then we explore the properties of the eigenvectors to derive an efficient algorithm that is able to deliver a matrix with the required structure and spectrum. We have implemented our ideas in a Matlab code. Numerical results produced with this code are included.     

The inverse eigenvalue problem for symmetric quasi anti-bidiagonal matrices

In this paper we construct the symmetric quasi anti-bidiagonal matrix that its eigenvalues are given, and show that the problem is also equivalent to the inverse eigenvalue problem for a certain symmetric tridiagonal matrix which has the same eigenvalues. Not only elements of the tridiagonal matrix come from quasi anti-bidiagonal matrix, but also the places of elements exchange based on some conditions.     

The right-normed basis for a free lie superalgebra and Lyndon-Shirshov words

We construct a basis for a free Lie superalgebra consisting of right-normed words , where are free generators. Supported By RFBR Grant No. 05-01-00230. __________ Translated from Algebra i Logika, Vol. 45, No. 4, pp. 458–483, July–August, 2006.     

The Dual Functionals for the Generalized Ball Basis of Wang-Said Type and Basis Transformation Formulas

The generalized Ball curves of Wang-Said type with a position parameter L not only unify the Wang-Ball curves and the Said-Ball curves, but also include several useful intermediate curves. This paper presents the dual functionals for the generalized Ball basis of Wang-Said type. The relevant basis transformation formulae are also worked out.