分式线性函数的亚纯迭代根

迭代根问题是嵌入流的一个弱问题.关于单调函数的迭代根已有较多结论.但是对非单调函数迭代根的研究却很困难的.分式线性函数是一类实数域上的非单调函数．本文对复平面上分式线性函数的迭代根进行了研究.将分式线性函数的迭代函数方程与一个商空间上的矩阵方程对应,并运用一个求解矩阵根的方法,得到其所有亚纯迭代根的一般公式.并且确定了不同情形下分式线性函数迭代根的准确数目. 作为应用,分别给出了函数$z$和函数$1/z$全部亚纯迭代根.     

分式线性函数─—保形映照的普遍性工具

本文从两个方面论证：分式线性函数是实施保形映照的普遍性工具。一方面，对于任何一个分式线性函数，如何方便地求出其映照的像；另一方面，对于边界为光滑曲线的区域，怎样近似地用分式线性函数实行变换，从而可以在计算机上实行。     

关于线性分式函数的n次迭代及其应用

利用矩阵的特征多项式的理论,得到了线性分式函数的n次迭代式的一般计算公式,推广和补充了有关文献的结论.根据这一公式,可以快捷地得到任意线性分式函数的n次迭代式.     

线性分式函数的自迭代周期与吸引子

应用矩阵特征值的方法推导出线性分式的 n次自迭代通项公式 ,证明了对于任意的自然数 n 3 ,存在无穷多以 n为自迭代周期的线性分式 ,给出了线性分式函数的自迭代周期和吸引子的较全面的刻画 .     

一个有经济意义的多目标规划模型的调整

本文在线性约束条件下 ,同时考虑三个目标函数的最优化 ,即线性函数、二次函数、分式函数 .对于已知的线性规划的最优基可行解 ,通过调整二次函数和分式函数中的系数向量和系数矩阵 ,使其成为这两个规划的最优解 .模型的改进有经济意义的解释     

对线性分式函数n次迭代的一个补充

线性分式函数的迭代有着较为广泛的应用。现有的求函数的n次迭代式的方法有：定义法、数学归纳法、不动点法和桥函数相似法等．文[1]利用矩阵的特征多项式理论，得到了线性分式函数的n次迭代式的一般计算公式，此公式只能解决特征根互异的情形．本文就特征根相等的情形作了一些讨论，得到了特征根相等时的线性分式函数的n次迭代式的一般计算公式，并举例说明了它的应用。     

常系数线性分数阶微分方程组的解

本文研究了常系数线性分数阶微分方程组的求解问题.利用逆Laplace变换,Jordan标准矩阵和最小多项式,得到矩阵变量Mittag-Leffler函数的三种不同的计算方法,包含了常系数线性一阶微分方程组的解.     

基于特征值理论求分式线性递推数列极限

利用分式线性递推数列与二阶方阵的对应关系,通过求二阶方阵的n次幂,给出了分式线性递推数列的通项表达式.再利用矩阵的特征值与不动点关系,得到了分式线性递推数列敛散性的所有表现形式.     

分式函数拉氏反变换的数值计算简法

拉氏反变换的数值计算已有许多人研究过。计算线性系统的过渡过程时,往往归结为分式函数的拉氏反交换,按照经典的步骤是:求出分式函数的极点(分母的零点);分成部分分式;利用拉氏变换表进行反交换;计算数值。这样一套步骤十分不方便,目前     

一个二元矩阵插值连分式的展开式

本文借助于文[1]定义的一种实用的矩阵广义逆,构造了一个二元Stieltjes型矩阵值插值连分式的展开式,它的截断分式可以定义二元矩阵值插值函数.     

一类解析函数的联合留数插值

The necessary and sufficient conditions are given for the simultaneous two-sided residue interpolation problem with nodes in the open upper half-plane for the matrix-valued analytic functions. A linear fractional transformation of the set of all solutions to the question is presented in terms of the original data. The method is based on characterizing least common minimal multiples and the reduction of the solution of the problem to the construction of a rational matrix function which serves as the coefficient, matrix in the linear fractional transformation.     

On the Nevanlinna-Pick interpolation problem for generalized stieltjes functions

The solutions of the Nevanlinna-Pick interpolation problem for generalized Stieltjes matrix functions are parametrized via a fractional linear transformation over a subset of the class of classical Stieltjes functions. The fractional linear transformation of some of these functions may have a pole in one or more of the interpolation points, hence not all Stieltjes functions can serve as a parameter. The set of excluded parameters is characterized in terms of the two related Pick matrices.Dedicated to the memory of M. G. Kreîn     

On the Carathéodory–Fejér Interpolation Problem for Generalized Schur Functions

The solutions of the Carathéodory–Fejér interpolation problem for generalized Schur functions can be parametrized via a linear fractional transformation over the class of classical Schur functions. The linear fractional transformation of some of these functions may have a pole (simple or multiple) in one or more of the interpolation points or not satisfy one or more interpolation conditions, hence not all Schur functions can serve as a parameter. The set of excluded parameters is characterized in terms of the related Pick matrix.Research was supported by the Summer Research Grant from the College of William and MarySubmitted: June 26, 2002 Revised: January 31, 2003     

Exponential synchronization for fractional‐order chaotic systems with mixed uncertainties

This article focuses on the problem of exponential synchronization for fractional‐order chaotic systems via a nonfragile controller. A criterion for α‐exponential stability of an error system is obtained using the drive‐response synchronization concept together with the Lyapunov stability theory and linear matrix inequalities approach. The uncertainty in system is considered with polytopic form together with structured form. The sufficient conditions are derived for two kinds of structured uncertainty, namely, (1) norm bounded one and (2) linear fractional transformation one. Finally, numerical examples are presented by taking the fractional‐order chaotic Lorenz system and fractional‐order chaotic Newton–Leipnik system to illustrate the applicability of the obtained theory. © 2014 Wiley Periodicals, Inc. Complexity 21: 114–125, 2015     

On an operator approach to interpolation problems for Stieltjes functions

A general interpolation problem for operator-valued Stieltjes functions is studied using V. P. Potapov's method of fundamental matrix inequalities and the method of operator identities. The solvability criterion is established and under certain restrictions the set of all solutions is parametrized in terms of a linear fractional transformation. As applications of a general theory, a number of classical and new interpolation problems are considered.     

Existence of fractional differential chains and factorizations based on transformations

In this work, we deal with the existence of the fractional integrable equations involving two generalized symmetries compatible with nonlinear systems. The method used is based on the Bä cklund transformation or B‐transformation. Furthermore, we shall factorize the fractional heat operator in order to yield the fractional Riccati equation. This is done by utilizing matrix transform Miura type and matrix operators, that is, matrices whose entries are differential operators of fractional order. The fractional differential operator is taken in the sense of Riemann–Liouville calculus. Copyright © 2014 John Wiley & Sons, Ltd.     

时不变和时变的Caputo分数阶时滞微分系统的常数变易公式

This paper studies the variation of constant formulae for linear Caputo fractional delay differential systems. We discuss the exponential estimates of the solutions for linear time invariant fractional delay differential systems by using the Gronwall＇s integral inequality. The variation of constant formula for linear time invariant fractional delay differential systems is obtained by using the Laplace transform method. In terms of the superposition principle of linear systems and fundamental solution matrix, we also establish the variation of constant formula for linear time varying fractional delay differential systems. The obtained results generalize the corresponding ones of integer-order delayed differential equations.     

Complex Fractional Programming and the Charnes-Cooper Transformation

We extend the Charnes-Cooper transformation to complex fractional programs involving continuous complex functions and analytic functions. Such problems are shown to be equivalent to nonfractional complex programming problems. This technique is employed also to reduce complex linear fractional programs to complex linear programs. More generally, it can be shown that complex convex-concave fractional programming problems are equivalent to complex convex nonfractional programs using the generalized Charnes-Cooper transformation.The third author gratefully acknowledges the support of the National Center of Theoretical Sciences, National Tsinghua University, Hsinchu, Taiwan during his visit in June 2002 when this research project was started.     

The operational matrix of fractional integration for shifted Chebyshev polynomials

A new shifted Chebyshev operational matrix (SCOM) of fractional integration of arbitrary order is introduced and applied together with spectral tau method for solving linear fractional differential equations (FDEs). The fractional integration is described in the Riemann–Liouville sense. The numerical approach is based on the shifted Chebyshev tau method. The main characteristic behind the approach using this technique is that only a small number of shifted Chebyshev polynomials is needed to obtain a satisfactory result. Illustrative examples reveal that the present method is very effective and convenient for linear multi-term FDEs.