Quasi-Newton ABS methods for solving nonlinear algebraic systems of equations

This paper is concerned with the solution of nonlinear algebraic systems of equations. For this problem, we suggest new methods, which are combinations of the nonlinear ABS methods and quasi-Newton methods. Extensive numerical experiments compare particular algorithms and show the efficiency of the proposed methods.The authors are grateful to Professors C. G. Broyden and E. Spedicato for many helpful discussions.     

On a quadrature formula of Micchelli and Rivlin

Micchelli and Rivlin (1972) obtained a quadrature formula of highest algebraic degree of precision for the Fourier-Chebyshev coefficients A_n(f), which is based on the divided differences of f′ at the zeros of the Chebyshev polynomial T_n(x). We give here a simple approach to questions of this type, which applies to the coefficients in arbitrary orthogonal expansion of f. As an auxiliary result we obtain a new interpolation formula and a new representation of the Turán quadrature formula.     

Function-space quasi-Newton algorithms for optimal control problems with bounded controls and singular arcs

Two existing function-space quasi-Newton algorithms, the Davidon algorithm and the projected gradient algorithm, are modified so that they may handle directly control-variable inequality constraints. A third quasi-Newton-type algorithm, developed by Broyden, is extended to optimal control problems. The Broyden algorithm is further modified so that it may handle directly control-variable inequality constraints. From a computational viewpoint, dyadic operator implementation of quasi-Newton methods is shown to be superior to the integral kernel representation. The quasi-Newton methods, along with the steepest descent method and two conjugate gradient algorithms, are simulated on three relatively simple (yet representative) bounded control problems, two of which possess singular subarcs. Overall, the Broyden algorithm was found to be superior. The most notable result of the simulations was the clear superiority of the Broyden and Davidon algorithms in producing a sharp singular control subarc.This research was supported by the National Science Foundation under Grant Nos. GK-30115 and ENG 74-21618 and by the National Aeronautics and Space Administration under Contract No. NAS 9-12872.     

Inversion of the Penrose transform and the Cauchy–Fantappie formula

We discuss the construction of an explicit inversion of the Penrose transform with the focus on connections with the Radon transform, multi-dimensional residues and the Cauchy–Fantappie integral formula following to results [1], [2]. The focus is on the new representation (M) of the inverse Penrose transform as a residue. The proof of this formula can be extracted from [1]. This proof includes an explicit computation of this residue (D). In this formula not the exact values of all coefficients but the existence of a differential operator, inverting the Penrose transform (we call this Leibnitz–Newton’s phenomenon) is important. It is similar to local inversion formulas in integral geometry.     

可积系统棗求迹公式和h逆谱分析

研究了二维无关联四次振子系统,有理环面上积分Hamiltonian运动方程给出了系统一系列周期轨道和经典物理量,使用半经典近似下的Berry-Tabor求迹公式,得到了半经典的态密度．应用Fourier变换分析了每条周期轨道对态密度的贡献,并与量子态密度的Fourier变换结果比较证实了半经典求迹公式的有效性．     

En">Characters and Composition Factor Multiplicities for the Lie Superalgebra $${\mathfrak{g}}{\mathfrak{l}}$$ ( m / n )

The multiplicities a of simple modules L in the composition series of Kac modules V lambda for the Lie superalgebra (m/n ) were described by Serganova, leading to her solution of the character problem for (m/n ). In Serganova's algorithm all with nonzero a are determined for a given this algorithm, turns out to be rather complicated. In this Letter, a simple rule is conjectured to find all nonzero a for any given weight . In particular, we claim that for an r-fold atypical weight there are 2r distinct weights such that a = 1, and a = 0 for all other weights . Some related properties on the multiplicities a are proved, and arguments in favour of our main conjecture are given. Finally, an extension of the conjecture describing the inverse of the matrix of Kazhdan–Lusztig polynomials is discussed.